Homomorphisms between two isomorphic rings ?

robertjordan
Messages
71
Reaction score
0

Homework Statement


True or False?
Let R and S be two isomorphic commutative rings (S=/={0}). Then any ring homomorphism from R to S is an isomorphism.

Homework Equations



R being a commutative ring means it's an abelian group under addition, and has the following additional properties:

i) a*(b+c)=a*b+a*c
ii) ab=ba
iii) a*(b*c)=(a*b)*c
iv) there exists an element eR s.t. a*eR=a for all a in R.



A "ring homomorphism" from R to S is a function f from R to S such that
i) f(a)*f(b)=f(a*b)
ii) f(a+b)=f(a)+f(b)
iii) f(eS)=eR

The Attempt at a Solution


BAck of the book says false

I thought to make f(a)=0S for all a in S which would have worked as a counterexample but but it implies f(eR)=0S which by property (iii) of ring homomorphisms implies eR=0S which means a=a*eS=a*0S=0 so a=0 for all a in S but that means S={0} which is a contradiction.


Thanks for reading
 
Physics news on Phys.org
robertjordan said:

The Attempt at a Solution


BAck of the book says false

I thought to make f(a)=0S for all a in S which would have worked as a counterexample but but it implies f(eR)=0S which by property (iii) of ring homomorphisms implies eR=0S which means a=a*eS=a*0S=0 so a=0 for all a in S but that means S={0} which is a contradiction.
Consider for example a polynomial ring, such as ##\mathbb{R}[x]##. Clearly it is isomorphic to itself. But there are many homomorphisms from ##\mathbb{R}[x] \to \mathbb{R}[x]## which are not isomorphisms. Can you find one?
 
jbunniii said:
Consider for example a polynomial ring, such as ##\mathbb{R}[x]##. Clearly it is isomorphic to itself. But there are many homomorphisms from ##\mathbb{R}[x] \to \mathbb{R}[x]## which are not isomorphisms. Can you find one?
A homomorphism could me mapping every polynomial to its constant term (term without an x).
Say ##P_{1}(x)=c_{n}x^n+...+c_{1}x+c_{0}## and
##P_{2}(x)=k_{m}x^n+...+k_{1}x+k_{0}##

So ##f(P_{1}(x)P_{2}(x))=c_{0}k_{0}=f(P_{1}(x)f(P_{2}(x))##
Also, ##f(P_{1}(x)+P_{2}(x))=c_{0}+k_{0}=f(P_{1}(x)+f(P_{2}(x))##
And lastly, ##f(1)=1##.

So indeed this is a ring homomorphism, but obviously it is not surjective or injective.Is this right?
 
robertjordan said:
A homomorphism could me mapping every polynomial to its constant term (term without an x).
Say ##P_{1}(x)=c_{n}x^n+...+c_{1}x+c_{0}## and
##P_{2}(x)=k_{m}x^n+...+k_{1}x+k_{0}##

So ##f(P_{1}(x)P_{2}(x))=c_{0}k_{0}=f(P_{1}(x)f(P_{2}(x))##
Also, ##f(P_{1}(x)+P_{2}(x))=c_{0}+k_{0}=f(P_{1}(x)+f(P_{2}(x))##
And lastly, ##f(1)=1##.

So indeed this is a ring homomorphism, but obviously it is not surjective or injective.


Is this right?
Yes, that's the example I had in mind.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top