The ring of polynomials in one or more indeterminates over a base ring or field R, denoted R[x], R[x1,...,xn], consisting of finite R-linear combinations of monomials in the indeterminates.

Principle

Polynomials form the free commutative R-algebra on a set of indeterminates: expressions are finite sums of coefficients times monomials, with addition and multiplication induced by distributivity.

Demonstration

k[x] is the ring of single-variable polynomials over a field k; k[x,y] consists of finite sums a_{ij} x^i y^j. If R is Noetherian then R[x] is Noetherian (Hilbert's basis theorem).

Misapplication

Confusing polynomial rings with rings of polynomial functions on an infinite field: distinct polynomials can define the same function over finite fields or when variables are specialized, and formal power series differ from polynomials.

Consequence

Polynomial rings provide coordinate rings for affine varieties, admit degree-based algorithms (division, Groebner bases over fields), and serve as prototypical examples in algebraic constructions.

Reversal

Formal power series rings R[[x]] allow infinite sums and drastically different completion and convergence properties; free algebras in noncommuting variables differ from commutative polynomial rings.

Boundary

Usually refers to commutative polynomials in commuting indeterminates over a unital base ring; exclude noncommutative free algebras, rings of rational functions, and power series unless specified.

Semantic Tension

Polynomial ring vs polynomial function ring: the former is an algebra of formal expressions, the latter a set of functions on a domain; over infinite fields they often agree as maps, but not as algebraic objects in general.

Synthesis

A polynomial ring is the algebra of finite formal linear combinations of monomials in indeterminates with coefficients in a base ring; it is the free commutative algebra on variables and underlies many algebraic and geometric constructions.