Study guide
1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema
Key Takeaways Explain This Topic AI
Rolle's Theorem requires continuity on [a, b], differentiability on (a, b), and f(a) = f(b) to guarantee an interior point c in (a, b) with f'(c) = 0.
The Mean Value Theorem equates the instantaneous rate of change to the average rate of change: f'(c) = (f(b) - f(a)) / (b - a); it fails if differentiability is violated at even a single interior point.
Cauchy's Extended Mean Value Theorem establishes that [f(b) - f(a)] g'(c) = [g(b) - g(a)] f'(c), providing the theoretical mechanism behind L'Hôpital's Rule.
Critical points occur where f'(x) = 0 or f'(x) is undefined; global extrema on compact intervals must be located by comparing critical values and endpoint values.
An inflection point requires a true change in the sign of concavity; f''(c) = 0 is a necessary condition for twice-differentiable functions, but never a sufficient one.
Last updated: September 2026
1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema
The Mean Value Theorem connects local derivative values to global interval changes. On the GRE Mathematics Subject Test, Rolle's Theorem and the MVT are tested through root counting, function bounding, and critical point classification.
- Rolle's Theorem and the Mean Value Theorem
- Rolle's Theorem
Let f : [ a , b ] → R f: [a, b] \to \mathbb{R} f : [ a , b ] → R satisfy three hypotheses:
f f f is continuous on [ a , b ] [a, b] [ a , b ] .
f f f is differentiable on ( a , b ) (a, b) ( a , b ) .
f ( a ) = f ( b ) f(a) = f(b) f ( a ) = f ( b ) .
Then there exists at least one c ∈ ( a , b ) c \in (a, b) c ∈ ( a , b ) such that f ′ ( c ) = 0 f'(c) = 0 f ′ ( c ) = 0 . Proof Blueprint : EVT guarantees extrema on [ a , b ] [a, b] [ a , b ] . If maximum equals minimum, f f f is constant. If maximum or minimum occurs in ( a , b ) (a, b) ( a , b ) , Fermat's Theorem forces f ′ ( c ) = 0 f'(c) = 0 f ′ ( c ) = 0 .
Mean Value Theorem (Lagrange MVT)
If f f f is continuous on [ a , b ] [a, b] [ a , b ] and differentiable on ( a , b ) (a, b) ( a , b ) , there exists c ∈ ( a , b ) c \in (a, b) c ∈ ( a , b ) with: f ′ ( c ) = f ( b ) − f ( a ) b − a ⟺ f ( b ) − f ( a ) = f ′ ( c ) ( b − a ) . f'(c) = \frac{f(b) - f(a)}{b - a} \iff f(b) - f(a) = f'(c)(b - a). f ′ ( c ) = b − a f ( b ) − f ( a ) ⟺ f ( b ) − f ( a ) = f ′ ( c ) ( b − a ) .
Core Corollaries
Constancy : f ′ ( x ) = 0 f'(x) = 0 f ′ ( x ) = 0 on ( a , b ) ⟹ f (a, b) \implies f ( a , b ) ⟹ f is constant.
Monotonicity : f ′ ( x ) > 0 f'(x) > 0 f ′ ( x ) > 0 on ( a , b ) ⟹ f (a, b) \implies f ( a , b ) ⟹ f is strictly increasing on [ a , b ] [a, b] [ a , b ] .
Root Separation : Between any two distinct roots of a differentiable function f f f , there lies at least one root of f ′ f' f ′ .
Cauchy's Generalized MVT
If f , g f, g f , g are continuous on [ a , b ] [a, b] [ a , b ] and differentiable on ( a , b ) (a, b) ( a , b ) , then for some c ∈ ( a , b ) c \in (a, b) c ∈ ( a , b ) : [ f ( b ) − f ( a ) ] g ′ ( c ) = [ g ( b ) − g ( a ) ] f ′ ( c ) . [f(b) - f(a)] g'(c) = [g(b) - g(a)] f'(c). [ f ( b ) − f ( a )] g ′ ( c ) = [ g ( b ) − g ( a )] f ′ ( c ) .
When g ′ ( x ) ≠ 0 g'(x) \neq 0 g ′ ( x ) = 0 , this yields f ′ ( c ) g ′ ( c ) = f ( b ) − f ( a ) g ( b ) − g ( a ) \frac{f'(c)}{g'(c)} = \frac{f(b) - f(a)}{g(b) - g(a)} g ′ ( c ) f ′ ( c ) = g ( b ) − g ( a ) f ( b ) − f ( a ) , which provides the theoretical foundation for L'Hôpital's Rule.
Critical Points, Fermat's Theorem, and Extrema
A point c ∈ Dom ( f ) c \in \operatorname{Dom}(f) c ∈ Dom ( f ) is a critical point if f ′ ( c ) = 0 f'(c) = 0 f ′ ( c ) = 0 or f ′ ( c ) f'(c) f ′ ( c ) is undefined.
Fermat's Theorem : If f f f attains a local extremum at an interior point c c c and f ′ ( c ) f'(c) f ′ ( c ) exists, then f ′ ( c ) = 0 f'(c) = 0 f ′ ( c ) = 0 .
Converse Fails : f ( x ) = x 3 f(x) = x^3 f ( x ) = x 3 has f ′ ( 0 ) = 0 f'(0) = 0 f ′ ( 0 ) = 0 , but x = 0 x = 0 x = 0 is an inflection point, not an extremum.
Closed Interval Method for Global Extrema
To find absolute extrema of continuous f f f on [ a , b ] [a, b] [ a , b ] :
Locate all critical points c i ∈ ( a , b ) c_i \in (a, b) c i ∈ ( a , b ) .
Evaluate f ( c i ) f(c_i) f ( c i ) at all critical points.
Evaluate f ( a ) f(a) f ( a ) and f ( b ) f(b) f ( b ) at boundary endpoints.
The maximum value is max { f ( c i ) , f ( a ) , f ( b ) } \max \{f(c_i), f(a), f(b)\} max { f ( c i ) , f ( a ) , f ( b )} ; the minimum is min { f ( c i ) , f ( a ) , f ( b ) } \min \{f(c_i), f(a), f(b)\} min { f ( c i ) , f ( a ) , f ( b )} .
- Derivative Tests, Concavity, and Inflection Points
- First Derivative Test
At critical point c c c :
f ′ f' f ′ flips from + + + to − - − : local maximum.
f ′ f' f ′ flips from − - − to + + + : local minimum.
No sign flip: not an extremum.
Second Derivative Test
At stationary point c c c ( f ′ ( c ) = 0 f'(c) = 0 f ′ ( c ) = 0 ):
f ′ ′ ( c ) > 0 ⟹ f''(c) > 0 \implies f ′′ ( c ) > 0 ⟹ concave up ⟹ \implies ⟹ local minimum.
f ′ ′ ( c ) < 0 ⟹ f''(c) < 0 \implies f ′′ ( c ) < 0 ⟹ concave down ⟹ \implies ⟹ local maximum.
f ′ ′ ( c ) = 0 ⟹ f''(c) = 0 \implies f ′′ ( c ) = 0 ⟹ inconclusive.
Concavity and Inflection Points
Concave Up : f ′ ′ ( x ) ≥ 0 f''(x) \ge 0 f ′′ ( x ) ≥ 0 ; graph lies above tangent lines.
Concave Down : f ′ ′ ( x ) ≤ 0 f''(x) \le 0 f ′′ ( x ) ≤ 0 ; graph lies below tangent lines.
Inflection Point : A point where the curve changes concavity. f ′ ′ ( c ) = 0 f''(c) = 0 f ′′ ( c ) = 0 is necessary (for C 2 C^2 C 2 functions) but not sufficient.
- Test / Feature Condition Geometric Identification
- Local Min f ′ ( c ) = 0 , f ′ ′ ( c ) > 0 f'(c) = 0, f''(c) > 0 f ′ ( c ) = 0 , f ′′ ( c ) > 0 Local valley
- Local Max f ′ ( c ) = 0 , f ′ ′ ( c ) < 0 f'(c) = 0, f''(c) < 0 f ′ ( c ) = 0 , f ′′ ( c ) < 0 Local peak
- Inflection f ′ ′ ( x ) f''(x) f ′′ ( x ) changes sign across c c c Tangent line crosses graph
Inconclusive f ′ ( c ) = 0 , f ′ ′ ( c ) = 0 f'(c) = 0, f''(c) = 0 f ′ ( c ) = 0 , f ′′ ( c ) = 0 Analyze via higher derivatives or 1st test
- Step-by-Step Worked Problems
- Problem 1: Root Uniqueness via Rolle's Theorem
Prove P ( x ) = x 7 + 4 x 3 + 3 x − 5 = 0 P(x) = x^7 + 4x^3 + 3x - 5 = 0 P ( x ) = x 7 + 4 x 3 + 3 x − 5 = 0 has exactly one real solution.
Solution :
Existence: P ( 0 ) = − 5 < 0 P(0) = -5 < 0 P ( 0 ) = − 5 < 0 and P ( 1 ) = 3 > 0 P(1) = 3 > 0 P ( 1 ) = 3 > 0 . By IVT, P P P has at least one root in ( 0 , 1 ) (0, 1) ( 0 , 1 ) .
Uniqueness: P ′ ( x ) = 7 x 6 + 12 x 2 + 3 P'(x) = 7x^6 + 12x^2 + 3 P ′ ( x ) = 7 x 6 + 12 x 2 + 3 . Since x 6 ≥ 0 x^6 \ge 0 x 6 ≥ 0 and x 2 ≥ 0 x^2 \ge 0 x 2 ≥ 0 , P ′ ( x ) ≥ 3 > 0 P'(x) \ge 3 > 0 P ′ ( x ) ≥ 3 > 0 for all x ∈ R x \in \mathbb{R} x ∈ R .
If P P P had two roots x 1 < x 2 x_1 < x_2 x 1 < x 2 , Rolle's Theorem would guarantee c ∈ ( x 1 , x 2 ) c \in (x_1, x_2) c ∈ ( x 1 , x 2 ) with P ′ ( c ) = 0 P'(c) = 0 P ′ ( c ) = 0 , contradicting P ′ ( x ) ≥ 3 P'(x) \ge 3 P ′ ( x ) ≥ 3 . Thus exactly one root exists.
Problem 2: Function Bounding via MVT
Show that ∣ sin x − sin y ∣ ≤ ∣ x − y ∣ |\sin x - \sin y| \le |x - y| ∣ sin x − sin y ∣ ≤ ∣ x − y ∣ for all x , y ∈ R x, y \in \mathbb{R} x , y ∈ R .
Solution :
For x = y x = y x = y , the statement holds trivially. Assume x < y x < y x < y .
The function f ( t ) = sin t f(t) = \sin t f ( t ) = sin t is continuous on [ x , y ] [x, y] [ x , y ] and differentiable on ( x , y ) (x, y) ( x , y ) .
By MVT, sin y − sin x y − x = cos c \frac{\sin y - \sin x}{y - x} = \cos c y − x s i n y − s i n x = cos c for some c ∈ ( x , y ) c \in (x, y) c ∈ ( x , y ) .
Taking absolute values gives ∣ sin x − sin y ∣ ∣ x − y ∣ = ∣ cos c ∣ ≤ 1 \frac{|\sin x - \sin y|}{|x - y|} = |\cos c| \le 1 ∣ x − y ∣ ∣ s i n x − s i n y ∣ = ∣ cos c ∣ ≤ 1 .
Multiplying by ∣ x − y ∣ |x - y| ∣ x − y ∣ yields ∣ sin x − sin y ∣ ≤ ∣ x − y ∣ |\sin x - \sin y| \le |x - y| ∣ sin x − sin y ∣ ≤ ∣ x − y ∣ .
GRE Exam Traps & Pitfalls
Trap 1: Applying MVT Across Non-Differentiable Interior Points For f ( x ) = ∣ x ∣ f(x) = |x| f ( x ) = ∣ x ∣ on [ − 1 , 2 ] [-1, 2] [ − 1 , 2 ] , the average slope is 2 − 1 2 − ( − 1 ) = 1 3 \frac{2 - 1}{2 - (-1)} = \frac{1}{3} 2 − ( − 1 ) 2 − 1 = 3 1 . Yet f ′ ( x ) ∈ { − 1 , + 1 } f'(x) \in \{-1, +1\} f ′ ( x ) ∈ { − 1 , + 1 } everywhere it exists. MVT fails because differentiability breaks down at x = 0 ∈ ( − 1 , 2 ) x = 0 \in (-1, 2) x = 0 ∈ ( − 1 , 2 ) .
Trap 2: Declaring Inflection Points Where f ′ ′ ( c ) = 0 f''(c) = 0 f ′′ ( c ) = 0 Without Sign Flip For f ( x ) = x 4 f(x) = x^4 f ( x ) = x 4 , f ′ ′ ( 0 ) = 0 f''(0) = 0 f ′′ ( 0 ) = 0 , but f ′ ′ ( x ) = 12 x 2 ≥ 0 f''(x) = 12x^2 \ge 0 f ′′ ( x ) = 12 x 2 ≥ 0 for all x x x . The graph remains concave up everywhere, so ( 0 , 0 ) (0, 0) ( 0 , 0 ) is not an inflection point.
Trap 3: Forgetting Boundary Evaluations on Compact Sets On closed intervals, global extrema often occur at boundary endpoints rather than interior critical points. Always evaluate f ( a ) f(a) f ( a ) and f ( b ) f(b) f ( b ) .