1

The polynomials over a commutative ring $R$ are defined as usual: $R[x] = \{p \in R^\mathbb{N}: \#\mathrm{supp}(p) < \#\mathbb{N} \}$ where $\mathrm{supp}$ is the set of non-zero points and $\#$ is the cardinality of a set.

(2.13) Proposition: There is a unique commutative ring structure on the set of polynomials $R[X]$ having these properties:

(a) Addition of polynomials is vector addition.

(b) Multiplication of monomials is given by $ax^m * bx^n = > (ab)x^{m+n}$

(c) The ring $R$ is a subring of $R[X]$ when the elements of $R$ are identified with the constant polynomials.

The proof of this proposition is notationally unpleasant without having any interesting features, so we omit it. $\square$

What is so notationally unpleasant about this proof? It seems to me like we could simply do induction on degree of polynomials to show multiplication of them is the usual result, applying (a) and (b) at the induction basis. Then to show it's unique we could consider the identity map in $R[X]$ and show that it's a ring homomorphism. Am i missing something? Also this proposition is in the section before ring homomorphisms are introduced. Does the word "unique" have meaning without isomorphisms? Finally, the last condition seems superflous. Since constants are monomials, wouldn't (c) follow from (b)?

  • Usually constants aren't monomials, however $1$ is usually regarded as a monomial. This is because monomials are products of powers of variables. – morrowmh Mar 02 '21 at 17:25
  • As written, it seems that $R[x]$ is claimed to be commutative even if $R$ is not ?!?! – Hagen von Eitzen Mar 02 '21 at 17:48
  • 2
    Yes, "unique" makes perfect sense without mentioning isos. It means that there is a unique additive operation and a unique multiplication operation making everything true. This does not need the concept of isomorphism. You're just saying there is only one set of operations making this into a ring with all these conditions. – Randall Mar 02 '21 at 17:55

0 Answers0