Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

Under the Axiom of Countable Choice, Baire sequence space is Polish, and its standard ultrametric is complete

Statement

On NN define d(x,y)=0 for x=y and d(x,y)=2−k when k is the least index with xk≠yk. Then d is a complete ultrametric inducing the cylinder topology. Assuming the Axiom of Countable Choice, Baire sequence space is separable and hence Polish.

Facts & Assumptions

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

[F1]

The Baire sequence space is N:=NN, the set of functions from N to itself (def-the-set-of-functions-from-one-set-to-another), with the product topology obtained by giving each copy of N the discrete topology (def-product-topology, def-standard-topologies). For a finite sequence s=(s0,…,sk−1), its cylinder is Ns:={x∈N:xi=si for i<k}. The empty sequence has cylinder N, and these cylinders form a basis. (Baire sequence space NN and its cylinder topology).

[F2]

A topological space is Polish when it is separable (def-separable-space) and completely metrizable: its topology is induced by some complete metric (lem-complete-remetrisation). No particular compatible complete metric or countable dense subset is part of the structure. (Polish spaces are separable completely metrizable spaces).

[F3]

Let (X,d) be a metric space (def-metric-space). (X,d) is complete if every Cauchy sequence in (X,d) converges to a point of X; a subset A⊆X is called complete when the metric subspace (A,dA) is complete. (Complete metric space: every Cauchy sequence converges in the space).

[F4]

Assume the Axiom of Countable Choice. Let (An)n∈N be a family of at most countable sets indexed by N. Then U=⋃n∈NAn is at most countable (Countable unions of at most countable sets, assuming ACω).

Proof

technique · direct
1.1givenF1F3

Give two unequal sequences distance 2−k where k is their first differing index.

2.1step 1.1F1F2

Verify the ultrametric and cylinder topology.

3.1step 2.1F4F1F2

A Cauchy sequence eventually stabilises in every coordinate, producing a limit; eventually constant sequences form a countable dense set.

4.1step 3.1F4

Check the zero-index convention at the first coordinate.

5.1step 4.1∎

The preceding construction and implications establish the assertion.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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