Math 2.0

Commutative algebra Definition

Polynomial ring

Builds on Ring

Definition

Let RR be a ring. A polynomial over RR is a sequence (a0,a1,a2,… )(a_0, a_1, a_2, \dots) of elements of RR such that an=0a_n = 0 for all but finitely many nn. The element ana_n is the coefficient of degree nn. The polynomial ring R[x]R[x] is the set of these polynomials, with these operations: (an)n+(bn)n=(an+bn)n,(an)n⋅(bn)n=(cn)n,cn=∑i+j=naibj.(a_n)_n + (b_n)_n = (a_n + b_n)_n, \qquad (a_n)_n \cdot (b_n)_n = (c_n)_n, \quad c_n = \sum_{i + j = n} a_i b_j. With these operations, R[x]R[x] is a ring.

Remarks

Let xx be the polynomial (0,1,0,0,… )(0, 1, 0, 0, \dots), and identify r∈Rr \in R with (r,0,0,… )(r, 0, 0, \dots). Then each polynomial with an=0a_n = 0 for n>dn > d is a0+a1x+⋯+adxda_0 + a_1 x + \dots + a_d x^d, in exactly one way. If RR is a commutative ring, then R[x]R[x] is commutative. A polynomial is a formal expression and not a function: over 𝔽2\mathbb{F}_2, x2+xx^2 + x is a nonzero polynomial, but it is zero at both elements of 𝔽2\mathbb{F}_2.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Polynomial ring definition

Where this leads

199 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Polynomial_ring, Definition (univariate case)
About this page