Trivial group homomorphism from G to Q

  • Thread starter Thread starter tomkoolen
  • Start date Start date
  • Tags Tags
    Group
Click For Summary

Homework Help Overview

The problem involves demonstrating that any homomorphism from a finite group G to the additive group of rational numbers Q is trivial, meaning that the image of every element in G under the homomorphism is zero.

Discussion Character

  • Conceptual clarification, Assumption checking, Exploratory

Approaches and Questions Raised

  • Participants discuss the properties of homomorphisms, particularly the implications of finite groups and their orders. Some explore the relationship between the kernel and image of the homomorphism, while others consider the structure of finite subgroups in Q.

Discussion Status

Participants are actively engaging with the problem, sharing insights about the nature of finite groups and the characteristics of homomorphisms. Some have provided hints and suggestions for further exploration, while others are questioning the complexity of the reasoning involved.

Contextual Notes

There is a focus on the finite nature of the group G and the implications this has for the image of the homomorphism in Q. The discussion also touches on the requirement that a homomorphism must map elements to a subgroup of the target group.

tomkoolen
Messages
39
Reaction score
1
Member warned about posting without the template
Hello, I have to solve the following problem:

Show that a homomorphism from a finite group G to Q, the additive group of rational numbers is trivial, so for every g of G, f(g) = 0.

My work so far:

f(x+y) = f(x)+f(y)
I know that |G| = |ker(f)||Im(f)|

I think that somehow I have to find that Im(f) = 1 but I don't know how. Can anybody help me please?

Thanks in advance!
 
Physics news on Phys.org
tomkoolen said:
Hello, I have to solve the following problem:

Show that a homomorphism from a finite group G to Q, the additive group of rational numbers is trivial, so for every g of G, f(g) = 0.

My work so far:

f(x+y) = f(x)+f(y)
I know that |G| = |ker(f)||Im(f)|

I think that somehow I have to find that Im(f) = 1 but I don't know how. Can anybody help me please?

Thanks in advance!
You could use the fact that every element of G has a finite period.
 
The only finite subgroup of the additive group of rational numbers is {0}. (NOT {1}!)
 
Okay I understand that, but now I only know that there is an isomorphism to Z/nZ with n the number of elements. Then I know that f is one-to-one, so |ker(f)| = 1 and Im(f) would equal n, but that's not what I need. Can you give me one more hint?
 
tomkoolen said:
Okay I understand that, but now I only know that there is an isomorphism to Z/nZ with n the number of elements. Then I know that f is one-to-one, so |ker(f)| = 1 and Im(f) would equal n, but that's not what I need. Can you give me one more hint?
Aren't you making this too complicated?
Take an element ##g \in G##. Then ##g^p=e## for some positive integer ##p##, ( ##e## is the identity of G) . What information can you glean from ##f(g^p)=f(e)##?
 
f(g^p) = f(e) so that is e of Q (= 0). And you can conclude that order(f(x)) is finite as well and then you can conclude that because {0} is the only finite subgroup of Q all elements of G will be mapped to 0?

Thanks for the help!
 
  • Like
Likes   Reactions: Samy_A
I wasn't thinking that complicated! I would just use the fact that a homomorphism from group G to group H maps G to a subgroup of H.
 
HallsofIvy said:
I wasn't thinking that complicated! I would just use the fact that a homomorphism from group G to group H maps G to a subgroup of H.
Isn't this the same amount of work, sorry: line of proof? Because with that you have to prove your statement in #3.
 
What are the requirements for f to be a group homomorphism?
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
2
Views
2K