Alphabeta Math
LemmaStatement: 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 closed subset of a compact metric space is compact

Facts & Assumptions

Given: A compact metric space (X,d)(X,d) and a closed subset FXF \subseteq X.

[L1]

(X,d)(X,d) is compact: every family of open subsets of XX with union XX has a finite subfamily with union XX (Open cover, subcover, compact metric space, and compact subset of a metric space).

[L2]

A subset AXA \subseteq X is a compact subset exactly when for every set II and every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with AiIUiA \subseteq \bigcup_{i \in I} U_i there are nNn \in \mathbb{N} and i0,,inIi_0, \dots, i_n \in I with AUi0UinA \subseteq U_{i_0} \cup \dots \cup U_{i_n}, or else A=A = \emptyset; and XX is a compact subset of itself, its subspace metric being dd (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it, Isometry, isometric embedding, and the subspace metric on a subset).

Proof

technique · direct
1.1

XFX \setminus F is open in XX.

L3
1.2

By the ambient characterisation it suffices to show that every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with FiIUiF \subseteq \bigcup_{i \in I} U_i has finitely many members whose union contains FF, or that F=F = \emptyset; so fix such a family.

L2suffices: finitely many members cover F
2.1

Take an object \ast not in II, put I+:=I{}I^{+} := I \cup \{\ast\} and U:=XFU_{\ast} := X \setminus F; then (Ui)iI+(U_i)_{i \in I^{+}} is a family of open subsets of XX whose union is XX, since a point outside FF lies in UU_{\ast} and a point of FF lies in some UiU_i with iIi \in I.

L1L2step 1.1step 1.2
3.1

Applying the ambient characterisation to the compact subset XX of itself gives nNn \in \mathbb{N} and j0,,jnI+j_0, \dots, j_n \in I^{+} with X=Uj0UjnX = U_{j_0} \cup \dots \cup U_{j_n}, unless X=X = \emptyset, in which case F=F = \emptyset and there is nothing to prove.

L2step 2.1
4.1

Delete from the list j0,,jnj_0, \dots, j_n every entry equal to \ast; what remains is a finite list of indices from II, possibly empty, and the union of the corresponding sets still contains FF, because U=XFU_{\ast} = X \setminus F contains no point of FF while every point of FF lies in one of the listed sets.

step 3.1
5.1

If that remaining list is empty then F=F = \emptyset, and otherwise it exhibits finitely many members of (Ui)iI(U_i)_{i \in I} whose union contains FF; in both cases the condition of step 1.2 is met, so FF is a compact subset of XX.

L2step 1.2step 4.1

Remarks

The hypothesis that XX is compact cannot be dropped, and neither can closedness. A closed subset of a non-compact space need not be compact: the whole space is closed in itself. And a non-closed subset of a compact space need not be compact, since a compact subset of any metric space is closed (A compact subset of a metric space is closed and bounded).

Why the augmented family is the whole trick. The set FF is covered by the UiU_i, but XX need not be; adjoining the single open set XFX \setminus F repairs that at no cost, and it is the only member of the resulting finite subcover that has to be discarded again at the end.

Depends on

Used by

Dependency tree · next 3 levels

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