Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

The Cauchy criterion for a Henstock–Kurzweil integral at a missing endpoint

Statement

Let f be HK integrable on every compact subinterval of [a,b), where b may be finite or +∞. Its noncompact integral exists if and only if for every ε>0 there is a truncation point c0 such that

∣∫cdf∣<ε

whenever c0<c<d<b. Thus noncompact integrability is equivalent to uniformly small tail integrals. The reflected criterion holds at a missing left endpoint.

Noncompact integrability is equivalent to uniformly small tail integrals.

A missing finite-endpoint integral exists exactly when all sufficiently late tail integrals are small.

Facts & Assumptions

Given: The locally HK-integrable function and a finite or infinite missing endpoint.

[L1]

For points u,v,w, ∫uwf=∫uvf+∫vwf whenever the compact pieces are integrable (Henstock–Kurzweil integrability on subintervals and additivity over adjacent intervals).

[L4]

A limit at infinity is defined by eventual control beyond a real threshold (Limits at +∞ and −∞, and infinite limits at a point).

Proof

technique · direct
1.1givenL1

For the forward direction, the truncation primitive A(c)=∫acf has a finite limit, so late values A(c),A(d) are close; [L1] identifies their difference with ∫cdf.

2.1givenL1L2L3L4algebra∎

For the reverse direction, take the explicit cofinal sequence cn=b−(b−a)/(n+1) at a finite endpoint, or cn=a+n at +∞. The tail condition makes A(cn) Cauchy, so [L2] gives a finite limit I. For an arbitrary sufficiently late c, choose n with cn>c; then [L1] gives ∣A(c)−I∣≤∣∫ccnf∣+∣A(cn)−I∣, and the two terms are small. This is exactly the limit in [L3] or [L4]; reflection handles a missing left endpoint.

Depends on

Used by

Dependency tree · two levels

26 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