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

Dense Sets and Nowhere Dense Sets

Graduate Depth 79 in the knowledge graph I know this Set as goal
5topics build on this
367prerequisites beneath it
See this on the map →
Closure, Interior, and BoundaryBaire Category TheoremSeparability
dense-sets nowhere-dense meager-sets

Core Idea

A set is dense if its closure is the whole space—intuitively, its points are everywhere. A set is nowhere dense if its closure has empty interior. The study of dense sets leads to the Baire category theorem, which shows that complete metric spaces cannot be expressed as countable unions of nowhere dense sets, providing a powerful tool for existence arguments.

Explainer

From your prerequisite on closure, interior, and boundary, you know that cl(A) is the smallest closed set containing A, and int(A) is the largest open set contained in A. Dense sets and nowhere dense sets are defined in terms of these operations, so the definitions come with immediate geometric meaning. A set A ⊆ X is dense in X if cl(A) = X — every point of X is either in A or is a limit point of A, meaning every open set contains a point of A. Intuitively, A's points are "everywhere present" in X: no matter where you look in X, you find points of A nearby.

The canonical dense set is ℚ inside ℝ: between any two real numbers lies a rational, so every open interval contains rationals, so cl(ℚ) = ℝ. What makes this striking is that ℚ is countable and, in a measure-theoretic sense, "negligible" (it has Lebesgue measure zero). Yet it is topologically everywhere present. This shows that topological density is genuinely different from measure-theoretic density — the two notions of "size" answer different questions and do not track each other.

A set A is nowhere dense if int(cl(A)) = ∅ — its closure contains no open set. The integers ℤ in ℝ are nowhere dense: cl(ℤ) = ℤ itself (ℤ is closed), and ℤ contains no open interval. A more sophisticated example is the Cantor set C ⊆ [0,1]: C is closed, so cl(C) = C, and C contains no open interval (its complement is open and dense), so C is nowhere dense. Yet C is uncountable — it has the same cardinality as ℝ. Nowhere dense sets are "topologically thin" in a way that cardinality does not capture.

The Baire Category Theorem elevates these definitions into a powerful existence tool. It says: in a complete metric space (or locally compact Hausdorff space), the whole space cannot be written as a countable union of nowhere dense sets. A set expressible as a countable union of nowhere dense sets is called meager (or "of first category"); the theorem says the ambient space is non-meager. This lets analysts prove that "generic" elements of a function space have extreme properties, without constructing a single example. The classic application: the continuous functions on [0,1] that are differentiable at even one point form a meager subset of C([0,1]) — so in a precise topological sense, *most* continuous functions are nowhere differentiable, even though constructing an explicit example (like the Weierstrass function) requires significant work.

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 Sets

Longest path: 80 steps · 367 total prerequisite topics

Prerequisites (1)

Leads To (2)