Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge 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 set is homeomorphic to {0,1}N with the product of discrete topologies, the ternary digits being the coordinates

Example

Let D:={0,1} carry the discrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies) and let

K  :=  DN  =  ∏j∈ND

carry the product topology (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). Let C be the Cantor set (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds) with the subspace topology inherited from the usual topology of R (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded). Define

Φ:K→C,Φ(b)  :=  ∑j=0∞2bj 3−(j+1).

Then:

  1. Φ is a well defined bijection onto C. Writing Φ0(a):=∑k=0∞ak3−k−1 for a sequence a:N→{0,2}, one has Φ(b)=Φ0((2bk)k), and claim 3 of The Cantor set is exactly the set of ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N says exactly that this assignment is a bijection from {0,1}N onto C.
  2. Two estimates control Φ completely. For b,c∈K and n∈N:
    • if bj=cj for every j<n, then ∣Φ(b)−Φ(c)∣≤3−n;
    • if bj=cj for every j<m and bm≠cm, then ∣Φ(b)−Φ(c)∣≥3−(m+1).
  3. Φ is a homeomorphism (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological): it is continuous by the first estimate and open onto C by the second, and a continuous open bijection is a homeomorphism (A continuous bijection is a homeomorphism iff it is open iff it is closed, and homeomorphy is an equivalence relation on spaces).

So the Cantor set, a subspace of the line, and the space of all binary sequences, a product of two-point discrete spaces, are the same topological space; the ternary digits of a point of C are its coordinates in the product.

Compactness is not used anywhere below. The usual argument, that a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, is not available at this point in the reading order, and the openness of Φ is proved by hand instead.

Facts & Assumptions

Given: D={0,1} discrete, K=DN with the product topology, the Cantor set C⊆R with the subspace topology, the map Φ above, and points b,c∈K. For n∈N the cylinder at b of depth n is Z(b,n):={ c∈K:cj=bj for every j<n }. Powers 3−k are integer powers (Integer powers am) and 3 denotes ι(3) (The canonical natural ι(n)=n⋅1F of a field).

[A1]

For a sequence a:N→{0,2} the series ∑k≥0ak3−k−1 converges, its sum Φ0(a) lies in [0,1], the Cantor set is exactly the set of these sums, and b↦Φ0((2bk)k) is a bijection from {0,1}N onto C (The Cantor set is exactly the set of ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N, claims 1, 2 and 3; The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds).

[L1]

∑k=0∞rk=1/(1−r) for ∣r∣<1 (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges); a nonnegative series converges iff its partial sums are bounded, and then every partial sum is at most the sum (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum); series may be shifted to a general starting index (Series, partial sums, convergence and the sum, divergence, and the tail series); sums are additive and homogeneous (Convergent series add and scale termwise).

[L2]

Finite sums are monotone in their terms and satisfy ∑k<nλ=nλ (Laws of finite sums and finite products); weak inequalities pass to limits (Limits preserve non-strict inequalities); ∣u∣≤v is equivalent to −v≤u≤v (Basic properties of the absolute value).

[L3]

3m3n=3m+n and 3−m=(3m)−1 (Laws of integer exponents, Integer powers am); 3k>0 and k↦3k is nondecreasing for k∈N, so 0<u≤v gives 3−v≤3−u (Inverses of positives are positive, and reciprocation reverses order, Laws of integer exponents).

[L4]

If ∑ak converges then ak→0 (If a series converges then its terms tend to 0); below any positive real lies a positive rational, so convergence tested against rational tolerances gives every real tolerance (The rationals embed densely in the reals).

[L5]

Every nonempty set of naturals has a least element (The well-ordering principle); a listed finite set of reals has a maximum (Every nonempty finite set of reals has a maximum and a minimum).

Verification

technique · direct
1.1

For every b∈K the terms 2bj3−(j+1) lie between 0 and 2⋅3−(j+1), and ∑j2⋅3−(j+1) converges with sum 1, since it is 2⋅3−1∑j3−j=(2/3)(3/2) by [L1] and [L3]. So Φ(b) is defined and lies in [0,1].

givenL1L2L3
1.2

3−k→0, since ∑k3−k converges by [L1]; hence for every real ε>0 there is n∈N with 3−n<ε, a positive rational below ε serving as the tolerance.

L1L4
1.3

Each cylinder Z(b,n) is open in K: it is the box with factor {bj} at each j<n and D elsewhere, and every subset of D is open. Moreover Z(c,n)=Z(b,n) whenever c∈Z(b,n), the defining condition being agreement of the first n coordinates.

A2
1.4

The cylinders form a basis of K: given a basic box ∏jUj with Uj=D off a list j0,…,jr−1 and a point b in it, put n:=1+jm0 where jm0 is the largest of the listed indices, available by [L5] for r≥1, and n:=0 for r=0; then b∈Z(b,n)⊆∏jUj, since every listed index is <n.

A2L5
2.1

Φ(b)=Φ0((2bk)k) for every b∈K, the two series having the same terms 2bk3−k−1; so by [A1] the map Φ is a bijection of K onto C. This is claim 1.

step 1.1A1L1
2.2

For every n∈N: ∑j≥n2⋅3−(j+1)=3−n, by shifting the index and applying [L1] and [L3] as in step 1.1.

step 1.1L1L3
3.1

Suppose bj=cj for every j<n. For N≥n the finite sum ∑j<N2(bj−cj)3−(j+1) has vanishing terms for j<n, and each remaining term lies between −2⋅3−(j+1) and 2⋅3−(j+1), so by [L2] the finite sum lies between −3−n and 3−n, using step 2.2 and [L1]. Letting N grow and applying [L1] and [L2] gives ∣Φ(b)−Φ(c)∣≤3−n.

step 2.2L1L2
3.2

Suppose bj=cj for every j<m and bm≠cm; interchanging b and c if necessary, take bm=1 and cm=0. For N>m the finite sum ∑j<N2(bj−cj)3−(j+1) equals 2⋅3−(m+1) plus a term bounded below by −∑j≥m+12⋅3−(j+1)=−3−(m+1), by step 2.2, [L1] and [L2]; so it is at least 3−(m+1). Letting N grow gives Φ(b)−Φ(c)≥3−(m+1), hence ∣Φ(b)−Φ(c)∣≥3−(m+1).

step 2.2L1L2
4.1

Steps 3.1 and 3.2 are claim 2.

step 3.1step 3.2
4.2

Φ is continuous: let V be open in C and b∈Φ−1[V]; by [A3] there is ε>0 with BC(Φ(b),ε)⊆V, by step 1.2 there is n with 3−n<ε, and by step 3.1 every c∈Z(b,n) has ∣Φ(c)−Φ(b)∣≤3−n<ε, so Z(b,n)⊆Φ−1[V]; and Z(b,n) is open by step 1.3.

step 1.2step 1.3step 3.1A3
4.3

For b∈K and n∈N: BC(Φ(b),3−n)⊆Φ[Z(b,n)]. Indeed such a point is Φ(c) for a unique c∈K by step 2.1; if c∉Z(b,n), let m be the least index with bm≠cm, which exists by [L5] and satisfies m<n, and then step 3.2 gives ∣Φ(c)−Φ(b)∣≥3−(m+1)≥3−n by [L3], contradicting the choice of Φ(c).

step 2.1step 3.2L3L5
5.1

Φ is an open map onto C: by step 1.3 the set Φ[Z(b,n)] contains, around each of its points Φ(c) with c∈Z(b,n), the ball BC(Φ(c),3−n)⊆Φ[Z(c,n)]=Φ[Z(b,n)] by step 4.3; so each Φ[Z(b,n)] is open in C by [A3], and by step 1.4 every open subset of K is a union of cylinders, whose image is the union of their images.

step 1.3step 1.4step 4.3A3
6.1

By step 2.1 the map Φ is a bijection onto C, by step 4.2 it is continuous and by step 5.1 it is open, so it is a homeomorphism by [L6]. This is claim 3, and with steps 2.1 and 4.1 all three claims are proved.

step 2.1step 4.1step 4.2step 5.1L6∎

Remarks

  • The two estimates say that Φ almost preserves distance. Agreement of the first n coordinates forces the images to be within 3−n, and the first disagreement at index m forces them to be at least 3−(m+1) apart. Together they say that the cylinder Z(b,n) and the trace on C of an interval of length about 3−n around Φ(b) determine each other, which is exactly what makes Φ a homeomorphism.

  • Why openness has to be proved and not quoted. For a continuous bijection, openness is equivalent to being a homeomorphism (A continuous bijection is a homeomorphism iff it is open iff it is closed, and homeomorphy is an equivalence relation on spaces) and is not automatic; the standard shortcut uses compactness of the source and the Hausdorff condition on the target, and compactness is later in the reading order. Steps 4.3 and 5.1 replace it with a direct computation.

  • The coordinates are the digits, and the digits are not the point. A real number in C has exactly one ternary expansion with digits in {0,2}, which is what makes Φ injective; the ambiguity of ternary expansions in general, such as two expansions of 1/3, does not arise inside C because the alternative expansion uses the digit 1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

126 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