Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

In any metric space the range of a convergent sequence together with its limit is compact, worked out for {0}{1/(k+1):kN}\{0\} \cup \{1/(k+1) : k \in \mathbb{N}\} in R\mathbb{R}

Example

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), let (xk)(x_k) be a sequence in XX converging to pXp \in X (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}, Sequences of reals: bounded, eventually, frequently, tails, subsequences), and put

K  :=  {xk:kN}{p}.K \;:=\; \{\, x_k : k \in \mathbb{N} \,\} \cup \{p\}.

Then KK is a compact subset of XX (Open cover, subcover, compact metric space, and compact subset of a metric space).

In R\mathbb{R} with the usual metric (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded) the sequence xk:=1/(k+1)x_k := 1/(k+1) converges to 00, so {0}{1/(k+1):kN}\{0\} \cup \{\, 1/(k+1) : k \in \mathbb{N} \,\} is compact. The index is written k+1k+1 because N\mathbb{N} contains 00 and 1/01/0 is undefined (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Dropping the limit destroys compactness: the range alone is not closed in R\mathbb{R}, and a compact subset is closed (A compact subset of a metric space is closed and bounded).

Facts & Assumptions

Given: A metric space (X,d)(X,d), a sequence (xk)(x_k) in XX with xkpXx_k \to p \in X, and K:={xk:kN}{p}K := \{x_k : k \in \mathbb{N}\} \cup \{p\}.

[L1]

AXA \subseteq X is compact exactly when every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with AiIUiA \subseteq \bigcup_{i \in I}U_i has finitely many members whose union contains AA, or A=A = \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]

xkpx_k \to p means: for every rational ε>0\varepsilon > 0 there is K0NK_0 \in \mathbb{N} with d(xk,p)<εd(x_k,p) < \varepsilon for all kK0k \ge K_0 (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}).

[L4]

A function with domain a natural number all of whose values are nonempty sets has a choice function, in ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

Verification

technique · direct
1.1

Let (Ui)iI(U_i)_{i \in I} be a family of open subsets of XX with KiIUiK \subseteq \bigcup_{i \in I} U_i.

L1
2.1

Since pKp \in K there is iIi^{\ast} \in I with pUip \in U_{i^{\ast}}, and openness gives a real r>0r > 0 with B(p,r)UiB(p,r) \subseteq U_{i^{\ast}}.

L3step 1.1
3.1

Taking a positive rational below rr, for instance 1/N1/N with N1N \ge 1 a natural and 1/N<r1/N < r, convergence supplies K0NK_0 \in \mathbb{N} with d(xk,p)<1/N<rd(x_k,p) < 1/N < r for every kK0k \ge K_0, so xkB(p,r)Uix_k \in B(p,r) \subseteq U_{i^{\ast}} for every kK0k \ge K_0.

L2L5step 2.1
4.1

For each j<K0j < K_0 the set {iI:xjUi}\{\, i \in I : x_j \in U_i \,\} is nonempty, since xjKx_j \in K; finite choice applied to jj \mapsto that set gives indices i0,,iK01Ii_0, \dots, i_{K_0-1} \in I with xjUijx_j \in U_{i_j} for every j<K0j < K_0, this list being empty when K0=0K_0 = 0.

L4step 3.1
5.1

Then KUiUi0UiK01K \subseteq U_{i^{\ast}} \cup U_{i_0} \cup \dots \cup U_{i_{K_0-1}}: the point pp and every xkx_k with kK0k \ge K_0 lie in UiU_{i^{\ast}} by steps 2.1 and 3.1, and every xjx_j with j<K0j < K_0 lies in UijU_{i_j}. So finitely many members of the family cover KK, and KK is compact.

L1step 2.1step 3.1step 4.1
6.1

For the instance in R\mathbb{R}, the terms 1/(k+1)1/(k+1) satisfy 1/(k+1)0=1/(k+1)<ε|1/(k+1) - 0| = 1/(k+1) < \varepsilon for every kk with k+1Nk+1 \ge N, where N1N \ge 1 is a natural with 1/N<ε1/N < \varepsilon; so 1/(k+1)01/(k+1) \to 0 and {0}{1/(k+1):kN}\{0\} \cup \{1/(k+1) : k \in \mathbb{N}\} is compact by the general claim.

L2L5step 5.1

Remarks

Finitely many exceptional terms is the whole idea. All but finitely many terms are captured by the single member containing the limit, and the remaining ones are finitely many points, each needing one member. That is why the selection at step 4.1 is over a finite index set and costs nothing (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

Without the limit point the set is not compact. In R\mathbb{R} the set {1/(k+1):kN}\{1/(k+1) : k \in \mathbb{N}\} has 00 in its closure and does not contain it, so it is not closed and hence not compact (A compact subset of a metric space is closed and bounded).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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