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 Hilbert cube [0,1]N[0,1]^{\mathbb{N}} with the product topology is metrizable, by d(x,y)=kxkyk/2k+1d(x,y) = \sum_{k} |x_k - y_k| / 2^{\,k+1}

Example

Let [0,1][0,1] carry the subspace topology from the usual topology of R\mathbb{R} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, 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) and let

Q  :=  [0,1]N  =  kN[0,1]Q \;:=\; [0,1]^{\mathbb{N}} \;=\; \prod_{k \in \mathbb{N}} [0,1]

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); QQ is the Hilbert cube. Define

d(x,y)  :=  k=0xkyk2k+1(x,yQ).d(x,y) \;:=\; \sum_{k=0}^{\infty} \frac{|x_k - y_k|}{2^{\,k+1}} \qquad (x,y \in Q).

Then:

  1. dd is defined, with 0d(x,y)10 \le d(x,y) \le 1: the series has nonnegative terms bounded by 2(k+1)2^{-(k+1)}, and k2(k+1)=1\sum_{k} 2^{-(k+1)} = 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, If 0akbk0 \le a_k \le b_k eventually, convergence of bk\sum b_k gives convergence of ak\sum a_k, and divergence of ak\sum a_k gives divergence of bk\sum b_k).
  2. dd is a metric on QQ (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric).
  3. dd induces the product topology, so QQ is metrizable (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

Claim 3 is the only real work, and it is what the index weights are for: the factor 2(k+1)2^{-(k+1)} makes the tail of the sum small no matter what the coordinates do, so a constraint on finitely many coordinates already forces dd to be small, and conversely dd small forces each individual coordinate to be close.

By claim 1 of Products commute with subspaces; for infinite nonempty families, the closure identity Ai=Ai\overline{\prod A_i}=\prod \overline{A_i} uses the Axiom of Choice the topology on QQ is also the subspace topology it inherits from RN\mathbb{R}^{\mathbb{N}}, so the two readings of "[0,1]N[0,1]^{\mathbb{N}}" agree.

Facts & Assumptions

Given: Q=kN[0,1]Q = \prod_{k \in \mathbb{N}}[0,1] with the product topology, points x,y,zQx, y, z \in Q, the function dd above, and a real r>0r > 0. Powers 2k2^{-k} are integer powers (Integer powers ama^m) and 22 denotes ι(2)\iota(2) (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[A1]

A basis for the product topology on QQ is the family of boxes kOk\prod_k O_k with every OkO_k open in [0,1][0,1] and Ok=[0,1]O_k = [0,1] off a list k0,,kn1k_0,\dots,k_{n-1}; the product topology is generated by the sets πj1[O]\pi_j^{-1}[O] with OO open in [0,1][0,1] (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).

[A2]

O[0,1]O \subseteq [0,1] is open in [0,1][0,1] exactly when O=V[0,1]O = V \cap [0,1] for some VV open in R\mathbb{R}; in particular {t[0,1]:ts<ε}=(sε, s+ε)[0,1]\{\, t \in [0,1] : |t - s| < \varepsilon \,\} = (s-\varepsilon,\ s+\varepsilon) \cap [0,1] is open in [0,1][0,1] for every ss and every ε>0\varepsilon > 0, and every open OsO \ni s of [0,1][0,1] contains such a set (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, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L2]

Finite sums are monotone in their terms, k<nλ=nλ\sum_{k<n}\lambda = n\lambda, and a finite sum of nonnegative terms that vanishes has all its terms zero (Laws of finite sums and finite products, claims 2 and 4); weak inequalities pass to limits (Limits preserve non-strict inequalities).

[L3]

s0|s| \ge 0, s=0|s| = 0 iff s=0s = 0, s=s|s| = |-s| (Basic properties of the absolute value), and sust+tu|s-u| \le |s-t| + |t-u| (The triangle inequality).

[L4]

2m2n=2m+n2^{m}2^{n} = 2^{m+n} and 2m=(2m)12^{-m} = (2^m)^{-1}, with 2k>02^k > 0 (Laws of integer exponents, Integer powers ama^m, Inverses of positives are positive, and reciprocation reverses order).

[L5]

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 (The rationals embed densely in the reals), so a convergence tested at rational tolerances delivers every real tolerance.

[L6]

In a metric space the balls Bd(u,ρ)B_d(u,\rho) form a basis of the metric topology, and UU is dd-open exactly when every uUu \in U has some ρ>0\rho > 0 with Bd(u,ρ)UB_d(u,\rho) \subseteq U (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space).

Verification

technique · direct
1.1

k2(k+1)=1\sum_{k} 2^{-(k+1)} = 1, being 12k2k=122\tfrac{1}{2}\sum_k 2^{-k} = \tfrac{1}{2} \cdot 2 by [L1] and [L4]; and more generally kN2(k+1)=2N\sum_{k \ge N} 2^{-(k+1)} = 2^{-N} for every NNN \in \mathbb{N}, by shifting the index.

L1L4
1.2

2k02^{-k} \to 0, since k2k\sum_k 2^{-k} converges by [L1]; so for every real η>0\eta > 0 there is NNN \in \mathbb{N} with 2N<η2^{-N} < \eta.

L1L5
1.3

d(x,y)=d(y,x)d(x,y) = d(y,x), term by term, by [L3]. This is (M2).

L3
2.1

For x,yQx, y \in Q and every kk: 0xkyk10 \le |x_k - y_k| \le 1, since both coordinates lie in [0,1][0,1]; hence 0xkyk2(k+1)2(k+1)0 \le |x_k-y_k| 2^{-(k+1)} \le 2^{-(k+1)}. By [L1] and step 1.1 the series defining d(x,y)d(x,y) converges and 0d(x,y)10 \le d(x,y) \le 1. This is claim 1.

step 1.1A2L1L2L3L4
3.1

For every jNj \in \mathbb{N} and x,yQx,y \in Q: xjyj2(j+1)d(x,y)|x_j - y_j| 2^{-(j+1)} \le d(x,y), the left side being a single term of a nonnegative convergent series and hence at most one of its partial sums, which is at most the sum by [L1].

step 2.1L1L2
3.2

d(x,z)d(x,y)+d(y,z)d(x,z) \le d(x,y) + d(y,z): for every kk one has xkzkxkyk+ykzk|x_k-z_k| \le |x_k-y_k| + |y_k-z_k| by [L3], so each partial sum of the left series is at most the corresponding partial sum of the sum of the two right series by [L2], and the inequality passes to the limits by [L2] and [L1]. This is (M3), so claim 2 holds.

step 2.1L1L2L3
3.3

Every dd-ball contains a basic product-open neighbourhood of its centre. Given uQu \in Q and ρ>0\rho > 0, take NN with 2N<ρ/22^{-N} < \rho/2 by step 1.2 and put W:={yQ:ykuk<ρ/2 for every k<N}W := \{\, y \in Q : |y_k - u_k| < \rho/2 \text{ for every } k < N \,\}, which is a basic product-open set containing uu by [A1] and [A2]. For yWy \in W, splitting the series at NN gives d(u,y)(ρ/2)k<N2(k+1)+kN2(k+1)ρ/2+2N<ρd(u,y) \le (\rho/2)\sum_{k<N}2^{-(k+1)} + \sum_{k \ge N} 2^{-(k+1)} \le \rho/2 + 2^{-N} < \rho, by steps 1.1 and 2.1 with [L1] and [L2]. So uWBd(u,ρ)u \in W \subseteq B_d(u,\rho).

step 1.1step 2.1step 1.2A1A2L1L2
4.1

d(x,x)=0d(x,x) = 0, every term vanishing by [L3]. Conversely if d(x,y)=0d(x,y) = 0 then by step 3.1 every xjyj2(j+1)0|x_j-y_j|2^{-(j+1)} \le 0, so xjyj=0|x_j - y_j| = 0 and xj=yjx_j = y_j for every jj by [L3] and [L4]; hence x=yx = y. This is (M1).

step 3.1L3L4
4.2

Every subbasic product-open set is dd-open. Let OO be open in [0,1][0,1], let xπj1[O]x \in \pi_j^{-1}[O] and take ε>0\varepsilon > 0 with {t[0,1]:txj<ε}O\{\, t \in [0,1] : |t - x_j| < \varepsilon \,\} \subseteq O, available by [A2]. If d(x,y)<ε2(j+1)d(x,y) < \varepsilon 2^{-(j+1)} then xjyj2(j+1)<ε2(j+1)|x_j-y_j| 2^{-(j+1)} < \varepsilon 2^{-(j+1)} by step 3.1, so xjyj<ε|x_j - y_j| < \varepsilon by [L4], so yjOy_j \in O; hence Bd(x,ε2(j+1))πj1[O]B_d(x, \varepsilon 2^{-(j+1)}) \subseteq \pi_j^{-1}[O].

step 3.1A1A2L4L6
4.3

Td\mathcal{T}_d is contained in the product topology: by [L6] it suffices that every ball Bd(x,r)B_d(x,r) be product-open, and for zBd(x,r)z \in B_d(x,r) the triangle inequality of step 3.2 gives Bd(z,rd(x,z))Bd(x,r)B_d(z, r - d(x,z)) \subseteq B_d(x,r) with rd(x,z)>0r - d(x,z) > 0, while step 3.3 supplies a basic product-open WW with zWBd(z,rd(x,z))z \in W \subseteq B_d(z, r - d(x,z)).

step 3.2step 3.3L6
5.1

The product topology is contained in Td\mathcal{T}_d: by step 4.2 every subbasic product-open set is dd-open, and Td\mathcal{T}_d is a topology containing them, hence contains the topology they generate, which is the product topology by [A1].

step 4.2A1L6
6.1

By steps 5.1 and 4.3 the metric topology of dd is the product topology on QQ, so QQ is metrizable; this is claim 3, and with steps 2.1 and 3.2 all three claims are proved.

step 2.1step 3.2step 5.1step 4.3

Remarks

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: 169 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