Intermediate value theorem




Not to be confused with the Mean value theorem.



Intermediate value theorem: Let f be a defined continuous function on [a, b] and let s be a number with f(a) < s < f(b). Then there exists at least one x with f(x) = s


In mathematical analysis, the intermediate value theorem states that if a continuous function, f, with an interval, [a, b], as its domain, takes values f(a) and f(b) at each end of the interval, then it also takes any value between f(a) and f(b) at some point within the interval.


This has two important corollaries:



  1. If a continuous function has values of opposite sign inside an interval, then it has a root in that interval (Bolzano's theorem).[1]

  2. The image of a continuous function over an interval is itself an interval.




Contents






  • 1 Motivation


  • 2 Theorem


  • 3 Relation to completeness


  • 4 Proof


  • 5 History


  • 6 Generalizations


  • 7 Converse is false


  • 8 Practical applications


  • 9 See also


  • 10 References


  • 11 External links





Motivation




The intermediate value theorem


This captures an intuitive property of continuous functions: given f continuous on [1, 2] with the known values f(1) = 3 and f(2) = 5. Then the graph of y = f(x) must pass through the horizontal line y = 4 while x moves from 1 to 2. It represents the idea that the graph of a continuous function on a closed interval can be drawn without lifting your pencil from the paper.



Theorem


The intermediate value theorem states the following.


Consider an interval I=[a,b]{displaystyle I=[a,b]}I=[a,b] in the real numbers R{displaystyle mathbb {R} }mathbb {R} and a continuous function f:I→R{displaystyle f:Ito mathbb {R} }{displaystyle f:Ito mathbb {R} }. Then,



  • Version I. if u{displaystyle u}u is a number between f(a){displaystyle f(a)}f(a) and f(b){displaystyle f(b)}f(b),


that is, min(f(a),f(b))<u<max(f(a),f(b)){displaystyle min(f(a),f(b))<u<max(f(a),f(b))}{displaystyle min(f(a),f(b))<u<max(f(a),f(b))},

then there is a c∈(a,b){displaystyle cin (a,b)}cin (a,b) such that f(c)=u{displaystyle f(c)=u}{displaystyle f(c)=u}.



  • Version II. the image set f(I){displaystyle f(I)}f(I) is also an interval, and either it contains [f(a),f(b)]{displaystyle {bigl [}f(a),f(b){bigr ]}}{displaystyle {bigl [}f(a),f(b){bigr ]}}, or it contains [f(b),f(a)]{displaystyle {bigl [}f(b),f(a){bigr ]}}{displaystyle {bigl [}f(b),f(a){bigr ]}}; that is,


f(I)⊇[f(a),f(b)]  or  f(I)⊇[f(b),f(a)]{displaystyle f(I)supseteq {bigl [}f(a),f(b){bigr ]} {mbox{ or }} f(I)supseteq {bigl [}f(b),f(a){bigr ]}}{displaystyle f(I)supseteq {bigl [}f(a),f(b){bigr ]} {mbox{ or }} f(I)supseteq {bigl [}f(b),f(a){bigr ]}}.

Remark: Version II states that the set of function values has no gap. For any two function values c<d{displaystyle c<d}c<d, even if they are outside the interval between f(a){displaystyle f(a)}f(a) and f(b){displaystyle f(b)}f(b), all points in the interval [c,d]{displaystyle {bigl [}c,d{bigr ]}}{displaystyle {bigl [}c,d{bigr ]}} are also function values,



[c,d]⊆f(I){displaystyle {bigl [}c,d{bigr ]}subseteq f(I)}{displaystyle {bigl [}c,d{bigr ]}subseteq f(I)}.

A subset of the real numbers with no internal gap is an interval. Version I is naturally contained in Version II.



Relation to completeness


The theorem depends on, and is equivalent to, the completeness of the real numbers. The intermediate value theorem does not apply to the rational numbers ℚ because gaps exist between rational numbers; irrational numbers fill those gaps. For example, the function f(x)=x2−2{displaystyle f(x)=x^{2}-2}{displaystyle f(x)=x^{2}-2} for x∈Q{displaystyle xin mathbb {Q} }{displaystyle xin mathbb {Q} } satisfies f(0)=−2{displaystyle f(0)=-2}{displaystyle f(0)=-2} and f(2)=2{displaystyle f(2)=2}{displaystyle f(2)=2}. However, there is no rational number x{displaystyle x}x such that f(x)=0{displaystyle f(x)=0}f(x)=0, because 2{displaystyle {sqrt {2}}}{sqrt {2}} is an irrational number.



Proof


The theorem may be proven as a consequence of the completeness property of the real numbers as follows:[2]


We shall prove the first case, f(a)<u<f(b){displaystyle f(a)<u<f(b)}{displaystyle f(a)<u<f(b)}. The second case is similar.


Let S{displaystyle S}S be the set of all x∈[a,b]{displaystyle xin [a,b]}xin [a,b] such that f(x)≤u{displaystyle f(x)leq u}{displaystyle f(x)leq u}. Then S{displaystyle S}S is non-empty since a{displaystyle a}a is an element of S{displaystyle S}S, and S{displaystyle S}S is bounded above by b{displaystyle b}b. Hence, by completeness, the supremum c=supS{displaystyle c=sup S}{displaystyle c=sup S} exists. That is, c{displaystyle c}c is the lowest number that is greater than or equal to every member of S{displaystyle S}S. We claim that f(c)=u{displaystyle f(c)=u}{displaystyle f(c)=u}.


Fix some ε>0{displaystyle varepsilon >0}varepsilon >0. Since f{displaystyle f}f is continuous, there is a δ>0{displaystyle delta >0}delta >0 such that |f(x)−f(c)|<ε{displaystyle {Big |}f(x)-f(c){Big |}<varepsilon }{displaystyle {Big |}f(x)-f(c){Big |}<varepsilon } whenever |x−c|<δ{displaystyle |x-c|<delta }{displaystyle |x-c|<delta }. This means that


f(x)−ε<f(c)<f(x)+ε{displaystyle f(x)-varepsilon <f(c)<f(x)+varepsilon }{displaystyle f(x)-varepsilon <f(c)<f(x)+varepsilon }

for all x∈(c−δ,c+δ){displaystyle xin (c-delta ,c+delta )}{displaystyle xin (c-delta ,c+delta )}. By the properties of the supremum, there exist a∗∈(c−δ,c]{displaystyle a^{*}in (c-delta ,c]}{displaystyle a^{*}in (c-delta ,c]} that is contained in S{displaystyle S}S, so that for that a∗{displaystyle a^{*}}a^{*}



f(c)<f(a∗)+ε≤u+ε{displaystyle f(c)<f(a^{*})+varepsilon leq u+varepsilon }{displaystyle f(c)<f(a^{*})+varepsilon leq u+varepsilon }.

Choose a∗∗∈[c,c+δ){displaystyle a^{**}in [c,c+delta )}{displaystyle a^{**}in [c,c+delta )} that will obviously not be contained in S{displaystyle S}S, so we have



f(c)>f(a∗∗)−ε≥u−ε{displaystyle f(c)>f(a^{**})-varepsilon geq u-varepsilon }{displaystyle f(c)>f(a^{**})-varepsilon geq u-varepsilon }.

Both inequalities


u−ε<f(c)<u+ε{displaystyle u-varepsilon <f(c)<u+varepsilon }{displaystyle u-varepsilon <f(c)<u+varepsilon }

are valid for all ε>0{displaystyle varepsilon >0}varepsilon >0, from which we deduce f(c)=u{displaystyle f(c)=u}{displaystyle f(c)=u} as the only possible value, as stated.


The intermediate value theorem is an easy consequence of the basic properties of connected sets: the preservation of connectedness under continuous functions and the characterization of connected subsets of ℝ as intervals (see below for details and alternate proof). The latter characterization is ultimately a consequence of the least-upper-bound property of the real numbers.


The intermediate value theorem can also be proved using the methods of non-standard analysis, which places "intuitive" arguments involving infinitesimals on a rigorous footing. (See the article: non-standard calculus.)



History


For u = 0 above, the statement is also known as Bolzano's theorem. This theorem was first proved by Bernard Bolzano in 1817. Augustin-Louis Cauchy provided a proof in 1821.[3] Both were inspired by the goal of formalizing the analysis of functions and the work of Joseph-Louis Lagrange. The idea that continuous functions possess the intermediate value property has an earlier origin. Simon Stevin proved the intermediate value theorem for polynomials (using a cubic as an example) by providing an algorithm for constructing the decimal expansion of the solution. The algorithm iteratively subdivides the interval into 10 parts, producing an additional decimal digit at each step of the iteration.[4] Before the formal definition of continuity was given, the intermediate value property was given as part of the definition of a continuous function. Proponents include Louis Arbogast, who assumed the functions to have no jumps, satisfy the intermediate value property and have increments whose sizes corresponded to the sizes of the increments of the variable.[5]
Earlier authors held the result to be intuitively obvious and requiring no proof. The insight of Bolzano and Cauchy was to define a general notion of continuity (in terms of infinitesimals in Cauchy's case and using real inequalities in Bolzano's case), and to provide a proof based on such definitions.



Generalizations


The intermediate value theorem is closely linked to the topological notion of connectedness and follows from the basic properties of connected sets in metric spaces and connected subsets of ℝ in particular:



  • If X{displaystyle X}X and Y{displaystyle Y}Y are metric spaces, f:X→Y{displaystyle f:Xto Y}f:Xto Y is a continuous map, and E⊂X{displaystyle Esubset X}{displaystyle Esubset X} is a connected subset, then f(E){displaystyle f(E)}{displaystyle f(E)} is connected. (*)

  • A subset E⊂R{displaystyle Esubset mathbb {R} }Esubsetmathbb{R} is connected if and only if it satisfies the following property: x,y∈E, x<r<y⟹r∈E{displaystyle x,yin E, x<r<yimplies rin E}{displaystyle x,yin E, x<r<yimplies rin E}. (**)


In fact, connectedness is a topological property and (*) generalizes to topological spaces: If X{displaystyle X}X and Y{displaystyle Y}Y are topological spaces, f:X→Y{displaystyle f:Xto Y}f:Xto Y is a continuous map, and X{displaystyle X}X is a connected space, then f(X){displaystyle f(X)}f(X) is connected. The preservation of connectedness under continuous maps can be thought of as a generalization of the intermediate value theorem, a property of real valued functions of a real variable, to continuous functions in general spaces.


Recall the first version of the intermediate value theorem, stated previously:


Intermediate value theorem. (Version I). Consider a closed interval I=[a,b]{displaystyle I=[a,b]}I=[a,b] in the real numbers R{displaystyle mathbb {R} }mathbb {R} and a continuous function f:I→R{displaystyle f:Ito mathbb {R} }{displaystyle f:Ito mathbb {R} }. Then, if u{displaystyle u}u is a real number such that min(f(a),f(b))<u<max(f(a),f(b)){displaystyle min(f(a),f(b))<u<max(f(a),f(b))}{displaystyle min(f(a),f(b))<u<max(f(a),f(b))}, there exists c∈(a,b){displaystyle cin (a,b)}cin (a,b) such that f(c)=u{displaystyle f(c)=u}{displaystyle f(c)=u}.


The intermediate value theorem is an immediate consequence of these two properties of connectedness:[6]


Proof: By (**), I=[a,b]{displaystyle I=[a,b]}I=[a,b] is a connected set. It follows from (*) that the image, f(I){displaystyle f(I)}f(I), is also connected. For convenience, assume that f(a)<f(b){displaystyle f(a)<f(b)}{displaystyle f(a)<f(b)}. Then once more invoking (**), f(a)<u<f(b){displaystyle f(a)<u<f(b)}{displaystyle f(a)<u<f(b)} implies that u∈f(I){displaystyle uin f(I)}{displaystyle uin f(I)}, or f(c)=u{displaystyle f(c)=u}{displaystyle f(c)=u} for some c∈I{displaystyle cin I}{displaystyle cin I}. Since u≠f(a),f(b){displaystyle uneq f(a),f(b)}{displaystyle uneq f(a),f(b)}, c∈(a,b){displaystyle cin (a,b)}cin (a,b) must actually hold, and the desired conclusion follows. The same argument applies if f(b)<f(a){displaystyle f(b)<f(a)}{displaystyle f(b)<f(a)}, so we are done.  ◼{displaystyle blacksquare }{displaystyle blacksquare }


The intermediate value theorem generalizes in a natural way: Suppose that X is a connected topological space and (Y, <) is a totally ordered set equipped with the order topology, and let f : X → Y be a continuous map. If a and b are two points in X and u is a point in Y lying between f(a) and f(b) with respect to <, then there exists c in X such that f(c) = u. The original theorem is recovered by noting that ℝ is connected and that its natural topology is the order topology.


The Brouwer fixed-point theorem is a related theorem that, in one dimension gives a special case of the intermediate value theorem.



Converse is false


A "Darboux function" is a real-valued function f that has the "intermediate value property", i.e., that satisfies the conclusion of the intermediate value theorem: for any two values a and b in the domain of f, and any y between f(a) and f(b), there is some c between a and b with f(c) = y. The intermediate value theorem says that every continuous function is a Darboux function. However, not every Darboux function is continuous; i.e., the converse of the intermediate value theorem is false.


As an example, take the function f : [0, ∞) → [−1, 1] defined by f(x) = sin(1/x) for x > 0 and f(0) = 0. This function is not continuous at x = 0 because the limit of f(x) as x tends to 0 does not exist; yet the function has the intermediate value property. Another, more complicated example is given by the Conway base 13 function.


Historically, this intermediate value property has been suggested as a definition for continuity of real-valued functions[7][citation needed]; this definition was not adopted.


Darboux's theorem states that all functions that result from the differentiation of some other function on some interval have the intermediate value property (even though they need not be continuous).



Practical applications


The theorem implies that on any great circle around the world, for the temperature, pressure, elevation, carbon dioxide concentration, if the simplification is taken that this varies continuously, there will always exist two antipodal points that share the same value for that variable.


Proof: Take f to be any continuous function on a circle. Draw a line through the center of the circle, intersecting it at two opposite points A and B. Let d be defined by the difference f(A) − f(B). If the line is rotated 180 degrees, the value −d will be obtained instead. Due to the intermediate value theorem there must be some intermediate rotation angle for which d = 0, and as a consequence f(A) = f(B) at this angle.


This is a special case of a more general result called the Borsuk–Ulam theorem.


Another generalization for which this holds is for any closed convex n (n > 1) dimensional shape. Specifically, for any continuous function whose domain is the given shape, and any point inside the shape (not necessarily its center), there exist two antipodal points with respect to the given point whose functional value is the same. The proof is identical to the one given above.


The theorem also underpins the explanation of why rotating a wobbly table will bring it to stability (subject to certain easily met constraints).[8]



See also



  • Mean value theorem

  • Hairy ball theorem

  • Brouwer fixed point theorem



References




  1. ^ Weisstein, Eric W. "Bolzano's Theorem". MathWorld..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}


  2. ^ Essentially follows Clarke, Douglas A. (1971). Foundations of Analysis. Appleton-Century-Crofts. p. 284.


  3. ^ Grabiner, Judith V. (March 1983). "Who Gave You the Epsilon? Cauchy and the Origins of Rigorous Calculus" (PDF). The American Mathematical Monthly. Mathematical Association of America. 90 (3): 185–194. doi:10.2307/2975545. JSTOR 2975545


  4. ^ Karin Usadi Katz and Mikhail G. Katz (2011) A Burgessian Critique of Nominalistic Tendencies in Contemporary Mathematics and its Historiography. Foundations of Science. doi:10.1007/s10699-011-9223-1 See link


  5. ^ O'Connor, John J.; Robertson, Edmund F., "Intermediate value theorem", MacTutor History of Mathematics archive, University of St Andrews.


  6. ^ Rudin, Walter (1976). Principles of Mathematical Analysis. New York: McGraw-Hill. pp. 42, 93. ISBN 978-0-07-054235-8.


  7. ^ Smorynski, Craig (2017-04-07). MVT: A Most Valuable Theorem. Springer. ISBN 9783319529561.


  8. ^ Keith Devlin (2007) How to stabilize a wobbly table



External links




  • Intermediate value Theorem at ProofWiki


  • Intermediate value Theorem - Bolzano Theorem at cut-the-knot


  • Bolzano's Theorem by Julio Cesar de la Yncera, Wolfram Demonstrations Project.

  • Weisstein, Eric W. "Intermediate Value Theorem". MathWorld.


  • Two-dimensional version of the Intermediate Value Theorem, by Jim Belk at Math Stack Exchange.


  • Mizar system proof: http://mizar.org/version/current/html/topreal5.html#T4




Comments

Post a Comment

Popular posts from this blog

Information security

Image
This article is part of a series on Information security Related security categories Internet security Cyberwarfare Computer security Mobile security Network security Threats Computer crime Vulnerability Eavesdropping Malware Spyware Ransomware Trojans Viruses Worms Rootkits Bootkits Keyloggers Screen scrapers Exploits Backdoors Logic bombs Payloads Denial of service Defenses Computer access control Application security Antivirus software Secure coding Secure by default Secure by design Secure operating systems Authentication Multi-factor authentication Authorization Data-centric security Encryption Firewall Intrusion detection system Mobile secure gateway Runtime application self-protection (RASP) v t e Information security , sometimes shortened to InfoSec , is the practice of preventing unauthorized access, use, disclosure, disruption, modification, inspection, recording or destruction of information. Th
Read more

Lambak Kiri

Image
For Lambak Kiri public housing area, see Lambak Kiri Landless Indigenous Citizens' Housing Scheme. Village in Brunei-Muara, Brunei Lambak Kiri Village Location in Brunei Coordinates: 4°59′26″N 114°57′04″E  /  4.990472°N 114.951114°E  / 4.990472; 114.951114 Coordinates: 4°59′26″N 114°57′04″E  /  4.990472°N 114.951114°E  / 4.990472; 114.951114 Country Brunei District Brunei-Muara Mukim Berakas A Government  • Village head Hamdani Omar Postcode BB1214 Lambak Kiri is a populated place in Brunei-Muara District, Brunei. It is officially a village subdivision under Berakas A, a mukim in the district. Lambak Kiri may also refer to the greater area which includes the Lambak Kiri public housing area of the Landless Indigenous Citizens' Housing Scheme (Malay: Skim Tanah Kurnia Rakyat Jati ), although the latter is a separate subdivision. Contents 1 Name 2 Administration 3 See also 4 References Name
Read more

Farm Security Administration

Image
Farm Security Administration Farm Security Administration logo Agency overview Formed September 1, 1937  ( 1937-09-01 ) Preceding agencies Resettlement Administration Federal Emergency Relief Administration Dissolved 1946 Superseding agency Farmers Home Administration Key documents Farm Security Act Bankhead-Jones Farm Tenant Act The Farm Security Administration ( FSA ) was a New Deal agency created in 1937 to combat rural poverty during the Great Depression in the United States. It succeeded the Resettlement Administration (1935–1937). [1] The FSA stressed "rural rehabilitation" efforts to improve the lifestyle of sharecroppers, tenants, very poor landowning farmers, and a program to purchase submarginal land owned by poor farmers and resettle them in group farms on land more suitable for efficient farming. Critics, including the Farm Bureau, strongly opposed the FSA as an experiment in collectivizing agriculture—that is, in bringing
Read more