Zero of a function

Every equation in the unknown ${\displaystyle x}$  may be rewritten as

${\displaystyle f($x)=0}  

by regrouping all the terms in the left-hand side. It follows that the solutions of such an equation are exactly the zeros of the function ${\displaystyle f}$ . In other words, a "zero of a function" is precisely 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.

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 the smallest odd whole number is 1), 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 (which always happens for odd functions).

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

Computing roots of functions, for example polynomial functions, frequently requires the use of specialised or approximation techniques (e.g., 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 (for more, see algebraic solution).

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

Under the same hypothesis on the codomain of the function, a level set of a function ${\displaystyle f}$  is the zero set of the function ${\displaystyle f-c}$  for some ${\displaystyle c}$  in the codomain of ${\displaystyle f.}$ 

The zero set of a linear map is also known as its kernel.

The cozero set of the function ${\displaystyle f:X\to \mathbb {R} }$  is the complement of the zero set of ${\displaystyle f}$  (i.e., the subset of ${\displaystyle X}$  on which ${\displaystyle f}$  is nonzero).

Inalgebraic geometry, the first definition of an algebraic variety is through zero sets. Specifically, an affine algebraic set is the intersection of the zero sets of several polynomials, in a polynomial ring ${\displaystyle k\left[x_{1},\ldots ,x_{n}\right]}$  over a field. In this context, a zero set is sometimes called a zero locus.

Inanalysis and geometry, any closed subsetof${\displaystyle \mathbb {R} ^{n}}$  is the zero set of a smooth function defined on all of ${\displaystyle \mathbb {R} ^{n}}$ . This extends to any smooth manifold as a corollary of paracompactness.

Indifferential geometry, zero sets are frequently used to define manifolds. An important special case is the case that ${\displaystyle f}$  is a smooth function from ${\displaystyle \mathbb {R} ^{p}}$ to${\displaystyle \mathbb {R} ^{n}}$ . If zero is a regular valueof${\displaystyle f}$ , then the zero set of ${\displaystyle f}$  is a smooth manifold of dimension ${\displaystyle m=p-n}$  by the regular value theorem.

For example, the unit ${\displaystyle m}$ -spherein${\displaystyle \mathbb {R} ^{m+1}}$  is the zero set of the real-valued function ${\displaystyle f($x)=\Vert x\Vert ^{2}-1}  .

• Marden's theorem
• Root-finding algorithm
• Sendov's conjecture
• Vanish at infinity
• Zero crossing
• Zeros and poles

• Weisstein, Eric W. "Root". MathWorld.