Study guide
13.1 Topological Spaces, Open/Closed Sets, and Bases
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
13.1 Topological Spaces, Open/Closed Sets, and Bases
Key Takeaways Explain This Topic AI
A topology on a set X is a family T of subsets containing empty set and X, closed under arbitrary unions and finite intersections; complements of open sets are closed.
The lower limit topology on R (Sorgenfrey line) is strictly finer than the Euclidean topology, producing clopen basis intervals [a, b) and providing standard topological counterexamples.
The closure of A is the smallest closed set containing A (equal to A union its limit points), the interior is the largest open set inside A, and the boundary is closure minus interior.
A collection B of open sets forms a basis if every open set is a union of elements of B; in metric spaces, open balls of rational radii centered at countable dense points form a basis.
Second-countability (countable basis) implies first-countability (countable local base at each point) and separability (countable dense subset); for metric spaces, these conditions are equivalent.
Last updated: September 2026
13.1 Topological Spaces, Open/Closed Sets, and Bases
Point-set topology abstracts the core notions of distance, convergence, and continuity onto general sets without a metric. On the GRE Mathematics Subject Test, questions test axiomatic definitions, finer versus coarser topologies, operators (interior, closure, boundary), and countability axioms.
Topological Spaces and Axiomatic Foundations
A topological space is a pair ( X , T ) (X, \mathcal{T}) ( X , T ) , where X X X is a set and T ⊆ P ( X ) \mathcal{T} \subseteq \mathcal{P}(X) T ⊆ P ( X ) is a collection of subsets called open sets satisfying:
∅ ∈ T \emptyset \in \mathcal{T} ∅ ∈ T and X ∈ T X \in \mathcal{T} X ∈ T .
If { U α } α ∈ I ⊆ T \{U_\alpha\}_{\alpha \in I} \subseteq \mathcal{T} { U α } α ∈ I ⊆ T , then ⋃ α ∈ I U α ∈ T \bigcup_{\alpha \in I} U_\alpha \in \mathcal{T} ⋃ α ∈ I U α ∈ T (arbitrary unions are open).
If U 1 , … , U n ∈ T U_1, \dots, U_n \in \mathcal{T} U 1 , … , U n ∈ T , then ⋂ k = 1 n U k ∈ T \bigcap_{k=1}^n U_k \in \mathcal{T} ⋂ k = 1 n U k ∈ T (finite intersections are open).
Canonical Topologies on a Set X X X
Discrete Topology : T disc = P ( X ) \mathcal{T}_{\text{disc}} = \mathcal{P}(X) T disc = P ( X ) . Every subset is open; finest topology on X X X .
Indiscrete (Trivial) Topology : T triv = { ∅ , X } \mathcal{T}_{\text{triv}} = \{\emptyset, X\} T triv = { ∅ , X } . Coarsest topology on X X X .
Standard (Euclidean) Topology on R \mathbb{R} R : Generated by all open intervals ( a , b ) (a, b) ( a , b ) .
Lower Limit Topology ( R ℓ \mathbb{R}_\ell R ℓ , Sorgenfrey Line) : Generated by all half-open intervals [ a , b ) [a, b) [ a , b ) .
Cofinite (Finite Complement) Topology : T cof = { U ⊆ X : X ∖ U is finite } ∪ { ∅ } \mathcal{T}_{\text{cof}} = \{U \subseteq X : X \setminus U \text{ is finite}\} \cup \{\emptyset\} T cof = { U ⊆ X : X ∖ U is finite } ∪ { ∅ } .
Cocountable Topology : T coc = { U ⊆ X : X ∖ U is countable } ∪ { ∅ } \mathcal{T}_{\text{coc}} = \{U \subseteq X : X \setminus U \text{ is countable}\} \cup \{\emptyset\} T coc = { U ⊆ X : X ∖ U is countable } ∪ { ∅ } .
Comparison of Topologies: Finer vs. Coarser
Given two topologies T 1 \mathcal{T}_1 T 1 and T 2 \mathcal{T}_2 T 2 on the same set X X X :
If T 1 ⊆ T 2 \mathcal{T}_1 \subseteq \mathcal{T}_2 T 1 ⊆ T 2 , then T 2 \mathcal{T}_2 T 2 is finer (stronger) than T 1 \mathcal{T}_1 T 1 , and T 1 \mathcal{T}_1 T 1 is coarser (weaker) than T 2 \mathcal{T}_2 T 2 .
On R \mathbb{R} R , two valid strict chains are: T triv ⊊ T cof ⊊ T coc ⊊ T disc , \mathcal{T}_{\text{triv}} \subsetneq \mathcal{T}_{\text{cof}} \subsetneq \mathcal{T}_{\text{coc}} \subsetneq \mathcal{T}_{\text{disc}}, T triv ⊊ T cof ⊊ T coc ⊊ T disc , T triv ⊊ T std ⊊ T ℓ ⊊ T disc . \mathcal{T}_{\text{triv}} \subsetneq \mathcal{T}_{\text{std}} \subsetneq \mathcal{T}_\ell \subsetneq \mathcal{T}_{\text{disc}}. T triv ⊊ T std ⊊ T ℓ ⊊ T disc .
The cocountable and standard Euclidean topologies are incomparable . The set R ∖ Q \mathbb{R}\setminus\mathbb{Q} R ∖ Q is cocountable-open but not Euclidean-open, while ( 0 , 1 ) (0,1) ( 0 , 1 ) is Euclidean-open but not cocountable-open because its complement is uncountable.
Why R ℓ \mathbb{R}_\ell R ℓ is Strictly Finer than T std \mathcal{T}_{\text{std}} T std : Any open interval ( a , b ) = ⋃ n = 1 ∞ [ a + 1 / n , b ) (a, b) = \bigcup_{n=1}^\infty [a + 1/n, b) ( a , b ) = ⋃ n = 1 ∞ [ a + 1/ n , b ) is a union of lower-limit basis elements, so ( a , b ) ∈ T ℓ (a, b) \in \mathcal{T}_\ell ( a , b ) ∈ T ℓ . However, [ a , b ) ∉ T std [a, b) \notin \mathcal{T}_{\text{std}} [ a , b ) ∈ / T std because no Euclidean open ball centered at a a a lies within [ a , b ) [a, b) [ a , b ) .
Closed Sets, Clopen Sets, and Topological Operations
A set F ⊆ X F \subseteq X F ⊆ X is closed if its complement X ∖ F X \setminus F X ∖ F is open. A set is clopen if it is both open and closed. In R ℓ \mathbb{R}_\ell R ℓ , every basis interval [ a , b ) [a, b) [ a , b ) is clopen because its complement ( − ∞ , a ) ∪ [ b , ∞ ) = ⋃ n = 1 ∞ [ a − n , a ) ∪ ⋃ k = 1 ∞ [ b , b + k ) (-\infty, a) \cup [b, \infty) = \bigcup_{n=1}^\infty [a-n, a) \cup \bigcup_{k=1}^\infty [b, b+k) ( − ∞ , a ) ∪ [ b , ∞ ) = ⋃ n = 1 ∞ [ a − n , a ) ∪ ⋃ k = 1 ∞ [ b , b + k ) is open.
Core Topological Operations on A ⊆ X A \subseteq X A ⊆ X
Interior : int ( A ) = A ∘ = ⋃ { U ∈ T : U ⊆ A } \operatorname{int}(A) = A^\circ = \bigcup \{U \in \mathcal{T} : U \subseteq A\} int ( A ) = A ∘ = ⋃ { U ∈ T : U ⊆ A } is the largest open set contained in A A A . Pointwise, x ∈ int ( A ) ⟺ ∃ U ∈ T x \in \operatorname{int}(A) \iff \exists U \in \mathcal{T} x ∈ int ( A ) ⟺ ∃ U ∈ T with x ∈ U ⊆ A x \in U \subseteq A x ∈ U ⊆ A .
Closure : cl ( A ) = A ‾ = ⋂ { F closed : A ⊆ F } \operatorname{cl}(A) = \overline{A} = \bigcap \{F \text{ closed} : A \subseteq F\} cl ( A ) = A = ⋂ { F closed : A ⊆ F } is the smallest closed set containing A A A . Pointwise, x ∈ A ‾ ⟺ ∀ U ∈ T x \in \overline{A} \iff \forall U \in \mathcal{T} x ∈ A ⟺ ∀ U ∈ T containing x x x , U ∩ A ≠ ∅ U \cap A \neq \emptyset U ∩ A = ∅ .
Boundary : ∂ A = A ‾ ∖ int ( A ) = A ‾ ∩ X ∖ A ‾ \partial A = \overline{A} \setminus \operatorname{int}(A) = \overline{A} \cap \overline{X \setminus A} ∂ A = A ∖ int ( A ) = A ∩ X ∖ A , always closed.
Limit Points & Derived Set : x ∈ X x \in X x ∈ X is a limit point of A A A if every neighborhood U U U of x x x satisfies ( U ∖ { x } ) ∩ A ≠ ∅ (U \setminus \{x\}) \cap A \neq \emptyset ( U ∖ { x }) ∩ A = ∅ . The set of all limit points is A ′ A' A ′ , and A ‾ = A ∪ A ′ \overline{A} = A \cup A' A = A ∪ A ′ .
Isolated Points & Dense Sets : A point x ∈ A x \in A x ∈ A is isolated if { x } = U ∩ A \{x\} = U \cap A { x } = U ∩ A for some open U U U . A set D ⊆ X D \subseteq X D ⊆ X is dense if D ‾ = X \overline{D} = X D = X .
- Bases, Subbases, and Countability Axioms
- Bases and Subbases
Basis B \mathcal{B} B : A collection of open sets such that ⋃ B ∈ B B = X \bigcup_{B \in \mathcal{B}} B = X ⋃ B ∈ B B = X , and if x ∈ B 1 ∩ B 2 x \in B_1 \cap B_2 x ∈ B 1 ∩ B 2 , there exists B 3 ∈ B B_3 \in \mathcal{B} B 3 ∈ B with x ∈ B 3 ⊆ B 1 ∩ B 2 x \in B_3 \subseteq B_1 \cap B_2 x ∈ B 3 ⊆ B 1 ∩ B 2 . The topology consists of all unions of elements of B \mathcal{B} B .
Subbasis S \mathcal{S} S : A collection whose union is X X X ; its finite intersections form a basis for T \mathcal{T} T .
Countability Axioms
First-Countable : Every point x ∈ X x \in X x ∈ X has a countable local base B x \mathcal{B}_x B x . All metric spaces are first-countable (take B 1 / n ( x ) B_{1/n}(x) B 1/ n ( x ) ).
Second-Countable : X X X has a countable basis for its entire topology.
Separable : X X X contains a countable dense subset (e.g., Q ⊂ R \mathbb{Q} \subset \mathbb{R} Q ⊂ R ).
The Metric Equivalence : For metric spaces, Second-Countable ⟺ \iff ⟺ Separable ⟺ \iff ⟺ Lindelöf (every open cover has a countable subcover).
The Sorgenfrey Counterexample : R ℓ \mathbb{R}_\ell R ℓ is first-countable and separable ( Q \mathbb{Q} Q is dense), but not second-countable.
Comparison Table of Topologies on R \mathbb{R} R
Topology Basis Elements Clopen Sets First-Countable? Second-Countable? Separable?
Indiscrete { R } \{ \mathbb{R} \} { R } ∅ , R \emptyset, \mathbb{R} ∅ , R Yes Yes Yes
Cofinite R ∖ { p 1 , … , p k } \mathbb{R} \setminus \{p_1, \dots, p_k\} R ∖ { p 1 , … , p k } ∅ , R \emptyset, \mathbb{R} ∅ , R No No Yes
Standard ( R \mathbb{R} R ) Open intervals ( a , b ) (a, b) ( a , b ) ∅ , R \emptyset, \mathbb{R} ∅ , R Yes Yes Yes ( Q \mathbb{Q} Q )
Lower Limit ( R ℓ \mathbb{R}_\ell R ℓ ) Half-open intervals [ a , b ) [a, b) [ a , b ) All [ a , b ) [a, b) [ a , b ) Yes No Yes ( Q \mathbb{Q} Q )
- Discrete Singletons { x } \{x\} { x } All P ( R ) \mathcal{P}(\mathbb{R}) P ( R ) Yes No No
- Step-by-Step Worked Problems
- Problem 1: Operators in the Cofinite Topology
Let X = R X = \mathbb{R} X = R have the cofinite topology T cof \mathcal{T}_{\text{cof}} T cof . Find int ( A ) \operatorname{int}(A) int ( A ) and A ‾ \overline{A} A for A = ( 0 , 1 ) ∪ { 2 } A = (0, 1) \cup \{2\} A = ( 0 , 1 ) ∪ { 2 } .
Solution :
Non-empty open sets have finite complements; closed sets are finite subsets of R \mathbb{R} R plus R \mathbb{R} R .
If U ⊆ A U \subseteq A U ⊆ A is open and non-empty, R ∖ U \mathbb{R} \setminus U R ∖ U is finite, so U U U must omit only finitely many points. Because A A A omits an uncountable set, no non-empty open set fits inside A A A . Thus, int ( A ) = ∅ \operatorname{int}(A) = \emptyset int ( A ) = ∅ .
Closed sets containing A A A must contain an infinite set, so the only closed set containing A A A is R \mathbb{R} R . Therefore, A ‾ = R \overline{A} = \mathbb{R} A = R .
Problem 2: Rational Endpoints and Topology Comparison
Determine whether B = { [ a , b ) : a < b , a , b ∈ Q } \mathcal{B} = \{[a, b) : a < b, \, a, b \in \mathbb{Q}\} B = {[ a , b ) : a < b , a , b ∈ Q } is a basis for a topology on R \mathbb{R} R , and compare it to R ℓ \mathbb{R}_\ell R ℓ .
Solution :
For any x x x , choose rationals q 1 ≤ x < q 2 q_1 \le x < q_2 q 1 ≤ x < q 2 , so x ∈ [ q 1 , q 2 ) x \in [q_1, q_2) x ∈ [ q 1 , q 2 ) . The intersection of [ a 1 , b 1 ) [a_1, b_1) [ a 1 , b 1 ) and [ a 2 , b 2 ) [a_2, b_2) [ a 2 , b 2 ) is [ max ( a 1 , a 2 ) , min ( b 1 , b 2 ) ) [\max(a_1, a_2), \min(b_1, b_2)) [ max ( a 1 , a 2 ) , min ( b 1 , b 2 )) , which is in B \mathcal{B} B or empty. Thus B \mathcal{B} B is a basis.
For irrational α \alpha α , [ α , β ) [\alpha, \beta) [ α , β ) is open in R ℓ \mathbb{R}_\ell R ℓ but cannot be a union of intervals with rational left endpoints. Hence the topology generated by B \mathcal{B} B is strictly coarser than R ℓ \mathbb{R}_\ell R ℓ .
GRE Exam Traps & Pitfalls
Trap 1: The Binary Door Fallacy Sets need not be either open or closed: in standard R \mathbb{R} R , ( 0 , 1 ] (0, 1] ( 0 , 1 ] is neither; in discrete spaces, every set is clopen.
Trap 2: Cofinite Accumulation Points In the cofinite topology on an infinite set X X X , every infinite set A A A is dense ( A ‾ = X \overline{A} = X A = X ) and has derived set A ′ = X A' = X A ′ = X .
Trap 3: Separable vs. Second-Countable Second-countable always implies separable, but the converse is false in general topology: the Sorgenfrey line R ℓ \mathbb{R}_\ell R ℓ is separable but not second-countable.