# Degree of a polynomial

The **degree** of a polynomial is the highest degree of its terms when the polynomial is expressed in its canonical form consisting of a linear combination of monomials. The degree of a term is the sum of the exponents of the variables that appear in it. The term **order** has been used as a synonym of *degree* but, nowadays, may refer to several other concepts (see order of a polynomial).
For example, the polynomial has three terms. (Notice, this polynomial can also be expressed as .) The first term has a degree of 5 (the sum of the powers 2 and 3), the second term has a degree of 1, and the last term has a degree of 0. Therefore, the polynomial has a degree of 5 which is the highest degree of any term.

To determine the degree of a polynomial that is not in standard form (for example ), one has to put it first in standard form by expanding the products (by distributivity) and combining the like terms; for example is of degree 1, even though each summand has degree 2. However, this is not needed when the polynomial is expressed as a product of polynomials in standard form, because the degree of a product is the sum of the degrees of the factors.

## Names of polynomials by degree

Look up in Wiktionary, the free dictionary.Appendix:English polynomial degrees |

The following names are assigned to polynomials according to their degree:^{[1]}^{[2]}^{[3]}

- Special case – zero (see § Degree of the zero polynomial below)
- Degree 0 – constant
^{[4]} - Degree 1 – linear
- Degree 2 – quadratic
- Degree 3 – cubic
- Degree 4 – quartic (or, if all terms have even degree, biquadratic)
- Degree 5 – quintic
- Degree 6 – sextic (or, less commonly, hexic)
- Degree 7 – septic (or, less commonly, heptic)

For higher degrees, names have sometimes been proposed,^{[5]} but they are rarely used:

- Degree 8 – octic
- Degree 9 – nonic
- Degree 10 – decic

Names for degree above three are based on Latin ordinal numbers, and end in *-ic*. This should be distinguished from the names used for the number of variables, the arity, which are based on Latin distributive numbers, and end in *-ary*. For example, a degree two polynomial in two variables, such as , is called a "binary quadratic": *binary* due to two variables, *quadratic* due to degree two.^{[lower-alpha 1]} There are also names for the number of terms, which are also based on Latin distributive numbers, ending in *-nomial*; the common ones are *monomial*, *binomial*, and (less commonly) *trinomial*; thus is a "binary quadratic binomial".

## Other examples

- The polynomial is a nonic polynomial
- The polynomial is a cubic polynomial
- The polynomial is a quintic polynomial (as the are cancelled out)

The canonical forms of the three examples above are:

- for , after reordering, ;
- for , after multiplying out and collecting terms of the same degree, ;
- for , in which the two terms of degree 8 cancel, .

## Behavior under polynomial operations

The degree of the sum, the product or the composition of two polynomials is strongly related to the degree of the input polynomials.^{[6]}

### Behaviour under addition

The degree of the sum (or difference) of two polynomials is less than or equal to the greater of their degrees; the equality always holds when the degrees of the polynomials are different i.e.

- .
- .

E.g.

- The degree of is 3. Note that 3 ≤ max(3, 2)
- The degree of is 2. Note that 2 ≤ max(3, 3)

### Behaviour under scalar multiplication

The degree of the product of a polynomial by a non-zero scalar is equal to the degree of the polynomial, i.e.

- .

E.g.

- The degree of is 2, just as the degree of .

Note that for polynomials over a ring containing divisors of zero, this is not necessarily true. For example, in , , but .

The set of polynomials with coefficients from a given field F and degree smaller than or equal to a given number n thus forms a vector space. (Note, however, that this set is not a ring, as it is not closed under multiplication, as is seen below.)

### Behaviour under multiplication

The degree of the product of two polynomials over a field or an integral domain is the sum of their degrees

- .

E.g.

- The degree of is 3 + 2 = 5.

Note that for polynomials over an arbitrary ring, this is not necessarily true. For example, in , , but .

### Behaviour under composition

The degree of the composition of two non-constant polynomials and over a field or integral domain is the product of their degrees:

- .

E.g.

- If , , then , which has degree 6.

Note that for polynomials over an arbitrary ring, this is not necessarily true. For example, in , , but .

## Degree of the zero polynomial

The degree of the zero polynomial is either left undefined, or is defined to be negative (usually −1 or −∞).^{[7]}

Like any constant value, the value 0 can be considered as a (constant) polynomial, called the zero polynomial. It has no nonzero terms, and so, strictly speaking, it has no degree either. As such, its degree is undefined. The propositions for the degree of sums and products of polynomials in the above section do not apply if any of the polynomials involved is the zero polynomial.^{[8]}

It is convenient, however, to define the degree of the zero polynomial to be *negative infinity*, −∞, and introduce the arithmetic rules^{[9]}

and

These examples illustrate how this extension satisfies the behavior rules above:

- The degree of the sum is 3. This satisfies the expected behavior, which is that .
- The degree of the difference is . This satisfies the expected behavior, which is that .
- The degree of the product is . This satisfies the expected behavior, which is that .

## Computed from the function values

A number of formulae exist which will evaluate the degree of a polynomial function *f*. One based on asymptotic analysis is

- ;

this is the exact counterpart of the method of estimating the slope in a log–log plot.

This formula generalizes the concept of degree to some functions that are not polynomials. For example:

- The degree of the multiplicative inverse, , is −1.
- The degree of the square root, , is 1/2.
- The degree of the logarithm, , is 0.
- The degree of the exponential function, , is ∞.

Note that the formula also gives sensible results for many combinations of such functions, e.g., the degree of is .

Another formula to compute the degree of *f* from its values is

- ;

this second formula follows from applying L'Hôpital's rule to the first formula. Intuitively though, it is more about exhibiting the degree *d* as the extra constant factor in the derivative of .

A more fine grained (than a simple numeric degree) description of the asymptotics of a function can be had by using big O notation. In the analysis of algorithms, it is for example often relevant to distinguish between the growth rates of and , which would both come out as having the *same* degree according to the above formulae.

## Extension to polynomials with two or more variables

For polynomials in two or more variables, the degree of a term is the *sum* of the exponents of the variables in the term; the degree (sometimes called the **total degree**) of the polynomial is again the maximum of the degrees of all terms in the polynomial. For example, the polynomial *x*^{2}*y*^{2} + 3*x*^{3} + 4*y* has degree 4, the same degree as the term *x*^{2}*y*^{2}.

However, a polynomial in variables *x* and *y*, is a polynomial in *x* with coefficients which are polynomials in *y*, and also a polynomial in *y* with coefficients which are polynomials in *x*.

*x*^{2}*y*^{2}+ 3*x*^{3}+ 4*y*= (3)*x*^{3}+ (*y*^{2})*x*^{2}+ (4*y*) = (*x*^{2})*y*^{2}+ (4)*y*+ (3*x*^{3})

This polynomial has degree 3 in *x* and degree 2 in *y*.

## Degree function in abstract algebra

Given a ring R, the polynomial ring R[*x*] is the set of all polynomials in *x* that have coefficients chosen from R. In the special case that R is also a field, then the polynomial ring R[*x*] is a principal ideal domain and, more importantly to our discussion here, a Euclidean domain.

It can be shown that the degree of a polynomial over a field satisfies all of the requirements of the *norm* function in the euclidean domain. That is, given two polynomials *f*(*x*) and *g*(*x*), the degree of the product *f*(*x*)*g*(*x*) must be larger than both the degrees of *f* and *g* individually. In fact, something stronger holds:

- deg(
*f*(*x*)*g*(*x*)) = deg(*f*(*x*)) + deg(*g*(*x*))

For an example of why the degree function may fail over a ring that is not a field, take the following example. Let R = , the ring of integers modulo 4. This ring is not a field (and is not even an integral domain) because 2 × 2 = 4 ≡ 0 (mod 4). Therefore, let *f*(*x*) = *g*(*x*) = 2*x* + 1. Then, *f*(*x*)*g*(*x*) = 4*x*^{2} + 4*x* + 1 = 1. Thus deg(*f*⋅*g*) = 0 which is not greater than the degrees of *f* and *g* (which each had degree 1).

Since the *norm* function is not defined for the zero element of the ring, we consider the degree of the polynomial *f*(*x*) = 0 to also be undefined so that it follows the rules of a norm in a euclidean domain.

## Notes

- ↑ For simplicity, this is a homogeneous polynomial, with equal degree in both variables separately.

- ↑ "Names of Polynomials". November 25, 1997. Retrieved 5 February 2012.
- ↑ Mac Lane and Birkhoff (1999) define "linear", "quadratic", "cubic", "quartic", and "quintic". (p. 107)
- ↑ King (2009) defines "quadratic", "cubic", "quartic", "quintic", "sextic", "septic", and "octic".
- ↑ Shafarevich (2003) says of a polynomial of degree zero, : "Such a polynomial is called a
*constant*because if we substitute different values of*x*in it, we always obtain the same value ." (p. 23) - ↑ James Cockle proposed the names "sexic", "septic", "octic", "nonic", and "decic" in 1851. (
*Mechanics Magazine*, Vol. LV, p. 171) - ↑ Lang, Sergei (2005).
*Algebra*(3rd ed.). Springer. p. 100. ISBN 978-0-387-95385-4. - ↑ Shafarevich (2003) says of the zero polynomial: "In this case, we consider that the degree of the polynomial is undefined." (p. 27)

Childs (1995) uses −1. (p. 233)

Childs (2009) uses −∞ (p. 287), however he excludes zero polynomials in his Proposition 1 (p. 288) and then explains that the proposition holds for zero polynomials "with the reasonable assumption that +*m*= for*m*any integer or*m*= ".

Axler (1997) uses −∞. (p. 64)

Grillet (2007) says: "The degree of the zero polynomial 0 is sometimes left undefined or is variously defined as −1 ∈ ℤ or as , as long as deg 0 < deg A for all A ≠ 0." (A is a polynomial.) However, he excludes zero polynomials in his Proposition 5.3. (p. 121) - ↑ Barile, Margherita. "Zero Polynomial".
*MathWorld*. - ↑ Axler (1997) gives these rules and says: "The 0 polynomial is declared to have degree so that exceptions are not needed for various reasonable results." (p. 64)

## References

- Axler, Sheldon (1997),
*Linear Algebra Done Right*(2nd ed.), Springer Science & Business Media - Childs, Lindsay N. (1995),
*A Concrete Introduction to Higher Algebra*(2nd ed.), Springer Science & Business Media - Childs, Lindsay N. (2009),
*A Concrete Introduction to Higher Algebra*(3rd ed.), Springer Science & Business Media - Grillet, Pierre Antoine (2007),
*Abstract Algebra*(2nd ed.), Springer Science & Business Media - King, R. Bruce (2009),
*Beyond the Quartic Equation*, Springer Science & Business Media - Mac Lane, Saunders; Birkhoff, Garrett (1999),
*Algebra*(3rd ed.), American Mathematical Society - Shafarevich, Igor R. (2003),
*Discourses on Algebra*, Springer Science & Business Media

## External links

- Polynomial Order; Wolfram MathWorld