Study guide
11.1 The Real Field and Metric Space Topology
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.1 The Real Field and Metric Space Topology
Key Takeaways Explain This Topic AI
The real numbers constitute a complete ordered field satisfying the Least Upper Bound Axiom, establishing the existence of suprema and infima for bounded nonempty subsets.
The Archimedean property and the density of both rational and irrational numbers guarantee that every open interval contains infinitely many numbers of both types.
In a metric space (M, d), open sets are collections of interior points, closed sets contain all their accumulation points, and boundary points lie in the intersection of the closures of the set and its complement.
A subset E is dense in M if its closure equals M; metric spaces admitting a countable dense subset are separable, with Euclidean space R^n being the archetypal example.
The ternary Cantor set is an uncountable, compact, perfect, and totally disconnected subset of [0, 1] with empty interior and Lebesgue measure zero.
Last updated: September 2026
11.1 The Real Field and Metric Space Topology
Introductory real analysis formalizes the calculus of the real line. On the GRE Mathematics Subject Test, questions emphasize metric space topology, completeness axioms, topological set classifications, and the canonical Cantor set.
The Real Numbers as a Complete Ordered Field
The real numbers R \mathbb{R} R form a complete ordered field . While Q \mathbb{Q} Q is also an ordered field, R \mathbb{R} R is uniquely distinguished by the Least Upper Bound (Completeness) Axiom :
Supremum ( sup S \sup S sup S ) : For a nonempty set S ⊂ R S \subset \mathbb{R} S ⊂ R bounded above, s = sup S s = \sup S s = sup S satisfies x ≤ s x \le s x ≤ s for all x ∈ S x \in S x ∈ S , and for every ε > 0 \varepsilon > 0 ε > 0 , there exists x ∈ S x \in S x ∈ S with x > s − ε x > s - \varepsilon x > s − ε .
Infimum ( inf S \inf S in f S ) : Dually, m = inf S m = \inf S m = in f S satisfies x ≥ m x \ge m x ≥ m for all x ∈ S x \in S x ∈ S , and for every ε > 0 \varepsilon > 0 ε > 0 , there exists x ∈ S x \in S x ∈ S with x < m + ε x < m + \varepsilon x < m + ε .
Completeness : Every nonempty subset bounded above in R \mathbb{R} R has a supremum in R \mathbb{R} R . In contrast, { q ∈ Q : q 2 < 2 } \{q \in \mathbb{Q} : q^2 < 2\} { q ∈ Q : q 2 < 2 } has no supremum in Q \mathbb{Q} Q , proving Q \mathbb{Q} Q is incomplete.
Archimedean Property and Density
Archimedean Property : For any x ∈ R x \in \mathbb{R} x ∈ R , there exists n ∈ N n \in \mathbb{N} n ∈ N with n > x n > x n > x . Equivalently, for any ε > 0 \varepsilon > 0 ε > 0 , there exists n ∈ N n \in \mathbb{N} n ∈ N with 1 / n < ε 1/n < \varepsilon 1/ n < ε .
Density of Q \mathbb{Q} Q and R ∖ Q \mathbb{R} \setminus \mathbb{Q} R ∖ Q : Between any two distinct reals a < b a < b a < b , there exists a rational q q q and an irrational r r r such that a < q < r < b a < q < r < b a < q < r < b .
Metric Spaces and Topological Classifications
A metric space ( M , d ) (M, d) ( M , d ) is a set M M M with distance d : M × M → [ 0 , ∞ ) d: M \times M \to [0, \infty) d : M × M → [ 0 , ∞ ) satisfying non-negativity ( d ( x , y ) ≥ 0 d(x, y) \ge 0 d ( x , y ) ≥ 0 , with equality iff x = y x = y x = y ), symmetry ( d ( x , y ) = d ( y , x ) d(x, y) = d(y, x) d ( x , y ) = d ( y , x ) ), and the triangle inequality ( d ( x , z ) ≤ d ( x , y ) + d ( y , z ) d(x, z) \le d(x, y) + d(y, z) d ( x , z ) ≤ d ( x , y ) + d ( y , z ) ). Standard metrics on R n \mathbb{R}^n R n include Euclidean d 2 d_2 d 2 , taxicab d 1 d_1 d 1 , and supremum d ∞ d_\infty d ∞ . In the discrete metric ( d ( x , y ) = 1 d(x, y) = 1 d ( x , y ) = 1 for x ≠ y x \neq y x = y ), all subsets are clopen.
Neighborhoods and Set Topology
For open ball B ( x , r ) = { y ∈ M : d ( x , y ) < r } B(x, r) = \{y \in M : d(x, y) < r\} B ( x , r ) = { y ∈ M : d ( x , y ) < r } :
Open Set : Every point has an open ball contained in U U U . Arbitrary unions and finite intersections of open sets are open.
Closed Set : Complement M ∖ F M \setminus F M ∖ F is open. Contains all its limit points.
Interior ( E ∘ E^\circ E ∘ ) : The union of all open subsets of E E E ; largest open set in E E E .
Limit Point ( E ′ E' E ′ ) : x ∈ M x \in M x ∈ M such that every punctured ball ( B ( x , r ) ∖ { x } ) ∩ E ≠ ∅ (B(x, r) \setminus \{x\}) \cap E \neq \emptyset ( B ( x , r ) ∖ { x }) ∩ E = ∅ .
Closure ( E ˉ \bar{E} E ˉ ) : E ˉ = E ∪ E ′ \bar{E} = E \cup E' E ˉ = E ∪ E ′ ; smallest closed set containing E E E .
Boundary ( ∂ E \partial E ∂ E ) : ∂ E = E ˉ ∖ E ∘ = E ˉ ∩ M ∖ E ‾ \partial E = \bar{E} \setminus E^\circ = \bar{E} \cap \overline{M \setminus E} ∂ E = E ˉ ∖ E ∘ = E ˉ ∩ M ∖ E .
Dense Set : E ˉ = M \bar{E} = M E ˉ = M . A space with a countable dense subset is separable (e.g., Q ⊂ R \mathbb{Q} \subset \mathbb{R} Q ⊂ R ).
The Cantor Ternary Set
Constructed by iteratively removing open middle thirds from C 0 = [ 0 , 1 ] C_0 = [0, 1] C 0 = [ 0 , 1 ] , the Cantor set C = ⋂ k = 1 ∞ C k \mathcal{C} = \bigcap_{k=1}^\infty C_k C = ⋂ k = 1 ∞ C k has five core GRE properties:
Compactness : Closed and bounded in R \mathbb{R} R , hence compact.
Lebesgue Measure Zero : Total length removed is ∑ k = 1 ∞ 2 k − 1 3 k = 1 \sum_{k=1}^\infty \frac{2^{k-1}}{3^k} = 1 ∑ k = 1 ∞ 3 k 2 k − 1 = 1 , leaving λ ( C ) = 0 \lambda(\mathcal{C}) = 0 λ ( C ) = 0 .
Uncountable : Base-3 expansions with digits { 0 , 2 } \{0, 2\} { 0 , 2 } biject with { 0 , 1 } N \{0, 1\}^\mathbb{N} { 0 , 1 } N , so ∣ C ∣ = 2 ℵ 0 = c |\mathcal{C}| = 2^{\aleph_0} = \mathfrak{c} ∣ C ∣ = 2 ℵ 0 = c .
Empty Interior : int ( C ) = ∅ \operatorname{int}(\mathcal{C}) = \emptyset int ( C ) = ∅ ; contains no open intervals.
Perfect : Closed with no isolated points ( C ′ = C \mathcal{C}' = \mathcal{C} C ′ = C ).
Comparison Table: Subsets of R \mathbb{R} R
Subset E ⊂ R E \subset \mathbb{R} E ⊂ R Open? Closed? Interior E ∘ E^\circ E ∘ Closure E ˉ \bar{E} E ˉ Boundary ∂ E \partial E ∂ E Limit Points E ′ E' E ′
( 0 , 1 ) (0, 1) ( 0 , 1 ) Yes No ( 0 , 1 ) (0, 1) ( 0 , 1 ) [ 0 , 1 ] [0, 1] [ 0 , 1 ] { 0 , 1 } \{0, 1\} { 0 , 1 } [ 0 , 1 ] [0, 1] [ 0 , 1 ]
[ 0 , 1 ) [0, 1) [ 0 , 1 ) No No ( 0 , 1 ) (0, 1) ( 0 , 1 ) [ 0 , 1 ] [0, 1] [ 0 , 1 ] { 0 , 1 } \{0, 1\} { 0 , 1 } [ 0 , 1 ] [0, 1] [ 0 , 1 ]
Q \mathbb{Q} Q No No ∅ \emptyset ∅ R \mathbb{R} R R \mathbb{R} R R \mathbb{R} R
{ 1 / n : n ∈ Z + } \{1/n : n \in \mathbb{Z}^+\} { 1/ n : n ∈ Z + } No No ∅ \emptyset ∅ { 1 / n } ∪ { 0 } \{1/n\} \cup \{0\} { 1/ n } ∪ { 0 } { 1 / n } ∪ { 0 } \{1/n\} \cup \{0\} { 1/ n } ∪ { 0 } { 0 } \{0\} { 0 }
- Cantor set C \mathcal{C} C No Yes ∅ \emptyset ∅ C \mathcal{C} C C \mathcal{C} C C \mathcal{C} C
- Step-by-Step Worked Problems
- Problem 1: Accumulation Points and Boundary
Find sup S \sup S sup S , S ′ S' S ′ , and ∂ S \partial S ∂ S for S = { ( − 1 ) n + 1 / n : n ∈ Z + } ∪ ( 2 , 4 ) S = \{(-1)^n + 1/n : n \in \mathbb{Z}^+\} \cup (2, 4) S = {( − 1 ) n + 1/ n : n ∈ Z + } ∪ ( 2 , 4 ) .
Solution :
Sequence terms: Even terms 1 + 1 / n ∈ ( 1 , 3 / 2 ] 1 + 1/n \in (1, 3/2] 1 + 1/ n ∈ ( 1 , 3/2 ] ; odd terms − 1 + 1 / n ∈ ( − 1 , 0 ] -1 + 1/n \in (-1, 0] − 1 + 1/ n ∈ ( − 1 , 0 ] .
Interval ( 2 , 4 ) (2, 4) ( 2 , 4 ) yields sup S = 4 \sup S = 4 sup S = 4 .
Limit points S ′ S' S ′ : Even terms converge to 1 1 1 ; odd terms to − 1 -1 − 1 . The interval ( 2 , 4 ) (2, 4) ( 2 , 4 ) gives [ 2 , 4 ] [2, 4] [ 2 , 4 ] . Thus S ′ = { − 1 , 1 } ∪ [ 2 , 4 ] S' = \{-1, 1\} \cup [2, 4] S ′ = { − 1 , 1 } ∪ [ 2 , 4 ] .
Boundary ∂ S \partial S ∂ S : All sequence points are isolated, so each is in ∂ S \partial S ∂ S . Limit points { − 1 , 1 } ⊂ ∂ S \{-1, 1\} \subset \partial S { − 1 , 1 } ⊂ ∂ S . The interval contributes { 2 , 4 } \{2, 4\} { 2 , 4 } . Thus ∂ S = S s e q ∪ { − 1 , 1 , 2 , 4 } \partial S = S_{seq} \cup \{-1, 1, 2, 4\} ∂ S = S se q ∪ { − 1 , 1 , 2 , 4 } .
Problem 2: Topological Distributivity Failure
Show that A ∩ B ‾ ≠ A ˉ ∩ B ˉ \overline{A \cap B} \neq \bar{A} \cap \bar{B} A ∩ B = A ˉ ∩ B ˉ in general.
Solution :
Let A = ( 0 , 1 ) A = (0, 1) A = ( 0 , 1 ) and B = ( 1 , 2 ) B = (1, 2) B = ( 1 , 2 ) in R \mathbb{R} R .
A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ , so A ∩ B ‾ = ∅ \overline{A \cap B} = \emptyset A ∩ B = ∅ .
Closures are A ˉ = [ 0 , 1 ] \bar{A} = [0, 1] A ˉ = [ 0 , 1 ] and B ˉ = [ 1 , 2 ] \bar{B} = [1, 2] B ˉ = [ 1 , 2 ] , so A ˉ ∩ B ˉ = { 1 } \bar{A} \cap \bar{B} = \{1\} A ˉ ∩ B ˉ = { 1 } .
Since ∅ ≠ { 1 } \emptyset \neq \{1\} ∅ = { 1 } , the closure of an intersection does not equal the intersection of closures.
GRE Exam Traps & Pitfalls
Trap 1: "Open" and "Closed" Are Not Antonyms Sets need not be either open or closed. Subsets like [ 0 , 1 ) [0, 1) [ 0 , 1 ) and Q \mathbb{Q} Q are neither open nor closed, while ∅ \emptyset ∅ and R \mathbb{R} R are clopen in R \mathbb{R} R .
Trap 2: Assuming Boundary Points Belong to the Set Boundary points belong to E E E iff E E E contains them. For E = ( 0 , 1 ) E = (0, 1) E = ( 0 , 1 ) , ∂ E = { 0 , 1 } \partial E = \{0, 1\} ∂ E = { 0 , 1 } , but ∂ E ∩ E = ∅ \partial E \cap E = \emptyset ∂ E ∩ E = ∅ . A set is closed iff ∂ E ⊆ E \partial E \subseteq E ∂ E ⊆ E .
Trap 3: Equating Measure Zero with Countability The Cantor set has measure zero but is uncountable ( ∣ C ∣ = 2 ℵ 0 |\mathcal{C}| = 2^{\aleph_0} ∣ C ∣ = 2 ℵ 0 ). Never deduce countability from measure zero.