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.

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

Statement

Let a,b∈R with a≤b. Then the closed bounded interval [a,b] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) is compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset): every family of open subsets of R whose union contains [a,b] has a finite subfamily whose union already contains [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 a≤b and an open cover U of [a,b]; the set X:={ (u,v)∈R×R:u≤v }; and the following terminology: a pair (u,v)∈X is bad when there are no n∈N and U0,…,Un∈U with [u,v]⊆U0∪⋯∪Un, that is, when the interval [u,v] admits no finite subcover from U.

[L2]

Closed bounded intervals: [u,v]={ z:u≤z≤v } is nonempty exactly when u≤v; and for u≤m≤v one has [u,v]=[u,m]∪[m,v], since z∈[u,v] satisfies z≤m or m<z by trichotomy (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Ordered field).

[L3]

U is open when every x∈U admits ε>0 with Nε(x)⊆U, and Nε(x)={ y:∣y−x∣<ε } (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]

Recursion: for a set Y, an element y0∈Y and a function G:Y→Y there is h:N→Y with h(0)=y0 and h(k+1)=G(h(k)) for every k (The recursion theorem).

[L5]

Nested interval property: if [ak,bk] with ak≤bk satisfy [ak+1,bk+1]⊆[ak,bk] for every k∈N, then ⋂k[ak,bk]≠∅ (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 0).

[L6]

Reciprocal Archimedean property: for every real ε>0 there is a natural n≥1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean).

[L7]

Canonical naturals: n⋅1R>0 for n≥1, the map n↦n⋅1R is strictly increasing, and (n+1)⋅1R=n⋅1R+1 (Canonical naturals are positive and strictly increasing); a positive element has a positive inverse and 0<c≤d gives 0<1/d≤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<1, hence 2:=1+1>0 and 2−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: ∣y−x∣≤v−u whenever x,y∈[u,v], because ∣y−x∣ equals y−x or x−y and each is at most v−u (Basic properties of the absolute value, Ordered field).

Proof

technique · contradiction
1.1

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

assume-contraL1
1.2

Bisection rule: for (u,v)∈X put m:=(u+v)⋅2−1, so that u≤m≤v by [L8], and define G(u,v):=(u,m) if (u,m) is bad and G(u,v):=(m,v) otherwise. This is a definition by cases on one condition, so G:X→X is a function and nothing is selected.

L2L8construct
1.3

If (u,v) is bad then G(u,v) is bad: were both (u,m) and (m,v) not bad, concatenating the two finite lists of members of U would give a finite subfamily whose union contains [u,m]∪[m,v]=[u,v] by [L2], so (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=X, seed (a,b) and map G: there is h:N→X with h(0)=(a,b) and h(k+1)=G(h(k)). Write h(k)=(ak,bk), so ak≤bk for every k, (a0,b0)=(a,b), and (ak+1,bk+1) is one of the two halves of (ak,bk).

step 1.2L2L4construct
3.1

Every (ak,bk) is bad, by induction on k: the case k=0 is step 1.1, and if (ak,bk) is bad then (ak+1,bk+1)=G(ak,bk) is bad by step 1.3.

step 1.1step 1.3step 2.1
3.2

Writing ℓk:=bk−ak≥0, the intervals are nested and the lengths halve: [ak+1,bk+1] is [ak,mk] or [mk,bk] with mk=(ak+bk)⋅2−1, and each of these is contained in [ak,bk] by [L2], while mk−ak=bk−mk=ℓk⋅2−1, so ℓk+1=ℓk⋅2−1.

step 2.1L2L8
4.1

For every k∈N one has ℓk⋅(k+1)≤ℓ0, by induction on k: at k=0 this reads ℓ0⋅1≤ℓ0; and if it holds at k then ℓk+1⋅(k+2)=ℓk⋅2−1⋅(k+2)≤ℓk⋅(k+1)≤ℓ0, using ℓk≥0 and (k+2)⋅2−1≤k+1, which is k+2≤2k+2, that is 0≤k.

step 3.2L7L8
4.2

By [L5] the nested family [ak,bk] of nonempty closed bounded intervals has a common point x; since x∈[a0,b0]=[a,b] and U covers [a,b], fix U∈U with x∈U and then, U being open, a real ε>0 with Nε(x)⊆U.

step 3.2L1L2L3L5choose
5.1

There is k∈N with ℓk<ε: the real ε/(ℓ0+1) is positive because ℓ0+1>0, so [L6] supplies a natural n≥1 with 1/n<ε/(ℓ0+1); put k:=n−1, a natural number, so that k+1=n and step 4.1 with [L7] gives ℓk≤ℓ0⋅(1/n)≤ℓ0⋅ε/(ℓ0+1)<ε, the last step because ℓ0<ℓ0+1 forces ℓ0/(ℓ0+1)<1 and ε>0.

step 4.1step 4.2L6L7L8choose
6.1

For that k one has x∈[ak,bk], and every y∈[ak,bk] satisfies ∣y−x∣≤ℓk<ε by [L9], so [ak,bk]⊆Nε(x)⊆U; hence the one-member subfamily {U} of U covers [ak,bk] and (ak,bk) is not bad, contradicting step 3.1. The assumption of step 1.1 is therefore untenable and [a,b] is compact.

step 3.1step 4.2step 5.1L1L3L9discharge-contradiction∎

Remarks

Depends on

Used by

…and 3 more results.

Dependency tree · two levels

40 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