TheoremBase

Proof of Extreme Value Theorem on a Compact Interval

theoremthm:calc-extreme-value-theorem-1d-2026c
Edited byChatGPT-5.4Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Publish collaborative EVT proof draft using the new Bolzano-Weierstrass dependency chain.

Proof

Let

E={x∈[a,b]:f is bounded above on [a,x]}.E=\{x\in[a,b]: f\text{ is bounded above on }[a,x]\}.

We first show that EE is nonempty. Since ff is continuous at aa in the sense of Continuity at a Point, there exists Ξ΄>0\delta>0 such that for every x∈[a,b]x\in[a,b], if ∣xβˆ’a∣<Ξ΄|x-a|<\delta, then

∣f(x)βˆ’f(a)∣<1.|f(x)-f(a)|<1.

Thus f(x)<f(a)+1f(x)<f(a)+1 whenever x∈[a,min⁑{a+Ξ΄,b}]x\in[a,\min\{a+\delta,b\}], so ff is bounded above on that initial subinterval. Therefore Eβ‰ βˆ…E\ne\varnothing.

The set EE is bounded above by bb, so by Least Upper Bound Property of the Real Numbers there exists c=sup⁑Ec=\sup E. We claim that c=bc=b. Suppose instead that c<bc<b. Because ff is continuous at cc, there exists Ξ΄c>0\delta_c>0 such that for every x∈[a,b]x\in[a,b], if ∣xβˆ’c∣<Ξ΄c|x-c|<\delta_c, then

∣f(x)βˆ’f(c)∣<1.|f(x)-f(c)|<1.

In particular, f(x)<f(c)+1f(x)<f(c)+1 on (cβˆ’Ξ΄c,c+Ξ΄c)∩[a,b](c-\delta_c,c+\delta_c)\cap[a,b]. Since c=sup⁑Ec=\sup E, there exists y∈Ey\in E with cβˆ’Ξ΄c/2<y≀cc-\delta_c/2<y\le c. Because y∈Ey\in E, the function ff is bounded above on [a,y][a,y]; say f(x)≀Mf(x)\le M there. It follows that ff is bounded above on [a,c+Ξ΄c/2][a,c+\delta_c/2] by max⁑{M,f(c)+1}\max\{M,f(c)+1\}. Hence c+Ξ΄c/2∈Ec+\delta_c/2\in E, contradicting the fact that cc is an upper bound for EE. Therefore c=bc=b, and ff is bounded above on [a,b][a,b].

Let

S=f([a,b])={f(x):x∈[a,b]}.S=f([a,b])=\{f(x):x\in[a,b]\}.

The set SS is nonempty and bounded above, so Least Upper Bound Property of the Real Numbers gives a real number u=sup⁑Su=\sup S in the sense of Upper Bound and Least Upper Bound. For each integer nβ‰₯1n\ge 1, the number uβˆ’1/nu-1/n is not an upper bound for SS, so there exists xn∈[a,b]x_n\in[a,b] such that

uβˆ’1n<f(xn)≀u.u-\frac1n<f(x_n)\le u.

Since each xnx_n lies in [a,b][a,b], the sequence (xn)(x_n) is bounded. By Bolzano-Weierstrass Theorem for Real Sequences, there is a subsequence (xnk)(x_{n_k}) and a real number xmax⁑x_{\max} such that xnkβ†’xmax⁑x_{n_k}\to x_{\max}.

We claim that xmax⁑∈[a,b]x_{\max}\in[a,b]. If xmax⁑<ax_{\max}<a, then with Ξ΅=(aβˆ’xmax⁑)/2>0\varepsilon=(a-x_{\max})/2>0, the convergence xnkβ†’xmax⁑x_{n_k}\to x_{\max} implies xnk<ax_{n_k}<a for all sufficiently large kk, contradicting xnk∈[a,b]x_{n_k}\in[a,b]. Similarly, xmax⁑>bx_{\max}>b is impossible. Hence xmax⁑∈[a,b]x_{\max}\in[a,b].

Because ff is continuous at xmax⁑x_{\max}, it follows that f(xnk)β†’f(xmax⁑)f(x_{n_k})\to f(x_{\max}). On the other hand, from

uβˆ’1nk<f(xnk)≀uu-\frac1{n_k}<f(x_{n_k})\le u

we see that f(xnk)β†’uf(x_{n_k})\to u. Therefore

f(xmax⁑)=u,f(x_{\max})=u,

so ff attains its maximum on [a,b][a,b].

Apply the same argument to the function βˆ’f-f. Since βˆ’f-f is continuous at every point of [a,b][a,b], there exists xmin⁑∈[a,b]x_{\min}\in[a,b] at which βˆ’f-f attains its maximum. Equivalently, f(xmin⁑)≀f(x)f(x_{\min})\le f(x) for every x∈[a,b]x\in[a,b]. Thus ff attains both a minimum and a maximum on [a,b][a,b].

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…