Alphabeta Math
RemarkRemark: AI-generatedProof: Not applicableverified 2026-09-26 (gpt-6-sol)
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.

Completeness belongs to the metric; complete metrizability is characterised on a later page

Orientation

This page has proved that completeness is a property of the metric and not of the topology it induces: two metrics on one set can have exactly the same open sets while only one of them is complete (FALSE: completeness of a metric space is determined by its topology, Complete metric space: every Cauchy sequence converges in the space, Topologically, uniformly and Lipschitz equivalent metrics on a set). That leaves an obvious question, and this remark says what the question is, what the page now answers, and what it does not.

The question. Given the open sets, is there some metric inducing them that is complete? A topology for which the answer is yes is called completely metrizable, and that is the definition made precise in Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and (0,∞) has it without being complete. Unlike completeness, this really is a property of the open sets alone: the metric is quantified over (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), so a homeomorphism transports it — which is claim 1 of that lemma. It is the topological shadow that completeness casts, and it is strictly weaker than "carries this particular complete metric".

What this page now settles. Two of the three facts below are discharged by Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and (0,∞) has it without being complete; the third is not, and says so.

What this early page does not prove. The later published page complete-metrizability-and-baire proves the qualified Alexandrov characterisation: assuming Dependent Choice, a subspace of a complete metric space is completely metrizable exactly when it is a Gδ subset (Alexandrov's theorem, under Dependent Choice: a subspace of a complete metric space is completely metrizable exactly when it is Gδ ↗). Its published subspace corollary proves the open and closed cases directly, and the general Gδ case under DC (Open and closed subspaces of a completely metrizable space are completely metrizable, and under Dependent Choice so is every Gδ subspace ↗). This early page has not yet developed countable intersections of open sets, the Baire category theorem, or the convergent-series remetrisation used later; 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 here supplies only the metric topology as a collection of subsets. Beyond the three claims of Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and (0,∞) has it without being complete, "completely metrizable" is not used here as a proof tool.

How to read the rest of the library in the meantime. Every statement of the form "X is complete" in this library is a statement about a named metric on X, and it never means "X has a complete metric". Where the distinction matters, the metric is written out. This is the same discipline as for the word bounded, which is also metric and not topological (Topologically, uniformly and Lipschitz equivalent metrics on a set).

Remarks

Depends on

Dependency tree · 2 levels

Sources