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 moreMetrization 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementCartesian Products and RelationsPartial OrdersBinary RelationsEquivalence RelationsTopological Spaces: Definition and ExamplesOpen Sets in Topological SpacesClosed Sets in Topological SpacesClosure of SetsBoundary of SetsClosure, Interior, and BoundaryDense Sets and Nowhere Dense SetsSeparability

Longest path: 81 steps · 378 total prerequisite topics

Prerequisites (3)

Leads To (2)