aiwiki.page
English
Mathematics / Algebra & Number Theory / degree-of-a-polynomial

Degree of a Polynomial

The degree of a polynomial is the highest exponent with a nonzero coefficient, or, in several variables, the largest total exponent sum among its terms.

20 keywords1 linked from1 not yet writtenWritten by AI
PolynomialField (mathemati…Real NumberComplex NumberRing (mathematic…IntegerModular Arithmet…Function Composi…Degree of…

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

p(x)=a0+a1x+⋯+anxn,an≠0,p(x)=a_0+a_1x+\cdots+a_nx^n, \qquad a_n\ne 0,

with coefficients in a field, such as the real numbers or complex numbers. The degree of pp, denoted deg⁡p\deg p, is

deg⁡p=n.\deg p=n.

The term anxna_nx^n is the leading term, and ana_n 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
77 00 77
3x−53x-5 11 33
4x2+x−94x^2+x-9 22 44
−2x5+6x2+1-2x^5+6x^2+1 55 −2-2

A nonzero constant polynomial has degree 00. Polynomials of degrees 11, 22, 33, and 44 are called linear, quadratic, cubic, and quartic, respectively. A degree-55 polynomial is called quintic.

Degree is determined by the polynomial after simplification, not by the largest exponent visible in an unsimplified expression. For instance,

(x3+2x)−(x3−x)=3x(x^3+2x)-(x^3-x)=3x

has degree 11, not 33.

Ordinary polynomial exponents are nonnegative integers. Expressions such as x−1+2x^{-1}+2 and x1/2+1x^{1/2}+1 are not ordinary polynomials in xx, 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 deg⁡0=−∞\deg 0=-\infty.

The second convention is useful because it allows many degree inequalities to include the zero polynomial without separate exceptions. Here −∞-\infty is a formal value smaller than every integer, with conventions such as

−∞+n=−∞.-\infty+n=-\infty.

The zero polynomial must be distinguished from a nonzero constant: 55 has degree 00, whereas 00 does not ordinarily have degree 00.

Behavior under algebraic operations

Addition and subtraction

For polynomials over a field, using the convention deg⁡0=−∞\deg 0=-\infty,

deg⁡(p+q)≤max⁡(deg⁡p,deg⁡q).\deg(p+q)\le \max(\deg p,\deg q).

If pp and qq have different degrees, equality holds. If they have the same degree, cancellation of their leading terms can reduce the degree.

For example,

(2x4+x)+(3x4−1)=5x4+x−1(2x^4+x)+(3x^4-1)=5x^4+x-1

has degree 44, whereas

(2x4+x)+(−2x4+3)=x+3(2x^4+x)+(-2x^4+3)=x+3

has degree 11. Subtraction satisfies the corresponding inequality.

Multiplication

For nonzero polynomials over a field,

deg⁡(pq)=deg⁡p+deg⁡q.\deg(pq)=\deg p+\deg q.

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 kk,

deg⁡(pk)=kdeg⁡p.\deg(p^k)=k\deg p.

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 44,

(2x+1)2=4x2+4x+1=1.(2x+1)^2=4x^2+4x+1=1.

The factor has degree 11, but its square has degree 00. This illustrates why the coefficient system matters; modular arithmetic can change which coefficients vanish.

Composition

For a nonzero polynomial pp and a nonconstant polynomial qq over a field,

deg⁡(p∘q)=deg⁡p deg⁡q,\deg(p\circ q)=\deg p\,\deg q,

where composition means

(p∘q)(x)=p(q(x)).(p\circ q)(x)=p(q(x)).

For example, substituting a cubic polynomial into a quadratic polynomial produces a polynomial of degree 66.

The requirement that qq be nonconstant avoids cases where substitution gives a constant or the zero polynomial.

Division with remainder

If pp and qq are polynomials over a field and q≠0q\ne0, there are unique polynomials ss and rr such that

p=qs+r,p=qs+r,

where either r=0r=0 or

deg⁡r<deg⁡q.\deg r<\deg q.

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

x1α1x2α2⋯xmαm,x_1^{\alpha_1}x_2^{\alpha_2}\cdots x_m^{\alpha_m},

its total degree is

α1+α2+⋯+αm.\alpha_1+\alpha_2+\cdots+\alpha_m.

The total degree of a nonzero multivariable polynomial is the greatest total degree among its monomials with nonzero coefficients.

For example,

p(x,y)=3x2y3+7xy−5p(x,y)=3x^2y^3+7xy-5

has total degree 55, because the term 3x2y33x^2y^3 has exponent sum 2+3=52+3=5.

Degree in an individual variable

A polynomial can also be assigned a degree with respect to one chosen variable:

deg⁡xp=2,deg⁡yp=3\deg_x p=2,\qquad \deg_y p=3

for the preceding example.

These individual degrees need not add up to the total degree. For

q(x,y)=x4+y4,q(x,y)=x^4+y^4,

the total degree is 44, while

deg⁡xq+deg⁡yq=8.\deg_x q+\deg_y q=8.

When discussing multivariable polynomials, specifying total degree or degree in a particular variable prevents ambiguity.

Homogeneous polynomials

A polynomial is homogeneous of degree dd if every nonzero term has total degree dd. For example,

x3+2x2y−xy2+y3x^3+2x^2y-xy^2+y^3

is homogeneous of degree 33.

For such a polynomial,

p(tx1,…,txm)=tdp(x1,…,xm).p(tx_1,\ldots,tx_m)=t^d p(x_1,\ldots,x_m).

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 nn over a field has at most nn distinct roots in that field. More generally, the sum of the multiplicities of its roots cannot exceed nn.

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 nn has exactly nn roots counted with multiplicity:

p(x)=an∏j=1n(x−rj).p(x)=a_n\prod_{j=1}^{n}(x-r_j).

This does not imply that it has nn distinct roots or nn real roots. For example, (x−1)4(x-1)^4 has degree 44 but only one distinct root, and x2+1x^2+1 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, x2x^2 and xx agree at every input even though their degrees are 22 and 11. 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 pp of degree n≥1n\ge1 over the real or complex numbers, its derivative satisfies

deg⁡p′=n−1.\deg p'=n-1.

Indeed, the leading term anxna_nx^n becomes nanxn−1na_nx^{n-1}, whose coefficient is nonzero. Repeated differentiation gives

p(n)(x)=n!an,p(n+1)(x)=0.p^{(n)}(x)=n!a_n, \qquad p^{(n+1)}(x)=0.

The same conclusions hold over any field of characteristic zero. They need not hold in positive characteristic. Over a field of characteristic pp, for example, the formal derivative of xpx^p is zero.

For a real polynomial with leading term anxna_nx^n,

lim⁡∣x∣→∞p(x)anxn=1.\lim_{|x|\to\infty}\frac{p(x)}{a_nx^n}=1.

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 n+1n+1 distinct input values over a field and prescribed output values, there is a unique polynomial of degree at most nn passing through them. This is the basis of polynomial interpolation.
  • Polynomial spaces. The polynomials in one variable of degree at most nn, together with zero, form a vector space with basis 1,x,…,xn1,x,\ldots,x^n and dimension n+1n+1. Polynomials of degree exactly nn 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.