Intermediate Value Theorem

WHAT is it?

Three pieces you MUST keep straight:

• Continuity on a closed interval $[a,b]$ — the hypothesis (the price of admission).
• $N$ is an intermediate value — between $f(a)$ and $f(b)$.
• Conclusion: existence of a $c$. The IVT says a solution exists; it does not tell you what $c$ is or how many.

WHY is it true? (intuition before proof)

Derivation from first principles (the "bisection / completeness" proof)

We prove the special case $f(a)<0<f(b)$ and find $c$ with $f(c)=0$ (the Bolzano version). The general case follows by applying this to $g(x)=f(x)-N$.

Why is this special case enough? Define $g(x)=f(x)-N$. If $f(a)<N<f(b)$ then $g(a)<0<g(b)$, and $g$ is continuous. A root $g(c)=0$ means $f(c)=N$. So finding a zero is the whole problem.

Setup. Let $S=\{x\in[a,b] : f(x)<0\}.$

Why this set? $S$ is the collection of points where $f$ is still below zero. Its right edge is where $f$ is "about to cross". $S$ is non-empty ($a\in S$) and bounded above by $b$.

Step 1 — get a candidate. By the Completeness Axiom of $\mathbb{R}$, every non-empty set bounded above has a least upper bound (supremum). Let $c=\sup S.$ Why this step? Completeness is what makes IVT true on $\mathbb R$ and false on $\mathbb Q$ — it guarantees the "edge point" $c$ actually exists as a real number.

Step 2 — show $f(c)\le 0$. There are points of $S$ as close to $c$ as we like, so a sequence $x_n\to c$ with $f(x_n)<0$. By continuity $f(c)=\lim f(x_n)\le 0$. Why? Continuity lets us pass the limit inside $f$. A limit of negatives can't be positive.

Step 3 — show $f(c)\ge 0$. For $x$ slightly bigger than $c$, $x\notin S$, so $f(x)\ge 0$. Take $x_n\to c^+$; continuity gives $f(c)=\lim f(x_n)\ge 0$.

Step 4 — combine. $f(c)\le 0$ and $f(c)\ge 0$ force $f(c)=0$. Also $f(a)<0,f(b)>0$ means $c\neq a,b$, so $c\in(a,b)$. $\blacksquare$

HOW to use it (the standard moves)

Move 1 — Existence of a root. To show $f(x)=0$ has a solution on $[a,b]$: check $f$ is continuous, then find two points where $f$ has opposite signs.

Move 2 — Solve $f(x)=N$. Build $g=f-N$ and apply Move 1.

Move 3 — Locate a root (bisection). Halve the interval, keep the half whose endpoints have opposite signs. This constructs $c$ to any accuracy.

Common mistakes (Steel-manned)

Active Recall

Connections

• Continuity — IVT's hypothesis; "no jumps" is the engine.
• Completeness Axiom of Real Numbers — why IVT holds on $\mathbb R$ but fails on $\mathbb Q$.
• Extreme Value Theorem — sibling theorem on closed intervals (max/min exist).
• Bisection Method — numerical root-finding built on IVT.
• Bolzano's Theorem — the $N=0$ special case.
• Rolle's Theorem and Mean Value Theorem — derivative analogues for existence of points.
• Fixed Point Theorems — Example 3 generalizes to Brouwer's theorem.

Concept Map

Hinglish (regional understanding)