Study guide

3.1 Sequences, Monotonicity, and Limits

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

3.1 Sequences, Monotonicity, and Limits

Key Takeaways Explain This Topic AI

A real sequence ( a n ) (a_n) ( a n ​ ) converges to L L L if for every ϵ > 0 \epsilon > 0 ϵ > 0 , there exists an index N ∈ N N \in \mathbb{N} N ∈ N such that ∣ a n − L ∣ < ϵ |a_n - L| < \epsilon ∣ a n ​ − L ∣ < ϵ for all n > N n > N n > N .

The Monotone Convergence Theorem guarantees that every bounded, monotonic sequence in R \mathbb{R} R converges to its supremum (if non-decreasing) or infimum (if non-increasing).

The Bolzano-Weierstrass Theorem establishes that every bounded sequence in R \mathbb{R} R contains a convergent subsequence, and a sequence converges if and only if lim inf ⁡ a n = lim sup ⁡ a n \liminf a_n = \limsup a_n lim inf a n ​ = lim sup a n ​ .

In the complete metric space R \mathbb{R} R , a sequence converges if and only if it is Cauchy, enabling convergence proofs without prior knowledge of the limiting value.

Last updated: September 2026

3.1 Sequences, Monotonicity, and Limits

Sequences form the bedrock of real analysis on the GRE Mathematics Subject Test. The examination tests your ability to evaluate limits, analyze recursive relations, and apply foundational theorems including the Monotone Convergence Theorem, Bolzano-Weierstrass, and Cauchy completeness.

Formal Convergence and Boundedness

A real sequence ( a n ) n = 1 ∞ (a_n)_{n=1}^\infty ( a n ​ ) n = 1 ∞ ​ converges to L ∈ R L \in \mathbb{R} L ∈ R , denoted lim ⁡ n → ∞ a n = L \lim_{n \to \infty} a_n = L lim n → ∞ ​ a n ​ = L , if for every ϵ > 0 \epsilon > 0 ϵ > 0 , there exists N ∈ N N \in \mathbb{N} N ∈ N such that: ∣ a n − L ∣ < ϵ for all n > N |a_n - L| < \epsilon \quad \text{for all } n > N ∣ a n ​ − L ∣ < ϵ for all n > N

Otherwise, the sequence diverges (by unbounded growth or oscillation, e.g., a n = ( − 1 ) n a_n = (-1)^n a n ​ = ( − 1 ) n ).

A sequence ( a n ) (a_n) ( a n ​ ) is bounded above if a n ≤ M a_n \le M a n ​ ≤ M , bounded below if a n ≥ m a_n \ge m a n ​ ≥ m , and bounded if ∣ a n ∣ ≤ K |a_n| \le K ∣ a n ​ ∣ ≤ K for all n n n .

Fundamental Result: Every convergent sequence is bounded.

Converse Warning: Boundedness does not imply convergence ( a n = sin ⁡ ( n π / 2 ) a_n = \sin(n\pi/2) a n ​ = sin ( nπ /2 ) is bounded in [ − 1 , 1 ] [-1, 1] [ − 1 , 1 ] but diverges).

The Monotone Convergence Theorem (MCT)

A sequence is monotonically increasing if a n + 1 ≥ a n a_{n+1} \ge a_n a n + 1 ​ ≥ a n ​ , and monotonically decreasing if a n + 1 ≤ a n a_{n+1} \le a_n a n + 1 ​ ≤ a n ​ .

Theorem (Monotone Convergence Theorem)

Every bounded, monotonic sequence of real numbers converges:

If ( a n ) (a_n) ( a n ​ ) is non-decreasing and bounded above, lim ⁡ n → ∞ a n = sup ⁡ { a n : n ∈ N } \lim_{n \to \infty} a_n = \sup \{a_n : n \in \mathbb{N}\} lim n → ∞ ​ a n ​ = sup { a n ​ : n ∈ N } .

If ( a n ) (a_n) ( a n ​ ) is non-increasing and bounded below, lim ⁡ n → ∞ a n = inf ⁡ { a n : n ∈ N } \lim_{n \to \infty} a_n = \inf \{a_n : n \in \mathbb{N}\} lim n → ∞ ​ a n ​ = in f { a n ​ : n ∈ N } .

MCT guarantees existence without computing the value in advance, making it ideal for recursive sequences.

Subsequences, Bolzano-Weierstrass, and Limsup / Liminf

A subsequence ( a n k ) (a_{n_k}) ( a n k ​ ​ ) is defined by indices n 1 < n 2 < n 3 < ⋯ n_1 < n_2 < n_3 < \cdots n 1 ​ < n 2 ​ < n 3 ​ < ⋯ .

If lim ⁡ a n = L \lim a_n = L lim a n ​ = L , every subsequence converges to L L L . Distinct subsequential limits imply divergence.

Bolzano-Weierstrass Theorem: Every bounded sequence in R \mathbb{R} R contains a convergent subsequence.

Limit Superior and Limit Inferior

Define tail bounds s n = sup ⁡ k ≥ n a k s_n = \sup_{k \ge n} a_k s n ​ = sup k ≥ n ​ a k ​ and i n = inf ⁡ k ≥ n a k i_n = \inf_{k \ge n} a_k i n ​ = in f k ≥ n ​ a k ​ . Then lim sup ⁡ a n = lim ⁡ s n = inf ⁡ n ≥ 1 s n \limsup a_n = \lim s_n = \inf_{n \ge 1} s_n lim sup a n ​ = lim s n ​ = in f n ≥ 1 ​ s n ​ , and lim inf ⁡ a n = lim ⁡ i n = sup ⁡ n ≥ 1 i n \liminf a_n = \lim i_n = \sup_{n \ge 1} i_n lim inf a n ​ = lim i n ​ = sup n ≥ 1 ​ i n ​ .

In [ − ∞ , ∞ ] [-\infty, \infty] [ − ∞ , ∞ ] , lim sup ⁡ a n \limsup a_n lim sup a n ​ and lim inf ⁡ a n \liminf a_n lim inf a n ​ represent the greatest and least subsequential limits. A sequence converges in R \mathbb{R} R if and only if lim inf ⁡ a n = lim sup ⁡ a n = L ∈ R \liminf a_n = \limsup a_n = L \in \mathbb{R} lim inf a n ​ = lim sup a n ​ = L ∈ R .

Cauchy Sequences and Completeness of R \mathbb{R} R

A sequence ( a n ) (a_n) ( a n ​ ) is Cauchy if for every ϵ > 0 \epsilon > 0 ϵ > 0 , there exists N ∈ N N \in \mathbb{N} N ∈ N such that: ∣ a n − a m ∣ < ϵ for all n , m > N |a_n - a_m| < \epsilon \quad \text{for all } n, m > N ∣ a n ​ − a m ​ ∣ < ϵ for all n , m > N

A metric space is complete if every Cauchy sequence converges to an element of the space.

In R \mathbb{R} R with Euclidean metric, a sequence converges if and only if it is Cauchy. This equivalence fails in incomplete spaces like Q \mathbb{Q} Q .

Recursive Sequences and Fixed-Point Limits

For recursive sequences x n + 1 = f ( x n ) x_{n+1} = f(x_n) x n + 1 ​ = f ( x n ​ ) :

Prove Convergence: Show ( x n ) (x_n) ( x n ​ ) is monotonic and bounded by induction. MCT guarantees the limit L = lim ⁡ x n L = \lim x_n L = lim x n ​ exists.

Solve Fixed Point: For continuous f f f , take limits across the recurrence: L = f ( L ) L = f(L) L = f ( L ) . Solve for L L L and reject extraneous roots.

If ∣ f ′ ( x ) ∣ ≤ k < 1 |f'(x)| \le k < 1 ∣ f ′ ( x ) ∣ ≤ k < 1 on an invariant interval, the Banach Fixed-Point Theorem guarantees unique convergence to L L L .

Squeeze Theorem and Asymptotics

If a n ≤ b n ≤ c n a_n \le b_n \le c_n a n ​ ≤ b n ​ ≤ c n ​ for all n ≥ N n \ge N n ≥ N and lim ⁡ a n = lim ⁡ c n = L \lim a_n = \lim c_n = L lim a n ​ = lim c n ​ = L , then lim ⁡ b n = L \lim b_n = L lim b n ​ = L .

If a n → 0 a_n \to 0 a n ​ → 0 and ( b n ) (b_n) ( b n ​ ) is bounded, lim ⁡ ( a n b n ) = 0 \lim (a_n b_n) = 0 lim ( a n ​ b n ​ ) = 0 .

For a , b > 0 a, b > 0 a , b > 0 , lim ⁡ n → ∞ ( a n + b n ) 1 / n = max ⁡ ( a , b ) \lim_{n \to \infty} (a^n + b^n)^{1/n} = \max(a, b) lim n → ∞ ​ ( a n + b n ) 1/ n = max ( a , b ) .

Summary Comparison Table: Sequence Theorems

Theorem Hypotheses Conclusion GRE Application

Monotone Convergence Bounded + Monotonic Converges to sup ⁡ \sup sup or inf ⁡ \inf in f Recursive sequences x n + 1 = f ( x n ) x_{n+1} = f(x_n) x n + 1 ​ = f ( x n ​ )

Bolzano-Weierstrass Bounded in R \mathbb{R} R Convergent subsequence exists Conceptual compactness questions

Cauchy Completeness ∣ a n − a m ∣ < ϵ \vert a_n - a_m\vert< \epsilon ∣ a n ​ − a m ​ ∣ < ϵ for large n , m n, m n , m Sequence converges Theoretical convergence tests

Limsup / Liminf Arbitrary sequence Converges ⟺ lim inf ⁡ = lim sup ⁡ \iff \liminf = \limsup ⟺ lim inf = lim sup Interleaved oscillating sequences

Squeeze Theorem a n ≤ b n ≤ c n a_n \le b_n \le c_n a n ​ ≤ b n ​ ≤ c n ​ , shared limit Trapped sequence converges Dominant roots, oscillatory products

Worked Problem: Recursive Sequence with Fixed Point

Problem: Let x 1 = 1 x_1 = 1 x 1 ​ = 1 and x n + 1 = 3 x n + 4 x_{n+1} = \sqrt{3x_n + 4} x n + 1 ​ = 3 x n ​ + 4 ​ for n ≥ 1 n \ge 1 n ≥ 1 . Prove convergence and find lim ⁡ n → ∞ x n \lim_{n \to \infty} x_n lim n → ∞ ​ x n ​ .

Solution:

Boundedness: We claim 1 ≤ x n < 4 1 \le x_n < 4 1 ≤ x n ​ < 4 . Base case: x 1 = 1 < 4 x_1 = 1 < 4 x 1 ​ = 1 < 4 . If x k < 4 x_k < 4 x k ​ < 4 , then x k + 1 = 3 x k + 4 < 3 ( 4 ) + 4 = 4 x_{k+1} = \sqrt{3x_k + 4} < \sqrt{3(4) + 4} = 4 x k + 1 ​ = 3 x k ​ + 4 ​ < 3 ( 4 ) + 4 ​ = 4 . Thus ( x n ) (x_n) ( x n ​ ) is bounded above by 4.

Monotonicity: Base case: x 2 = 7 ≈ 2.65 > 1 = x 1 x_2 = \sqrt{7} \approx 2.65 > 1 = x_1 x 2 ​ = 7 ​ ≈ 2.65 > 1 = x 1 ​ . Inductive step: x k ≥ x k − 1 ⟹ 3 x k + 4 ≥ 3 x k − 1 + 4 ⟹ x k + 1 ≥ x k x_k \ge x_{k-1} \implies 3x_k + 4 \ge 3x_{k-1} + 4 \implies x_{k+1} \ge x_k x k ​ ≥ x k − 1 ​ ⟹ 3 x k ​ + 4 ≥ 3 x k − 1 ​ + 4 ⟹ x k + 1 ​ ≥ x k ​ . Thus ( x n ) (x_n) ( x n ​ ) is non-decreasing.

Limit: By MCT, L = lim ⁡ x n L = \lim x_n L = lim x n ​ exists with 1 ≤ L ≤ 4 1 \le L \le 4 1 ≤ L ≤ 4 . Continuity yields L = 3 L + 4 ⟹ L 2 − 3 L − 4 = 0 ⟹ ( L − 4 ) ( L + 1 ) = 0 L = \sqrt{3L + 4} \implies L^2 - 3L - 4 = 0 \implies (L - 4)(L + 1) = 0 L = 3 L + 4 ​ ⟹ L 2 − 3 L − 4 = 0 ⟹ ( L − 4 ) ( L + 1 ) = 0 . Since L ≥ 1 L \ge 1 L ≥ 1 , L = 4 L = 4 L = 4 .

GRE Exam Traps & Fast Test-Taking Strategies

Trap 1: Solving L = f ( L ) L = f(L) L = f ( L ) without proving convergence. For x 1 = 3 x_1 = 3 x 1 ​ = 3 and x n + 1 = 2 x n − 1 x_{n+1} = 2x_n - 1 x n + 1 ​ = 2 x n ​ − 1 , setting L = 2 L − 1 L = 2L - 1 L = 2 L − 1 gives L = 1 L = 1 L = 1 , yet x n = 2 n + 1 → ∞ x_n = 2^n + 1 \to \infty x n ​ = 2 n + 1 → ∞ . Always verify boundedness and monotonicity before computing limits.

Trap 2: Ignoring sign restrictions on roots. Quadratic fixed-point equations often give positive and negative roots; discard roots outside sequence bounds.

Trap 3: Confusing a n + 1 − a n → 0 a_{n+1} - a_n \to 0 a n + 1 ​ − a n ​ → 0 with convergence. Harmonic numbers H n = ∑ k = 1 n 1 / k H_n = \sum_{k=1}^n 1/k H n ​ = ∑ k = 1 n ​ 1/ k satisfy H n + 1 − H n = 1 / ( n + 1 ) → 0 H_{n+1} - H_n = 1/(n+1) \to 0 H n + 1 ​ − H n ​ = 1/ ( n + 1 ) → 0 , yet H n → ∞ H_n \to \infty H n ​ → ∞ .

Loading diagram... Sequence Convergence Decision Flowchart