MHB A cyclic group with only one generator can have at most two elements

mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

Show that a cyclic group with only one generator can have at most two elements.

I thought the following:

When $a \neq e$ is in the group, then $a^{-1}$ is also in the group.
So, when $a$ is a generator, then $a^{-1}$ is also a generator.

Is this correct?? (Wondering)

But I how can I use this to show that a cyclic group with only one generator can have at most two elements??

Or should I use something else to prove this?? (Wasntme)
 
Physics news on Phys.org
mathmari said:
Hey! :o

Show that a cyclic group with only one generator can have at most two elements.

I thought the following:

When $a \neq e$ is in the group, then $a^{-1}$ is also in the group.
So, when $a$ is a generator, then $a^{-1}$ is also a generator.

Is this correct?? (Wondering)

But I how can I use this to show that a cyclic group with only one generator can have at most two elements??

Or should I use something else to prove this?? (Wasntme)

Hi mathmari,

By having an $a\in G$ different from $e$, you are assuming $G$ has more than one element. It's true that $a$ and $a^{-1}$ will generate $G$, but this does not follow from the fact that $a^{-1}$ is in the group. Instead, it follows from the fact that any element in a group has the same order as its inverse. Now, knowing that $a$ and $a^{-1}$ generate $G$ and $G$ has only one generator, you deduce that $a = a^{-1}$, i.e., $a^2 = e$. So $G$ has order two, with elements $e$ and $a$.

Of course, if $G = {e}$, then $G$ is cyclic with one generator. So all cases have been covered.
 
Euge said:
Hi mathmari,

By having an $a\in G$ different from $e$, you are assuming $G$ has more than one element. It's true that $a$ and $a^{-1}$ will generate $G$, but this does not follow from the fact that $a^{-1}$ is in the group. Instead, it follows from the fact that any element in a group has the same order as its inverse. Now, knowing that $a$ and $a^{-1}$ generate $G$ and $G$ has only one generator, you deduce that $a = a^{-1}$, i.e., $a^2 = e$. So $G$ has order two, with elements $e$ and $a$.

Of course, if $G = {e}$, then $G$ is cyclic with one generator. So all cases have been covered.

Have we proven in that way that a cyclic group with only one generator can have at most two elements??
 
Certainly. Either $G$ has one element (which is cyclic with only one generator) or it has more than element, in which case $G$ has only two elements.
 
mathmari said:
Have we proven in that way that a cyclic group with only one generator can have at most two elements??

Yes, but it might be hard for you to SEE.

Suppose that we have $b \in G$ with $b \neq a,e$. Since $a$ generates $G$, it must be that $b = a^k$ for some integer $k$. However, since $a^k = e$ if $k$ is even, and $a^k = a$ if $k$ is odd, there is no such $b$.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top