How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points
Statement
Let be the Cantor set (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds). Then:
- is closed and bounded, hence compact (A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset);
- has content zero, and therefore measure zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover));
- is perfect (Perfect subset of : closed with no isolated points);
- is uncountable (Finite, countably infinite, countable, uncountable);
- contains no interval with two distinct endpoints, and is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of );
- every nonempty connected subset of (Separated sets, disconnection, and connected subset of ) is a single point.
Claim 6 is what the phrase "totally disconnected" names elsewhere; that phrase is not used here, because no definition of total disconnectedness exists at this point in the reading order. What is proved is exactly the displayed statement, and it is obtained from claim 5 through A subset of is connected if and only if it is order-convex, that is, an interval.
Facts & Assumptions
Given: The sets and of The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds, and the map and the set of -valued sequences of The Cantor set is exactly the set of with every , and this gives a bijection with .
is a bijection from onto , , and convergent series add and scale termwise (The Cantor set is exactly the set of with every , and this gives a bijection with , Convergent series add and scale termwise, Series, partial sums, convergence and the sum, divergence, and the tail series).
is a closed set and a bounded interval, is open, , and every open set contains a neighbourhood of each of its points (Intervals of : the nine order-convex forms, nondegeneracy, and length, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of ).
Finite unions of closed sets are closed, and an intersection of a nonempty family of closed sets is closed (Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets).
A subset of is compact exactly when it is closed and bounded (A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Content zero and measure zero as in Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover); a set of content zero is null (A set of content zero has measure zero); no null set contains an interval with (A sequence of intervals covering has total length at least , so no interval of positive length has measure zero).
is perfect when it is closed and no point of it is isolated in it (Perfect subset of : closed with no isolated points, Limit point, isolated point, adherent point, derived set, and dense subset of ); every nonempty perfect subset of is uncountable (Every nonempty perfect subset of is uncountable, Finite, countably infinite, countable, uncountable).
A set is nowhere dense exactly when the interior of its closure is empty, and a closed set equals its closure (Nowhere dense, meager (first category), residual, and second category subsets of , Interior, closure, boundary and exterior of a subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points).
A subset of is connected exactly when it is order-convex (A subset of is connected if and only if it is order-convex, that is, an interval, Separated sets, disconnection, and connected subset of , Intervals of : the nine order-convex forms, nondegeneracy, and length).
for (For the sequence is null, and for the sequence diverges to ); convergence to is tested against rational (Limits and Cauchy sequences of reals); , for , and (Basic properties of the absolute value).
Induction on (The principle of mathematical induction); finite sums split, scale and are monotone in their terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
Ordered-field arithmetic: , so , , and ; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
is compact, claim 1. First, for and the set is closed whenever is: if then , so by [L3] there is a real with , and every with satisfies by [L10] and [L12], hence and . Now every is closed, by induction on ([L11]): is closed by [L3], and is the union of the two closed sets and , hence closed by [L4]. So is closed by [L4], and is bounded by [L1] and [L3]; by [L5] it is compact.
has content zero and measure zero, claim 2. By induction on ([L11]) the following holds for every : there are and reals with and . At take the single interval , of total length by [L1]. Given such a list at , define intervals by for and for ; they cover and respectively, hence cover , and their total length is by [L11] and [L12]. Since by [L12], [L10] gives, for every real , an with ; as by [L1], the corresponding finite list covers with total length at most . So has content zero by [L6], and hence measure zero by [L6].
is perfect, claim 3. is closed by step 1.1. Let and let the real be given. By [L2] write with . By [L10] and [L12] fix with , and define by for and , so and . Then and by [L2], while by [L2], all other terms being , so by [L10]. Thus contains a point of other than , for every , so is not isolated in ; by [L7] is perfect.
contains no nondegenerate interval and is nowhere dense, claim 5. By step 1.2 the set is null, so by [L6] it contains no with ; in particular it contains no interval of any of the four bounded forms with distinct endpoints, since such an interval contains a closed one with distinct endpoints by [L6] and [L12]. Its interior is therefore empty: if for some real , then by [L3] and [L12], an interval with distinct endpoints. Since is closed by step 1.1, it equals its closure, so [L8] gives that is nowhere dense.
is uncountable, claim 4. is nonempty, since by [L1], and perfect by step 2.1, so [L7] applies.
Connected subsets, claim 6. Let be connected and nonempty. By [L9] is order-convex, so if with then , contradicting step 2.2. Hence no two distinct elements of exist, and , being nonempty, is a single point.
Claims 1 to 6 are steps 1.1, 1.2, 2.1, 3.1, 2.2 and 3.2 respectively, so all six hold.
Remarks
-
Two independent proofs of uncountability. The route above is Every nonempty perfect subset of is uncountable applied to a nonempty perfect set. The other is claim 3 of The Cantor set is exactly the set of with every , and this gives a bijection with : is in bijection with , which is in bijection with the power set of , uncountable by Cantor's theorem: . The two arguments share nothing, and the second is the one that makes the size of evident: is in bijection with the power set of , while having content zero. It is deliberately not said here that has as many points as . That would require a bijection between and the power set of , and no such bijection is constructed anywhere at this point in the reading order; the two uncountability results available here are separate facts, one proved by the diagonal argument on power sets and one by nested intervals.
-
Claim 2 and claim 4 together are the point of the whole construction. A set of measure zero may be uncountable, so nullity is not a cardinality condition; and a nowhere dense set need not be null, so it is not a category condition either (FALSE: every nowhere dense subset of has measure zero, The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero).
-
Why claim 5 is proved through measure and not by inspection. The intervals making up have length , and one can see directly that a long interval cannot fit inside . Doing that rigorously means keeping track of the component intervals of and their gaps; going through A sequence of intervals covering has total length at least , so no interval of positive length has measure zero uses the estimate already made in step 1.2 and needs no such bookkeeping.
-
Every point of is a limit of other points of , and the witnesses are explicit: change one ternary digit far out, as step 2.1 does. This is also what shows has no isolated points without any appeal to the structure of its complement.
Depends on
- The Cantor middle-thirds set as the intersection of the sets $C_n$ obtained by removing open middle thirds
- The Cantor set is exactly the set of $\sum_{k \ge 1} a_k 3^{-k}$ with every $a_k \in \{0,2\}$, and this gives a bijection with $\{0,1\}^{\mathbb{N}}$
- A subset of $\mathbb{R}$ is compact if and only if it is closed and bounded
- Open cover, subcover, compact subset of $\mathbb{R}$ (every open cover has a finite subcover), and sequentially compact subset
- Perfect subset of $\mathbb{R}$: closed with no isolated points
- Every nonempty perfect subset of $\mathbb{R}$ is uncountable
- Nowhere dense, meager (first category), residual, and second category subsets of $\mathbb{R}$
- Measure zero (a countable cover by intervals of total length below every $\varepsilon$) and content zero (a finite such cover)
- A set of content zero has measure zero
- A sequence of intervals covering $[a,b]$ has total length at least $b - a$, so no interval of positive length has measure zero
- Separated sets, disconnection, and connected subset of $\mathbb{R}$
- A subset of $\mathbb{R}$ is connected if and only if it is order-convex, that is, an interval
- Arbitrary unions and finite intersections of open subsets of $\mathbb{R}$ are open, and dually for closed sets
- Finite, countably infinite, countable, uncountable
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Integer powers $a^m$
- Laws of integer exponents
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
- Limit point, isolated point, adherent point, derived set, and dense subset of $\mathbb{R}$
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
- Interior, closure, boundary and exterior of a subset of $\mathbb{R}$
- The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points
- The principle of mathematical induction
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
- Convergent series add and scale termwise
- Series, partial sums, convergence and the sum, divergence, and the tail series
- For $|r| < 1$ the sequence $r^k$ is null, and for $|r| > 1$ the sequence $|r|^k$ diverges to $+\infty$
- Limits and Cauchy sequences of reals
- Basic properties of the absolute value
- Complete ordered field (least-upper-bound property)
- Ordered field
- The multiplicative identity is positive
- Order is preserved by adding a constant and by adding inequalities
- Sign rules for products and monotonicity of multiplication
Used by
- [0,1] and the Cantor set are compact, by Heine-Borel and by closedness inside [0,1]; and, assuming the Axiom of Choice, so is [0,1]^ℕ, by Tychonoff Example
- The Cantor set contains no interval of positive length yet has no isolated point, so every connected subset of it is a single point Example
- The Cantor set has measure zero, yet the Cantor function maps it onto all of [0,1]: a null set can have image an interval of length 1 Example
- The Cantor slab C×[0,1] has content zero in ℝ² Example
- The indicator of the Cantor set is discontinuous exactly on the Cantor set, which is null, so it is Riemann integrable with integral 0 even though it is discontinuous at uncountably many points Example
- FALSE: the Cantor set is countable because only countably many intervals were removed False statement
- The Cantor function is continuous and nondecreasing, climbs from 0 to 1, and is constant on every interval removed in the construction of the Cantor set, so all of its increase happens on a set of measure zero Remark
- The Cantor function is well defined, satisfies c(x) ≤ c(y) whenever x ≤ y, is surjective onto [0,1], and is constant on every interval removed from the Cantor set Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 155 results over 32 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Cantor set (Wikipedia) (standard reference, not scraped)
- Perfect set (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (§2.44) (standard reference, not scraped)
- University of Chicago MATH 395 notes (standard reference, not scraped)
- Stanford Math 205A, Homework 1 (standard reference, not scraped)