A group of finite order can be infinitely large?

  • Thread starter Thread starter jessicaw
  • Start date Start date
  • Tags Tags
    Finite Group
jessicaw
Messages
54
Reaction score
0
a group or a cyclic group of finite order can i just repeatedly write down the repeated elements and form a very large even infinite group?
 
Physics news on Phys.org
What do you mean by "write down repeating elements". If the group is of finite order, then every member of it has finite order. Eventually, "repeating elements" get you back to the identity and then you get nothing new.
 
HallsofIvy said:
What do you mean by "write down repeating elements". If the group is of finite order, then every member of it has finite order. Eventually, "repeating elements" get you back to the identity and then you get nothing new.

why" If the group is of finite order, then every member of it has finite order."? The group may not be a cyclic group. For example {1,2,3} the group is finite the member may have infinite order like the element {2}?

"get you back to the identity and then you get nothing new." is what i am confused; i am always wondering if i can write a group called {1,1,1,1,1,1,1,1,1,1,1,1....}. Please help. Thanks
 
What do you mean by the group {1, 2, 3}? Surely not the group with three members since that is a cyclic group.

In any case, the proof that every element of a finite group has finite order is elementary. I would be surprised if you didn't see it shortly after learning the definition of "order".

Let a be any member of the finite group, G. Then, for all n, a^n\in G. Since there are only a finite number of members of G while there are an infinite number of positive integers, by the pigeon hole principal, we must have a^k= a^j for some distinct j and k. If j< k, then a^ka^{-j}= a^{k- j}= a^ja^{-j}= e where e is the group identity and I am using "a^{-j} to represent the inverse of a^j. If k< j, then a^ka^{-k}= e= a^{j}a^{-k}= a^{j-k}.

In either case, a has finite order.
 
Usually what is meant by a group of finite order is a group with finitely many elements so by definition it can not be infinite.

But if you just require that each element be of finite order then one can have an infinite group with no problem

take the infinite direct product of Z/2 with itself.
 
I think the OP had in mind something like, for example, with Z_3, writing {1,2,3,1,2,3,1,2,3,1,2,3,1,...}. And the answer is, no, that is actually equal to {1,2,3}, i.e. "repeating elements" does not enlarge a set.

Edit: ...as HoI said already.
 
##\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