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 middle-thirds set as the intersection of the sets obtained by removing open middle thirds
Definition
For write
and let be
By the recursion theorem (The recursion theorem), applied to the set , the starting element (Intervals of : the nine order-convex forms, nondegeneracy, and length) and the function , there is a unique family of subsets of with
The Cantor middle-thirds set is
The first step really is the removal of the open middle third. Directly from the clauses,
the middle equality because is an order isomorphism of onto itself with inverse (Ordered field, Sign rules for products and monotonicity of multiplication), and the last because splits, by totality of the order, into , and . The recursion then performs the same operation inside each of the two scaled copies, which is what "removing the open middle thirds" names.
Every lies in , by induction on (The principle of mathematical induction): ; and if then and , so (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication). The same computation shows that the two halves of are disjoint, the first lying in and the second in , and (The multiplicative identity is positive).
The family is nested, for every , again by induction. For this is . And is monotone, in the sense that implies , directly from the displayed description of ; so gives . Consequently for every , and .
Powers. Here means , the integer power of Integer powers , so that , and for every (Laws of integer exponents, Complete ordered field (least-upper-bound property)).
Remarks
-
Why the self-similar recursion rather than a description by digits. The clause is a single application of The recursion theorem to one explicitly given function on , so nothing is selected at any stage and no listing of the intervals making up has to be constructed. Every structural property below is then proved by induction on through . The description by ternary digits is a theorem about , not its definition, and it is The Cantor set is exactly the set of with every , and this gives a bijection with .
-
is not empty. for every , by induction: , and gives . Likewise , since gives . So contains at least the two endpoints; that it is in fact uncountable is 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.
-
The construction with a different proportion. Replacing "middle third" by an interval of length removed at stage produces a set that is closed, has empty interior and is not of measure zero (The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals). So none of the qualitative properties of proved on this page is a consequence of its being nowhere dense, and the two constructions are kept apart deliberately.
Depends on
Intervals of : the nine order-convex forms, nondegeneracy, and length
The recursion theorem
The principle of mathematical induction
Integer powers
Laws of integer exponents
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