ProofComplete

Detailed Proof: Intermediate Value Theorem

This detailed proof of the Intermediate Value Theorem uses the completeness axiom (least upper bound property) directly. The strategy is to define a set SS of points where f<yf < y, use completeness to find c=sup⁑Sc = \sup S, and show f(c)=yf(c) = y using continuity. This is a model for many existence proofs in analysis.


Statement

Theorem4.1Intermediate Value Theorem

Let f:[a,b]β†’Rf : [a, b] \to \mathbb{R} be continuous. If yy satisfies f(a)<y<f(b)f(a) < y < f(b) (or f(a)>y>f(b)f(a) > y > f(b)), then there exists c∈(a,b)c \in (a, b) such that f(c)=yf(c) = y.


Detailed Proof

Proof

Assume without loss of generality that f(a)<y<f(b)f(a) < y < f(b). (If f(a)>y>f(b)f(a) > y > f(b), apply the result to βˆ’f-f.)

Construction of SS: Define

S={x∈[a,b]∣f(x)<y}.S = \{x \in [a, b] \mid f(x) < y\}.

Step 1: SS is nonempty and bounded above.

  • Since f(a)<yf(a) < y, we have a∈Sa \in S, so Sβ‰ βˆ…S \neq \varnothing.
  • Since SβŠ†[a,b]S \subseteq [a, b], SS is bounded above by bb.

Step 2: By completeness, c=sup⁑Sc = \sup S exists, and a≀c≀ba \leq c \leq b.

Step 3: We show f(c)=yf(c) = y by eliminating the cases f(c)<yf(c) < y and f(c)>yf(c) > y.

Case 1: f(c)<yf(c) < y leads to contradiction.

Suppose f(c)<yf(c) < y. Let Ο΅=yβˆ’f(c)>0\epsilon = y - f(c) > 0. Since ff is continuous at cc, there exists Ξ΄>0\delta > 0 such that

∣xβˆ’c∣<Ξ΄andx∈[a,b]β€…β€ŠβŸΉβ€…β€Šβˆ£f(x)βˆ’f(c)∣<Ο΅/2.|x - c| < \delta \quad \text{and} \quad x \in [a, b] \implies |f(x) - f(c)| < \epsilon/2.

In particular, for x∈(c,c+δ)∩[a,b]x \in (c, c + \delta) \cap [a, b],

f(x)<f(c)+Ο΅/2=f(c)+yβˆ’f(c)2=f(c)+y2<y.f(x) < f(c) + \epsilon/2 = f(c) + \frac{y - f(c)}{2} = \frac{f(c) + y}{2} < y.

Thus f(x)<yf(x) < y for all x∈(c,c+δ)∩[a,b]x \in (c, c + \delta) \cap [a, b]. This means that all points in (c,c+δ)∩[a,b](c, c + \delta) \cap [a, b] belong to SS.

Choose x0=min⁑(c+Ξ΄/2,b)>cx_0 = \min(c + \delta/2, b) > c. Since x0∈Sx_0 \in S, we have x0≀sup⁑S=cx_0 \leq \sup S = c, contradiction. Thus f(c)<ΜΈyf(c) \not< y.

Case 2: f(c)>yf(c) > y leads to contradiction.

Suppose f(c)>yf(c) > y. Let Ο΅=f(c)βˆ’y>0\epsilon = f(c) - y > 0. By continuity at cc, there exists Ξ΄>0\delta > 0 such that

∣xβˆ’c∣<Ξ΄andx∈[a,b]β€…β€ŠβŸΉβ€…β€Šβˆ£f(x)βˆ’f(c)∣<Ο΅/2.|x - c| < \delta \quad \text{and} \quad x \in [a, b] \implies |f(x) - f(c)| < \epsilon/2.

For x∈(cβˆ’Ξ΄,c)∩[a,b]x \in (c - \delta, c) \cap [a, b],

f(x)>f(c)βˆ’Ο΅/2=f(c)βˆ’f(c)βˆ’y2=f(c)+y2>y.f(x) > f(c) - \epsilon/2 = f(c) - \frac{f(c) - y}{2} = \frac{f(c) + y}{2} > y.

Thus f(x)>yf(x) > y for all x∈(cβˆ’Ξ΄,c)x \in (c - \delta, c). This means that no points in (cβˆ’Ξ΄,c)(c - \delta, c) belong to SS (since f(x)>yf(x) > y means xβˆ‰Sx \notin S).

Therefore, cβˆ’Ξ΄c - \delta is an upper bound for SS (any x∈Sx \in S with x>cβˆ’Ξ΄x > c - \delta would satisfy xβ‰₯cx \geq c, contradicting x∈(cβˆ’Ξ΄,c)x \in (c - \delta, c)). But cβˆ’Ξ΄<c=sup⁑Sc - \delta < c = \sup S, contradicting the definition of supremum. Thus f(c)>ΜΈyf(c) \not> y.

Conclusion: Since f(c)<ΜΈyf(c) \not< y and f(c)>ΜΈyf(c) \not> y, we must have f(c)=yf(c) = y.

β– 

Summary

This proof demonstrates:

  • Use of the completeness axiom to construct the point c=sup⁑Sc = \sup S.
  • Use of continuity to show f(c)=yf(c) = y by contradiction.
  • The technique of "ruling out" f(c)<yf(c) < y and f(c)>yf(c) > y separately.

This is a template for many existence proofs in analysis. See Intermediate Value Theorem for applications.