Mean Value Theorem Applications
On this page
Direct answer
Somewhere between two points on a smooth curve the tangent runs parallel to the chord: f′(c) = (f(b) − f(a))/(b − a) for some c in (a, b) — the Lagrange Mean Value Theorem, whose entire job in JEE is proving inequalities and locating roots. Rolle's theorem is the case f(a) = f(b), forcing f′(c) = 0, and it caps root counts: between consecutive roots of f lies a root of f′, so n roots of f′ permit at most n + 1 roots of f. Every application follows one design: choose f and [a, b] so the conclusion rearranges into the required inequality, after checking continuity on the closed interval and differentiability on the open one.
What you must remember
- LMVT: if f is continuous on [a, b] and differentiable on (a, b), some c in (a, b) satisfies f′(c) = (f(b) − f(a))/(b − a).
- Rolle: the same with f(a) = f(b); the conclusion f′(c) = 0 is the root-counting engine.
- Root cap: f′ with n real zeros allows f at most n + 1 real zeros — count derivative roots first, then locate signs.
- Inequality factory: e^x > 1 + x (x ≠ 0); ln(1 + x) < x for x > 0; x/(1 + x) < ln(1 + x) for x > 0; |sin a − sin b| ≤ |a − b|; tan x > x on (0, π/2).
- Geometric reading: somewhere the instantaneous rate equals the average rate — the tangent-parallel-to-chord picture that makes the statement believable without symbols.
- Existential c: the theorem guarantees some c, never a unique one, and questions asking you to exhibit c are computations, not consequences.
- Hypothesis discipline: |x| on [−1, 1] satisfies neither Rolle conclusion nor its promise — differentiability fails at 0 and the example is the standard counterquote.
Two standard arguments
First, prove e^x > 1 + x for x > 0. Apply LMVT to f(t) = e^t on [0, x]: (e^x − 1)/x = e^c for some c in (0, x), and e^c > 1 since c > 0, so e^x − 1 > x. For x < 0 the same argument on [x, 0] gives (1 − e^x)/(−x) = e^c < 1, hence e^x > 1 + x again. Second, show x³ − 3x + 1 = 0 has exactly three real roots. Sign hunting: f(−2) = −1 < 0, f(−1) = 3 > 0, f(0) = 1 > 0, f(1) = −1 < 0, f(2) = 3 > 0, so roots lie in (−2, −1), (0, 1) and (1, 2) — at least three. Now Rolle caps it: f′ = 3x² − 3 has only the two zeros ±1, and a cubic with a two-root derivative can have at most three roots. Exactly three, without ever solving the cubic.
Rolle as a root counter
JEE Main rarely states the theorems; it uses their corollaries in monotonicity and inequality clothing, and numerical items ask for the c guaranteed by LMVT on a polynomial — a one-line solve of f′(c) = slope. JEE Advanced is where the architecture appears: prove that between two real roots of e^x sin x = 0 there lies a root of e^x(sin x + cos x) = 0 (Rolle applied to e^x sin x), or bound the real roots of x⁴ + 4x − 1 = 0 from its derivative's single critical point (Rolle caps it at two, and sign changes on (−2, −1) and (0, 1) certify exactly two). The recurring mark-killer is the unchecked hypothesis: applying Rolle to |x| or to a function discontinuous at an interior point produces a false conclusion that the options happily include. Direction of inequality is the second leak — when LMVT yields f′(c) = (f(b) − f(a))/(b − a), bounding f′ above bounds the quotient with the inequality preserved only when b > a, and candidates flip it silently. Check hypotheses, fix the interval order, then quote.
Frequently asked questions
What does the Mean Value Theorem assert?
That some c in (a, b) satisfies f′(c) = (f(b) − f(a))/(b − a), provided f is continuous on [a, b] and differentiable on (a, b).
How does Rolle's theorem count roots?
Between consecutive roots of f, Rolle forces a root of f′ — so a derivative with n zeros caps f at n + 1 zeros.
How does LMVT prove e^x > 1 + x?
On [0, x], the theorem gives (e^x − 1)/x = e^c > 1 for c > 0, so e^x − 1 > x; the x < 0 case mirrors on [x, 0].
Why does Rolle fail for |x| on [−1, 1]?
The endpoints agree at 1 but the function is not differentiable at 0, which sits inside the interval — the hypothesis, not the conclusion, is broken.
Can the c guaranteed by LMVT be unique?
No — the theorem asserts existence only, and a function may host several valid c values between the same pair of points.