Study guide
11.2 Compactness, Completeness, and Connectedness in R^n
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.2 Compactness, Completeness, and Connectedness in R^n
Key Takeaways Explain This Topic AI
Compactness is formally defined via the open cover property: every open cover admits a finite subcover; in metric spaces, this is equivalent to sequential compactness.
The Heine-Borel Theorem establishes that a subset of Euclidean space R^n is compact if and only if it is closed and bounded; this equivalence fails in general metric spaces.
The Bolzano-Weierstrass Theorem guarantees that every bounded sequence in R^n has a convergent subsequence, which serves as the sequential foundation for compactness.
A metric space is complete if every Cauchy sequence converges within the space; Cantor's Intersection Theorem guarantees that nested closed sets with diameters tending to zero intersect at a unique point.
Connected subsets of the real line R are precisely intervals; in R^n, an open set is connected if and only if it is path-connected.
Last updated: September 2026
11.2 Compactness, Completeness, and Connectedness in R^n
Compactness, completeness, and connectedness are the triad of topological concepts that govern analysis in Euclidean and metric spaces. The GRE Mathematics Subject Test evaluates both their theoretical equivalents and their standard counterexamples.
- Compactness and the Heine-Borel Theorem
- Open Coverings and Compactness
Let ( M , d ) (M, d) ( M , d ) be a metric space and K ⊆ M K \subseteq M K ⊆ M .
An open cover of K K K is a family { U α } α ∈ I \{U_\alpha\}_{\alpha \in I} { U α } α ∈ I of open sets such that K ⊆ ⋃ α ∈ I U α K \subseteq \bigcup_{\alpha \in I} U_\alpha K ⊆ ⋃ α ∈ I U α .
A finite subcover is a finite subfamily { U α 1 , … , U α k } \{U_{\alpha_1}, \dots, U_{\alpha_k}\} { U α 1 , … , U α k } with K ⊆ ⋃ j = 1 k U α j K \subseteq \bigcup_{j=1}^k U_{\alpha_j} K ⊆ ⋃ j = 1 k U α j .
A set K K K is compact if every open cover of K K K admits a finite subcover.
The Heine-Borel Theorem in R n \mathbb{R}^n R n
In finite-dimensional Euclidean space R n \mathbb{R}^n R n , the Heine-Borel Theorem provides a concrete geometric characterization: K ⊂ R n is compact ⟺ K is closed and bounded . K \subset \mathbb{R}^n \text{ is compact} \iff K \text{ is closed and bounded}. K ⊂ R n is compact ⟺ K is closed and bounded .
Failure of Heine-Borel in General Metric Spaces
In any metric space, compact sets are always closed and bounded. However, closed and bounded does NOT imply compact in general:
Discrete Metric on Infinite Sets : If X X X is infinite and d ( x , y ) = 1 d(x, y) = 1 d ( x , y ) = 1 for x ≠ y x \neq y x = y , X X X is closed and bounded (diameter 1), but the open cover of singletons { { x } } x ∈ X \{\{x\}\}_{x \in X} {{ x } } x ∈ X has no finite subcover.
Infinite-Dimensional Spaces : In ℓ 2 \ell^2 ℓ 2 , the closed unit ball B ˉ ( 0 , 1 ) \bar{B}(0, 1) B ˉ ( 0 , 1 ) is closed and bounded, but the orthonormal basis vectors e n e_n e n satisfy d ( e n , e m ) = 2 d(e_n, e_m) = \sqrt{2} d ( e n , e m ) = 2 ( n ≠ m n \neq m n = m ), admitting no convergent subsequence.
Sequential Compactness and Bolzano-Weierstrass
Sequential Compactness : A metric space is sequentially compact if every sequence has a subsequence converging to a point in the space.
Metric Equivalence : In all metric spaces, compactness is strictly equivalent to sequential compactness, and also to completeness plus total boundedness.
Bolzano-Weierstrass Theorem : Every bounded sequence in R n \mathbb{R}^n R n has a convergent subsequence. Equivalently, every infinite bounded subset of R n \mathbb{R}^n R n has an accumulation point.
Metric Completeness and Cantor's Intersection Theorem
Cauchy Sequence : A sequence ( x n ) (x_n) ( x n ) is Cauchy if for all ε > 0 \varepsilon > 0 ε > 0 , there exists N ∈ N N \in \mathbb{N} N ∈ N such that d ( x n , x m ) < ε d(x_n, x_m) < \varepsilon d ( x n , x m ) < ε for all n , m ≥ N n, m \ge N n , m ≥ N . Every convergent sequence in a metric space is Cauchy.
Complete Metric Space : A space ( M , d ) (M, d) ( M , d ) is complete if every Cauchy sequence converges to a limit in M M M . R n \mathbb{R}^n R n is complete; Q \mathbb{Q} Q and ( 0 , 1 ) (0, 1) ( 0 , 1 ) with ∣ x − y ∣ |x - y| ∣ x − y ∣ are incomplete. Every compact metric space is complete.
Cantor's Intersection Theorem : In a complete metric space, if { F n } n = 1 ∞ \{F_n\}_{n=1}^\infty { F n } n = 1 ∞ is a nested sequence of nonempty closed sets ( F n + 1 ⊆ F n F_{n+1} \subseteq F_n F n + 1 ⊆ F n ) with lim n → ∞ diam ( F n ) = 0 \lim_{n \to \infty} \operatorname{diam}(F_n) = 0 lim n → ∞ diam ( F n ) = 0 , then ⋂ n = 1 ∞ F n = { p } \bigcap_{n=1}^\infty F_n = \{p\} ⋂ n = 1 ∞ F n = { p } contains exactly one point.
Connectedness and Path-Connectedness
Connectedness : A metric space M M M is disconnected if M = U ∪ V M = U \cup V M = U ∪ V for nonempty, disjoint open sets U , V U, V U , V . Otherwise, M M M is connected. Equivalently, the only clopen subsets of M M M are ∅ \emptyset ∅ and M M M .
Subsets of R \mathbb{R} R : A subset of R \mathbb{R} R is connected if and only if it is an interval .
Path-Connectedness : A space M M M is path-connected if any two points can be joined by a continuous path γ : [ 0 , 1 ] → M \gamma: [0, 1] \to M γ : [ 0 , 1 ] → M .
Path-connectedness implies connectedness.
The converse is false : The topologist's sine curve T = { ( x , sin ( 1 / x ) ) : x ∈ ( 0 , 1 ] } ∪ { ( 0 , y ) : y ∈ [ − 1 , 1 ] } T = \{(x, \sin(1/x)) : x \in (0, 1]\} \cup \{(0, y) : y \in [-1, 1]\} T = {( x , sin ( 1/ x )) : x ∈ ( 0 , 1 ]} ∪ {( 0 , y ) : y ∈ [ − 1 , 1 ]} is connected and compact in R 2 \mathbb{R}^2 R 2 , but not path-connected .
In R n \mathbb{R}^n R n , any open connected set is path-connected.
Comparison Table: Compactness, Completeness, and Connectedness
Space / Subset Compact? Complete? Connected? Path-Connected?
[ 0 , 1 ] ⊂ R [0, 1] \subset \mathbb{R} [ 0 , 1 ] ⊂ R Yes (closed & bounded) Yes Yes (interval) Yes
( 0 , 1 ) ⊂ R (0, 1) \subset \mathbb{R} ( 0 , 1 ) ⊂ R No (not closed) No ( 1 / n 1/n 1/ n diverges) Yes (interval) Yes
- R \mathbb{R} R No (unbounded) Yes Yes (interval) Yes
- Q ⊂ R \mathbb{Q} \subset \mathbb{R} Q ⊂ R No (neither closed nor bounded) No No (totally disconnected) No
Topologist's Sine Curve T ⊂ R 2 T \subset \mathbb{R}^2 T ⊂ R 2 Yes (closed & bounded) Yes Yes (closure of connected) No
- Unit Ball in ℓ 2 \ell^2 ℓ 2 No (infinite-dimensional) Yes Yes Yes
- Step-by-Step Worked Problems
- Problem 1: Compactness in Sequence Spaces
Let S = { x ∈ ℓ ∞ : ∥ x ∥ ∞ ≤ 1 } S = \{x \in \ell^\infty : \|x\|_\infty \le 1\} S = { x ∈ ℓ ∞ : ∥ x ∥ ∞ ≤ 1 } . Is S S S compact?
Solution :
S S S is closed and bounded in the supremum norm.
Consider sequence x ( n ) = e n = ( 0 , … , 0 , 1 , 0 , … ) x^{(n)} = e_n = (0, \dots, 0, 1, 0, \dots) x ( n ) = e n = ( 0 , … , 0 , 1 , 0 , … ) .
For n ≠ m n \neq m n = m , ∥ e n − e m ∥ ∞ = max ( 1 , 1 ) = 1 \|e_n - e_m\|_\infty = \max(1, 1) = 1 ∥ e n − e m ∥ ∞ = max ( 1 , 1 ) = 1 .
No subsequence can be Cauchy, so no subsequence converges.
S S S is not sequentially compact, hence not compact.
Problem 2: Connectedness of Hyperbolic Level Sets
Determine whether S = { ( x , y ) ∈ R 2 : x 2 − y 2 = 1 } S = \{(x, y) \in \mathbb{R}^2 : x^2 - y^2 = 1\} S = {( x , y ) ∈ R 2 : x 2 − y 2 = 1 } is connected.
Solution :
The hyperbola has two branches: x ≥ 1 x \ge 1 x ≥ 1 and x ≤ − 1 x \le -1 x ≤ − 1 .
Let U = { ( x , y ) : x > 0 } U = \{(x, y) : x > 0\} U = {( x , y ) : x > 0 } and V = { ( x , y ) : x < 0 } V = \{(x, y) : x < 0\} V = {( x , y ) : x < 0 } . Both are open in R 2 \mathbb{R}^2 R 2 .
S ⊂ U ∪ V S \subset U \cup V S ⊂ U ∪ V , with S ∩ U ≠ ∅ S \cap U \neq \emptyset S ∩ U = ∅ and S ∩ V ≠ ∅ S \cap V \neq \emptyset S ∩ V = ∅ , while ( S ∩ U ) ∩ ( S ∩ V ) = ∅ (S \cap U) \cap (S \cap V) = \emptyset ( S ∩ U ) ∩ ( S ∩ V ) = ∅ .
S S S is disconnected into two disjoint clopen components.
GRE Exam Traps & Pitfalls
Trap 1: Applying Heine-Borel Beyond R n \mathbb{R}^n R n "Closed and bounded ⟺ \iff ⟺ compact" is exclusively true in finite-dimensional Euclidean space. In function spaces and ℓ p \ell^p ℓ p , closed bounded sets are non-compact.
Trap 2: Concluding Path-Connectedness from Connectedness Connected does not imply path-connected. The topologist's sine curve is connected (as the closure of a connected graph) but fails path-connectedness.
Trap 3: Omitting Shrinking Diameters in Cantor's Theorem In complete spaces, nested closed sets must satisfy lim diam ( F n ) = 0 \lim \operatorname{diam}(F_n) = 0 lim diam ( F n ) = 0 . Sets like F n = [ n , ∞ ) F_n = [n, \infty) F n = [ n , ∞ ) are closed, nested, and nonempty, but have empty intersection.