Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-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.

Heine-Cantor in R\mathbb{R}: a continuous real function on a compact subset of R\mathbb{R} is uniformly continuous, proved R\mathbb{R}-natively from sequential compactness

Statement

Let KRK \subseteq \mathbb{R} be compact (Open cover, subcover, compact subset of R\mathbb{R} (every open cover has a finite subcover), and sequentially compact subset) and let f:KRf : K \to \mathbb{R} be continuous on KK (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point). Then ff is uniformly continuous on KK (Uniform continuity of f:ARf : A \to \mathbb{R}: one δ\delta serving every pair of points of AA).

This theorem is stated twice in this library, on purpose. Its metric-space twin is Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous, proved there from the cover machinery of metric spaces; the proof below is R\mathbb{R}-native and runs through A subset of R\mathbb{R} is compact iff it is sequentially compact, which is order-based. That the two statements are the same statement in two vocabularies is Dictionary: for ARA \subseteq \mathbb{R} with the metric d(x,y)=xyd(x,y) = |x-y|, continuity and uniform continuity of f:ARf : A \to \mathbb{R} agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R\mathbb{R} is compact in the open-cover sense of R\mathbb{R} exactly when it is a compact metric subspace, clauses 1, 2 and 5, immediately above.

The choice cost, named. The proof invokes the axiom of countable choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)) exactly once, at step 3.1, to select one bad pair of points from each of countably many nonempty sets. The backward implication of A subset of R\mathbb{R} is compact iff it is sequentially compact also spends countable choice, and that item names its own uses; the forward implication used here, from compact to sequentially compact, does not. No claim is made that the axiom is necessary for either.

Facts & Assumptions

Given: A compact set KRK \subseteq \mathbb{R} and a function f:KRf : K \to \mathbb{R} continuous on KK.

[L1]

Uniform continuity on KK: for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that all x,xKx, x' \in K with xx<δ|x - x'| < \delta satisfy f(x)f(x)<ε|f(x) - f(x')| < \varepsilon. Its negation: there is a real ε0>0\varepsilon_0 > 0 such that for every real δ>0\delta > 0 some pair x,xKx, x' \in K has xx<δ|x - x'| < \delta and f(x)f(x)ε0|f(x) - f(x')| \ge \varepsilon_0 (Uniform continuity of f:ARf : A \to \mathbb{R}: one δ\delta serving every pair of points of AA, Ordered field).

[L3]

Countable choice: for a family (Pk)kN(P_k)_{k \in \mathbb{N}} of nonempty sets there is a function on N\mathbb{N} picking an element of each (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L5]

Archimedean property in reciprocal form: for every real η>0\eta > 0 there is a natural n1n \ge 1 with 1/n<η1/n < \eta; and 0<st0 < s \le t implies 1/t1/s1/t \le 1/s (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean, Inverses of positives are positive, and reciprocation reverses order).

[L7]

Triangle inequality and absolute value: u+vu+v|u + v| \le |u| + |v|, u=u|{-u}| = |u|, u0|u| \ge 0 (The triangle inequality, Basic properties of the absolute value).

[L8]

Convergence of real sequences is tested at rational ε>0\varepsilon > 0, and below every positive real lies a positive rational, so the test may equally be run at every real ε>0\varepsilon > 0 (Limits and Cauchy sequences of reals, The rationals embed densely in the reals).

Proof

technique · contradiction
1.1

Suppose ff is not uniformly continuous on KK. By [L1] fix a real ε0>0\varepsilon_0 > 0 such that for every real δ>0\delta > 0 there are x,xKx, x' \in K with xx<δ|x - x'| < \delta and f(x)f(x)ε0|f(x) - f(x')| \ge \varepsilon_0.

L1assume-contra
2.1

For kNk \in \mathbb{N} put Pk:={(x,x)K×K : xx<1/(k+1) and f(x)f(x)ε0}P_k := \{\, (x,x') \in K \times K \ : \ |x - x'| < 1/(k+1) \text{ and } |f(x) - f(x')| \ge \varepsilon_0 \,\}. Since 1/(k+1)>01/(k+1) > 0, step 1.1 makes every PkP_k nonempty.

step 1.1L5
3.1

By [L3] applied to the family (Pk)kN(P_k)_{k \in \mathbb{N}} fix a function k(xk,xk)k \mapsto (x_k, x'_k) with (xk,xk)Pk(x_k, x'_k) \in P_k for every kk. This is the single use of countable choice in this proof.

step 2.1L3choose
4.1

(xk)(x_k) is a sequence of reals with all terms in KK, so by [L2] there are a strictly increasing n:NNn : \mathbb{N} \to \mathbb{N} and pKp \in K with xnjpx_{n_j} \to p.

step 3.1L2choose
5.1

The second sequence converges to pp as well. Let a rational ε>0\varepsilon > 0 be given. By [L5] and [L8] fix J1J_1 with 1/(j+1)<ε/21/(j+1) < \varepsilon/2 for every jJ1j \ge J_1, and by step 4.1 fix J2J_2 with xnjp<ε/2|x_{n_j} - p| < \varepsilon/2 for every jJ2j \ge J_2. For jmax{J1,J2}j \ge \max\{J_1, J_2\}, using (xnj,xnj)Pnj(x_{n_j}, x'_{n_j}) \in P_{n_j} and njjn_j \ge j from [L4], we get xnjxnj<1/(nj+1)1/(j+1)<ε/2|x'_{n_j} - x_{n_j}| < 1/(n_j+1) \le 1/(j+1) < \varepsilon/2, hence xnjpxnjxnj+xnjp<ε|x'_{n_j} - p| \le |x'_{n_j} - x_{n_j}| + |x_{n_j} - p| < \varepsilon by [L7]. So xnjpx'_{n_j} \to p.

step 3.1step 4.1L4L5L7L8
6.1

The point pp lies in KK and ff is continuous at pp, so [L6] applied to the two sequences of steps 4.1 and 5.1, both with terms in KK, gives f(xnj)f(p)f(x_{n_j}) \to f(p) and f(xnj)f(p)f(x'_{n_j}) \to f(p).

step 4.1step 5.1L6
7.1

By [L8] fix a rational ε\varepsilon with 0<ε<ε0/20 < \varepsilon < \varepsilon_0/2, and by step 6.1 fix JJ with f(xnj)f(p)<ε|f(x_{n_j}) - f(p)| < \varepsilon and f(xnj)f(p)<ε|f(x'_{n_j}) - f(p)| < \varepsilon for every jJj \ge J. For such jj, [L7] gives f(xnj)f(xnj)f(xnj)f(p)+f(p)f(xnj)<2ε<ε0|f(x_{n_j}) - f(x'_{n_j})| \le |f(x_{n_j}) - f(p)| + |f(p) - f(x'_{n_j})| < 2\varepsilon < \varepsilon_0.

step 6.1L7L8choose
8.1

But (xnj,xnj)Pnj(x_{n_j}, x'_{n_j}) \in P_{n_j} gives f(xnj)f(xnj)ε0|f(x_{n_j}) - f(x'_{n_j})| \ge \varepsilon_0 for every jj, which contradicts step 7.1. The assumption of step 1.1 is therefore false, and ff is uniformly continuous on KK.

step 3.1step 7.1discharge-contradiction

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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