Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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\{0,1\}^{\mathbb{N}} with the product of discrete topologies, the ternary digits being the coordinates

Example

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

K  :=  DN  =  jNDK \;:=\; D^{\mathbb{N}} \;=\; \prod_{j \in \mathbb{N}} D

carry the product topology (The product set iIXi\prod_{i \in I} X_i 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 CC be the Cantor set (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds) with the subspace topology inherited from the usual topology of R\mathbb{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\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded). Define

Φ:KC,Φ(b)  :=  j=02bj3(j+1).\Phi : K \to C, \qquad \Phi(b) \;:=\; \sum_{j=0}^{\infty} 2 b_j\, 3^{-(j+1)} .

Then:

  1. Φ\Phi is a well defined bijection onto CC. Writing Φ0(a):=k=0ak3k1\Phi_0(a) := \sum_{k=0}^{\infty} a_k 3^{-k-1} for a sequence a:N{0,2}a : \mathbb{N} \to \{0,2\}, one has Φ(b)=Φ0((2bk)k)\Phi(b) = \Phi_0\big((2b_k)_k\big), and claim 3 of The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}} says exactly that this assignment is a bijection from {0,1}N\{0,1\}^{\mathbb{N}} onto CC.
  2. Two estimates control Φ\Phi completely. For b,cKb, c \in K and nNn \in \mathbb{N}:
    • if bj=cjb_j = c_j for every j<nj < n, then Φ(b)Φ(c)3n|\Phi(b) - \Phi(c)| \le 3^{-n};
    • if bj=cjb_j = c_j for every j<mj < m and bmcmb_m \ne c_m, then Φ(b)Φ(c)3(m+1)|\Phi(b) - \Phi(c)| \ge 3^{-(m+1)}.
  3. Φ\Phi 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 CC 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 CC 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 Φ\Phi is proved by hand instead.

Facts & Assumptions

Given: D={0,1}D = \{0,1\} discrete, K=DNK = D^{\mathbb{N}} with the product topology, the Cantor set CRC \subseteq \mathbb{R} with the subspace topology, the map Φ\Phi above, and points b,cKb, c \in K. For nNn \in \mathbb{N} the cylinder at bb of depth nn is Z(b,n):={cK:cj=bj for every j<n}Z(b,n) := \{\, c \in K : c_j = b_j \text{ for every } j < n \,\}. Powers 3k3^{-k} are integer powers (Integer powers ama^m) and 33 denotes ι(3)\iota(3) (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[A1]

For a sequence a:N{0,2}a : \mathbb{N} \to \{0,2\} the series k0ak3k1\sum_{k \ge 0} a_k 3^{-k-1} converges, its sum Φ0(a)\Phi_0(a) lies in [0,1][0,1], the Cantor set is exactly the set of these sums, and bΦ0((2bk)k)b \mapsto \Phi_0\big((2b_k)_k\big) is a bijection from {0,1}N\{0,1\}^{\mathbb{N}} onto CC (The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}, claims 1, 2 and 3; The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds).

[L1]

k=0rk=1/(1r)\sum_{k=0}^{\infty} r^k = 1/(1-r) for r<1|r|<1 (For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 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λ\sum_{k<n}\lambda = n\lambda (Laws of finite sums and finite products); weak inequalities pass to limits (Limits preserve non-strict inequalities); uv|u| \le v is equivalent to vuv-v \le u \le v (Basic properties of the absolute value).

[L3]

3m3n=3m+n3^{m}3^{n} = 3^{m+n} and 3m=(3m)13^{-m} = (3^m)^{-1} (Laws of integer exponents, Integer powers ama^m); 3k>03^k > 0 and k3kk \mapsto 3^k is nondecreasing for kNk \in \mathbb{N}, so 0<uv0 < u \le v gives 3v3u3^{-v} \le 3^{-u} (Inverses of positives are positive, and reciprocation reverses order, Laws of integer exponents).

[L4]

If ak\sum a_k converges then ak0a_k \to 0 (If a series converges then its terms tend to 00); 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 bKb \in K the terms 2bj3(j+1)2b_j 3^{-(j+1)} lie between 00 and 23(j+1)2 \cdot 3^{-(j+1)}, and j23(j+1)\sum_j 2 \cdot 3^{-(j+1)} converges with sum 11, since it is 231j3j=(2/3)(3/2)2 \cdot 3^{-1}\sum_j 3^{-j} = (2/3)(3/2) by [L1] and [L3]. So Φ(b)\Phi(b) is defined and lies in [0,1][0,1].

givenL1L2L3
1.2

3k03^{-k} \to 0, since k3k\sum_k 3^{-k} converges by [L1]; hence for every real ε>0\varepsilon > 0 there is nNn \in \mathbb{N} with 3n<ε3^{-n} < \varepsilon, a positive rational below ε\varepsilon serving as the tolerance.

L1L4
1.3

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

A2
1.4

The cylinders form a basis of KK: given a basic box jUj\prod_j U_j with Uj=DU_j = D off a list j0,,jr1j_0,\dots,j_{r-1} and a point bb in it, put n:=1+jm0n := 1 + j_{m_0} where jm0j_{m_0} is the largest of the listed indices, available by [L5] for r1r \ge 1, and n:=0n := 0 for r=0r = 0; then bZ(b,n)jUjb \in Z(b,n) \subseteq \prod_j U_j, since every listed index is <n< n.

A2L5
2.1

Φ(b)=Φ0((2bk)k)\Phi(b) = \Phi_0\big((2b_k)_k\big) for every bKb \in K, the two series having the same terms 2bk3k12b_k 3^{-k-1}; so by [A1] the map Φ\Phi is a bijection of KK onto CC. This is claim 1.

step 1.1A1L1
2.2

For every nNn \in \mathbb{N}: jn23(j+1)=3n\sum_{j \ge n} 2 \cdot 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=cjb_j = c_j for every j<nj < n. For NnN \ge n the finite sum j<N2(bjcj)3(j+1)\sum_{j<N} 2(b_j - c_j)3^{-(j+1)} has vanishing terms for j<nj < n, and each remaining term lies between 23(j+1)-2 \cdot 3^{-(j+1)} and 23(j+1)2 \cdot 3^{-(j+1)}, so by [L2] the finite sum lies between 3n-3^{-n} and 3n3^{-n}, using step 2.2 and [L1]. Letting NN grow and applying [L1] and [L2] gives Φ(b)Φ(c)3n|\Phi(b) - \Phi(c)| \le 3^{-n}.

step 2.2L1L2
3.2

Suppose bj=cjb_j = c_j for every j<mj < m and bmcmb_m \ne c_m; interchanging bb and cc if necessary, take bm=1b_m = 1 and cm=0c_m = 0. For N>mN > m the finite sum j<N2(bjcj)3(j+1)\sum_{j<N} 2(b_j-c_j)3^{-(j+1)} equals 23(m+1)2 \cdot 3^{-(m+1)} plus a term bounded below by jm+123(j+1)=3(m+1)-\sum_{j \ge m+1} 2 \cdot 3^{-(j+1)} = -3^{-(m+1)}, by step 2.2, [L1] and [L2]; so it is at least 3(m+1)3^{-(m+1)}. Letting NN grow gives Φ(b)Φ(c)3(m+1)\Phi(b) - \Phi(c) \ge 3^{-(m+1)}, hence Φ(b)Φ(c)3(m+1)|\Phi(b)-\Phi(c)| \ge 3^{-(m+1)}.

step 2.2L1L2
4.1

Steps 3.1 and 3.2 are claim 2.

step 3.1step 3.2
4.2

Φ\Phi is continuous: let VV be open in CC and bΦ1[V]b \in \Phi^{-1}[V]; by [A3] there is ε>0\varepsilon > 0 with BC(Φ(b),ε)VB_C(\Phi(b),\varepsilon) \subseteq V, by step 1.2 there is nn with 3n<ε3^{-n} < \varepsilon, and by step 3.1 every cZ(b,n)c \in Z(b,n) has Φ(c)Φ(b)3n<ε|\Phi(c)-\Phi(b)| \le 3^{-n} < \varepsilon, so Z(b,n)Φ1[V]Z(b,n) \subseteq \Phi^{-1}[V]; and Z(b,n)Z(b,n) is open by step 1.3.

step 1.2step 1.3step 3.1A3
4.3

For bKb \in K and nNn \in \mathbb{N}: BC(Φ(b),3n)Φ[Z(b,n)]B_C(\Phi(b), 3^{-n}) \subseteq \Phi[Z(b,n)]. Indeed such a point is Φ(c)\Phi(c) for a unique cKc \in K by step 2.1; if cZ(b,n)c \notin Z(b,n), let mm be the least index with bmcmb_m \ne c_m, which exists by [L5] and satisfies m<nm < n, and then step 3.2 gives Φ(c)Φ(b)3(m+1)3n|\Phi(c)-\Phi(b)| \ge 3^{-(m+1)} \ge 3^{-n} by [L3], contradicting the choice of Φ(c)\Phi(c).

step 2.1step 3.2L3L5
5.1

Φ\Phi is an open map onto CC: by step 1.3 the set Φ[Z(b,n)]\Phi[Z(b,n)] contains, around each of its points Φ(c)\Phi(c) with cZ(b,n)c \in Z(b,n), the ball BC(Φ(c),3n)Φ[Z(c,n)]=Φ[Z(b,n)]B_C(\Phi(c),3^{-n}) \subseteq \Phi[Z(c,n)] = \Phi[Z(b,n)] by step 4.3; so each Φ[Z(b,n)]\Phi[Z(b,n)] is open in CC by [A3], and by step 1.4 every open subset of KK 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 Φ\Phi is a bijection onto CC, 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 Φ\Phi almost preserves distance. Agreement of the first nn coordinates forces the images to be within 3n3^{-n}, and the first disagreement at index mm forces them to be at least 3(m+1)3^{-(m+1)} apart. Together they say that the cylinder Z(b,n)Z(b,n) and the trace on CC of an interval of length about 3n3^{-n} around Φ(b)\Phi(b) determine each other, which is exactly what makes Φ\Phi 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 CC has exactly one ternary expansion with digits in {0,2}\{0,2\}, which is what makes Φ\Phi injective; the ambiguity of ternary expansions in general, such as two expansions of 1/31/3, does not arise inside CC because the alternative expansion uses the digit 11.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 188 results over 36 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