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 Dependent Choice, a subspace of a Polish space is Polish exactly when it is Gδ

Statement

Assume Dependent Choice, which yields the instances of Countable Choice used below. A subspace of a Polish space is Polish if and only if it is a Gδ subset.

Facts & Assumptions

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

[F1]

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).

[F2]

Assume Dependent Choice. For a subspace Y of a complete metric space X, Y is completely metrizable if and only if Y is a Gδ subset of X. (Alexandrov's theorem, under Dependent Choice: a subspace of a complete metric space is completely metrizable exactly when it is Gδ).

[F3]

Every subspace of a second countable space is second countable. (Second countability is hereditary).

[F4]

Assuming ACω, every second countable space is separable. (Assuming countable choice, every second countable space is separable).

[F5]

Assume the Axiom of Countable Choice. For a completely metrizable space, separability is equivalent to second countability. Thus either countability convention gives the same notion of Polish space. (For completely metrizable spaces, the separable and second-countable definitions of Polish space agree under countable choice).

Proof

technique · direct
1.1givenF2F1F5

Alexandrov gives the complete-metrizability equivalence.

2.1step 1.1F3F4F1

A subspace of a second-countable space is second countable, hence separable under the stated choice hypothesis, while every subspace already inherits metrizability.

3.1step 2.1F3

Combine these facts in both directions.

4.1step 3.1∎

The preceding construction and implications establish the assertion.

Depends on

Used by

Dependency tree · two levels

16 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