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 compact subset of a metric space is closed and bounded

Statement

Facts & Assumptions

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

[L1]

KK 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 KiIUiK \subseteq \bigcup_{i \in I} U_i there are nNn \in \mathbb{N} and i0,,inIi_0, \dots, i_n \in I with KUi0UinK \subseteq U_{i_0} \cup \dots \cup U_{i_n}, or else K=K = \emptyset (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, Open cover, subcover, compact metric space, and compact subset of a metric space).

[L2]

For pxp \ne x in XX and r:=d(p,x)/2r := d(p,x)/2 one has r>0r > 0 and B(p,r)B(x,r)=B(p,r) \cap B(x,r) = \emptyset (Distinct points of a metric space have disjoint balls around them).

[L4]

A nonempty finite set of reals has a maximum and a minimum, each one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L5]

A subset is bounded when it is empty or contained in some ball B(x0,r)B(x_0,r) with r>0r > 0; and B(x0,s)B(x0,r)B(x_0,s) \subseteq B(x_0,r) whenever 0<sr0 < s \le r (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Open ball, closed ball and sphere in a metric space).

Proof

technique · direct
1.1

If K=K = \emptyset then KK is bounded by the first clause of the definition, and it is closed because XK=XX \setminus K = X is open.

L3L5
1.2

Assume from now on that KK \ne \emptyset and fix pKp \in K; the family (B(p,r))rP(B(p,r))_{r \in P} indexed by the set PP of positive reals consists of open sets and covers KK, since every xKx \in K satisfies d(p,x)<d(p,x)+1d(p,x) < d(p,x) + 1 and so lies in B(p,d(p,x)+1)B(p, d(p,x)+1).

L3L5
2.1

The indexed characterisation gives nNn \in \mathbb{N} and positive reals r0,,rnr_0, \dots, r_n with KB(p,r0)B(p,rn)K \subseteq B(p,r_0) \cup \dots \cup B(p,r_n); putting R:=max{r0,,rn}R := \max\{r_0, \dots, r_n\}, a positive real, the balls with common centre pp are nested, so KB(p,R)K \subseteq B(p,R) and KK is bounded.

L1L4L5step 1.2
3.1

Boundedness being settled, take up closedness: let qXKq \in X \setminus K and for each xKx \in K put rx:=d(q,x)/2r_x := d(q,x)/2, which is a positive real because qxq \ne x, and which satisfies B(q,rx)B(x,rx)=B(q,r_x) \cap B(x,r_x) = \emptyset.

L2step 2.1
4.1

The family (B(x,rx))xK(B(x,r_x))_{x \in K} consists of open subsets of XX and covers KK, since xB(x,rx)x \in B(x,r_x); so there are nNn \in \mathbb{N} and x0,,xnKx_0, \dots, x_n \in K with KB(x0,rx0)B(xn,rxn)K \subseteq B(x_0, r_{x_0}) \cup \dots \cup B(x_n, r_{x_n}).

L1L3step 3.1
5.1

Put r:=min{rx0,,rxn}r := \min\{r_{x_0}, \dots, r_{x_n}\}, a positive real.

L4step 4.1
6.1

Then B(q,r)K=B(q,r) \cap K = \emptyset: a point yy of the intersection would lie in B(xi,rxi)B(x_i, r_{x_i}) for some ini \le n by step 4.1, and also in B(q,r)B(q,rxi)B(q,r) \subseteq B(q, r_{x_i}) by step 5.1, whereas those two balls are disjoint by step 3.1.

L5step 3.1step 4.1step 5.1
7.1

So every point of XKX \setminus K has a ball around it inside XKX \setminus K, that set is open, and KK is closed; together with steps 1.1 and 2.1 this proves the theorem.

L3step 1.1step 2.1step 6.1

Remarks

Both conclusions use compactness through the same characterisation. The first cover is by concentric balls of every positive radius, which is what boundedness is about; the second is by balls small enough to keep a fixed outside point away, which is what closedness is about. In each case what compactness returns is a finite list of indices, and a maximum or a minimum of finitely many positive reals then does the rest.

Hausdorffness is what makes the second argument work, and every metric space has it (Distinct points of a metric space have disjoint balls around them). The statement is false for topological spaces without that separation property, which is why the proof cites the separation lemma rather than the metric axioms directly.

Depends on

Used by

Dependency tree · next 3 levels

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