Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Closed subspaces, products, and Baire parametrization

Statement

In ZFC, finite products and closed subspaces of Polish spaces are Polish. Every nonempty Polish space is a continuous image of N=NN. No surjection from N onto the empty space is asserted.

Proof

Given: The stated spaces and ZFC assumptions.

1.1

For two nonempty Polish spaces choose compatible complete metrics d,e and countable dense sets D,E by F1. On the product put q((x,y),(x,y))=d(x,x)+e(y,y). Each product neighbourhood contains a q-ball, and each q-ball contains the product of two coordinate balls of half its radius, so this is F3's topology. A q-Cauchy sequence is Cauchy in both coordinates; its coordinate limits exist and converge in q by addition of the two distance bounds. The countable set D×E meets each nonempty basic product open, so is dense. Thus the product is Polish. Iterate for finitely many factors. An empty factor gives the empty space, which has the empty complete metric and empty dense set; the product of no factors is a singleton with zero metric.

F1F3
1.2

For a closed YX, a Cauchy sequence in the restricted complete metric converges in X; its limit is in Y, since otherwise the open complement would contain a ball eventually containing the sequence. To prove separability, enumerate an ambient countable metric basis using dense centres and positive rational radii. Its nonempty traces form a countable basis on Y. A1 selects a point from each such trace; the selected set is countable and meets every nonempty relative open. If Y is empty no selection is needed. This proves F1 for the closed subspace.

F1A1
1.3

Now let X. Fix a complete metric and a dense sequence, and put U=X. For each nonempty open Us enumerate all balls with dense-sequence centres and positive rational radii whose closures are contained in Us and whose diameters are at most 2s1. They cover Us: for xUs choose ϵ>0 with B(x,ϵ)Us and small enough for the diameter bound; a dense centre sufficiently close to x and a sufficiently small rational radius yield such a ball containing x, with its closed ball inside B(x,ϵ). The family is nonempty and countable; enumerate its indices increasingly, repeating the first if the list is finite. Set these balls to be Usn. Length recursion constructs all the nonempty opens with UsnUs.

F1
2.1

For aN, the centres of Uan for n1 form a Cauchy sequence: after stage n they lie in the same set of diameter at most 2n. Completeness gives a limit f(a). For every n, the tail lies in Ua(n+1), so the limit lies in its closure, which is contained in Uan. Shrinking diameters show this is the only point in all those opens. For each xX, recursively take the least child containing x, possible by their covering property; then x is that branch's unique limit. Thus f is onto. Inputs sharing n coordinates have images in Uan and at distance at most 2n, proving continuity with F2's cylinders. QED.

F1F2step 1.3

Depends on

Used by

Dependency tree · two levels

17 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