Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

A subspace of a complete metric space is complete iff it is closed, and a complete subspace of any metric space is closed

Statement

Let (X,d)(X,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let AXA \subseteq X carry the subspace metric dAd_A (Isometry, isometric embedding, and the subspace metric on a subset). Then:

  1. If (A,dA)(A,d_A) is complete (Complete metric space: every Cauchy sequence converges in the space), then AA is closed in (X,d)(X,d) (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). No hypothesis on XX is needed.
  2. If (X,d)(X,d) is complete and AA is closed in (X,d)(X,d), then (A,dA)(A,d_A) is complete.

Consequently, for a complete (X,d)(X,d) a subset AXA \subseteq X is complete if and only if it is closed.

Facts & Assumptions

Given: A metric space (X,d)(X,d) and a subset AXA \subseteq X with the subspace metric dA=d(A×A)d_A = d \restriction (A \times A).

[A1]

Completeness of (A,dA)(A,d_A): every dAd_A-Cauchy sequence in AA converges in (A,dA)(A,d_A) to a point of AA (Complete metric space: every Cauchy sequence converges in the space, Cauchy sequence in a metric space).

[A2]

Completeness of (X,d)(X,d): every dd-Cauchy sequence in XX converges in (X,d)(X,d) to a point of XX (Complete metric space: every Cauchy sequence converges in the space).

[L1]

Distances inside AA are computed in XX: dA(a,b)=d(a,b)d_A(a,b) = d(a,b) for a,bAa,b \in A (Isometry, isometric embedding, and the subspace metric on a subset). Hence a sequence in AA is dAd_A-Cauchy exactly when it is dd-Cauchy, and for pAp \in A it converges to pp in (A,dA)(A,d_A) exactly when it converges to pp in (X,d)(X,d) (Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}).

[L2]

A point lies in A\overline{A} if and only if some sequence in AA converges to it in (X,d)(X,d); and a subset FXF \subseteq X is closed if and only if every sequence in FF converging in XX has its limit in FF (A point lies in the closure of AA iff some sequence in AA converges to it, and a set is closed iff it is sequentially closed, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space). The first claim, in the direction that manufactures a sequence, spends the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L3]

A convergent sequence in a metric space is Cauchy (Every convergent sequence in a metric space is Cauchy).

[L4]

Limits in a metric space are unique (A sequence in a metric space has at most one limit).

Proof

technique · direct
1.1

For claim 1, assume [A1] and let xAx \in \overline{A}; by [L2] there is a sequence (ak)(a_k) with akAa_k \in A for every kk and akxa_k \to x in (X,d)(X,d).

A1L2
1.2

For claim 2, assume [A2], assume AA closed, and let (ak)(a_k) be a dAd_A-Cauchy sequence in AA; by [L1] it is dd-Cauchy in XX, so by [A2] it converges in (X,d)(X,d) to some xXx \in X.

A2L1
2.1

That sequence is dd-Cauchy by [L3], hence dAd_A-Cauchy by [L1], since all its terms lie in AA.

step 1.1L1L3
2.2

The sequence lies in AA and converges in XX, and AA is closed, so xAx \in A by [L2]; by [L1] the sequence then converges to xx in (A,dA)(A,d_A), and xAx \in A, so (A,dA)(A,d_A) is complete. This is claim 2.

step 1.2L1L2
3.1

By [A1] it therefore converges in (A,dA)(A,d_A) to some aAa \in A, and by [L1] it converges to aa in (X,d)(X,d) as well.

step 2.1A1L1
4.1

The sequence converges in (X,d)(X,d) both to xx and to aa, so x=aAx = a \in A by [L4]; as xAx \in \overline{A} was arbitrary, AA\overline{A} \subseteq A, hence A=A\overline{A} = A and AA is closed. This is claim 1.

step 1.1step 3.1L4L5
5.1

Claims 1 and 2 hold, by steps 4.1 and 2.2; for a complete (X,d)(X,d) they combine into the stated equivalence.

step 4.1step 2.2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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