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

Separability

Graduate Depth 80 in the knowledge graph ☐ I know this ☆ Set as goal
3topics build on this
378prerequisites beneath it
See this on the map →
Dense Sets and Nowhere Dense SetsDense Sets and Separability+1 more→→Metrization TheoremsSecond Countability and Separability
separability dense-subsets countable

Core Idea

A space is separable if it has a countable dense subset. Separability is related to second-countability (second-countable implies separable) and together with other axioms often implies metrization. Many important spaces are separable: ℝⁿ, Lᵖ spaces, and spaces of continuous functions.

Explainer

You have studied dense sets: a subset D is dense in X if every nonempty open set of X intersects D, or equivalently if the closure of D equals all of X. Separability adds one further requirement — the dense subset must be countable. A space is separable if it can be approximated, in the sense of density, using only countably many points. This is a "smallness" or "tameness" condition on the space.

The canonical example is ℝ: the rational numbers ℚ are countable and dense in ℝ (between any two reals lies a rational, as the density theorem guarantees). So ℝ is separable. The same argument extends to ℝⁿ: points with all rational coordinates form a countable dense subset. Separability is preserved under many standard constructions — continuous surjective images of separable spaces are separable, and subspaces of separable metric spaces are separable — making it a robust property in practice.

Separability is closely connected to second-countability — the condition that the topology has a countable base (a countable collection of open sets from which all open sets can be built). Every second-countable space is separable: pick one point from each basis element to form the countable dense subset. In metric spaces, the converse also holds: separable metric spaces are second-countable. This equivalence is powerful because second-countability enables many compactness and covering arguments, so proving separability in a metric space is often enough to unlock these tools.

In functional analysis, separability is what makes infinite-dimensional spaces analytically tractable. The Lᵖ spaces (for 1 ≤ p < ∞) are separable — you can approximate any Lᵖ function by step functions with rational heights and rational endpoints, a countable collection. Separable Hilbert spaces — those with a countable orthonormal basis — are the setting for quantum mechanics and much of modern analysis: every element can be expanded in a Fourier series, and limits of such series stay in the space. The Urysohn metrization theorem provides the capstone: a regular second-countable space (hence separable, with mild separation) is metrizable. Separability thus acts as a gateway condition — it combines with other properties to restore metric structure, the strongest and most useful form of topology for analysis.

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 → Open Sets in Topological Spaces → Closed Sets in Topological Spaces → Closure of Sets → Boundary of Sets → Closure, Interior, and Boundary → Dense Sets and Nowhere Dense Sets → Separability

Longest path: 81 steps · 378 total prerequisite topics

Prerequisites (3)

Leads To (2)