Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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.

Heine-Borel by bisection: every closed bounded interval [a,b][a,b] is compact

Statement

Let a,bRa, b \in \mathbb{R} with aba \le b. Then the closed bounded interval [a,b][a,b] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) is compact (Open cover, subcover, compact subset of R\mathbb{R} (every open cover has a finite subcover), and sequentially compact subset): every family of open subsets of R\mathbb{R} whose union contains [a,b][a,b] has a finite subfamily whose union already contains [a,b][a,b].

The proof is by repeated bisection. Supposing some open cover admits no finite subcover, one halves the interval, keeps a half that still admits none, and iterates; the halves shrink to a point, which the cover does reach, and a single member of the cover then swallows a whole late-stage half. The halving rule is canonical, taking the left half whenever the left half works, so the recursion uses The recursion theorem and no choice principle.

Facts & Assumptions

Given: Reals aba \le b and an open cover U\mathcal{U} of [a,b][a,b]; the set X:={(u,v)R×R:uv}X := \{\, (u,v) \in \mathbb{R} \times \mathbb{R} : u \le v \,\}; and the following terminology: a pair (u,v)X(u,v) \in X is bad when there are no nNn \in \mathbb{N} and U0,,UnUU_0, \dots, U_n \in \mathcal{U} with [u,v]U0Un[u,v] \subseteq U_0 \cup \dots \cup U_n, that is, when the interval [u,v][u,v] admits no finite subcover from U\mathcal{U}.

[L2]

Closed bounded intervals: [u,v]={z:uzv}[u,v] = \{\, z : u \le z \le v \,\} is nonempty exactly when uvu \le v; and for umvu \le m \le v one has [u,v]=[u,m][m,v][u,v] = [u,m] \cup [m,v], since z[u,v]z \in [u,v] satisfies zmz \le m or m<zm < z by trichotomy (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Ordered field).

[L3]

UU is open when every xUx \in U admits ε>0\varepsilon > 0 with Nε(x)UN_\varepsilon(x) \subseteq U, and Nε(x)={y:yx<ε}N_\varepsilon(x) = \{\, y : |y - x| < \varepsilon \,\} (Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L4]

Recursion: for a set YY, an element y0Yy_0 \in Y and a function G:YYG : Y \to Y there is h:NYh : \mathbb{N} \to Y with h(0)=y0h(0) = y_0 and h(k+1)=G(h(k))h(k+1) = G(h(k)) for every kk (The recursion theorem).

[L5]

Nested interval property: if [ak,bk][a_k,b_k] with akbka_k \le b_k satisfy [ak+1,bk+1][ak,bk][a_{k+1},b_{k+1}] \subseteq [a_k,b_k] for every kNk \in \mathbb{N}, then k[ak,bk]\bigcap_{k} [a_k,b_k] \ne \varnothing (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 00).

[L6]

Reciprocal Archimedean property: for every real ε>0\varepsilon > 0 there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon (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).

[L7]

Canonical naturals: n1R>0n \cdot 1_{\mathbb{R}} > 0 for n1n \ge 1, the map nn1Rn \mapsto n \cdot 1_{\mathbb{R}} is strictly increasing, and (n+1)1R=n1R+1(n+1) \cdot 1_{\mathbb{R}} = n \cdot 1_{\mathbb{R}} + 1 (Canonical naturals are positive and strictly increasing); a positive element has a positive inverse and 0<cd0 < c \le d gives 0<1/d1/c0 < 1/d \le 1/c (Inverses of positives are positive, and reciprocation reverses order). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

[L8]

Ordered-field arithmetic: 0<10 < 1, hence 2:=1+1>02 := 1 + 1 > 0 and 21>02^{-1} > 0; adding a constant preserves an inequality and multiplying by a positive preserves it (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Complete ordered field (least-upper-bound property), Ordered field). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

[L9]

Absolute value: yxvu|y - x| \le v - u whenever x,y[u,v]x, y \in [u,v], because yx|y - x| equals yxy - x or xyx - y and each is at most vuv - u (Basic properties of the absolute value, Ordered field).

Proof

technique · contradiction
1.1

Suppose, for contradiction, that [a,b][a,b] is not compact: some open cover U\mathcal{U} of [a,b][a,b] has no finite subcover, that is, the pair (a,b)X(a,b) \in X is bad.

assume-contraL1
1.2

Bisection rule: for (u,v)X(u,v) \in X put m:=(u+v)21m := (u+v) \cdot 2^{-1}, so that umvu \le m \le v by [L8], and define G(u,v):=(u,m)G(u,v) := (u,m) if (u,m)(u,m) is bad and G(u,v):=(m,v)G(u,v) := (m,v) otherwise. This is a definition by cases on one condition, so G:XXG : X \to X is a function and nothing is selected.

L2L8construct
1.3

If (u,v)(u,v) is bad then G(u,v)G(u,v) is bad: were both (u,m)(u,m) and (m,v)(m,v) not bad, concatenating the two finite lists of members of U\mathcal{U} would give a finite subfamily whose union contains [u,m][m,v]=[u,v][u,m] \cup [m,v] = [u,v] by [L2], so (u,v)(u,v) would not be bad; hence at least one half is bad, and the rule returns the left half when it is bad and otherwise the right half, which must then be bad.

L1L2
2.1

Apply [L4] with Y=XY = X, seed (a,b)(a,b) and map GG: there is h:NXh : \mathbb{N} \to X with h(0)=(a,b)h(0) = (a,b) and h(k+1)=G(h(k))h(k+1) = G(h(k)). Write h(k)=(ak,bk)h(k) = (a_k,b_k), so akbka_k \le b_k for every kk, (a0,b0)=(a,b)(a_0,b_0) = (a,b), and (ak+1,bk+1)(a_{k+1},b_{k+1}) is one of the two halves of (ak,bk)(a_k,b_k).

step 1.2L2L4construct
3.1

Every (ak,bk)(a_k,b_k) is bad, by induction on kk: the case k=0k = 0 is step 1.1, and if (ak,bk)(a_k,b_k) is bad then (ak+1,bk+1)=G(ak,bk)(a_{k+1},b_{k+1}) = G(a_k,b_k) is bad by step 1.3.

step 1.1step 1.3step 2.1
3.2

Writing k:=bkak0\ell_k := b_k - a_k \ge 0, the intervals are nested and the lengths halve: [ak+1,bk+1][a_{k+1},b_{k+1}] is [ak,mk][a_k,m_k] or [mk,bk][m_k,b_k] with mk=(ak+bk)21m_k = (a_k+b_k) \cdot 2^{-1}, and each of these is contained in [ak,bk][a_k,b_k] by [L2], while mkak=bkmk=k21m_k - a_k = b_k - m_k = \ell_k \cdot 2^{-1}, so k+1=k21\ell_{k+1} = \ell_k \cdot 2^{-1}.

step 2.1L2L8
4.1

For every kNk \in \mathbb{N} one has k(k+1)0\ell_k \cdot (k+1) \le \ell_0, by induction on kk: at k=0k = 0 this reads 010\ell_0 \cdot 1 \le \ell_0; and if it holds at kk then k+1(k+2)=k21(k+2)k(k+1)0\ell_{k+1} \cdot (k+2) = \ell_k \cdot 2^{-1} \cdot (k+2) \le \ell_k \cdot (k+1) \le \ell_0, using k0\ell_k \ge 0 and (k+2)21k+1(k+2) \cdot 2^{-1} \le k+1, which is k+22k+2k + 2 \le 2k+2, that is 0k0 \le k.

step 3.2L7L8
4.2

By [L5] the nested family [ak,bk][a_k,b_k] of nonempty closed bounded intervals has a common point xx; since x[a0,b0]=[a,b]x \in [a_0,b_0] = [a,b] and U\mathcal{U} covers [a,b][a,b], fix UUU \in \mathcal{U} with xUx \in U and then, UU being open, a real ε>0\varepsilon > 0 with Nε(x)UN_\varepsilon(x) \subseteq U.

step 3.2L1L2L3L5choose
5.1

There is kNk \in \mathbb{N} with k<ε\ell_k < \varepsilon: the real ε/(0+1)\varepsilon/(\ell_0+1) is positive because 0+1>0\ell_0 + 1 > 0, so [L6] supplies a natural n1n \ge 1 with 1/n<ε/(0+1)1/n < \varepsilon/(\ell_0+1); put k:=n1k := n-1, a natural number, so that k+1=nk+1 = n and step 4.1 with [L7] gives k0(1/n)0ε/(0+1)<ε\ell_k \le \ell_0 \cdot (1/n) \le \ell_0 \cdot \varepsilon/(\ell_0+1) < \varepsilon, the last step because 0<0+1\ell_0 < \ell_0 + 1 forces 0/(0+1)<1\ell_0/(\ell_0+1) < 1 and ε>0\varepsilon > 0.

step 4.1step 4.2L6L7L8choose
6.1

For that kk one has x[ak,bk]x \in [a_k,b_k], and every y[ak,bk]y \in [a_k,b_k] satisfies yxk<ε|y - x| \le \ell_k < \varepsilon by [L9], so [ak,bk]Nε(x)U[a_k,b_k] \subseteq N_\varepsilon(x) \subseteq U; hence the one-member subfamily {U}\{U\} of U\mathcal{U} covers [ak,bk][a_k,b_k] and (ak,bk)(a_k,b_k) is not bad, contradicting step 3.1. The assumption of step 1.1 is therefore untenable and [a,b][a,b] is compact.

step 3.1step 4.2step 5.1L1L3L9discharge-contradiction

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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