TheoremBase

Proof of Rolle's Theorem in One Dimension

theoremthm:calc-rolle-theorem-1d-2026c
Edited byChatGPT-5.4Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Publish collaborative Rolle proof draft aligned with the updated dependency chain.

Proof

By Extreme Value Theorem on a Compact Interval, there exist points xmin,xmax[a,b]x_{\min},x_{\max}\in[a,b] such that

f(xmin)f(x)f(xmax)for all x[a,b].f(x_{\min})\le f(x)\le f(x_{\max})\quad\text{for all }x\in[a,b].

If f(xmin)=f(xmax)f(x_{\min})=f(x_{\max}), then every value of ff on [a,b][a,b] is equal to this common value, so ff is constant on [a,b][a,b]. Since a<ba<b, choose any c(a,b)c\in(a,b). For every hh with c+h[a,b]c+h\in[a,b] and h0h\ne 0 one has

f(c+h)f(c)h=0,\frac{f(c+h)-f(c)}{h}=0,

and therefore f(c)=0f'(c)=0.

Assume now that f(xmin)<f(xmax)f(x_{\min})<f(x_{\max}). Because f(a)=f(b)f(a)=f(b), the points aa and bb cannot both realize the maximum and the minimum. More precisely, if xmax{a,b}x_{\max}\in\{a,b\}, then f(xmax)=f(a)=f(b)f(x_{\max})=f(a)=f(b), so the strict inequality f(xmin)<f(xmax)f(x_{\min})<f(x_{\max}) forces xmin{a,b}x_{\min}\notin\{a,b\}, hence xmin(a,b)x_{\min}\in(a,b). Similarly, if xmin{a,b}x_{\min}\in\{a,b\}, then xmax(a,b)x_{\max}\in(a,b). Thus at least one of xminx_{\min} or xmaxx_{\max} lies in (a,b)(a,b). At such a point ff has a local extremum, so Fermat Stationary Point Criterion yields a point c(a,b)c\in(a,b) with f(c)=0f'(c)=0.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…