Zero of a function explained

f , is a member x of the domain of f such that f(x) vanishes at x ; that is, the function f attains the value of 0 at x , or equivalently, x is a solution to the equation f(x) = 0 .^[1] A "zero" of a function is thus an input value that produces an output of 0.^[2]

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.^[3] For example, the polynomial

f of degree two, defined by f(x) = x ^{2-5x+6=(x-2)(x-3)} has the two roots (or zeros) that are 2 and 3.$$f(2)=2^2-5\backslash times\; 2+6=\; 0\backslash textf(3)=3^2-5\backslash times\; 3+6=0.$$

If the function maps real numbers to real numbers, then 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

x may be rewritten asf(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

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.

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 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).

Fundamental theorem of algebra

See main article: 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. Vieta's formulas relate the coefficients of a polynomial to sums and products of its roots.

Computing roots

See also: Equation solving. There are many methods for computing accurate approximations of roots of functions, the best being Newton's method, see Root-finding algorithm.

For polynomials, there are specialized algorithms that are more efficient and may provide all roots or all real roots; see Polynomial root-finding and Real-root isolation.

Some polynomial, including all those of degree no greater than 4, can have all their roots expressed algebraically in terms of their coefficients; see Solution in radicals.

Zero set

In various areas of mathematics, the zero set of a function is the set of all its zeros. More precisely, if

f:X\to R is a real-valued function (or, more generally, a function taking values in some additive group), its zero set is f ^{-1} ( 0 ) , the inverse image of \{ 0 \} in X .

Under the same hypothesis on the codomain of the function, a level set of a function

f is the zero set of the function f - c for some c in the codomain of f.

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

The cozero set of the function

f:X\to R is the complement of the zero set of f (i.e., the subset of X on which f is nonzero).

Applications

k\left[x _{1,\ldots,x} _{n\right]} over a field. In this context, a zero set is sometimes called a zero locus.

In analysis and geometry, any closed subset of

R ^{n} is the zero set of a smooth function defined on all of R ^{n} . 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 R ^{p} to R ^{n} . If zero is a regular value of f , then the zero set of f is a smooth manifold of dimension m = p - n by the regular value theorem.

For example, the unit

m -sphere in R ^{m+1} is the zero set of the real-valued function f(x) = \Vert x \Vert ^{2-1} .

See also

• Root-finding algorithm
• Bolzano's theorem, a continuous function that takes opposite signs at the end points of an interval has at least a zero in the interval.
• Gauss–Lucas theorem, the complex zeros of the derivative of a polynomial lie inside the convex hull of the roots of the polynomial.
• Marden's theorem, a refinement of Gauss–Lucas theorem for polynomials of degree three
• Sendov's conjecture, a conjectured refinement of Gauss-Lucas theorem
• zero at infinity
• Zero crossing, property of the graph of a function near a zero
• Zeros and poles of holomorphic functions

Notes and References

1. Web site: Algebra - Zeroes/Roots of Polynomials . tutorial.math.lamar.edu. 2019-12-15.
2. Book: Foerster, Paul A. . Algebra and Trigonometry: Functions and Applications, Teacher's Edition . Classics . 2006 . 535 . . Upper Saddle River, NJ . 0-13-165711-9 .
3. Web site: Roots and zeros (Algebra 2, Polynomial functions). Mathplanet . en. 2019-12-15.