Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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)=2k when k is the least index with xkyk. 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,,sk1), its cylinder is Ns:={xN: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 AX 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)nN be a family of at most countable sets indexed by N. Then U=nNAn is at most countable (Countable unions of at most countable sets, assuming ACω).

Proof

technique · direct
1.1

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

givenF1F3
2.1

Verify the ultrametric and cylinder topology.

step 1.1F1F2
3.1

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

step 2.1F4F1F2
4.1

Check the zero-index convention at the first coordinate.

step 3.1F4
5.1

The preceding construction and implications establish the assertion.

step 4.1

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: 95 results over 19 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