Results 1 to 2 of 2

Math Help - Proving ord(F(a)) divides order a

  1. #1
    Junior Member
    Joined
    Oct 2009
    Posts
    66

    Post Proving ord(F(a)) divides order a

    Allright here is a problem from one of my hw assignments and i have no idea how to solve it. Im sure there is probably a theorem or something that can be used to make it quite easy but i cant think of anything.

    Let F: G->G' be a group homomorphism and suppose a is in G and a has finite order. Prove that the ord(F(a)) divides ord(a)
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Mar 2009
    Posts
    378
    Let x \in G such that x^n = e_{G} where n \in \mathbb{N}. Since F is a group homomorphism we see that F(x^n) = F(e_G) = e_{G'}. On the other hand F(x^n) = (F(x))^n. Therefore, (F(x))^n = e_{G'}.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 3
    Last Post: October 8th 2011, 05:16 PM
  2. Replies: 2
    Last Post: May 1st 2011, 03:11 PM
  3. Replies: 5
    Last Post: April 3rd 2010, 07:10 PM
  4. Simple group's order divides n!/2
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: March 21st 2010, 08:09 PM
  5. Proving order in series and sequences
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 5th 2009, 07:12 AM

Search Tags


/mathhelpforum @mathhelpforum