Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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: a continuous real function on a compact subset of R is uniformly continuous, proved R-natively from sequential compactness

Statement

Let K⊆R be compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset) and let f:K→R be continuous on K (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point). Then f is uniformly continuous on K (Uniform continuity of f:A→R: one δ serving every pair of points of A).

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-native and runs through A subset of 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 A⊆R with the metric d(x,y)=∣x−y∣, continuity and uniform continuity of f:A→R agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of R is compact in the open-cover sense of 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ω)) 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 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 K⊆R and a function f:K→R continuous on K.

[L1]

Uniform continuity on K: for every real ε>0 there is a real δ>0 such that all x,x′∈K with ∣x−x′∣<δ satisfy ∣f(x)−f(x′)∣<ε. Its negation: there is a real ε0>0 such that for every real δ>0 some pair x,x′∈K has ∣x−x′∣<δ and ∣f(x)−f(x′)∣≥ε0 (Uniform continuity of f:A→R: one δ serving every pair of points of A, Ordered field).

[L3]

Countable choice: for a family (Pk)k∈N of nonempty sets there is a function on N picking an element of each (The Axiom of Countable Choice (ACω)).

[L5]

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

[L7]

Triangle inequality and absolute value: ∣u+v∣≤∣u∣+∣v∣, ∣−u∣=∣u∣, ∣u∣≥0 (The triangle inequality, Basic properties of the absolute value).

[L8]

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

Proof

technique · contradiction
1.1

Suppose f is not uniformly continuous on K. By [L1] fix a real ε0>0 such that for every real δ>0 there are x,x′∈K with ∣x−x′∣<δ and ∣f(x)−f(x′)∣≥ε0.

L1assume-contra
2.1

For k∈N put Pk:={ (x,x′)∈K×K : ∣x−x′∣<1/(k+1) and ∣f(x)−f(x′)∣≥ε0 }. Since 1/(k+1)>0, step 1.1 makes every Pk nonempty.

step 1.1L5
3.1

By [L3] applied to the family (Pk)k∈N fix a function k↦(xk,xk′) with (xk,xk′)∈Pk for every k. This is the single use of countable choice in this proof.

step 2.1L3choose
4.1

(xk) is a sequence of reals with all terms in K, so by [L2] there are a strictly increasing n:N→N and p∈K with xnj→p.

step 3.1L2choose
5.1

The second sequence converges to p as well. Let a rational ε>0 be given. By [L5] and [L8] fix J1 with 1/(j+1)<ε/2 for every j≥J1, and by step 4.1 fix J2 with ∣xnj−p∣<ε/2 for every j≥J2. For j≥max⁡{J1,J2}, using (xnj,xnj′)∈Pnj and nj≥j from [L4], we get ∣xnj′−xnj∣<1/(nj+1)≤1/(j+1)<ε/2, hence ∣xnj′−p∣≤∣xnj′−xnj∣+∣xnj−p∣<ε by [L7]. So xnj′→p.

step 3.1step 4.1L4L5L7L8
6.1

The point p lies in K and f is continuous at p, so [L6] applied to the two sequences of steps 4.1 and 5.1, both with terms in K, gives f(xnj)→f(p) and f(xnj′)→f(p).

step 4.1step 5.1L6
7.1

By [L8] fix a rational ε with 0<ε<ε0/2, and by step 6.1 fix J with ∣f(xnj)−f(p)∣<ε and ∣f(xnj′)−f(p)∣<ε for every j≥J. For such j, [L7] gives ∣f(xnj)−f(xnj′)∣≤∣f(xnj)−f(p)∣+∣f(p)−f(xnj′)∣<2ε<ε0.

step 6.1L7L8choose
8.1

But (xnj,xnj′)∈Pnj gives ∣f(xnj)−f(xnj′)∣≥ε0 for every j, which contradicts step 7.1. The assumption of step 1.1 is therefore false, and f is uniformly continuous on K.

step 3.1step 7.1discharge-contradiction∎

Remarks

Depends on

Used by

Dependency tree · two levels

81 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