# Zero of a function

(Redirected from Root of a polynomial)
A graph of the function cos(x) on the domain ${\displaystyle \scriptstyle {[-2\pi ,2\pi ]}}$, with x-intercepts indicated in red. The function has zeroes where x is ${\displaystyle \scriptstyle {\frac {-3\pi }{2}}}$, ${\displaystyle \scriptstyle {\frac {-\pi }{2}}}$, ${\displaystyle \scriptstyle {\frac {\pi }{2}}}$ and ${\displaystyle \scriptstyle {\frac {3\pi }{2}}}$.

In mathematics, a zero, also sometimes called a root, of a real-, complex- or generally vector-valued function f is a member x of the domain of f such that f(x) vanishes at x; that is, x is a solution of the equation

f(x) = 0.

In other words, a "zero" of a function is an input value that produces an output of zero (0).[1]

A root of a polynomial is a zero of the corresponding polynomial function. The fundamental theorem of algebra shows that any non-zero polynomial has a number of roots at most equal to its degree and that the number of roots and the degree are equal when one considers the complex roots (or more generally the roots in an algebraically closed extension) counted with their multiplicities. For example, the polynomial f of degree two, defined by

${\displaystyle f(x)=x^{2}-5x+6}$

has the two roots 2 and 3, since

${\displaystyle f(2)=2^{2}-5\cdot 2+6=0\quad \textstyle {\rm {and}}\quad f(3)=3^{2}-5\cdot 3+6=0.}$

If the function maps real numbers to real numbers, its zeros are the x-coordinates of the points where its graph meets the x-axis. An alternative name for such a point (x,0) in this context is an x-intercept.

## Solution of an equation

Every equation in the unknown x may be rewritten as

f(x) = 0

by regrouping all terms in the left-hand side. It follows that the solutions of such an equation are exactly the zeros of the function f. In other words, "zero of a function" is a phrase denoting a "solution of the equation obtained by equating the function to 0", and the study of zeros of functions is exactly the same as the study of solutions of equations.

## Polynomial roots

Every real polynomial of odd degree has an odd number of real roots (counting multiplicities); likewise, a real polynomial of even degree must have an even number of real roots. Consequently, real odd polynomials must have at least one real root (because one is the smallest odd whole number), whereas even polynomials may have none. This principle can be proven by reference to the intermediate value theorem: since polynomial functions are continuous, the function value must cross zero in the process of changing from negative to positive or vice versa.

### Fundamental theorem of algebra

The fundamental theorem of algebra states that every polynomial of degree n has n complex roots, counted with their multiplicities. The non-real roots of polynomials with real coefficients come in conjugate pairs.[1] Vieta's formulas relate the coefficients of a polynomial to sums and products of its roots.

## Computing roots

Computing roots of functions, for example polynomial functions, frequently requires the use of specialised or approximation techniques (for example, Newton's method). However, some polynomial functions, including all those of degree no greater than 4, can have all their roots expressed algebraically in terms of their coefficients. (See algebraic solution.)

## Zero set

In various areas of mathematics, the zero set of a function is the set of all its zeros. More precisely, if f : XR is a real-valued function (or, more generally, a function taking values in some additive group), its zero set is ${\displaystyle f^{-1}(0)}$ of X, the inverse image of {0}).

The term zero set is generally used when there are infinitely many zeros, and they have some non-trivial topological properties. For example, a level set of a function f is the zero set of fc. The cozero set of f is the complement of the zero set of f (i.e., the subset of X on which f is nonzero).

### Applications

In algebraic geometry, the first definition of an algebraic variety is through zero-sets. Specifically, an affine algebraic set is the intersection of the zeros sets of several polynomials in a polynomial ring k[x1, ..., xn] over a field. In this context, a zero-set is sometimes called a zero-locus.

In analysis and geometry, any closed subset of Rn is the zero set of a smooth function defined on all of Rn. This extends to any smooth manifold, as a corollary of paracompactness.

In differential geometry, zero sets are frequently used to define manifolds. An important special case is the case that f is a smooth function from Rp to Rn. If zero is a regular value of f then the zero-set of f is a smooth manifold of dimension m = pn by the regular value theorem.

For example, the unit m-sphere in Rm+1 is the zero set of the real-valued function f(x) = |x|2 − 1.