The Cantor Set: An Uncountable Nowhere Dense Example

College Depth 60 in the knowledge graph I know this Set as goal
Unlocks 84 downstream topics
cantor-set uncountable nowhere-dense topology

Core Idea

The Cantor set is constructed by iteratively removing the middle third of intervals: start with [0,1], remove (1/3, 2/3), then remove the middle thirds of remaining intervals, and repeat infinitely. The result is uncountable (equinumerous with [0,1]) yet has measure zero and is nowhere dense. It illustrates the subtlety of infinite sets and motivates descriptive set theory.

How It's Best Learned

Construct the first few iterations visually. Show that points remaining have ternary expansions with no digit 1 (base-3 representations using only 0 and 2). Prove uncountability via the bijection with {0,1}^ℕ. Compute that the complement is dense.

Common Misconceptions

Explainer

You already know Cantor's diagonal argument: the real numbers are uncountable because any attempted enumeration misses a real number constructed by differing from each listed entry in its nth decimal digit. The Cantor set C is a concrete, visualizable uncountable set with paradoxical properties that make the subtleties of uncountability tangible rather than abstract. It is constructed iteratively: start with [0, 1], remove the open middle third (1/3, 2/3), then remove the middle third of each remaining interval, and repeat infinitely. What remains after infinitely many removals is C.

The most striking fact is what gets removed versus what remains. At each stage, you remove intervals — at stage 1, one interval of length 1/3; at stage 2, two intervals of length 1/9 each; at stage n, 2^(n−1) intervals of length 3^(−n). The total length removed is the geometric series 1/3 + 2/9 + 4/27 + ··· = (1/3) / (1 − 2/3) = 1. So C has measure zero — in terms of "length on the line," C contributes nothing. Yet C is uncountable, with as many points as [0, 1] itself. The proof uses the ternary (base-3) representation: a point x ∈ [0,1] survives the construction if and only if its ternary expansion uses only the digits 0 and 2 (never 1). The map sending 0 ↦ 0 and 2 ↦ 1 defines a bijection between C and the set {0,1}^ℕ of infinite binary sequences, which is uncountable by the diagonal argument you already know.

The Cantor set is also nowhere dense: it contains no open interval. Every interval (a, b) ⊂ [0,1] contains a middle-third interval that was removed, so C cannot contain (a, b). Yet C is perfect — every point of C is a limit of other points of C. These two properties together — nowhere dense and perfect — define a Cantor space in topology, and the Cantor set is the prototypical example. It embeds into essentially any uncountable Polish space, which is why it appears throughout descriptive set theory.

The Cantor set demolishes two naive intuitions simultaneously. First, "big" in cardinality does not mean "big" in measure — an uncountable set can have measure zero. Second, "large" in measure does not mean "dense" — the complement of C, the removed intervals, is dense in [0,1] and has measure 1, while C itself is meager (a countable union of nowhere dense sets). These decouplings — cardinality from measure, density from measure — are foundational in real analysis and motivate the need for a formal measure theory rather than relying on cardinality or topology alone.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication 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 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesDefining Finite Sets RigorouslyRecursive Definitions on Finite SetsWell-Founded Relations and Transfinite RecursionThe Axiom of Choice and Equivalent FormulationsAxiom of ChoiceWell-Ordering TheoremInfinite Cardinal NumbersCantor's TheoremUncountability and the Diagonal ArgumentThe Cantor Set: An Uncountable Nowhere Dense Example

Longest path: 61 steps · 298 total prerequisite topics

Prerequisites (2)

Leads To (1)