Topological Spaces
2.1 Definition
Section titled “2.1 Definition”Definition. A topological space is a pair where is a set and is a collection of subsets of called open sets, satisfying:
- and .
- The union of any sub-collection of is in (arbitrary unions of open sets are open).
- The intersection of any finite sub-collection of is in (finite intersections of open sets are open).
The collection is called a topology on .
2.2 Examples of Topologies
Section titled “2.2 Examples of Topologies”Example 2.1. Let . The collection
is a topology on .
Example 2.2 (Discrete topology). For any set , let (all subsets of ). This is the discrete topology — every subset is open.
Example 2.3 (Indiscrete topology). For any set , let . This is the indiscrete topology (or trivial topology).
Example 2.4 (Cofinite topology). For any infinite set , let consist of and all subsets such that is finite. This is the cofinite topology.
Example 2.5 (Standard topology on ). A subset is open if for every there exists such that . The collection of all such open sets is the standard topology on .
2.3 Basis for a Topology
Section titled “2.3 Basis for a Topology”Definition. A basis for a topology on is a collection such that every open set is a union of elements of .
Equivalently, is a basis if and only if:
- For each , there exists with .
- If and , then there exists with .
Example 2.6. The collection of all open intervals in forms a basis for the standard topology.
Example 2.7. The collection of all open balls forms a basis for the standard topology on .
2.4 Subspace Topology
Section titled “2.4 Subspace Topology”Definition. Let be a topological space and . The subspace topology on is
Proposition 2.1. If is a basis for , then is a basis for the subspace topology on .
Example 2.8. The subspace topology on (with the standard topology) has as an open set (since ).
2.5 Comparison of Topologies
Section titled “2.5 Comparison of Topologies”Definition. Let and be topologies on . We say is coarser (weaker) than (or is finer (stronger) than ) if .
For any set : indiscrete cofinite standard (if ) discrete.
2.6 Key Relationships
Section titled “2.6 Key Relationships”| Topology | Basis | Separation | Properties |
|---|---|---|---|
| Discrete | Completely normal | Every function from is continuous | |
| Indiscrete | Not | Every function to is continuous | |
| Cofinite | but not | Compact (any ) | |
| Standard () | (normal) | Connected, separable, Lindelöf | |
| Subspace | Inherits | Open sets = intersections with |
These examples span the spectrum from finest (discrete, many open sets) to coarsest (indiscrete, few open sets).
2.7 Common Pitfalls
Section titled “2.7 Common Pitfalls”- Assuming all topologies are metric. The cofinite topology on an infinite set is not Hausdorff () and cannot arise from a metric. Fix: Metric spaces are a proper subclass of topological spaces; many useful topologies are non-metrisable.
- Thinking arbitrary intersections of open sets are open. Only finite intersections are guaranteed. Fix: Counterexample: in , , which is not open.
- Confusing open and closed sets. A set can be both (clopen: and ), neither, or one without the other. Fix: Topology defines open sets; closed sets are complements. Check the definition, not intuition from .
- Assuming the subspace topology is intuitive. A set can be open in without being open in . Fix: is open in with subspace topology because .
2.8 Applications
Section titled “2.8 Applications”- Data analysis (persistent homology): Topological data analysis uses simplicial complexes and persistent homology to study shape in high-dimensional data, with the Vietoris-Rips complex topology.
- Network theory: Graphs are 1-dimensional CW complexes; topological invariants like the fundamental group detect holes and cycles in communication and social networks.
- Robot motion planning: The configuration space of a robotic arm is a topological space; its connected components determine reachable configurations and its fundamental group encodes obstacles.
- Quantum computing: The topology of quantum error-correcting codes (surface codes, toric codes) determines their error thresholds; logical qubits correspond to non-contractible loops on the code manifold.
- General relativity: Spacetime is a 4-dimensional Lorentzian manifold (a topological space locally modelled on ); global topology determines possible causal structures and singularities.
2.9 Worked Example: Comparing Topologies on a Finite Set
Section titled “2.9 Worked Example: Comparing Topologies on a Finite Set”Problem. Let . List all possible topologies on that are strictly finer than and strictly coarser than . How many are there?
Solution. is the indiscrete topology (2 open sets). is the discrete topology (8 open sets). Any topology strictly between them must have at least 3 and at most 7 open sets.
We need such that . By checking all collections that satisfy the three axioms, we find three such topologies:
- (coarsest refinement)
- (contains two singletons)
Each is strictly finer than the indiscrete topology (adds at least one non-trivial open set) and strictly coarser than the discrete topology (omits at least one singleton). There are three distinct intermediate topologies up to relabelling of points.
2.10 Summary Table
Section titled “2.10 Summary Table”| Axiom | Requirement | Why finite matters |
|---|---|---|
| The empty set and whole space are open | Provides base and top elements | |
| Arbitrary unions | Any union of open sets is open | Ensures topology is closed under “or” |
| Finite intersections | Finite intersections of open sets are open | Prevents pathological singleton limits |