A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Mean Value Theorem (Rigorous)

Graduate Depth 80 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
362prerequisites beneath it
See this on the map →
Rigorous Definition of the DerivativeExtreme Value Theorem (Proof via Compactness)+1 more→→L'Hôpital's Rule (Rigorous)Taylor's Theorem with Remainder
mean-value derivative intermediate-point

Core Idea

If f is continuous on [a,b] and differentiable on (a,b), then there exists c ∈ (a,b) such that f'(c) = [f(b) - f(a)]/(b - a). This theorem links the derivative at a point to the average rate of change and is fundamental to bounding derivatives, proving monotonicity, and analyzing function behavior. Rolle's Theorem (f(a) = f(b) ⟹ f'(c) = 0) is a special case.

Explainer

The Mean Value Theorem (MVT) captures a geometrically obvious fact in analytically usable form. Draw any smooth curve from (a, f(a)) to (b, f(b)) — the secant line connecting the endpoints has a definite slope [f(b) − f(a)]/(b − a). The MVT says there must be at least one interior point c where the tangent to the curve is exactly parallel to that secant line. In kinematic terms: if you drive 120 miles in 2 hours, your average speed is 60 mph — and the MVT guarantees you were traveling at *exactly* 60 mph at some instant, even if you sped and slowed throughout the trip.

The rigorous proof builds from your prerequisite — the rigorous derivative definition — and proceeds through Rolle's Theorem. Rolle's handles the special case f(a) = f(b): if a function starts and ends at the same height and is continuous on [a,b] and differentiable on (a,b), then f'(c) = 0 somewhere inside. This follows from the Extreme Value Theorem: f attains a maximum and minimum on [a,b]; if both occur at the endpoints, f is constant and f' ≡ 0 everywhere; otherwise an interior extremum exists, and at an interior extremum the derivative must be zero (by the first-derivative test from your derivative definition). To derive MVT from Rolle's, define g(x) = f(x) − [f(a) + ((f(b)−f(a))/(b−a))(x−a)], which subtracts the secant line, making g(a) = g(b) = 0. Rolle's applies to g, yielding g'(c) = 0, which translates directly to f'(c) = [f(b)−f(a)]/(b−a).

The MVT's primary analytical power is bounding functions via their derivatives. If |f'(x)| ≤ M on (a,b), then applying MVT gives |f(b) − f(a)| ≤ M|b − a|. This estimate — the function can change no faster than its maximum derivative rate — appears constantly: in error analysis for numerical integration, in proving continuity from differentiability, and in establishing that algorithms converge. The MVT also proves the fundamental uniqueness principle: if f'(x) = 0 everywhere on (a,b), then f is constant. This is the rigorous justification for the calculus claim that "antiderivatives of the same function differ only by a constant," which undergirds the whole theory of definite integration.

Monotonicity is another direct consequence: if f'(x) > 0 on (a,b), then for any x₁ < x₂ in (a,b), MVT gives f(x₂) − f(x₁) = f'(c)(x₂ − x₁) > 0, so f is strictly increasing. The MVT thus transforms the local information encoded in the derivative into global statements about the function's behavior. From this point, Taylor's Theorem and L'Hôpital's Rule both use MVT-style arguments to control remainder terms and indeterminate forms — so the proof technique you learn here recurs throughout the rest of real analysis.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Multiplying Binomials (FOIL) → Factoring Trinomials → Factoring Completely → Introduction to Rational Expressions → Simplifying Radical Expressions → Operations with Radicals → Complex Numbers Introduction → Operations with Complex Numbers → Solving Quadratic Equations by Completing the Square → Quadratic Formula Review and Applications → Graphing Quadratic Functions: Vertex and Intercepts → Quadratic Inequalities → Polynomial Functions: Degree and Leading Coefficient → Weierstrass Approximation Theorem → Bolzano-Weierstrass Theorem → Heine-Borel Theorem → Uniform Continuity on Compact Sets → Compact Sets and the Heine-Borel Theorem → Extreme Value Theorem (Proof via Compactness) → Mean Value Theorem (Rigorous)

Longest path: 81 steps · 362 total prerequisite topics

Prerequisites (3)

Leads To (2)