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 is compact
Statement
Let with . Then the closed bounded interval (Intervals of : the nine order-convex forms, nondegeneracy, and length) is compact (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset): every family of open subsets of whose union contains has a finite subfamily whose union already contains .
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 and an open cover of ; the set ; and the following terminology: a pair is bad when there are no and with , that is, when the interval admits no finite subcover from .
Open cover, subcover, finite subfamily and compactness (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Closed bounded intervals: is nonempty exactly when ; and for one has , since satisfies or by trichotomy (Intervals of : the nine order-convex forms, nondegeneracy, and length, Ordered field).
is open when every admits with , and (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of ).
Recursion: for a set , an element and a function there is with and for every (The recursion theorem).
Nested interval property: if with satisfy for every , then (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to ).
Reciprocal Archimedean property: for every real there is a natural with (For every in a complete ordered field there is a natural with , Every complete ordered field is Archimedean).
Canonical naturals: for , the map is strictly increasing, and (Canonical naturals are positive and strictly increasing); a positive element has a positive inverse and gives (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.
Ordered-field arithmetic: , hence and ; 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.
Absolute value: whenever , because equals or and each is at most (Basic properties of the absolute value, Ordered field).
Proof
Suppose, for contradiction, that is not compact: some open cover of has no finite subcover, that is, the pair is bad.
Bisection rule: for put , so that by [L8], and define if is bad and otherwise. This is a definition by cases on one condition, so is a function and nothing is selected.
If is bad then is bad: were both and not bad, concatenating the two finite lists of members of would give a finite subfamily whose union contains by [L2], so 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.
Apply [L4] with , seed and map : there is with and . Write , so for every , , and is one of the two halves of .
Every is bad, by induction on : the case is step 1.1, and if is bad then is bad by step 1.3.
Writing , the intervals are nested and the lengths halve: is or with , and each of these is contained in by [L2], while , so .
For every one has , by induction on : at this reads ; and if it holds at then , using and , which is , that is .
By [L5] the nested family of nonempty closed bounded intervals has a common point ; since and covers , fix with and then, being open, a real with .
There is with : the real is positive because , so [L6] supplies a natural with ; put , a natural number, so that and step 4.1 with [L7] gives , the last step because forces and .
For that one has , and every satisfies by [L9], so ; hence the one-member subfamily of covers and is not bad, contradicting step 3.1. The assumption of step 1.1 is therefore untenable and is compact.
Remarks
-
What each hypothesis buys. Closedness enters through [L5]: the nested interval property is stated for closed intervals and fails for open ones (The nested open intervals have empty intersection). Boundedness enters through the same fact and through the length computation of step 3.2. Completeness of enters only inside A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to and, through For every in a complete ordered field there is a natural with , in step 5.1.
-
Why the lengths are handled without powers. The obvious route is together with the nullity of a geometric sequence, which is available (For the sequence is null, and for the sequence diverges to ). The route taken instead, the one-line induction of step 4.1, gives the weaker bound , which is all step 5.1 needs, and it avoids integer powers and the algebra of limits entirely.
-
The recursion is over pairs, not over sets. The state carried from stage to stage is the pair of endpoints, so [L4] applies with and a total map ; had the rule been "choose a bad half", the state would have been chosen rather than computed and the argument would have needed dependent choice, which this library does not have.
-
The converse direction is a separate result. That a compact subset of must be closed and bounded is A compact subset of is closed and bounded, and the two together give A subset of is compact if and only if it is closed and bounded.
Depends on
- Open cover, subcover, compact subset of $\mathbb{R}$ (every open cover has a finite subcover), and sequentially compact subset
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- 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$
- Complete ordered field (least-upper-bound property)
- The recursion theorem
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Every complete ordered field is Archimedean
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
- Canonical naturals are positive and strictly increasing
- Inverses of positives are positive, and reciprocation reverses order
- Basic properties of the absolute value
- Order is preserved by adding a constant and by adding inequalities
- Sign rules for products and monotonicity of multiplication
- The multiplicative identity is positive
- Ordered field
Used by
- Assuming the ultrafilter lemma, every Tychonoff space has a Hausdorff compactification Corollary
- The reciprocal on (0,1] is continuous and extends to no continuous function on ℝ, so closedness of the subspace is not decoration in the ℝ-valued Tietze extension Counterexample
- Every function from discrete ℕ to [0,1] extends uniquely to βℕ Example
- ℝ^* is homeomorphic to the unit circle by inverse stereographic projection, and ℕ^* is the ordinal space ω + 1 Example
- Under dependent choice and the ultrafilter lemma, the Samuel compactification of the open unit interval is the closed unit interval Example
- FALSE: Every continuous real-valued function on a subspace of a normal space extends continuously to the whole space False statement
- The Samuel uniformity is totally bounded Lemma
- Which results on this page use the order of ℝ and therefore have no general-topological analogue Remark
- A countable pure-step integrator evaluates a continuous integrand as the absolutely convergent weighted sum of its values at the jumps Theorem
- A subset of ℝ is compact if and only if it is closed and bounded Theorem
- Bonnet's second mean value theorem: for f monotone and g integrable on [a,b] there is ξ∈[a,b] with ∫ₐᵇ fg = f(a)∫ₐ^ξ g + f(b)∫_ξᵇ g Theorem
- Darboux's theorem: every derivative has the intermediate-value property Theorem
- Dini's theorem on a closed interval: monotone pointwise convergence of continuous functions to a continuous limit is uniform Theorem
- If f is continuous on [a,b] and g is integrable with g ≥ 0, there is ξ ∈ [a,b] with ∫ₐᵇ fg = f(ξ)∫ₐᵇ g Theorem
- If f is integrable on [a,b] with values in [m,M] and φ is continuous on [m,M], then φ ∘ f is integrable Theorem
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
- Heine-Borel theorem (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (Thm 2.40) (standard reference, not scraped)
- J. Lebl, Basic Analysis I, §7.4 (standard reference, not scraped)
- Nested intervals (Wikipedia) (standard reference, not scraped)
- J. K. Hunter, An Introduction to Real Analysis (standard reference, not scraped)