
In mathematics, a zero (also sometimes called a root) of a real-, complex-, or generally vector-valued function , is a member of the domain of such that vanishes at ; that is, the function attains the value of 0 at , or equivalently, is a solution to the equation . A "zero" of a function is thus an input value that produces an output of 0.
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 of degree two, defined by has the two roots (or zeros) that are 2 and 3.
If the function maps real numbers to real numbers, then its zeros are the -coordinates of the points where its graph meets the x-axis. An alternative name for such a point in this context is an -intercept.
Solution of an equation
Every equation in the unknown may be rewritten as
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 . 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
The fundamental theorem of algebra states that every polynomial of degree has
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
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 is a real-valued function (or, more generally, a function taking values in some additive group), its zero set is
, the inverse image of
in
.
Under the same hypothesis on the codomain of the function, a level set of a function is the zero set of the function
for some
in the codomain of
The zero set of a linear map is also known as its kernel.
The cozero set of the function is the complement of the zero set of
(i.e., the subset of
on which
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 zero sets of several polynomials, in a polynomial ring over a field. In this context, a zero set is sometimes called a zero locus.
In analysis and geometry, any closed subset of is the zero set of a smooth function defined on all of
. 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 is a smooth function from
to
. If zero is a regular value of
, then the zero set of
is a smooth manifold of dimension
by the regular value theorem.
For example, the unit -sphere in
is the zero set of the real-valued function
.
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
References
- "Algebra - Zeroes/Roots of Polynomials". tutorial.math.lamar.edu. Retrieved 2019-12-15.
- Foerster, Paul A. (2006). Algebra and Trigonometry: Functions and Applications, Teacher's Edition (Classics ed.). Upper Saddle River, NJ: Prentice Hall. p. 535. ISBN 0-13-165711-9.
- "Roots and zeros (Algebra 2, Polynomial functions)". Mathplanet. Retrieved 2019-12-15.
Further reading
- Weisstein, Eric W. "Root". MathWorld.
In mathematics a zero also sometimes called a root of a real complex or generally vector valued function f displaystyle f is a member x displaystyle x of the domain of f displaystyle f such that f x displaystyle f x vanishes at x displaystyle x that is the function f displaystyle f attains the value of 0 at x displaystyle x or equivalently x displaystyle x is a solution to the equation f x 0 displaystyle f x 0 A zero of a function is thus an input value that produces an output of 0 A graph of the function cos x displaystyle cos x for x displaystyle x in 2p 2p displaystyle left 2 pi 2 pi right with zeros at 3p2 p2 p2 displaystyle tfrac 3 pi 2 tfrac pi 2 tfrac pi 2 and 3p2 displaystyle tfrac 3 pi 2 marked in red 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 displaystyle f of degree two defined by f x x2 5x 6 x 2 x 3 displaystyle f x x 2 5x 6 x 2 x 3 has the two roots or zeros that are 2 and 3 f 2 22 5 2 6 0 and f 3 32 5 3 6 0 displaystyle f 2 2 2 5 times 2 6 0 text and f 3 3 2 5 times 3 6 0 If the function maps real numbers to real numbers then its zeros are the x displaystyle x coordinates of the points where its graph meets the x axis An alternative name for such a point x 0 displaystyle x 0 in this context is an x displaystyle x intercept Solution of an equationEvery equation in the unknown x displaystyle x may be rewritten as f x 0 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 f 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 Polynomial rootsEvery 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 The fundamental theorem of algebra states that every polynomial of degree n displaystyle n has n displaystyle 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 rootsThere 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 setIn various areas of mathematics the zero set of a function is the set of all its zeros More precisely if f X R 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 f 1 0 displaystyle f 1 0 the inverse image of 0 displaystyle 0 in X displaystyle X Under the same hypothesis on the codomain of the function a level set of a function f displaystyle f is the zero set of the function f c displaystyle f c for some c displaystyle c in the codomain of f displaystyle f The zero set of a linear map is also known as its kernel The cozero set of the function f X R displaystyle f X to mathbb R is the complement of the zero set of f displaystyle f i e the subset of X displaystyle X on which f displaystyle 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 zero sets of several polynomials in a polynomial ring k x1 xn displaystyle 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 Rn displaystyle mathbb R n is the zero set of a smooth function defined on all of Rn displaystyle mathbb 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 displaystyle f is a smooth function from Rp displaystyle mathbb R p to Rn displaystyle mathbb R n If zero is a regular value of f displaystyle f then the zero set of f displaystyle f is a smooth manifold of dimension m p n displaystyle m p n by the regular value theorem For example the unit m displaystyle m sphere in Rm 1 displaystyle mathbb R m 1 is the zero set of the real valued function f x x 2 1 displaystyle f x Vert x Vert 2 1 See alsoRoot 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 functionsReferences Algebra Zeroes Roots of Polynomials tutorial math lamar edu Retrieved 2019 12 15 Foerster Paul A 2006 Algebra and Trigonometry Functions and Applications Teacher s Edition Classics ed Upper Saddle River NJ Prentice Hall p 535 ISBN 0 13 165711 9 Roots and zeros Algebra 2 Polynomial functions Mathplanet Retrieved 2019 12 15 Further readingWeisstein Eric W Root MathWorld