Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-09-10 (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.

Closed subspaces of complete metric spaces are complete; the converse under countable choice

Statement

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

  1. Under countable choice ACω (The Axiom of Countable Choice (ACω)), if (A,dA) is complete (Complete metric space: every Cauchy sequence converges in the space), then A is closed in (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 completeness hypothesis on X is needed.
  2. In ZF, without a choice axiom, if (X,d) is complete and A is closed in (X,d), then (A,dA) is complete.

Consequently, under countable choice, a subspace of a complete metric space is complete if and only if it is closed.

The following form of the first direction is also choice-free: a complete subspace contains the ambient limit of every convergent sequence of its points. Hence it is closed whenever every point of its ambient closure is already known to be the limit of a sequence from that subspace. This last condition is pointwise existence, not a chosen family of sequences.

Facts & Assumptions

Given: A metric space (X,d) and a subset A⊆X with the subspace metric dA=d↾(A×A).

[A1]

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

[A2]

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

[L1]

Distances inside A are computed in X: dA(a,b)=d(a,b) for a,b∈A (Isometry, isometric embedding, and the subspace metric on a subset). Hence a sequence in A is dA-Cauchy exactly when it is d-Cauchy, and for p∈A it converges to p in (A,dA) exactly when it converges to p in (X,d) (Cauchy sequence in a metric space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R).

[L2]

Under countable choice, each point of A‾ is the limit of a sequence from A (A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed, claim 1, sequence-manufacturing direction). In ZF, a closed set contains the limit of every ambient-convergent sequence of its points (the same theorem, proof step 2.2). We do not use the converse characterization of closed sets without its choice hypothesis.

[A3]

Countable choice is assumed only for claim 1: a sequence of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

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

[L5]

By the ball definition of closure, A⊆A‾, and if A‾⊆A then every point outside A has a ball disjoint from A, so A is closed (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, 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).

Proof

technique · direct
1.1

First work without choice: assume [A1] and let (ak) be any sequence of points of A which converges to x∈X. We will prove x∈A for this already given sequence.

A1given
1.2

For claim 2, assume [A2], assume A closed, and let (ak) be a dA-Cauchy sequence in A; by [L1] it is d-Cauchy in X, so by [A2] it converges in (X,d) to some x∈X.

A2L1
2.1

That sequence is d-Cauchy by [L3], hence dA-Cauchy by [L1], since all its terms lie in A.

step 1.1L1L3
2.2

The sequence lies in A and converges in X, and A is closed, so x∈A by [L2]; by [L1] the sequence then converges to x in (A,dA), and x∈A, so (A,dA) is complete. This is claim 2.

step 1.2L1L2
3.1

By [A1] it therefore converges in (A,dA) to some a∈A, and by [L1] it converges to a in (X,d) as well.

step 2.1A1L1
4.1

The sequence converges in (X,d) both to x and to a, so x=a∈A by [L4]. Thus a complete subspace contains all ambient limits of sequences of its points, in ZF. In particular, if each x∈A‾ is already known to admit such a sequence, applying this argument to one fixed x at a time gives A‾⊆A, and [L5] makes A closed without choosing a family of sequences.

step 1.1step 3.1L4L5
5.1

Now assume [A3] as well as [A1], and fix x∈A‾. The proof of [L2] applies [A3] to the nonempty sets A∩B(x,1/(k+1)), producing a sequence from A that converges to x. Step 4.1 gives x∈A, so [L5] gives closedness. This proves claim 1 under countable choice. Claim 2 was proved in step 2.2 without [A3]; combining these directions gives the stated equivalence under countable choice. If A is empty, it is closed and has no Cauchy sequences, so all relevant conclusions hold vacuously as well.

A1A3L2L5step 4.1step 2.2∎

Remarks

Depends on

Used by

Dependency tree · two levels

43 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