Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-09-23 (gpt-6-sol)
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 D⊆X 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 i∈I. The product is ∏i∈IXi  :=  { x:x is a function with domain I and x(i)∈Xi for every i∈I }, 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 j∈I the j-th projection is πj:∏i∈IXi→Xj,πj(x):=xj.. The product topology TΠ on ∏iXi is the initial topology of the projections: the topology generated by the subbasis {πi−1[U]:i∈I, U∈Ti}. Finite intersections of subbasic sets form a basis for it, and they are exactly the boxes ∏i∈IUi with every Ui open in Xi and Ui=Xi for all but finitely many i. (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).

[F4]

Let (X,d) be a metric space (def-metric-space) and define, for x,y∈X, 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.1given

The empty space embeds by its unique map into the Hilbert cube. Hence suppose X≠∅.

1.2F1F2F4choose

Choose a metric d inducing the topology of X and put ρ(x,y)=min⁡{d(x,y),1}. By [F4], ρ is a metric with the same topology and values in [0,1]. Choose an at most countable dense set D from [F1]. Since X≠∅, enumerate D as a sequence (an)n∈N, repeating an element if D is finite.

2.1step 1.2F3algebra

Define e:X→[0,1]N by e(x)n=ρ(x,an). For each n, the triangle inequality gives ∣e(x)n−e(y)n∣≤ρ(x,y), so every coordinate is continuous. In the product topology of [F3], inverse images of subbasic coordinate-open sets are therefore open; hence e is continuous.

3.1step 1.2step 2.1F1choose

If x≠y, set δ=ρ(x,y)>0 and choose an with ρ(x,an)<δ/3. The triangle inequality gives e(y)n=ρ(y,an)>2δ/3, while e(x)n<δ/3. Thus e(x)≠e(y) and e is injective.

4.1step 1.2step 2.1step 3.1F1F3algebra

Fix x∈X and ε>0. Choose an with ρ(x,an)<ε/4. The set W={z∈e(X):∣zn−e(x)n∣<ε/2} is open in the subspace e(X) by [F3]. If e(y)∈W, then ρ(y,x)≤ρ(y,an)+ρ(an,x)<ε/2+2ρ(x,an)<ε. Consequently e−1(W)⊆Bρ(x,ε), so the inverse e−1:e(X)→X is continuous at every e(x).

5.1step 1.1step 2.1step 3.1step 4.1∎

Steps 2.1--4.1 make e a homeomorphism of X onto the subspace e(X) of [0,1]N. Together with step 1.1 this covers every separable metrizable space.

Depends on

Used by

Dependency tree · two levels

48 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