Group theory (cyclic groups)

95 Views Asked by At

Let $G$ be a finite group where $ G=\{aⁿ \mid n \in Z \} $ or $G=\langle\, a\,\rangle$, so is it necessary that $a^n=e$, where $e$ is the identity of this group?

G is a finite group and elements of G are $a^0,a¹,.........a^{n-1}$(n elements) and a is generator of G hence is also having n elements As unity has already shown up in $a^0,a¹,.........a^{n-1}$ apart from it why aⁿ must be considered e always .

2

There are 2 best solutions below

1
On BEST ANSWER

See, if the group $G$ can be generated by the element $a$ then certainly

$|<a>| = |a|$

This is can verified easily.

We know that $ <a>$ consists of $a,a^2, a^3, \ldots a^{n-1},e$, certainly the sequence will end when $a$ attains its order i.e. when $a^n =e$ and $n$ here is the order of our element $a$

Hence this is true that the order of group $G$ is certainly equal to the order of the generator.

0
On

Let G is a group with "a" as an element within it ,let a has finite order n And hence aⁿ=e=a$^0$ , so $<a>$ goes like e,a,a²,a³......... And it stops at a$^n-1$ Because after this ,it can b written aⁿ which is again e and further it again generates e,a,a²,a³.........to a$^{n-1}$. Thus,number of elements in $<a>$ is n . Hence order of G is n.