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 . No surjection from onto the empty space is asserted.
Facts & Assumptions
Polish spaces are separable completely metrizable spaces means separable and admitting a compatible complete metric.
Cantor and Baire sequence spaces and coordinate codings supplies the Polish Baire space and its cylinder topology.
The product set 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 defines the product topology by finite coordinate restrictions.
Assume The Axiom of Choice.
Proof
Given: The stated spaces and ZFC assumptions.
For two nonempty Polish spaces choose compatible complete metrics and countable dense sets by F1. On the product put . 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 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.
For a closed , a Cauchy sequence in the restricted complete metric converges in ; its limit is in , 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 . A1 selects a point from each such trace; the selected set is countable and meets every nonempty relative open. If is empty no selection is needed. This proves F1 for the closed subspace.
Now let . Fix a complete metric and a dense sequence, and put . For each nonempty open enumerate all balls with dense-sequence centres and positive rational radii whose closures are contained in and whose diameters are at most . They cover : for choose with and small enough for the diameter bound; a dense centre sufficiently close to and a sufficiently small rational radius yield such a ball containing , with its closed ball inside . The family is nonempty and countable; enumerate its indices increasingly, repeating the first if the list is finite. Set these balls to be . Length recursion constructs all the nonempty opens with .
For , the centres of for form a Cauchy sequence: after stage they lie in the same set of diameter at most . Completeness gives a limit . For every , the tail lies in , so the limit lies in its closure, which is contained in . Shrinking diameters show this is the only point in all those opens. For each , recursively take the least child containing , possible by their covering property; then is that branch's unique limit. Thus is onto. Inputs sharing coordinates have images in and at distance at most , proving continuity with F2's cylinders. QED.
Depends on
- Polish spaces are separable completely metrizable spaces
- Cantor and Baire sequence spaces and coordinate codings
- The product set $\prod_{i \in I} X_i$ 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
- The Axiom of Choice
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.