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 Boundary→→Baire 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 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

Longest path: 80 steps · 367 total prerequisite topics

Prerequisites (1)

Leads To (2)