Homomorphisms from a free abelian group

Click For Summary

Homework Help Overview

The discussion revolves around determining the number of homomorphisms from a free abelian group of rank 2 into the groups Z_6 and S_3. The original poster attempts to establish a method for finding these homomorphisms, particularly focusing on the properties of free abelian groups and their mappings.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • The original poster outlines a method for calculating homomorphisms into Z_6, suggesting that the images of the generators determine the homomorphism. They express uncertainty regarding the approach for S_3. Other participants provide feedback on the proof, with one suggesting the use of the universal property of free groups. There is also a discussion about the implications of the kernel and image of the homomorphism.

Discussion Status

The discussion is active, with participants providing insights and questioning each other's reasoning. There is no explicit consensus on the number of homomorphisms into S_3, and some participants are exploring different interpretations of the problem. Guidance has been offered regarding the use of properties of free groups, but the conversation remains open-ended.

Contextual Notes

Participants are navigating the complexities of homomorphisms involving both abelian and non-abelian groups, with some confusion noted about the properties of S_3. The original poster expresses uncertainty about the second part of the problem, indicating a need for further clarification on the topic.

ehrenfest
Messages
2,001
Reaction score
1

Homework Statement


How many homomorphism are there of a free abelian group of rank 2 into a) Z_6 and b) S_3.

Homework Equations


The Attempt at a Solution


Since the images of the generators completely determine a homomorphism, the upper bound for both is 36.
Now a free abelian group of rank 2 is isomorphic to Z \times Z, which has basis {(1,0),(0,1)} and by the definition of a free abelian group, every nonzero element in the group can be uniquely expressed in the form a(1,0)+b(0,1) with a,b in Z. Therefore, given two arbitrary elements x and y in Z_6, we define phi((0,1)) = x and phi((1,0)) = y and for an arbitrary nonzero c = a(1,0)+b(0,1) in Z \times Z, we define \phi(c) = a\cdot x+b\cdot y. And then define \phi(0) = 0.

Now, why is that a homomorphism? Because if d and e are arbitrary nonzero elements in Z \times Z, such that d = a_1(1,0)+b_1(0,1) and e = a_2(1,0)+b_2(0,1), then we have
\phi(d+e) = \phi((a_1+a_2)(1,0)+(b_1+b_2)(0,1)) = (a_1+a_2)x+(b_1+b_2)y = (a_1x+b_1y)+(a_2x+b_2y) = \phi(d)+\phi(e)
where in the second-to-last step I have used the fact that Z_6 is abelian. If d is 0 then we have \phi(d+e)=\phi(e)=\phi(e)+0=\phi(e)+\phi(0).

Therefore the answer to part a is 36. Please confirm that proof. I have absolutely no idea how to do part b since that group is not abelian.
 
Physics news on Phys.org
anyone?
 
I quickly scanned your proof, and it looks alright. Although you can just use the universal property for free groups: if you send (1,0) and (0,1) to G, then this extends to a unique homomorphism of ZxZ into G. This is true for all free groups, not just abelian ones. So part (b) follows similarly.
 
I am kind of confused about your last post. Please read the problem again. The answer to part b is 18 not 36 which means what you said cannot be true.
 
Forget my last post. I'm not sure what was going through my head at the time.

If f:ZxZ->S_3 is a homomorphism, then (ZxZ)/kerf =~ imf. What does this tell us?
 
Last edited:
I am not sure what you are getting at. Oh wait--any quotient group of an abelian group must be abelian so the image of f must be abelian. Is that what you meant?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 26 ·
Replies
26
Views
1K
Replies
31
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K