Order of image of homomorphism divides order of G

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Image
Click For Summary
SUMMARY

The discussion centers on the relationship between the order of a group homomorphism and the orders of the groups involved. It establishes that if G is a finite group with order n, then the image of G under the homomorphism φ, denoted as im(G), is also finite and has order m, which is a divisor of n. The proof hinges on Lagrange's Theorem and the properties of the kernel of φ, specifically considering the quotient group G'/Φ(G) to demonstrate the equivalence classes formed by the left cosets of the kernel.

PREREQUISITES
  • Understanding of group theory concepts, specifically group homomorphisms.
  • Familiarity with Lagrange's Theorem in finite group theory.
  • Knowledge of quotient groups and equivalence classes.
  • Basic properties of finite groups and their orders.
NEXT STEPS
  • Study the implications of Lagrange's Theorem in various group structures.
  • Explore the concept of kernels in group homomorphisms and their significance.
  • Learn about quotient groups and their applications in group theory.
  • Investigate examples of finite groups and their homomorphisms to solidify understanding.
USEFUL FOR

This discussion is beneficial for students and educators in abstract algebra, particularly those focusing on group theory, as well as mathematicians interested in the properties of homomorphisms and finite groups.

Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Let ##\phi : G \rightarrow G'## be a group homomorphism. Show that if ##| G |## is finite, then ##| \phi [G] |## = ##| I am (\phi)| ## is finite and a divisor of ##| G |##

Homework Equations

The Attempt at a Solution


Assume that G is finite, with order n. Then im(G) is a subgroup of G' and has at most n elements, so must also be finite. Let im(G) have order m.

Next, we know that ##\forall a \in G##, ##a^n = e##. Also, we know that ##\phi : G \rightarrow \phi [ G ]## is a surjection, so ##(\forall a' \in \phi [G]) (\exists a \in G)~ \phi (a) = a' ## Thus, ##a^n = e \Rightarrow \phi (a^n) = \phi (e) \Rightarrow \phi (a) ^n = e \Rightarrow (a') ^n = e##, where a' is any element of the image of ##\phi##. This means that n is a multiple of the order of a'. But m is also a multiple of the order of a'...

This is as far as I get. I can't seem how to conclude that n is a multiple of m from this information
 
Physics news on Phys.org
The trick is to consider ##G'/\Phi(G)##. This divides ##G'## into equivalence classes which are equally big.
 
If you could show a bijection from the collection of left cosets of \ker \phi to \phi(G), then Lagrange's Theorem would complete the proof.

fresh_42 said:
The trick is to consider ##G'/\Phi(G)##. This divides ##G'## into equivalence classes which are equally big.

We are not given that G' is finite.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K