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

The Cantor Set: An Uncountable Nowhere Dense Example

College Depth 85 in the knowledge graph ☐ I know this ☆ Set as goal
101topics build on this
429prerequisites beneath it
See this on the map →
Uncountability and the Diagonal ArgumentSet Operations: Union, Intersection, and Complement→→Uncountable Sets and Cantor Diagonalization
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, 2n−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

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 → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → ZFC Axioms Overview → Axiom Schema of Separation → Axiom Schema of Replacement → Von Neumann Ordinals → Hereditarily Finite Sets → Recursive Definitions on Finite Sets → Well-Founded Relations and Transfinite Recursion → The Axiom of Choice and Equivalent Formulations → Axiom of Choice → Well-Ordering Theorem → Infinite Cardinal Numbers → Cantor's Theorem → Uncountability and the Diagonal Argument → The Cantor Set: An Uncountable Nowhere Dense Example

Longest path: 86 steps · 429 total prerequisite topics

Prerequisites (2)

Leads To (1)