Ring homomorphisms of polynomial rings

Click For Summary
SUMMARY

This discussion focuses on proving that any ring homomorphism S: R[x] -> R, which satisfies S(r) = r for all r in R, is equivalent to the evaluation homomorphism fa: R[x] -> R at some a in R. Participants clarify that S must preserve polynomial structure, specifically that S(x^2) = a^2, and emphasize the importance of using properties of ring homomorphisms, such as S(a + b) = S(a) + S(b) and S(ab) = S(a)S(b). The conversation highlights the necessity of correctly separating polynomial terms to demonstrate that S evaluates polynomials at a.

PREREQUISITES
  • Understanding of ring homomorphisms
  • Familiarity with polynomial rings, specifically R[x]
  • Knowledge of evaluation homomorphisms
  • Basic algebraic manipulation skills
NEXT STEPS
  • Study the properties of ring homomorphisms in detail
  • Learn about polynomial evaluation techniques in R[x]
  • Explore examples of ring homomorphisms and their applications
  • Investigate the implications of polynomial structure preservation in algebra
USEFUL FOR

Mathematicians, algebra students, and anyone studying abstract algebra, particularly those interested in ring theory and polynomial functions.

missavvy
Messages
73
Reaction score
0

Homework Statement



Let R be a commutative ring and let fa: R[x] -> R be evaluation at a \in R.
If S: R[x] -> R is any ring homomorphism such that S(r) = r for all r\in R, show that S = fa for some a \in R.

Homework Equations





The Attempt at a Solution



I don't get this at all.. really.. :S

Is this to show that for any ring homomorphism, you can evaluate it at some a in Z(R)?

Help?
 
Physics news on Phys.org
Take the polynomial x in R[x]. S(x) is in R. Call it 'a'. Can you show, for example, that S(x^2)=a^2?
 
So then S(x^2) = x^2, which is an element of R[x] and since fa: R[x] -> R is evaluation at a, we can sub in the a for x and get a^2... ?
 
missavvy said:
So then S(x^2) = x^2, which is an element of R[x] and since fa: R[x] -> R is evaluation at a, we can sub in the a for x and get a^2... ?

No. You want to PROVE that S is evaluation at a. Use that S is a ring homomorphism. S(x^2)=S(x*x)=S(x)*S(x), right?
 
Ok, well then S(x)*S(x) = a*a = a^2 = x^2... ?
 
missavvy said:
Ok, well then S(x)*S(x) = a*a = a^2 = x^2... ?

So far so good. Now you've got S(x^2)=f_a(x^2). What about the rest of the polynomials? And saying a^2=x^2 is wrong and sloppy. a^2 is a real number, x^2 is a polynomial. S(x^2)=a^2. x^2 isn't equal to a^2.
 
So I have to show that S(a_0 + a_1x+ ... + a_nx^n) = f_a(a_0+..+a_nx^n).
I don't really understand how I separate the terms of the polynomial to get to the point where they end up as evaluation at a.. do I have to define each x^k term to be = a^k for k = 0, n?
 
missavvy said:
So I have to show that S(a_0 + a_1x+ ... + a_nx^n) = f_a(a_0+..+a_nx^n).
I don't really understand how I separate the terms of the polynomial to get to the point where they end up as evaluation at a.. do I have to define each x^k term to be = a^k for k = 0, n?

You do it the same way you did x^2, missavvy. And use S(a+b)=S(a)+S(b) in addition to S(a*b)=S(a)*S(b). Do you know what 'ring homomorphism' means? If not, could you look it up, please?
 
Last edited:
Yes sir :) Got it thanks.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
9
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 19 ·
Replies
19
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K