Engineering / Mathematics — Rings and Polynomial Rings
Basic Properties of Polynomial Rings
Degree, leading coefficients, the ring structure of R[X], and when it is an integral domain.
Executive summary
The polynomial ring over a commutative ring is again a commutative ring, with degree behaving additively under multiplication when the coefficient ring is a domain.
The degree function is what makes polynomial rings over fields Euclidean, and hence what transfers the integer algorithms to the polynomial setting.
Learning objectives
- State the degree rules and their exceptions.
- Determine when R[X] is an integral domain.
- Identify the units of a polynomial ring.
01Degree
Degree and leading coefficient
The degree of a non-zero polynomial is the largest index with non-zero coefficient; that coefficient is the leading coefficient. A polynomial is monic if its leading coefficient is 1.
The zero polynomial is assigned degree −∞.
| Operation | Degree rule | Condition |
|---|---|---|
| f + g | deg ≤ max(deg f, deg g) | Always; strict if leading terms cancel |
| f · g | deg = deg f + deg g | R an integral domain |
| f · g | deg ≤ deg f + deg g | General R; may drop if leading coefficients multiply to zero |
02When R[X] is a domain
Domain inheritance
R[X] is an integral domain if and only if R is.
The forward direction uses the degree rule: leading coefficients of a product multiply, and in a domain a product of non-zero elements is non-zero, so the product polynomial is non-zero. The converse holds because R embeds in R[X] as the constants.
This is why polynomial rings over fields are so well behaved. A field is a domain, so F[X] is a domain, degrees add, and the degree function serves as a Euclidean size measure.
03Units and the Euclidean property
Units of F[X]
Over an integral domain R, the units of R[X] are exactly the units of R, viewed as constants.
The reason is degree: if fg = 1 then degrees sum to zero, forcing both to be constants. Over a field this means the units are the non-zero constants.
- Z
|·| as sizeDivision with remainder; Euclid; unique factorisation - F[X]
deg as sizeDivision with remainder; Euclid; unique factorisation - Z[X]
no Euclidean sizeStill a UFD, but no division with remainder in general
The third row marks the boundary. Z[X] retains unique factorisation but loses the Euclidean structure, because dividing X by 2X requires a coefficient inverse that Z does not provide. Algorithms depending on division with remainder therefore need a field of coefficients.
04Frequently asked questions
Why assign the zero polynomial degree minus infinity?
So the degree rules hold without exception. With that convention deg(fg) = deg f + deg g and deg(f+g) ≤ max(deg f, deg g) remain valid when either argument is zero.
Is F[X] ever a field?
No. X has no inverse, since degrees would have to sum to zero. Quotienting by an irreducible polynomial does produce a field, which is exactly how finite fields are constructed.
Does R[X] inherit unique factorisation?
Yes — Gauss's theorem states that R[X] is a unique factorisation domain whenever R is. This is what makes Z[X] a UFD despite not being Euclidean.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 222-226.
This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.
Author: Kevin Jogin. Last reviewed 2026-08-07.