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

[F1]

Let (X,d) be a metric space (def-metric-space) and let Td be its metric topology (def-metric-topology). Call Td completely metrizable if some metric ρ on X is topologically equivalent to d, that is Tρ=Td (def-equivalent-metrics), and makes (X,ρ) complete (def-complete-metric-space). Then: 1. Homeomorphism invariance. Let (Y,e) be a metric space and let h:XY be a bijection (def-injection-surjection-bijection) such that h and h1 are continuous (def-metric-continuity). If Td is completely metrizable then so is Te. 2. Closed subspaces. If Td is completely metrizable and AX is closed in (X,d), then TdA is completely metrizable, dA being the subspace metric (def-isometry-and-metric-embedding). 3. The property is strictly weaker than completeness. Let P:=(0,)R (def-interval) carry d(x,y):=xy (lem-real-line-is-a-metric-space). Then (P,d) is not complete, while ρP(x,y)  :=  xy  +  1x1y is a complete metric on P with TρP=Td. So Td is completely metrizable although no completeness assumption holds for d itself. Complete metrizability is a condition on the collection of open sets alone: the metric is quantified over and does not survive into the statement. That is exactly what completeness fails to be, and claim 3 shows the two conditions are genuinely different rather than merely stated differently. (Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and (0,) has it without being complete).

[F2]

Let (X,T) be a topological space (def-topological-space) and let AX. A is a Gδ set of X when there is a sequence (Vn)nN of open subsets of X with A=nNVn, and an Fσ set of X when there is a sequence (Fn)nN of closed subsets of X with A=nNFn. (Gδ and Fσ subsets of a topological space, agreeing with the real-line notion).

[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) and let p,qX with pq. Put r:=d(p,q)/2. Then r>0 and B(p,r)B(q,r)=. Both sets are open (thm-metric-open-set-algebra) and contain p respectively q (def-metric-ball), so every metric space is Hausdorff: distinct points are separated by disjoint open sets (def-metric-topology). (Distinct points of a metric space have disjoint balls around them).

Proof

technique · direct
1.1

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

givenF4F1F2
2.1

Let ρ be a compatible complete metric on the nonempty subspace Y and let d be the ambient metric. For n1 call an ambient open V n-small when VY, diamd(V)<1/n, and diamρ(VY)<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 yY 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.

step 1.1F1F4
3.1

Let xYn1Gn. For each n pick an n-small Vn with xVn and put Wn:=V1Vn, an ambient open neighbourhood of x with WnVn, so diamd(Wn)<1/n and diamρ(WnY)<1/n; the Wn decrease. Then pick ynWnY, which is nonempty because xY 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,ynWn and diamd(Wn)<1/n, the points yn converge to x in d. For m,nN both ym and yn lie in WNY, so ρ(ym,yn)<1/N and the sequence is ρ-Cauchy; completeness of ρ gives it a ρ-limit in Y.

step 2.1F1F4F3
4.1

Hausdorff uniqueness puts the point back in the subspace.

step 3.1F4F1
5.1

The preceding construction and implications establish the assertion.

step 4.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 107 results over 16 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