Proving Isomorphism Between Finite Group and Z_2 Using Group Theory

mathmadx
Messages
16
Reaction score
0
Let G be a finite group. For all elements of G (the following holds: g^2=e(the idendity.) So , all except the idendity have order two.

Proof that G is isomorphic to a finite number of copies of Z_2 ( the group of adittion mod 2, Z_2 has only two elements (zero and one).)

I can try to tell you what I have already tried, but please, can someone give a hint in the right direction..? I basically need a bijection from G to (Z_2)^m, but no idea how I can do it( In particular: they should have the same size as they are finite.)
 
Physics news on Phys.org
Define \phi : G \rightarrow Z_2, so that it is forced to be surjective; i.e. tell the identity where to go. Show \phi is a hom. Then look at the kernel. There is only one possibility.
 
I am sorry, I am not able to see it. I keep on thinking about the fact that m products of Z_2 has order 2^m, which is supposed to be equal to n( the order of the group G..)

I don't even get your advice: How can we tell the identity where to go!? The identity(of G) should always go to idendity(of Z_2). ..

Sorry, I am confused...
 
No one who can provide some insights..?
 
mathmadx said:
No one who can provide some insights..?

Show the group is isomorphic to Z_2 \times Z_2 \times \ldots, so

G must be commutative since it is the case that forall g, g = g^{-1} (since gg=1)
In particular, ab = (ab)^{-1} = b^{-1}a^{-1} = ba (by assumption) So that G is commutative.

Next, you could use the fundamental theorem of finite abelian groups, says that any abelian finite group is isomorphic to Z_{m_1} \times Z_{m_2} \times \ldots

Next, look to intuitionize what is happening, look at subgroups generated by a single non identity element. There will be the |G|- 1 of them and they will all have order 2. There is only one group of order 2 up to isomorphism. What is the next step?
 
We know by cauchy that the order of G is in the form 2^k. Applying this combined with the fundamental theorem is the proof.
 
##\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