Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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.

Hake's theorem: a finite-endpoint generalized integral is a proper Henstock–Kurzweil integral after assigning the endpoint value

Statement

Let a<b<, let f be HK integrable on every [a,c] with a<c<b, and assign any finite value to f(b). The resulting function on [a,b] is properly HK integrable if and only if limcbacf exists as a finite real. In that case the proper integral equals this limit and is independent of the assigned value at b. The reflected statement holds at a missing left endpoint.

A finite-endpoint noncompact integral extends to a proper HK integral if and only if the truncation limit exists.

Facts & Assumptions

Given: The locally HK-integrable function near a finite missing endpoint and a finite assigned endpoint value.

[L1]

A missing finite-endpoint integral exists exactly when all sufficiently late tail integrals are small (The Cauchy criterion for a Henstock–Kurzweil integral at a missing endpoint).

[L2]

Fine partial tagged partitions have uniformly small sums of local integration errors (The Saks–Henstock lemma for fine partial tagged partitions).

[L3]

Henstock–Kurzweil integrals restrict to subintervals and add over adjacent intervals (Henstock–Kurzweil integrability on subintervals and additivity over adjacent intervals).

[L4]

Countable choice selects one member from each nonempty set in a family indexed by N (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1

For the forward direction, [L3] restricts a proper HK integral to every compact prefix; apply [L2] to the one-cell partial partition ([c,b],b) after taking c sufficiently close to b, and also make f(b)(bc) small, to obtain uniformly small tail integrals, so [L1] and [L3] make the truncation values converge to the proper integral.

givenL1L2L3
1.2

For the reverse direction, let A=limcbacf and set ci=b(ba)/(i+1), so c0=a and cib. By [L4], choose for each band [ci1,ci] a gauge whose Saks–Henstock partial-partition error is below ε2i4.

givenL2L4
2.1

On each open band, take the minimum of its local gauge and half the distances to the two band endpoints; at each ci, take the minimum of the adjacent gauges and half the adjacent band lengths. At b, choose a radius γ so that the truncation tail error is below ε/4 and f(b)γ<ε/4. A partition fine for this global gauge can cross a band boundary only when tagged there, so it splits into finitely many complete band partitions, one final fine partial band partition, and a possible last cell tagged at b.

step 1.2L1L2algebra
3.1

Additivity [L3], the summable local error budget from step 1.2, the Saks–Henstock estimate on the final partial band, the truncation bound, and the endpoint-cell bound from step 2.1 show that every fine sum differs from A by less than ε. Thus the extension is properly HK integrable with integral A. Changing the assigned value at b alters only the last endpoint-tagged term, whose length the gauge can make arbitrarily small, so the integral is independent of that value; reflection gives the left-endpoint form.

step 1.2step 2.1L2L3algebra

Depends on

Used by

Dependency tree · two levels

16 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