Proving Group Isomorphism: Q& & Z[X]

  • Thread starter Thread starter TimNguyen
  • Start date Start date
  • Tags Tags
    Group Isomorphism
Click For Summary

Homework Help Overview

The discussion revolves around proving the existence of a group isomorphism between the group of strictly positive rational numbers under multiplication, denoted as (Q&,*), and the group of polynomials with integer coefficients under addition, denoted as (Z[X],+). Participants explore the mapping of elements from Q& to Z[X] and the requirements for establishing a homomorphism.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the initial mapping of prime numbers to polynomial terms and question how to handle reciprocals and other rational numbers. There is an emphasis on ensuring the mapping satisfies homomorphic properties.

Discussion Status

Some participants have provided guidance on the need to demonstrate that the proposed mapping is a homomorphism, while others are exploring how to extend the mapping to all rational numbers. The discussion is ongoing, with various interpretations and suggestions being explored.

Contextual Notes

There is mention of the need to adhere to the properties of homomorphisms, and participants are encouraged to clarify their mappings to ensure they meet the requirements of the isomorphism proof. The use of LaTeX for mathematical expressions is also noted as a point of confusion for some participants.

TimNguyen
Messages
79
Reaction score
0
Prove that there exists a group isomorphism between (Q&,*) and (Z[X],+) where Q& is the set of strictly positive rational numbers.

I was thinking of mapping a p_n, being the nth prime in Q& to x^(n-1). Would this work for this case?
 
Physics news on Phys.org
commonly you'd write [tex]\mathbb{Q}^+[/tex], though what is Z[x]? the polynomial ring in one variable with integer coefficients?
 
Yes, Z[z] is a polynomial ring with integer coefficients. Also, I have no idea how to do the fancy graphic stuff so I wouldn't be able to type out "the set of rational numbers".
 
read the sticky thread on latex. you can click on any 'fancy' picture to see what the generating text is.
 
Your idea is on the right lines, though you need to specify more than just p_n goes to x^n: where does 1/p_n go? what about 4, where is that sent?
 
Could I just send those to non-variable coefficients in Z[X]?
 
No, that can't happen. It is a homomorphism. You must send the reciprocal of a fraction to the inverse in Z[x], and you must send the product of rationals to their sum in Z[x]. I'm just saying that you need to show that the map you defined by specifying where p_n goes is indeed a homomorphism.
 
So, beside the mapping that I've already created, I need to make "additions" to the function in order to make it homomorphic?
 
If you were doing this and were a proven algebraist what you initially said is fine, since, with experience it's 'obvious' how to fill in the gaps, but you're trying to prove that you know what you're doing, so you need to show that that map, extended to any rational number, not just a prime, is a homomorphism. You don't have to make additions, as such, just prove that it is a homomorphism (and thence an isomorphism).
I mean, I know where that map with the proper details filled in sends 4/9, but do you? Rememver you're trying to both understand what's going on and demonstrate that understanding.
 
  • #10
So basically, all I need to do is for an arbitrary a,b in Q, then find a way to compute it so it will lead to:

f(ab) = f(a) + f(b)?
 
  • #11
But, surely you knew 'how to compute it' already...

you know you have to send, say 4=2^2 to x^2+x^2=2x^2, and 8=2^3 to x^2+x^2+x^2=3x^2 in order for it to be a homomorhism, hey, wonder what that is generally... now check it is indeed a homomorphism (and bijective)
 
  • #12
Thank you once again, I think I have a brief idea.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 19 ·
Replies
19
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K