The degree of a polynomial measures the highest power occurring in a nonzero polynomial after like terms have been combined. For a polynomial in one variable, it is the greatest exponent whose coefficient is nonzero. For a polynomial in several variables, “degree” usually means total degree: the largest sum of exponents in any term with a nonzero coefficient. Degree governs many properties of polynomials, including their possible numbers of roots, their behavior under algebraic operations, and the complexity of polynomial equations.
Definition in one variable
Let
with coefficients in a field, such as the real numbers or complex numbers. The degree of , denoted , is
The term is the leading term, and is the leading coefficient. More generally, the same definition applies to polynomials with coefficients in a ring, although some rules for degree require additional assumptions on that ring.
For example:
| Polynomial | Degree | Leading coefficient |
|---|---|---|
A nonzero constant polynomial has degree . Polynomials of degrees , , , and are called linear, quadratic, cubic, and quartic, respectively. A degree- polynomial is called quintic.
Degree is determined by the polynomial after simplification, not by the largest exponent visible in an unsimplified expression. For instance,
has degree , not .
Ordinary polynomial exponents are nonnegative integers. Expressions such as and are not ordinary polynomials in , so this definition does not assign them a polynomial degree.
The zero polynomial
The zero polynomial has every coefficient equal to zero. It therefore has no highest exponent with a nonzero coefficient.
Its degree is commonly either:
- left undefined; or
- defined by the convention .
The second convention is useful because it allows many degree inequalities to include the zero polynomial without separate exceptions. Here is a formal value smaller than every integer, with conventions such as
The zero polynomial must be distinguished from a nonzero constant: has degree , whereas does not ordinarily have degree .
Behavior under algebraic operations
Addition and subtraction
For polynomials over a field, using the convention ,
If and have different degrees, equality holds. If they have the same degree, cancellation of their leading terms can reduce the degree.
For example,
has degree , whereas
has degree . Subtraction satisfies the corresponding inequality.
Multiplication
For nonzero polynomials over a field,
The reason is that the product of the leading coefficients is nonzero and is the coefficient of the highest possible power. Consequently, for a positive integer ,
These identities also hold over an integral domain, a nonzero commutative ring in which the product of two nonzero elements is never zero. They may fail over rings with zero divisors. For example, in arithmetic modulo ,
The factor has degree , but its square has degree . This illustrates why the coefficient system matters; modular arithmetic can change which coefficients vanish.
Composition
For a nonzero polynomial and a nonconstant polynomial over a field,
where composition means
For example, substituting a cubic polynomial into a quadratic polynomial produces a polynomial of degree .
The requirement that be nonconstant avoids cases where substitution gives a constant or the zero polynomial.
Division with remainder
If and are polynomials over a field and , there are unique polynomials and such that
where either or
This decreasing-degree condition underlies the polynomial version of the Euclidean algorithm, used to compute a greatest common divisor of two polynomials.
Polynomials in several variables
For a monomial
its total degree is
The total degree of a nonzero multivariable polynomial is the greatest total degree among its monomials with nonzero coefficients.
For example,
has total degree , because the term has exponent sum .
Degree in an individual variable
A polynomial can also be assigned a degree with respect to one chosen variable:
for the preceding example.
These individual degrees need not add up to the total degree. For
the total degree is , while
When discussing multivariable polynomials, specifying total degree or degree in a particular variable prevents ambiguity.
Homogeneous polynomials
A polynomial is homogeneous of degree if every nonzero term has total degree . For example,
is homogeneous of degree .
For such a polynomial,
Every polynomial has a unique decomposition into homogeneous parts obtained by grouping terms of equal total degree. The highest nonzero homogeneous part determines its total degree. Homogeneous polynomials are important in algebraic geometry, especially in descriptions using homogeneous coordinates.
Degree, roots, and polynomial functions
A nonzero polynomial of degree over a field has at most distinct roots in that field. More generally, the sum of the multiplicities of its roots cannot exceed .
The fundamental theorem of algebra states that every nonconstant complex polynomial has a complex root. Combined with repeated factorization, it implies that a complex polynomial of degree has exactly roots counted with multiplicity:
This does not imply that it has distinct roots or real roots. For example, has degree but only one distinct root, and has no real roots.
A formal polynomial must also be distinguished from the function it defines on a particular field. Over an infinite field, distinct polynomials define distinct functions. Over a finite field, different polynomials can define the same function.
For example, over the field with two elements, and agree at every input even though their degrees are and . Thus polynomial degree is fundamentally a property of the formal polynomial, not always a uniquely determined property of its values.
Differentiation and growth
For a polynomial of degree over the real or complex numbers, its derivative satisfies
Indeed, the leading term becomes , whose coefficient is nonzero. Repeated differentiation gives
The same conclusions hold over any field of characteristic zero. They need not hold in positive characteristic. Over a field of characteristic , for example, the formal derivative of is zero.
For a real polynomial with leading term ,
Thus the leading term determines its behavior for sufficiently large positive or negative inputs. The parity of the degree and the sign of the leading coefficient determine the directions of the two ends of its graph.
Uses and limitations
Degree is a basic measure of algebraic complexity, with several concrete uses:
- Interpolation. Given distinct input values over a field and prescribed output values, there is a unique polynomial of degree at most passing through them. This is the basis of polynomial interpolation.
- Polynomial spaces. The polynomials in one variable of degree at most , together with zero, form a vector space with basis and dimension . Polynomials of degree exactly do not form a vector space, because addition can cancel leading terms.
- Approximation. In approximation theory, degree controls the size of the polynomial space available to approximate a function. Higher degree permits more flexibility, but does not by itself guarantee better numerical behavior.
- Geometry. The degree of a polynomial equation helps classify algebraic curves and surfaces. Degree alone does not determine their shape or number of components.
Degree also does not measure every aspect of computational difficulty. A polynomial of very high degree may contain only a few nonzero terms, while a lower-degree polynomial in many variables may contain many terms. Coefficient size, sparsity, representation, and numerical stability can therefore be as important as degree in computation.