Math 2.0

statement theorem

Universal property of the polynomial ring

Statement

Let RR and SS be commutative rings, let φ ⁣:R→S\varphi \colon R \to S be a ring homomorphism and let s∈Ss \in S. Then there is exactly one ring homomorphism Φ ⁣:R[x]→S\Phi \colon R[x] \to S such that Φ(r)=φ(r)\Phi(r) = \varphi(r) for all r∈Rr \in R and Φ(x)=s\Phi(x) = s. It is given by Φ(a0+a1x+⋯+anxn)=φ(a0)+φ(a1)s+⋯+φ(an)sn\Phi(a_0 + a_1 x + \dots + a_n x^n) = \varphi(a_0) + \varphi(a_1) s + \dots + \varphi(a_n) s^n.

Remarks

With S=RS = R, φ\varphi the identity and s=cs = c, the map Φ\Phi is the evaluation homomorphism at cc. In the language of algebras: for each commutative RR-algebra AA and each a∈Aa \in A, there is exactly one RR-algebra homomorphism R[x]→AR[x] \to A that sends xx to aa. This property characterizes R[x]R[x] up to a unique isomorphism.

Explanations

L1 human

A ring homomorphism from R[x]R[x] is fixed by two choices: what it does on the coefficients, and where it sends xx. Every pair of choices works, and it gives exactly one homomorphism. Evaluation at a number is the main example.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 7 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Polynomial ring definition
  4. Ring homomorphism definition
  5. Polynomial evaluation definition
  6. Evaluation homomorphism definition
  7. Universal property of the polynomial ring statement

Sources

  1. Web https://en.wikipedia.org/wiki/Polynomial_ring, Categorical characterization