Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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 subset of R is compact iff it is sequentially compact

Statement

Let K⊆R. Then K is compact if and only if K is sequentially compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset).

Neither implication is formal. Both are routed through the characterisation of compactness by closed and bounded (A subset of R is compact if and only if it is closed and bounded), and the forward implication additionally uses Bolzano-Weierstrass (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence). The backward implication uses the axiom of countable choice (The Axiom of Countable Choice (ACω)): twice, once inside A point lies in the closure of A⊆R iff some sequence in A converges to it, so a subset of R is closed iff it is sequentially closed when a point of the closure is turned into a sequence, and once directly in step 2.3, where an unbounded set supplies one point beyond each natural bound.

Facts & Assumptions

Given: A subset K⊆R. Sequences are indexed by N, which contains 0 (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L1]

K is compact when every open cover has a finite subcover, and sequentially compact when every sequence with all terms in K has a subsequence converging to a point of K (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset, Subsequential limit of a real sequence, and the subsequential limit set, Limits and Cauchy sequences of reals).

[L2]

K is compact exactly when K is closed and bounded (A subset of R is compact if and only if it is closed and bounded).

[L3]

Bolzano-Weierstrass: a sequence (xk) of reals for which some M satisfies ∣xk∣≤M at every index has a subsequence converging to some real (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence).

[L5]

K is bounded exactly when there are ℓ,u with ℓ≤y≤u for all y∈K (Lower bound, bounded below, bounded set).

[L6]

Countable choice: for a family (Yk)k∈N of nonempty sets there is f with domain N and f(k)∈Yk for every k (The Axiom of Countable Choice (ACω)).

[L7]

A convergent sequence of reals is bounded (Every convergent sequence is bounded); every subsequence of a convergent sequence converges to the same limit (Subsequences inherit the limit); a sequence has at most one limit (A sequence has at most one limit); a strictly increasing n:N→N satisfies nj≥j (A strictly increasing index map satisfies nk≥k).

[L8]

Archimedean property: for every real z there is a natural j≥1 with z<j; canonical naturals satisfy k⋅1R≥0 and are increasing in k (Every complete ordered field is Archimedean, Canonical naturals are positive and strictly increasing).

[L9]

Absolute value: ∣z∣≥z, ∣z∣≥−z, ∣z∣≥0, and ∣z∣=z for z≥0 while ∣z∣=−z for z<0 (Basic properties of the absolute value).

[L10]

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

Proof

technique · direct
1.1

For the forward implication assume K is compact; then K is closed and bounded by [L2], so [L5] supplies ℓ,u with ℓ≤y≤u for every y∈K. Let (xk) be any sequence with xk∈K for every k∈N.

assume-hypL2L5
1.2

For the backward implication assume K is sequentially compact.

assume-hypL1
2.1

The sequence of step 1.1 is bounded: put M:=max⁡{∣ℓ∣,∣u∣} by [L10]; for each k, from ℓ≤xk≤u we get xk≤u≤∣u∣≤M and −xk≤−ℓ≤∣ℓ∣≤M, so ∣xk∣≤M by [L9]. By [L3] there are a strictly increasing n and a real L with xnj→L; every term xnj lies in K and K is closed, so L∈K by [L4]. Hence every sequence in K has a subsequence converging in K, that is, K is sequentially compact.

step 1.1L1L3L4L9L10
2.2

A sequentially compact K is closed: let y∈K‾; by [L4] there is a sequence (ak) with ak∈K for all k and ak→y; by sequential compactness some subsequence (anj) converges to a point z∈K; but that subsequence also converges to y by [L7], and limits are unique by [L7], so z=y and y∈K. Hence K‾⊆K, so K‾=K and K is closed by [L4].

step 1.2L1L4L7
2.3

A sequentially compact K is bounded: suppose it is not. Then for every k∈N the set Yk:={ y∈K:y>k or y<−k } is nonempty, since Yk=∅ would mean −k≤y≤k for every y∈K and make K bounded by [L5]. Use [L6] to fix f with f(k)∈Yk and put xk:=f(k); then xk∈K, and ∣xk∣>k for every k, because xk>k≥0 gives ∣xk∣=xk>k while xk<−k≤0 gives ∣xk∣=−xk>k by [L9] and [L8]. By sequential compactness some subsequence (xnj) converges, hence is bounded by some real M with ∣xnj∣≤M for all j by [L7]; by [L8] fix a natural j≥1 with M<j, and then ∣xnj∣>nj≥j>M by [L7] and [L8], which contradicts ∣xnj∣≤M. So K is bounded.

step 1.2L1L5L6L7L8L9
3.1

A sequentially compact K is therefore closed by step 2.2 and bounded by step 2.3, hence compact by [L2].

step 2.2step 2.3L2
4.1

Step 2.1 is the forward implication and step 3.1 the backward one, so for subsets of R compactness and sequential compactness coincide.

step 2.1step 3.1∎

Remarks

Depends on

Used by

Dependency tree · two levels

59 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