A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Topological Spaces: Definition and Examples

College Depth 73 in the knowledge graph ☐ I know this ☆ Set as goal
221topics build on this
326prerequisites beneath it
See this on the map →
Set Theory BasicsEquivalence Relations→→Open Sets in Topological Spaces
foundations definition

Core Idea

A topological space (X, τ) consists of a set X and a collection τ of subsets called open sets satisfying: ∅ and X are open, any union of open sets is open, and finite intersections of open sets are open. This structure generalizes the notion of 'open' from real analysis to arbitrary sets and forms the foundation of topology.

Explainer

In real analysis, an open set in ℝ is one where every point has an open interval around it entirely contained in the set. This definition works beautifully — but it depends on the notion of distance. What if you want to study continuity and connectedness on a set where there is no natural notion of distance? Topology answers this by isolating the minimum structure needed: instead of defining "open" in terms of distance, you simply declare which sets are open, subject to three axioms that capture how open sets in ℝ actually behave.

The three axioms for a topology τ on a set X are: (1) the empty set ∅ and the whole set X are in τ; (2) any union of sets in τ is in τ — even infinite unions; (3) any finite intersection of sets in τ is in τ. The asymmetry between (2) and (3) is deliberate and important. In ℝ, the intersection of the open sets (−1/n, 1/n) for all n = 1, 2, 3, … is the single point {0}, which is not open. Allowing infinite intersections would let you generate closed sets from open sets through the back door, collapsing the structure. The axioms are carefully calibrated to permit enough structure for interesting topology while avoiding this collapse.

To build intuition, consider three extreme examples on the same set X = {a, b, c}. The discrete topology τ = 𝒫(X) (all subsets are open) is the finest possible topology — every set is open. The indiscrete topology τ = {∅, X} is the coarsest — only the two required sets are open. Between these extremes lie all other topologies, such as τ = {∅, {a}, X}, which is finer than the indiscrete but coarser than the discrete. Each topology encodes a different notion of which points are "close together": in the indiscrete topology, you cannot separate any two points with open sets at all, so in a sense every point is adjacent to every other.

The payoff is generality with preservation of key theorems. Continuous functions, convergence, connectedness, and compactness can all be defined purely in terms of open sets — no distances required. This means every theorem you prove in the topological setting applies automatically to metric spaces, function spaces, and far stranger settings. The set X you bring to topology can be almost anything: the real line, a finite set, a space of functions, a manifold. The topology τ specifies what "nearby" means in that context, and the three axioms ensure the structure is rich enough to do geometry with.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Topological Spaces: Definition and Examples

Longest path: 74 steps · 326 total prerequisite topics

Prerequisites (2)

Leads To (1)