Study guide

11.3 Continuity, Uniform Continuity, and Value Theorems

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

11.3 Continuity, Uniform Continuity, and Value Theorems

Key Takeaways Explain This Topic AI

A mapping between metric spaces is continuous if and only if the preimage of every open set is open, or equivalently, the preimage of every closed set is closed.

Continuous functions preserve compactness, directly implying the Extreme Value Theorem (EVT) that real-valued continuous functions on compact sets achieve absolute extrema.

Continuous functions preserve connectedness, guaranteeing the Intermediate Value Theorem (IVT) where all intermediate values are attained on connected intervals.

Uniform continuity requires a single domain-wide delta independent of position; by the Heine-Cantor Theorem, every continuous function on a compact metric space is uniformly continuous.

Lipschitz continuity implies uniform continuity, which implies pointwise continuity; bounded derivatives on an interval guarantee Lipschitz continuity by the Mean Value Theorem.

Last updated: September 2026

11.3 Continuity, Uniform Continuity, and Value Theorems

Continuity preserves the fundamental topological structures of metric spaces. On the GRE Mathematics Subject Test, questions test topological preimage formulations, the preservation of compactness and connectedness, and the distinction between pointwise, uniform, and Lipschitz continuity.

Topological and Metric Definitions of Continuity

Let ( X , d X ) (X, d_X) ( X , d X ​ ) and ( Y , d Y ) (Y, d_Y) ( Y , d Y ​ ) be metric spaces, and let f : X → Y f: X \to Y f : X → Y .

Metric ε \varepsilon ε - δ \delta δ Definition : f f f is continuous at x 0 ∈ X x_0 \in X x 0 ​ ∈ X if for every ε > 0 \varepsilon > 0 ε > 0 , there exists δ ( ε , x 0 ) > 0 \delta(\varepsilon, x_0) > 0 δ ( ε , x 0 ​ ) > 0 such that d X ( x , x 0 ) < δ ⟹ d Y ( f ( x ) , f ( x 0 ) ) < ε d_X(x, x_0) < \delta \implies d_Y(f(x), f(x_0)) < \varepsilon d X ​ ( x , x 0 ​ ) < δ ⟹ d Y ​ ( f ( x ) , f ( x 0 ​ )) < ε .

Topological Preimage Characterization : Global continuity is characterized without deltas: f : X → Y is continuous ⟺ f − 1 ( V ) is open in X for every open set V ⊆ Y . f: X \to Y \text{ is continuous} \iff f^{-1}(V) \text{ is open in } X \text{ for every open set } V \subseteq Y. f : X → Y is continuous ⟺ f − 1 ( V ) is open in X for every open set V ⊆ Y . Equivalently, f f f is continuous if and only if f − 1 ( F ) f^{-1}(F) f − 1 ( F ) is closed in X X X for every closed set F ⊆ Y F \subseteq Y F ⊆ Y .

GRE Trap : Continuous functions do not preserve openness or closedness under forward images f ( U ) f(U) f ( U ) . For instance, f ( x ) = x 2 f(x) = x^2 f ( x ) = x 2 maps open ( − 1 , 1 ) (-1, 1) ( − 1 , 1 ) to [ 0 , 1 ) [0, 1) [ 0 , 1 ) , which is not open.

Preservation of Topological Invariants: EVT and IVT

Continuous functions preserve the topological invariants of compactness and connectedness:

Preservation of Compactness & Extreme Value Theorem

If K ⊆ X K \subseteq X K ⊆ X is compact and f : X → Y f: X \to Y f : X → Y is continuous, the image f ( K ) f(K) f ( K ) is compact in Y Y Y .

Extreme Value Theorem (EVT) : If K ⊂ R n K \subset \mathbb{R}^n K ⊂ R n is compact and f : K → R f: K \to \mathbb{R} f : K → R is continuous, f ( K ) f(K) f ( K ) is closed and bounded in R \mathbb{R} R . Thus f f f attains an absolute maximum and minimum on K K K : ∃ x min ⁡ , x max ⁡ ∈ K such that f ( x min ⁡ ) ≤ f ( x ) ≤ f ( x max ⁡ ) ∀ x ∈ K . \exists x_{\min}, x_{\max} \in K \quad \text{such that} \quad f(x_{\min}) \le f(x) \le f(x_{\max}) \quad \forall x \in K. ∃ x m i n ​ , x m a x ​ ∈ K such that f ( x m i n ​ ) ≤ f ( x ) ≤ f ( x m a x ​ ) ∀ x ∈ K .

Compact Homeomorphism Theorem : If X X X is compact and f : X → Y f: X \to Y f : X → Y is a continuous bijection onto a metric space Y Y Y , then f − 1 f^{-1} f − 1 is continuous, so f f f is a homeomorphism .

Preservation of Connectedness & Intermediate Value Theorem

If E ⊆ X E \subseteq X E ⊆ X is connected and f : X → Y f: X \to Y f : X → Y is continuous, the image f ( E ) f(E) f ( E ) is connected in Y Y Y .

Intermediate Value Theorem (IVT) : If f : [ a , b ] → R f: [a, b] \to \mathbb{R} f : [ a , b ] → R is continuous, [ a , b ] [a, b] [ a , b ] is connected, so f ( [ a , b ] ) f([a, b]) f ([ a , b ]) is an interval. If u u u lies between f ( a ) f(a) f ( a ) and f ( b ) f(b) f ( b ) , there exists c ∈ [ a , b ] c \in [a, b] c ∈ [ a , b ] with f ( c ) = u f(c) = u f ( c ) = u .

Pointwise vs. Uniform Continuity

Pointwise Continuity : ∀ x 0 ∈ X , ∀ ε > 0 , ∃ δ ( ε , x 0 ) > 0 \forall x_0 \in X, \forall \varepsilon > 0, \exists \delta(\varepsilon, x_0) > 0 ∀ x 0 ​ ∈ X , ∀ ε > 0 , ∃ δ ( ε , x 0 ​ ) > 0 such that d X ( x , x 0 ) < δ ⟹ d Y ( f ( x ) , f ( x 0 ) ) < ε d_X(x, x_0) < \delta \implies d_Y(f(x), f(x_0)) < \varepsilon d X ​ ( x , x 0 ​ ) < δ ⟹ d Y ​ ( f ( x ) , f ( x 0 ​ )) < ε .

Uniform Continuity : ∀ ε > 0 , ∃ δ ( ε ) > 0 \forall \varepsilon > 0, \exists \delta(\varepsilon) > 0 ∀ ε > 0 , ∃ δ ( ε ) > 0 such that ∀ x , y ∈ X \forall x, y \in X ∀ x , y ∈ X : d X ( x , y ) < δ ⟹ d Y ( f ( x ) , f ( y ) ) < ε . d_X(x, y) < \delta \implies d_Y(f(x), f(y)) < \varepsilon. d X ​ ( x , y ) < δ ⟹ d Y ​ ( f ( x ) , f ( y )) < ε . A single δ \delta δ works across the entire domain, independent of position.

Archetypal Non-Uniform Functions

f ( x ) = 1 / x f(x) = 1/x f ( x ) = 1/ x on ( 0 , 1 ) (0, 1) ( 0 , 1 ) : Blows up as x → 0 + x \to 0^+ x → 0 + ; δ \delta δ must shrink with x 2 x^2 x 2 .

f ( x ) = x 2 f(x) = x^2 f ( x ) = x 2 on R \mathbb{R} R : Slope grows unboundedly as x → ∞ x \to \infty x → ∞ .

f ( x ) = sin ⁡ ( 1 / x ) f(x) = \sin(1/x) f ( x ) = sin ( 1/ x ) on ( 0 , 1 ) (0, 1) ( 0 , 1 ) : Bounded, but oscillates infinitely fast near 0 0 0 .

f ( x ) = sin ⁡ ( x 2 ) f(x) = \sin(x^2) f ( x ) = sin ( x 2 ) on R \mathbb{R} R : Bounded, but wave crests crowd closer together as x → ∞ x \to \infty x → ∞ .

Continuous Extension Theorem

A continuous function f : ( a , b ) → R f: (a, b) \to \mathbb{R} f : ( a , b ) → R is uniformly continuous if and only if both one-sided limits lim ⁡ x → a + f ( x ) \lim_{x \to a^+} f(x) lim x → a + ​ f ( x ) and lim ⁡ x → b − f ( x ) \lim_{x \to b^-} f(x) lim x → b − ​ f ( x ) exist and are finite in R \mathbb{R} R .

Heine-Cantor Theorem & Lipschitz Continuity

Heine-Cantor Theorem : If ( X , d X ) (X, d_X) ( X , d X ​ ) is a compact metric space and f : X → Y f: X \to Y f : X → Y is continuous, then f f f is uniformly continuous . Any continuous function on [ a , b ] [a, b] [ a , b ] is uniformly continuous.

Lipschitz Continuity : f f f is Lipschitz if ∃ L ≥ 0 \exists L \ge 0 ∃ L ≥ 0 such that d Y ( f ( x ) , f ( y ) ) ≤ L ⋅ d X ( x , y ) d_Y(f(x), f(y)) \le L \cdot d_X(x, y) d Y ​ ( f ( x ) , f ( y )) ≤ L ⋅ d X ​ ( x , y ) for all x , y x, y x , y .

Choosing δ = ε / L \delta = \varepsilon / L δ = ε / L confirms: Lipschitz ⟹ \implies ⟹ Uniformly Continuous ⟹ \implies ⟹ Continuous .

Bounded Derivative Rule : If f f f is differentiable on an interval and ∣ f ′ ( x ) ∣ ≤ M |f'(x)| \le M ∣ f ′ ( x ) ∣ ≤ M , then by the Mean Value Theorem, ∣ f ( x ) − f ( y ) ∣ ≤ M ∣ x − y ∣ |f(x) - f(y)| \le M|x - y| ∣ f ( x ) − f ( y ) ∣ ≤ M ∣ x − y ∣ , so f f f is Lipschitz with L = M L = M L = M .

Comparison Table: Continuity Hierarchy

Function & Domain Continuous? Uniformly Continuous? Lipschitz? Extension to Boundary?

f ( x ) = x 2 f(x) = x^2 f ( x ) = x 2 on [ 0 , 2 ] [0, 2] [ 0 , 2 ] Yes Yes (Heine-Cantor) Yes ( L = 4 L=4 L = 4 ) Yes (already compact)

f ( x ) = x 2 f(x) = x^2 f ( x ) = x 2 on R \mathbb{R} R Yes No (unbounded derivative) No Not applicable

f ( x ) = x f(x) = \sqrt{x} f ( x ) = x ​ on [ 0 , 1 ] [0, 1] [ 0 , 1 ] Yes Yes (Heine-Cantor) No ( f ′ ( 0 ) = ∞ f'(0)=\infty f ′ ( 0 ) = ∞ ) Yes

f ( x ) = 1 / x f(x) = 1/x f ( x ) = 1/ x on ( 0 , 1 ) (0, 1) ( 0 , 1 ) Yes No ( lim ⁡ x → 0 + = ∞ \lim_{x \to 0^+} = \infty lim x → 0 + ​ = ∞ ) No No

f ( x ) = sin ⁡ x x f(x) = \frac{\sin x}{x} f ( x ) = x s i n x ​ on ( 0 , 1 ) (0, 1) ( 0 , 1 ) Yes Yes ( lim ⁡ x → 0 + = 1 \lim_{x \to 0^+} = 1 lim x → 0 + ​ = 1 ) Yes Yes ( f ( 0 ) = 1 f(0)=1 f ( 0 ) = 1 )

f ( x ) = sin ⁡ ( 1 / x ) f(x) = \sin(1/x) f ( x ) = sin ( 1/ x ) on ( 0 , 1 ) (0, 1) ( 0 , 1 ) Yes No (limit at 0 0 0 fails) No No

  • Step-by-Step Worked Problems
  • Problem 1: Uniform Continuity Verification on [ 0 , ∞ ) [0, \infty) [ 0 , ∞ )

Show that f ( x ) = x f(x) = \sqrt{x} f ( x ) = x ​ is uniformly continuous on [ 0 , ∞ ) [0, \infty) [ 0 , ∞ ) .

Solution :

On [ 0 , 1 ] [0, 1] [ 0 , 1 ] , f f f is continuous on a compact set, hence uniformly continuous by Heine-Cantor.

On [ 1 , ∞ ) [1, \infty) [ 1 , ∞ ) , f ′ ( x ) = 1 / ( 2 x ) ≤ 1 / 2 f'(x) = 1/(2\sqrt{x}) \le 1/2 f ′ ( x ) = 1/ ( 2 x ​ ) ≤ 1/2 . By MVT, f f f is Lipschitz with L = 1 / 2 L = 1/2 L = 1/2 .

Combining intervals: given ε > 0 \varepsilon > 0 ε > 0 , choose δ = min ⁡ ( 1 , δ [ 0 , 1 ] , 2 ε ) \delta = \min(1, \delta_{[0, 1]}, 2\varepsilon) δ = min ( 1 , δ [ 0 , 1 ] ​ , 2 ε ) .

Alternatively, use the inequality ∣ x − y ∣ 2 ≤ ∣ x − y ∣ |\sqrt{x} - \sqrt{y}|^2 \le |x - y| ∣ x ​ − y ​ ∣ 2 ≤ ∣ x − y ∣ , which implies setting δ = ε 2 \delta = \varepsilon^2 δ = ε 2 works globally across [ 0 , ∞ ) [0, \infty) [ 0 , ∞ ) .

Problem 2: Topological Preimages of Level Sets

Determine whether S = { ( x , y ) ∈ R 2 : 1 < x 2 + 2 y 2 < 4 } S = \{(x, y) \in \mathbb{R}^2 : 1 < x^2 + 2y^2 < 4\} S = {( x , y ) ∈ R 2 : 1 < x 2 + 2 y 2 < 4 } is open.

Solution :

Let g ( x , y ) = x 2 + 2 y 2 g(x, y) = x^2 + 2y^2 g ( x , y ) = x 2 + 2 y 2 . As a polynomial, g : R 2 → R g: \mathbb{R}^2 \to \mathbb{R} g : R 2 → R is continuous.

S = g − 1 ( ( 1 , 4 ) ) S = g^{-1}((1, 4)) S = g − 1 (( 1 , 4 )) .

Since ( 1 , 4 ) (1, 4) ( 1 , 4 ) is an open interval in R \mathbb{R} R , its preimage S S S under continuous g g g is open in R 2 \mathbb{R}^2 R 2 .

GRE Exam Traps & Pitfalls

Trap 1: Assuming Bounded Functions Are Uniformly Continuous Boundedness does not guarantee uniform continuity. f ( x ) = sin ⁡ ( 1 / x ) f(x) = \sin(1/x) f ( x ) = sin ( 1/ x ) on ( 0 , 1 ) (0, 1) ( 0 , 1 ) is bounded in [ − 1 , 1 ] [-1, 1] [ − 1 , 1 ] but oscillates infinitely fast near 0 0 0 .

Trap 2: Forward Image Fallacy for Open Sets Continuity preserves open sets only under preimages f − 1 ( V ) f^{-1}(V) f − 1 ( V ) , not under forward images f ( U ) f(U) f ( U ) .

Trap 3: Inverting Continuous Bijections Without Compactness A continuous bijection f : X → Y f: X \to Y f : X → Y is not a homeomorphism unless X X X is compact. For example, f : [ 0 , 2 π ) → S 1 f: [0, 2\pi) \to S^1 f : [ 0 , 2 π ) → S 1 with f ( t ) = e i t f(t) = e^{it} f ( t ) = e i t has a discontinuous inverse.

Loading diagram... Hierarchy of Function Regularity