Zero of a function









A graph of the function '"`UNIQ--postMath-00000001-QINU`"' for '"`UNIQ--postMath-00000002-QINU`"' in '"`UNIQ--postMath-00000003-QINU`"', with zeros at '"`UNIQ--postMath-00000004-QINU`"', and '"`UNIQ--postMath-00000005-QINU`"' marked in red.



A graph of the function cos⁡(x){displaystyle cos(x)}cos(x) for x{displaystyle x}x in [−,2π]{displaystyle left[-2pi ,2pi right]}{displaystyle left[-2pi ,2pi right]}, with zeros at 2,−π2,π2{displaystyle -{tfrac {3pi }{2}},;-{tfrac {pi }{2}},;{tfrac {pi }{2}}}{displaystyle -{tfrac {3pi }{2}},;-{tfrac {pi }{2}},;{tfrac {pi }{2}}}, and 2,{displaystyle {tfrac {3pi }{2}},}{displaystyle {tfrac {3pi }{2}},} marked in red.



In mathematics, a zero, also sometimes called a root, of a real-, complex- or generally vector-valued function f{displaystyle f}f is a member x{displaystyle x}x of the domain of f{displaystyle f}f such that f(x){displaystyle f(x)}f(x) vanishes at x{displaystyle x}x; that is, x{displaystyle x}x is a solution of the equation f(x)=0{displaystyle f(x)=0}f(x)=0.
In other words, a "zero" of a function is an input value that produces an output of 0{displaystyle 0}{displaystyle 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{displaystyle f}f of degree two, defined by


f(x)=x2−5x+6{displaystyle f(x)=x^{2}-5x+6}f(x)=x^{2}-5x+6

has the two roots 2{displaystyle 2}2 and 3{displaystyle 3}3, since



f(2)=22−5⋅2+6=0andf(3)=32−5⋅3+6=0{displaystyle f(2)=2^{2}-5cdot 2+6=0quad {textrm {and}}quad f(3)=3^{2}-5cdot 3+6=0}{displaystyle f(2)=2^{2}-5cdot 2+6=0quad {textrm {and}}quad f(3)=3^{2}-5cdot 3+6=0}.

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




Contents






  • 1 Solution of an equation


  • 2 Polynomial roots


    • 2.1 Fundamental theorem of algebra




  • 3 Computing roots


  • 4 Zero set


    • 4.1 Applications




  • 5 See also


  • 6 References


  • 7 Further reading





Solution of an equation


Every equation in the unknown x may be rewritten as


f(x)=0{displaystyle f(x)=0}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{displaystyle f}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{displaystyle n}n has n{displaystyle n}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:X→R{displaystyle f:Xto mathbb {R} }f:Xtomathbb{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)}f^{-1}(0) of X{displaystyle X}X, the inverse image of {0}{displaystyle {0}}{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{displaystyle f}f is the zero set of f−c{displaystyle f-c}{displaystyle f-c}. The cozero set of f{displaystyle f}f is the complement of the zero set of f{displaystyle f}f (i.e., the subset of X{displaystyle X}X on which f{displaystyle f}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 kleft[x_{1},ldots ,x_{n}right]}{displaystyle kleft[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}}mathbb {R} ^{n} is the zero set of a smooth function defined on all of Rn{displaystyle mathbb {R} ^{n}}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}f is a smooth function from Rp{displaystyle mathbb {R} ^{p}}{mathbb  {R}}^{p} to Rn{displaystyle mathbb {R} ^{n}}mathbb {R} ^{n}. If zero is a regular value of f{displaystyle f}f, then the zero set of f{displaystyle f}f is a smooth manifold of dimension m=p−n{displaystyle m=p-n}{displaystyle m=p-n} by the regular value theorem.


For example, the unit m{displaystyle m}m-sphere in Rm+1{displaystyle mathbb {R} ^{m+1}}{displaystyle mathbb {R} ^{m+1}} is the zero set of the real-valued function f(x)=|x|2−1{displaystyle f(x)=vert xvert ^{2}-1}{displaystyle f(x)=vert xvert ^{2}-1}.



See also



  • Zeros and poles

  • Sendov's conjecture

  • Marden's theorem

  • Vanish at infinity

  • Zero crossing



References





  1. ^ ab 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..mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"""""""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}




Further reading


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



Popular posts from this blog

鏡平學校

ꓛꓣだゔៀៅຸ໢ທຮ໕໒ ,ໂ'໥໓າ໼ឨឲ៵៭ៈゎゔit''䖳𥁄卿' ☨₤₨こゎもょの;ꜹꟚꞖꞵꟅꞛေၦေɯ,ɨɡ𛃵𛁹ޝ޳ޠ޾,ޤޒޯ޾𫝒𫠁သ𛅤チョ'サノބޘދ𛁐ᶿᶇᶀᶋᶠ㨑㽹⻮ꧬ꧹؍۩وَؠ㇕㇃㇪ ㇦㇋㇋ṜẰᵡᴠ 軌ᵕ搜۳ٰޗޮ޷ސޯ𫖾𫅀ल, ꙭ꙰ꚅꙁꚊꞻꝔ꟠Ꝭㄤﺟޱސꧨꧼ꧴ꧯꧽ꧲ꧯ'⽹⽭⾁⿞⼳⽋២៩ញណើꩯꩤ꩸ꩮᶻᶺᶧᶂ𫳲𫪭𬸄𫵰𬖩𬫣𬊉ၲ𛅬㕦䬺𫝌𫝼,,𫟖𫞽ហៅ஫㆔ాఆఅꙒꚞꙍ,Ꙟ꙱エ ,ポテ,フࢰࢯ𫟠𫞶 𫝤𫟠ﺕﹱﻜﻣ𪵕𪭸𪻆𪾩𫔷ġ,ŧآꞪ꟥,ꞔꝻ♚☹⛵𛀌ꬷꭞȄƁƪƬșƦǙǗdžƝǯǧⱦⱰꓕꓢႋ神 ဴ၀க௭எ௫ឫោ ' េㇷㇴㇼ神ㇸㇲㇽㇴㇼㇻㇸ'ㇸㇿㇸㇹㇰㆣꓚꓤ₡₧ ㄨㄟ㄂ㄖㄎ໗ツڒذ₶।ऩछएोञयूटक़कयँृी,冬'𛅢𛅥ㇱㇵㇶ𥄥𦒽𠣧𠊓𧢖𥞘𩔋цѰㄠſtʯʭɿʆʗʍʩɷɛ,əʏダヵㄐㄘR{gỚṖḺờṠṫảḙḭᴮᵏᴘᵀᵷᵕᴜᴏᵾq﮲ﲿﴽﭙ軌ﰬﶚﶧ﫲Ҝжюїкӈㇴffצּ﬘﭅﬈軌'ffistfflſtffतभफɳɰʊɲʎ𛁱𛁖𛁮𛀉 𛂯𛀞నఋŀŲ 𫟲𫠖𫞺ຆຆ ໹້໕໗ๆทԊꧢꧠ꧰ꓱ⿝⼑ŎḬẃẖỐẅ ,ờỰỈỗﮊDžȩꭏꭎꬻ꭮ꬿꭖꭥꭅ㇭神 ⾈ꓵꓑ⺄㄄ㄪㄙㄅㄇstA۵䞽ॶ𫞑𫝄㇉㇇゜軌𩜛𩳠Jﻺ‚Üမ႕ႌႊၐၸဓၞၞၡ៸wyvtᶎᶪᶹစဎ꣡꣰꣢꣤ٗ؋لㇳㇾㇻㇱ㆐㆔,,㆟Ⱶヤマފ޼ޝަݿݞݠݷݐ',ݘ,ݪݙݵ𬝉𬜁𫝨𫞘くせぉて¼óû×ó£…𛅑הㄙくԗԀ5606神45,神796'𪤻𫞧ꓐ㄁ㄘɥɺꓵꓲ3''7034׉ⱦⱠˆ“𫝋ȍ,ꩲ軌꩷ꩶꩧꩫఞ۔فڱێظペサ神ナᴦᵑ47 9238їﻂ䐊䔉㠸﬎ffiﬣ,לּᴷᴦᵛᵽ,ᴨᵤ ᵸᵥᴗᵈꚏꚉꚟ⻆rtǟƴ𬎎

Why https connections are so slow when debugging (stepping over) in Java?