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 Dependent Choice, every nonempty Polish space is a continuous image of Baire sequence space

Statement

Assume Dependent Choice. Every nonempty Polish space is the image of a continuous surjection from Baire sequence space NN.

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 be a set and let RX×X be a binary relation on X. Call R entire on X when for every xX there is yX with xRy. The Axiom of Dependent Choice, written DC, is the following statement. The statement is: for every nonempty set X, every relation R entire on X, and every aX, there is a sequence x:NX with x0=a and xnRxn+1 for every nN. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F4]

Let (X,d) be a metric space (def-metric-space). Call a sequence (Fk)kN of subsets of X a Cantor chain if every Fk is nonempty, closed (def-metric-topology) and bounded, Fk+1Fk for every k, and diam(Fk)0 in R (def-metric-bounded-diameter, def-real-limit). Then: 1. If (X,d) is complete (def-complete-metric-space), every Cantor chain in X has an intersection kNFk with exactly one element. 2. Conversely, if every Cantor chain in X has nonempty intersection, then (X,d) is complete. Boundedness of each Fk is part of the definition of a Cantor chain because diam is defined for nonempty bounded sets only in this library (def-metric-bounded-diameter); it is not an extra hypothesis but the precondition for writing the diameter condition down. (In a complete metric space nested nonempty closed sets whose diameters tend to 0 meet in exactly one point, and this property characterises completeness).

[F5]

Let (X,d) be a metric space (def-metric-space), let xX and let rR with r>0 (def-real-order). Define B(x,r):={yX:d(x,y)<r},Bˉ(x,r):={yX:d(x,y)r},S(x,r):={yX:d(x,y)=r}. B(x,r) is the open ball, Bˉ(x,r) the closed ball and S(x,r) the sphere of centre x and radius r. The radius is always a strictly positive real; a ball of radius 0 or of negative radius is never written in this library. (Open ball, closed ball and sphere in a metric space).

Proof

technique · direct
1.1

Choose a compatible complete metric and recursively refine each nonempty open set into a countable cover by open sets whose closures remain inside the parent and whose diameters tend to zero.

givenF4F2F5
2.1

An infinite branch determines one point by completeness, giving a continuous map from Baire space.

step 1.1F1F2F4
3.1

For a prescribed target point, dependent choice selects a nested branch containing it, proving surjectivity.

step 2.1F3
4.1

Nonemptiness is necessary because the domain is nonempty.

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: 100 results over 17 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