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
Contents
- Names of polynomials by degree
- Other examples
- Behavior under polynomial operations
- Behaviour under addition
- Behaviour under scalar multiplication
- Behaviour under multiplication
- Behaviour under composition
- Degree of the zero polynomial
- Computed from the function values
- Extension to polynomials with two or more variables
- Degree function in abstract algebra
- References
To determine the degree of a polynomial that is not in standard form (for example
Names of polynomials by degree
The following names are assigned to polynomials according to their degree:
For higher degrees, names have sometimes been proposed, but they are rarely used:
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
Other examples
The canonical forms of the three examples above are:
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.
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.
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.
Note that for polynomials over a ring containing divisors of zero, this is not necessarily true. For example, in
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.
Note that for polynomials over an arbitrary ring, this is not necessarily true. For example, in
Behaviour under composition
The degree of the composition of two non-constant polynomials
E.g.
Note that for polynomials over an arbitrary ring, this is not necessarily true. For example, in
Degree of the zero polynomial
The degree of the zero polynomial is either left undefined, or is defined to be negative (usually −1 or −∞).
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.
It is convenient, however, to define the degree of the zero polynomial to be negative infinity, −∞, and introduce the arithmetic rules
and
These examples illustrate how this extension satisfies the behavior rules above:
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:
Note that the formula also gives sensible results for many combinations of such functions, e.g., the degree of
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
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
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 x2y2 + 3x3 + 4y has degree 4, the same degree as the term x2y2.
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.
x2y2 + 3x3 + 4y = (3)x3 + (y2)x2 + (4y) = (x2)y2 + (4)y + (3x3)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 =
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.