Proving Isomorphism Between Finite Group and Z_2 Using Group Theory

Click For Summary

Discussion Overview

The discussion revolves around proving that a finite group G, where every element except the identity has order two, is isomorphic to a finite number of copies of the group Z_2. Participants explore group theory concepts, including homomorphisms, kernels, and properties of abelian groups.

Discussion Character

  • Exploratory
  • Technical explanation
  • Mathematical reasoning

Main Points Raised

  • One participant suggests defining a surjective homomorphism from G to Z_2 and examining the kernel to establish isomorphism.
  • Another participant expresses confusion regarding the mapping of the identity element and the implications of the order of Z_2^m.
  • A later post argues that G must be commutative due to the property that every element is its own inverse, leading to the conclusion that G is abelian.
  • One participant references the fundamental theorem of finite abelian groups, suggesting that G can be expressed as a direct product of cyclic groups.
  • Another participant mentions Cauchy's theorem, asserting that the order of G must be a power of 2, which they believe supports their argument.

Areas of Agreement / Disagreement

Participants express various viewpoints on the approach to proving the isomorphism, with some focusing on the properties of G and others on the mapping to Z_2. There is no consensus on the best method or the implications of certain properties, indicating ongoing debate and exploration.

Contextual Notes

Participants have not fully resolved the assumptions regarding the mapping of elements or the implications of the group structure, leading to uncertainty in the discussion.

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 [tex]\phi : G \rightarrow Z_2[/tex], so that it is forced to be surjective; i.e. tell the identity where to go. Show [tex]\phi[/tex] 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 [tex]Z_2 \times Z_2 \times \ldots[/tex], so

G must be commutative since it is the case that forall g, [tex]g = g^{-1}[/tex] (since gg=1)
In particular, [tex]ab = (ab)^{-1} = b^{-1}a^{-1} = ba (by assumption)[/tex] 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 [tex]Z_{m_1} \times Z_{m_2} \times \ldots[/tex]

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.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 26 ·
Replies
26
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 38 ·
2
Replies
38
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K