Study guide

11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence

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.4 Sequences and Series of Functions: Pointwise and Uniform Convergence

Key Takeaways Explain This Topic AI

Pointwise convergence evaluates limits coordinate-wise, while uniform convergence controls domain-wide error via the supremum norm ||f_n - f||_infty -> 0.

The Uniform Limit Theorem states that the uniform limit of continuous functions is continuous; observing a discontinuous pointwise limit immediately disproves uniform convergence.

Dini's Theorem guarantees uniform convergence on a compact domain if the functions are continuous, converge pointwise to a continuous limit, and are monotonic in n.

Uniform convergence permits the term-by-term interchange of limits and Riemann integrals; however, term-by-term differentiation requires uniform convergence of the derivative sequence f_n', not merely f_n.

The Weierstrass M-Test establishes uniform and absolute convergence of function series sum u_n(x) by dominating each term |u_n(x)| <= M_n with a convergent numerical series sum M_n.

Last updated: September 2026

11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence

Convergence of function sequences is a central topic on the GRE Mathematics Subject Test. Success requires recognizing when limits, integrals, and derivatives can be legitimately interchanged with infinite sequences and series.

Pointwise vs. Uniform Convergence

Let ( f n ) n = 1 ∞ (f_n)_{n=1}^\infty ( f n ​ ) n = 1 ∞ ​ be a sequence of functions on E ⊆ R E \subseteq \mathbb{R} E ⊆ R .

Pointwise Convergence : f n → f f_n \to f f n ​ → f pointwise if for every x ∈ E x \in E x ∈ E and ε > 0 \varepsilon > 0 ε > 0 , there exists N ( ε , x ) N(\varepsilon, x) N ( ε , x ) such that n > N ⟹ ∣ f n ( x ) − f ( x ) ∣ < ε n > N \implies |f_n(x) - f(x)| < \varepsilon n > N ⟹ ∣ f n ​ ( x ) − f ( x ) ∣ < ε .

Uniform Convergence : f n ⇉ f f_n \rightrightarrows f f n ​ ⇉ f uniformly if for every ε > 0 \varepsilon > 0 ε > 0 , there exists N ( ε ) N(\varepsilon) N ( ε ) such that n > N ⟹ ∣ f n ( x ) − f ( x ) ∣ < ε n > N \implies |f_n(x) - f(x)| < \varepsilon n > N ⟹ ∣ f n ​ ( x ) − f ( x ) ∣ < ε for all x ∈ E x \in E x ∈ E .

Supremum Norm : f n ⇉ f f_n \rightrightarrows f f n ​ ⇉ f uniformly on E ⟺ lim ⁡ n → ∞ ∥ f n − f ∥ ∞ = lim ⁡ n → ∞ sup ⁡ x ∈ E ∣ f n ( x ) − f ( x ) ∣ = 0 E \iff \lim_{n \to \infty} \|f_n - f\|_\infty = \lim_{n \to \infty} \sup_{x \in E} |f_n(x) - f(x)| = 0 E ⟺ lim n → ∞ ​ ∥ f n ​ − f ∥ ∞ ​ = lim n → ∞ ​ sup x ∈ E ​ ∣ f n ​ ( x ) − f ( x ) ∣ = 0 .

Canonical Diagnostic Examples

f n ( x ) = x n f_n(x) = x^n f n ​ ( x ) = x n on [ 0 , 1 ] [0, 1] [ 0 , 1 ] : Pointwise limit is f ( x ) = 0 f(x) = 0 f ( x ) = 0 for x ∈ [ 0 , 1 ) x \in [0, 1) x ∈ [ 0 , 1 ) and f ( 1 ) = 1 f(1) = 1 f ( 1 ) = 1 . The limit is discontinuous at x = 1 x = 1 x = 1 , so convergence is not uniform on [ 0 , 1 ] [0, 1] [ 0 , 1 ] . On [ 0 , b ] [0, b] [ 0 , b ] with b < 1 b < 1 b < 1 , ∥ f n ∥ ∞ = b n → 0 \|f_n\|_\infty = b^n \to 0 ∥ f n ​ ∥ ∞ ​ = b n → 0 , so convergence is uniform.

f n ( x ) = n x 1 + n 2 x 2 f_n(x) = \frac{nx}{1 + n^2 x^2} f n ​ ( x ) = 1 + n 2 x 2 n x ​ on [ 0 , 1 ] [0, 1] [ 0 , 1 ] : Pointwise limit is 0 0 0 everywhere. The peak occurs at x = 1 / n x = 1/n x = 1/ n where f n ( 1 / n ) = 1 / 2 f_n(1/n) = 1/2 f n ​ ( 1/ n ) = 1/2 . Thus ∥ f n − 0 ∥ ∞ = 1 / 2 ↛ 0 \|f_n - 0\|_\infty = 1/2 \not\to 0 ∥ f n ​ − 0 ∥ ∞ ​ = 1/2  → 0 . The limit is continuous, yet convergence is not uniform !

Uniform Limit Theorem and Dini's Theorem

Uniform Limit Theorem : If f n : E → R f_n: E \to \mathbb{R} f n ​ : E → R are continuous and f n ⇉ f f_n \rightrightarrows f f n ​ ⇉ f uniformly on E E E , then f f f is continuous on E E E .

GRE Test : If continuous functions converge to a discontinuous limit, uniform convergence fails.

Dini's Theorem : Let K K K be a compact metric space. If f n : K → R f_n: K \to \mathbb{R} f n ​ : K → R are continuous, f n → f f_n \to f f n ​ → f pointwise to a continuous limit f f f , and the sequence is monotonic ( f n + 1 ( x ) ≤ f n ( x ) f_{n+1}(x) \le f_n(x) f n + 1 ​ ( x ) ≤ f n ​ ( x ) for all x x x ), then f n ⇉ f f_n \rightrightarrows f f n ​ ⇉ f uniformly on K K K .

  • Interchange of Limits: Integration and Differentiation
  • Integration Interchange

If f n ⇉ f f_n \rightrightarrows f f n ​ ⇉ f uniformly on [ a , b ] [a, b] [ a , b ] with each f n f_n f n ​ Riemann integrable, then f f f is Riemann integrable and: lim ⁡ n → ∞ ∫ a b f n ( x ) d x = ∫ a b ( lim ⁡ n → ∞ f n ( x ) ) d x = ∫ a b f ( x ) d x . \lim_{n \to \infty} \int_a^b f_n(x) \, dx = \int_a^b \left( \lim_{n \to \infty} f_n(x) \right) \, dx = \int_a^b f(x) \, dx. n → ∞ lim ​ ∫ a b ​ f n ​ ( x ) d x = ∫ a b ​ ( n → ∞ lim ​ f n ​ ( x ) ) d x = ∫ a b ​ f ( x ) d x .

Counterexample without uniform convergence : f n ( x ) = 2 n 2 x e − n 2 x 2 f_n(x) = 2n^2 x e^{-n^2 x^2} f n ​ ( x ) = 2 n 2 x e − n 2 x 2 on [ 0 , 1 ] [0, 1] [ 0 , 1 ] converges pointwise to 0 0 0 , but ∫ 0 1 f n ( x ) d x = 1 − e − n 2 → 1 ≠ ∫ 0 1 0 d x = 0 \int_0^1 f_n(x) \, dx = 1 - e^{-n^2} \to 1 \neq \int_0^1 0 \, dx = 0 ∫ 0 1 ​ f n ​ ( x ) d x = 1 − e − n 2 → 1  = ∫ 0 1 ​ 0 d x = 0 .

Differentiation Interchange (The Classic GRE Trap)

Uniform convergence of f n f_n f n ​ does not imply f n ′ → f ′ f_n' \to f' f n ′ ​ → f ′ .

Theorem : Suppose each f n f_n f n ​ is continuously differentiable on [ a , b ] [a, b] [ a , b ] , f n ( x 0 ) f_n(x_0) f n ​ ( x 0 ​ ) converges for at least one x 0 ∈ [ a , b ] x_0 \in [a, b] x 0 ​ ∈ [ a , b ] , and the derivatives converge uniformly : f n ′ ⇉ g f_n' \rightrightarrows g f n ′ ​ ⇉ g on [ a , b ] [a, b] [ a , b ] . Then f n ⇉ f f_n \rightrightarrows f f n ​ ⇉ f uniformly, f f f is differentiable, and f ′ ( x ) = g ( x ) = lim ⁡ f n ′ ( x ) f'(x) = g(x) = \lim f_n'(x) f ′ ( x ) = g ( x ) = lim f n ′ ​ ( x ) .

Counterexample : f n ( x ) = sin ⁡ ( n 2 x ) n ⇉ 0 f_n(x) = \frac{\sin(n^2 x)}{n} \rightrightarrows 0 f n ​ ( x ) = n s i n ( n 2 x ) ​ ⇉ 0 uniformly on R \mathbb{R} R , but f n ′ ( x ) = n cos ⁡ ( n 2 x ) f_n'(x) = n \cos(n^2 x) f n ′ ​ ( x ) = n cos ( n 2 x ) diverges unboundedly.

Weierstrass M-Test for Series of Functions

For a series of functions ∑ n = 1 ∞ u n ( x ) \sum_{n=1}^\infty u_n(x) ∑ n = 1 ∞ ​ u n ​ ( x ) on E E E :

Theorem : If there exist constants M n ≥ 0 M_n \ge 0 M n ​ ≥ 0 such that ∣ u n ( x ) ∣ ≤ M n |u_n(x)| \le M_n ∣ u n ​ ( x ) ∣ ≤ M n ​ for all x ∈ E x \in E x ∈ E and ∑ n = 1 ∞ M n < ∞ \sum_{n=1}^\infty M_n < \infty ∑ n = 1 ∞ ​ M n ​ < ∞ , then ∑ n = 1 ∞ u n ( x ) \sum_{n=1}^\infty u_n(x) ∑ n = 1 ∞ ​ u n ​ ( x ) converges absolutely and uniformly on E E E .

Consequences : If each u n u_n u n ​ is continuous, the sum S ( x ) S(x) S ( x ) is continuous, and integration can be performed term by term: ∫ a b S ( x ) d x = ∑ n = 1 ∞ ∫ a b u n ( x ) d x \int_a^b S(x) \, dx = \sum_{n=1}^\infty \int_a^b u_n(x) \, dx ∫ a b ​ S ( x ) d x = ∑ n = 1 ∞ ​ ∫ a b ​ u n ​ ( x ) d x .

Equicontinuity and the Arzelà-Ascoli Theorem

Equicontinuity : A family F ⊂ C ( X ) \mathcal{F} \subset C(X) F ⊂ C ( X ) is equicontinuous if for every ε > 0 \varepsilon > 0 ε > 0 , there exists δ > 0 \delta > 0 δ > 0 such that d ( x , y ) < δ ⟹ ∣ f ( x ) − f ( y ) ∣ < ε d(x, y) < \delta \implies |f(x) - f(y)| < \varepsilon d ( x , y ) < δ ⟹ ∣ f ( x ) − f ( y ) ∣ < ε for all f ∈ F f \in \mathcal{F} f ∈ F simultaneously.

Arzelà-Ascoli Theorem : Let K K K be a compact metric space. A subset F ⊂ C ( K ) \mathcal{F} \subset C(K) F ⊂ C ( K ) has compact closure in the supremum norm (every sequence in F \mathcal{F} F has a uniformly convergent subsequence) if and only if F \mathcal{F} F is pointwise bounded and equicontinuous .

Comparison Table: Conditions for Interchanging Operations

Operation Interchange Required Hypotheses Canonical Failure Without Hypothesis

lim ⁡ x → x 0 lim ⁡ n f n = lim ⁡ n lim ⁡ x → x 0 f n \lim_{x \to x_0} \lim_n f_n = \lim_n \lim_{x \to x_0} f_n lim x → x 0 ​ ​ lim n ​ f n ​ = lim n ​ lim x → x 0 ​ ​ f n ​ f n f_n f n ​ continuous, f n ⇉ f f_n \rightrightarrows f f n ​ ⇉ f uniformly f n ( x ) = x n f_n(x) = x^n f n ​ ( x ) = x n on [ 0 , 1 ] [0, 1] [ 0 , 1 ] (pointwise limit discontinuous)

lim ⁡ n ∫ f n d x = ∫ lim ⁡ n f n d x \lim_n \int f_n \, dx = \int \lim_n f_n \, dx lim n ​ ∫ f n ​ d x = ∫ lim n ​ f n ​ d x f n ⇉ f f_n \rightrightarrows f f n ​ ⇉ f uniformly on [ a , b ] [a, b] [ a , b ] f n ( x ) = 2 n 2 x e − n 2 x 2 f_n(x) = 2n^2 x e^{-n^2 x^2} f n ​ ( x ) = 2 n 2 x e − n 2 x 2 on [ 0 , 1 ] [0, 1] [ 0 , 1 ] (integral → 1 ≠ 0 \to 1 \neq 0 → 1  = 0 )

( lim ⁡ n f n ) ′ = lim ⁡ n f n ′ (\lim_n f_n)' = \lim_n f_n' ( lim n ​ f n ​ ) ′ = lim n ​ f n ′ ​ f n ( x 0 ) f_n(x_0) f n ​ ( x 0 ​ ) converges, f n ′ ⇉ g f_n' \rightrightarrows g f n ′ ​ ⇉ g uniformly f n ( x ) = sin ⁡ ( n 2 x ) n ⇉ 0 f_n(x) = \frac{\sin(n^2 x)}{n} \rightrightarrows 0 f n ​ ( x ) = n s i n ( n 2 x ) ​ ⇉ 0 , but f n ′ ( x ) f_n'(x) f n ′ ​ ( x ) diverges

∫ ∑ u n d x = ∑ ∫ u n d x \int \sum u_n \, dx = \sum \int u_n \, dx ∫ ∑ u n ​ d x = ∑ ∫ u n ​ d x ∑ u n \sum u_n ∑ u n ​ converges uniformly (e.g., M-Test) ∑ ( x n − x n + 1 ) \sum (x^n - x^{n+1}) ∑ ( x n − x n + 1 ) on [ 0 , 1 ] [0, 1] [ 0 , 1 ]

Uniformly convergent subsequence Domain compact, F \mathcal{F} F bounded & equicontinuous f n ( x ) = sin ⁡ ( n x ) f_n(x) = \sin(nx) f n ​ ( x ) = sin ( n x ) on [ 0 , π ] [0, \pi] [ 0 , π ] (not equicontinuous)

  • Step-by-Step Worked Problems
  • Problem 1: Applying the Weierstrass M-Test

Prove that S ( x ) = ∑ n = 1 ∞ cos ⁡ ( n x ) n 2 + x 2 S(x) = \sum_{n=1}^\infty \frac{\cos(nx)}{n^2 + x^2} S ( x ) = ∑ n = 1 ∞ ​ n 2 + x 2 c o s ( n x ) ​ is continuous on R \mathbb{R} R .

Solution :

For all x ∈ R x \in \mathbb{R} x ∈ R , ∣ u n ( x ) ∣ = ∣ cos ⁡ ( n x ) n 2 + x 2 ∣ ≤ 1 n 2 = M n |u_n(x)| = \left| \frac{\cos(nx)}{n^2 + x^2} \right| \le \frac{1}{n^2} = M_n ∣ u n ​ ( x ) ∣ = ​ n 2 + x 2 c o s ( n x ) ​ ​ ≤ n 2 1 ​ = M n ​ .

The series ∑ n = 1 ∞ 1 n 2 = π 2 6 < ∞ \sum_{n=1}^\infty \frac{1}{n^2} = \frac{\pi^2}{6} < \infty ∑ n = 1 ∞ ​ n 2 1 ​ = 6 π 2 ​ < ∞ converges.

By the Weierstrass M-Test, the series converges uniformly on R \mathbb{R} R .

Since each term is continuous, the Uniform Limit Theorem guarantees S ( x ) S(x) S ( x ) is continuous on R \mathbb{R} R .

Problem 2: Analyzing Derivative Limits

Let f n ( x ) = x 1 + n x 2 f_n(x) = \frac{x}{1 + nx^2} f n ​ ( x ) = 1 + n x 2 x ​ on [ − 1 , 1 ] [-1, 1] [ − 1 , 1 ] . Does f n ⇉ 0 f_n \rightrightarrows 0 f n ​ ⇉ 0 uniformly? Does f n ′ ( 0 ) → 0 f_n'(0) \to 0 f n ′ ​ ( 0 ) → 0 ?

Solution :

Maximum occurs at x = 1 / n x = 1/\sqrt{n} x = 1/ n ​ , with f n ( 1 / n ) = 1 2 n → 0 f_n(1/\sqrt{n}) = \frac{1}{2\sqrt{n}} \to 0 f n ​ ( 1/ n ​ ) = 2 n ​ 1 ​ → 0 .

Since ∥ f n − 0 ∥ ∞ = 1 2 n → 0 \|f_n - 0\|_\infty = \frac{1}{2\sqrt{n}} \to 0 ∥ f n ​ − 0 ∥ ∞ ​ = 2 n ​ 1 ​ → 0 , f n ⇉ 0 f_n \rightrightarrows 0 f n ​ ⇉ 0 uniformly on [ − 1 , 1 ] [-1, 1] [ − 1 , 1 ] .

Differentiating: f n ′ ( x ) = 1 − n x 2 ( 1 + n x 2 ) 2 f_n'(x) = \frac{1 - nx^2}{(1 + nx^2)^2} f n ′ ​ ( x ) = ( 1 + n x 2 ) 2 1 − n x 2 ​ , so f n ′ ( 0 ) = 1 f_n'(0) = 1 f n ′ ​ ( 0 ) = 1 for all n n n .

Thus lim ⁡ n → ∞ f n ′ ( 0 ) = 1 ≠ 0 = ( lim ⁡ n → ∞ f n ) ′ ( 0 ) \lim_{n \to \infty} f_n'(0) = 1 \neq 0 = (\lim_{n \to \infty} f_n)'(0) lim n → ∞ ​ f n ′ ​ ( 0 ) = 1  = 0 = ( lim n → ∞ ​ f n ​ ) ′ ( 0 ) , showing uniform convergence of f n f_n f n ​ is insufficient for derivative interchange.

GRE Exam Traps & Pitfalls

Trap 1: Interchanging Differentiation Assuming f n f_n f n ​ Converges Uniformly The most frequent GRE analysis trap. Uniform convergence of f n f_n f n ​ does not imply convergence of f n ′ f_n' f n ′ ​ . You must establish uniform convergence of the derivative sequence f n ′ f_n' f n ′ ​ .

Trap 2: Assuming Continuous Pointwise Limits Imply Uniform Convergence If continuous f n f_n f n ​ converge to a continuous limit f f f , convergence is not necessarily uniform. For f n ( x ) = n x 1 + n 2 x 2 f_n(x) = \frac{nx}{1 + n^2 x^2} f n ​ ( x ) = 1 + n 2 x 2 n x ​ , the limit is 0 0 0 everywhere but ∥ f n ∥ ∞ = 1 / 2 \|f_n\|_\infty = 1/2 ∥ f n ​ ∥ ∞ ​ = 1/2 .

Trap 3: Omitting Monotonicity in Dini's Theorem Dini's Theorem requires compact domain, continuous functions with continuous limit, and monotonic convergence. Without monotonicity, uniform convergence can easily fail.

Loading diagram... Function Sequence Convergence and Limit Interchanges