Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)
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 completely metrizable subspace of a metric space is Gδ

Statement

Assume Dependent Choice. If Y is a completely metrizable subspace of a metric space X, then Y is a Gδ subset of X.

Facts & Assumptions

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

[F2]

A Gδ set is a countable intersection of open sets. (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion)

[F3]

Dependent Choice gives a sequence of successive extensions whenever every finite admissible history has an extension. Apply its entire-relation form to the set of those histories, beginning with the empty history. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

[F5]

For each real r>0 there is an integer n≥1 with 1/n<r. (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε)

Proof

technique · direct
1.1givenF4F1F2

The empty subspace is the constant countable intersection of the ambient open set ∅.

2.1step 1.1F1F4

Let ρ be a compatible complete metric on the nonempty subspace Y and let d be the ambient metric. For n≥1 call an ambient open V n-small when V∩Y≠∅, diam⁡d(V)<1/n, and diam⁡ρ(V∩Y)<1/n. Both conditions are imposed, and neither may be dropped: ρ-smallness alone controls distances measured in ρ but says nothing about ambient distances, so it cannot force a point of Y to be near a prescribed ambient point, while ambient smallness alone gives no ρ-control and so cannot invoke completeness of ρ. Every y∈Y lies in some n-small V, because ρ induces the subspace topology, so a ρ-ball of radius below 1/2n about y contains Bd(y,r)∩Y for some r>0, and r may be shrunk below 1/2n. Let Gn be the union of all n-small ambient open sets, an ambient open set containing Y.

3.1

Every x∈⋂n≥1Gn lies in Y‾. [step 2.1, F5] Indeed, given r>0, choose n≥1 with 1/n<r. There is an n-small open V containing x, and some y∈V∩Y. Then d(x,y)<1/n<r. Thus every ambient ball about x meets Y. This uses only finitely many choices for each fixed r, not a selected sequence.

3.2step 2.1F1F4F3

Let x∈Y‾∩⋂n≥1Gn. For each n pick an n-small Vn with x∈Vn and put Wn:=V1∩⋯∩Vn, an ambient open neighbourhood of x with Wn⊆Vn, so diam⁡d(Wn)<1/n and diam⁡ρ(Wn∩Y)<1/n; the Wn decrease. Then pick yn∈Wn∩Y, which is nonempty because x∈Y‾ and Wn is an ambient neighbourhood of x. The selection over n is a recursion whose nth admissible set depends on the previous choices, so it is licensed by the Dependent Choice of [F3]. Since x,yn∈Wn and diam⁡d(Wn)<1/n, the points yn converge to x in d. For m,n≥N both ym and yn lie in WN∩Y, so ρ(ym,yn)<1/N and the sequence is ρ-Cauchy; completeness of ρ gives it a ρ-limit in Y.

4.1

Let y∈Y be the ρ-limit from step 3.2. [step 3.2, F4, F1] The compatible topologies make yn converge to y in the subspace d-metric, hence in X. It also converges to x. If x≠y, disjoint open neighbourhoods from [F4] would both contain every sufficiently late yn, a contradiction. Hence x=y∈Y.

5.1

Therefore Y=⋂n≥1Gn. [step 2.1, step 3.1, step 4.1, F2] Reindexing by n+1 gives a sequence indexed from zero as in [F2], so Y is Gδ in X. The only countable selection is the stated DC use in step 3.2; the empty case was handled in step 1.1. ∎

Depends on

Used by

Dependency tree · two levels

50 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