Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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):k∈N} in R

Example

Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), let (xk) be a sequence in X converging to p∈X (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Sequences of reals: bounded, eventually, frequently, tails, subsequences), and put

K  :=  { xk:k∈N }∪{p}.

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

In R with the usual metric (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded) the sequence xk:=1/(k+1) converges to 0, so {0}∪{ 1/(k+1):k∈N } is compact. The index is written k+1 because N contains 0 and 1/0 is undefined (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Dropping the limit destroys compactness: the range alone is not closed in 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), a sequence (xk) in X with xk→p∈X, and K:={xk:k∈N}∪{p}.

[L2]

xk→p means: for every rational ε>0 there is K0∈N with d(xk,p)<ε for all k≥K0 (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in 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)i∈I be a family of open subsets of X with K⊆⋃i∈IUi.

L1
2.1

Since p∈K there is i∗∈I with p∈Ui∗, and openness gives a real r>0 with B(p,r)⊆Ui∗.

L3step 1.1
3.1

Taking a positive rational below r, for instance 1/N with N≥1 a natural and 1/N<r, convergence supplies K0∈N with d(xk,p)<1/N<r for every k≥K0, so xk∈B(p,r)⊆Ui∗ for every k≥K0.

L2L5step 2.1
4.1

For each j<K0 the set { i∈I:xj∈Ui } is nonempty, since xj∈K; finite choice applied to j↦ that set gives indices i0,…,iK0−1∈I with xj∈Uij for every j<K0, this list being empty when K0=0.

L4step 3.1
5.1

Then K⊆Ui∗∪Ui0∪⋯∪UiK0−1: the point p and every xk with k≥K0 lie in Ui∗ by steps 2.1 and 3.1, and every xj with j<K0 lies in Uij. So finitely many members of the family cover K, and K is compact.

L1step 2.1step 3.1step 4.1
6.1

For the instance in R, the terms 1/(k+1) satisfy ∣1/(k+1)−0∣=1/(k+1)<ε for every k with k+1≥N, where N≥1 is a natural with 1/N<ε; so 1/(k+1)→0 and {0}∪{1/(k+1):k∈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 the set {1/(k+1):k∈N} has 0 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 · two levels

46 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