Alphabeta Math
LemmaStatement: 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.

Every open subspace of a completely metrizable space is completely metrizable

Statement

If X is completely metrizable and UX is open, then U is completely metrizable in its subspace topology.

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,d) be a metric space (def-metric-space), let AX be nonempty and let x,yX. Then d(x,A)d(y,A)d(x,y), with d(,A) the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function ud(u,A) changes by at most d(u,v) between u and v: it is 1-Lipschitz. (d(x,A)d(y,A)d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz).

[F3]

Let (X,d) be a metric space (def-metric-space) and let AX carry the subspace metric dA (def-isometry-and-metric-embedding). Then: 1. If (A,dA) is complete (def-complete-metric-space), then A is closed in (X,d) (def-metric-topology). No hypothesis on X is needed. 2. If (X,d) is complete and A is closed in (X,d), then (A,dA) is complete. Consequently, for a complete (X,d) a subset AX is complete if and only if it is closed. (A subspace of a complete metric space is complete iff it is closed, and a complete subspace of any metric space is closed).

Proof

technique · direct
1.1

If the open subspace is empty, its unique metric is compatible and complete.

givenF1F3F2
2.1

Otherwise choose a compatible complete metric.

step 1.1F1F3F2
3.1

If the open set is the whole space, restrict that metric.

step 2.1F1F3F2
4.1

In the remaining case add to the restricted metric the absolute difference of reciprocals of the distance to the nonempty closed complement.

step 3.1F1F3F2
5.1

A Cauchy sequence for the new metric cannot approach the complement and therefore converges inside the open set.

step 4.1F1F3F2
6.1

The preceding construction and implications establish the assertion.

step 5.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 79 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