Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27
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 Cn obtained by removing open middle thirds

Definition

For S⊆R write

13S  :=  { x⋅3−1:x∈S },23+13S  :=  { 2⋅3−1+x⋅3−1:x∈S },

and let F:P(R)→P(R) be

F(S)  :=  13S ∪ (23+13S).

By the recursion theorem (The recursion theorem), applied to the set P(R), the starting element [0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and the function F, there is a unique family (Cn)n∈N of subsets of R with

C0=[0,1],Cn+1=F(Cn)=13Cn∪(23+13Cn)(n∈N).

The Cantor middle-thirds set is

C  :=  ⋂n∈NCn.

The first step really is the removal of the open middle third. Directly from the clauses,

C1  =  13[0,1]∪(23+13[0,1])  =  [0,13]∪[23,1]  =  [0,1]∖(13,23),

the middle equality because x↦x⋅3−1 is an order isomorphism of R onto itself with inverse x↦3x (Ordered field, Sign rules for products and monotonicity of multiplication), and the last because 0≤x≤1 splits, by totality of the order, into x≤13, 13<x<23 and x≥23. The recursion then performs the same operation inside each of the two scaled copies, which is what "removing the open middle thirds" names.

Every Cn lies in [0,1], by induction on n (The principle of mathematical induction): C0=[0,1]; and if Cn⊆[0,1] then 13Cn⊆[0,13] and 23+13Cn⊆[23,1], so Cn+1⊆[0,1] (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 Cn+1 are disjoint, the first lying in [0,13] and the second in [23,1], and 13<23 (The multiplicative identity is positive).

The family is nested, Cn+1⊆Cn for every n, again by induction. For n=0 this is C1=[0,13]∪[23,1]⊆[0,1]. And F is monotone, in the sense that S⊆T implies F(S)⊆F(T), directly from the displayed description of F; so Cn+1⊆Cn gives Cn+2=F(Cn+1)⊆F(Cn)=Cn+1. Consequently C=⋂nCn⊆Cm for every m, and ⋂nCn+1=⋂nCn=C.

Powers. Here 3−n means (3−1)n, the integer power of Integer powers am, so that 30=1, 3−(n+1)⋅3=3−n and 3−n>0 for every n (Laws of integer exponents, Complete ordered field (least-upper-bound property)).

Remarks

Depends on

Used by

Dependency tree · two levels

27 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources