Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

Every separable metrizable space embeds in the Hilbert cube [0,1]N

Statement

Every separable metrizable space is homeomorphic to a subspace of the Hilbert cube [0,1]N.

Facts & Assumptions

Given: The objects, hypotheses, and choice principles stated above.

[F1]

A topological space X is separable if some at most countable subset DX is dense in X (def-dense-top, def-countable). Equivalently, every nonempty open subset of X meets D. (Separability: the existence of an at most countable dense subset).

[F2]

A topological space (X,T) (def-topological-space) is metrizable if there is a metric d on X (def-metric-space) whose metric topology is T, that is T=Td (def-metric-topology). Such a d is said to induce or metrise T. (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

[F3]

The product set. Let I be a set and let Xi be a set for each iI. The product is iIXi  :=  {x:x is a function with domain I and x(i)Xi for every iI}, and we write xi:=x(i), the i-th coordinate of x. Two elements of the product are equal exactly when they agree at every index, functions being equal when they have the same domain and the same values. For jI the j-th projection is πj:iIXiXj,πj(x):=xj.. The product topology TΠ on iXi is the initial topology of the projections: the topology generated by the subbasis {πi1[U]:iI, UTi}. Finite intersections of subbasic sets form a basis for it, and they are exactly the boxes iIUi with every Ui open in Xi and Ui=Xi for all but finitely many i. (The product set iIXi 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).

[F4]

Let (X,d) be a metric space (def-metric-space) and define, for x,yX, d(x,y):=min{d(x,y), 1},d(x,y):=d(x,y)1+d(x,y). Both are well defined: d(x,y)0 (lem-metric-nonnegativity), so 1+d(x,y)>0 and is invertible, and the minimum of a two-element set of reals exists (lem-finite-set-has-max, def-max-min). Then: 1. d and d are metrics on X. 2. d(x,y)1 and d(x,y)<1 for all x,y; hence (X,d) and (X,d) are bounded metric spaces (def-metric-bounded-diameter), and if X then diam(X)1 for both. 3. d and d are each uniformly equivalent to d, hence topologically equivalent to it (def-equivalent-metrics, thm-metric-equivalence-hierarchy). Consequently every metric space carries a bounded metric with exactly the same topology, so boundedness cannot be read off the topology alone. (min(d,1) and d/(1+d) are metrics uniformly equivalent to d, so every metric space carries a bounded metric with the same topology).

Proof

technique · direct
1.1

The empty space embeds by its unique map into the Hilbert cube.

givenF2F4F1
2.1

For a nonempty space choose a countable dense sequence and a bounded compatible metric.

step 1.1F4F2F1
3.1

Map a point to its bounded distances from the dense sequence.

step 2.1F4F1
4.1

The coordinates are continuous and separate points; if coordinate values converge, a coordinate centred close to the proposed point forces metric convergence.

step 3.1F4F2F3
5.1

Rescale the coordinate range to the unit interval and identify the induced topology with the product topology.

step 4.1F3F4F2
6.1

The preceding construction and implications establish the assertion.

step 5.1

Depends on

Used by

Dependency tree · next 3 levels

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