Alphabeta Math
RemarkRemark: AI-generatedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

What this page costs in choice: Riemann's criterion, the Darboux-Riemann equivalence and integrability of a monotone function are theorems of ZF; integrability of a continuous function inherits the single use of countable choice inside Heine-Cantor; and only the forward half of the Lebesgue criterion spends countable choice, once, at the countable union of null sets

This page develops the Riemann integral over ZF except at the points recorded below. The only choice principle that appears anywhere on it is the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)); the full Axiom of Choice is never used, and no claim is made anywhere that a use recorded here is necessary.

The ledger, item by item

itemchoice usedwhere it enters
Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitionsnonerecursion only, over a totally defined map
For bounded f on [a,b] and a partition P: the infimum mi and supremum Mi of f on the i-th subinterval, and the lower and upper Darboux sums L(f,P)=∑imiΔi and U(f,P)=∑iMiΔinonesuprema and infima are canonical
Refining a partition raises the lower Darboux sum and lowers the upper one, and every lower sum is at most every upper sum: L(f,P)≤L(f,P′)≤U(f,P′)≤U(f,P) when P′ refines P, and L(f,P)≤U(f,Q) for arbitrary partitions P and Q; moreover the two changes are at most 2M(n′−n)∥P∥noneone induction on the coarse index
The lower and upper Darboux integrals of a bounded f on [a,b] as sup⁡PL(f,P) and inf⁡PU(f,P), Darboux integrability as their equality, and the notation ∫abfnonesup⁡ and inf⁡ over a set of partitions
If m≤f≤M on [a,b] then m(b−a)≤L(f,P)≤∫ab‾f≤∫ab‾f≤U(f,P)≤M(b−a) for every partition P; in particular every constant function is integrable, with ∫abc=c(b−a)none—
Riemann's criterion: a bounded f on [a,b] is Darboux integrable if and only if for every real ε>0 there is a partition P with U(f,P)−L(f,P)<εnonefinitely many existential instantiations
Tagged partitions of [a,b], with a tag ξi in each subinterval, and the Riemann sum S(f,P,ξ)=∑if(ξi) Δinonea tagging is exhibited by a formula
[The Darboux and Riemann definitions agree: a bounded f on [a,b] is Darboux integrable with integral I if and only if for every real ε>0 there is a real δ>0 such that $S(f,P,\xi) - I< \varepsilonforeverytaggedpartitionofmeshbelow\delta$](/item/thm-darboux-equals-riemann)
A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterionACω, onceinherited from Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous, proved R-natively from sequential compactness
[A monotone function on [a,b] is Riemann integrable: for the uniform partition into N parts the upper minus lower sum telescopes to $f(b) - f(a),(b-a)/\iota(N)$](/item/thm-monotone-implies-integrable)
A bounded function on [a,b] that is continuous except at finitely many points is Riemann integrableACω, onceinherited from Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous, proved R-natively from sequential compactness
Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zeroACω, once, in the forward half onlyA countable union of measure-zero sets has measure zero, by countable choice
A bounded function on [a,b] whose set of discontinuities is at most countable is Riemann integrablenonesee below
FALSE: every bounded function on [a,b] is Riemann integrablenone—
FALSE: a bounded function on [a,b] is Riemann integrable exactly when its set of discontinuities is nowhere densenonerefuted from the interval-cover bound directly, not through the criterion
FALSE: a nonnegative Riemann integrable function on [a,b] with ∫abf=0 is identically zerononerests on the corollary, which is choice-free
FALSE: a pointwise limit of a sequence of Riemann integrable functions on [a,b] is Riemann integrableACω, onceinherited through A bounded function on [a,b] that is continuous except at finitely many points is Riemann integrable

The four entries that are easy to get wrong

Selecting a tag in every subinterval is not countable choice. The Darboux and Riemann definitions agree: a bounded f on [a,b] is Darboux integrable with integral I if and only if for every real ε>0 there is a real δ>0 such that ∣S(f,P,ξ)−I∣<ε for every tagged partition of mesh below δ picks, for a single fixed partition, one point in each of its n subintervals subject to a supremum condition. That family is listed by the index i<n, and a family of nonempty sets listed by a natural number has a choice function outright, by Every natural-number-indexed list of nonempty sets has a choice function on its family of values, which is a theorem of ZF proved by induction. (That lemma is careful to state only the listed form, since no definition of finiteness is available where it is proved; the listed form is what is used here.) The temptation to read this as a choice principle comes from the phrase "for each i pick a point"; the number of picks is what matters, and it is finite.

"For each n pick a partition" would be countable choice, and the page never does it. Both directions of Riemann's criterion: a bounded f on [a,b] is Darboux integrable if and only if for every real ε>0 there is a partition P with U(f,P)−L(f,P)<ε and the whole of The Darboux and Riemann definitions agree: a bounded f on [a,b] is Darboux integrable with integral I if and only if for every real ε>0 there is a real δ>0 such that ∣S(f,P,ξ)−I∣<ε for every tagged partition of mesh below δ instantiate an existential a fixed, finite number of times, once per ε under consideration; no proof on this page ever forms a sequence of partitions indexed by N and reasons about it. The one place where a sequence of sets does appear is step 7.1 of Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero, and that is exactly where the ledger records a cost.

Only the forward half of Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero costs anything. The implication "integrable ⇒ the discontinuity set is null" exhibits that set as ⋃kE1/(k+1) and applies A countable union of measure-zero sets has measure zero, by countable choice, which assumes ACω and names its own single use. The converse, "null ⇒ integrable", is a theorem of ZF: For every real ε>0 the set { x∈A:ωf(x)≥ε } is the intersection with A of a closed subset of R; in particular it is closed in R when A=R and A subset of R is compact if and only if it is closed and bounded are choice-free, For a compact subset of R, measure zero and content zero coincide and A set of content zero has measure zero are choice-free, and the partition is built by Cousin's supremum construction, which uses the completeness of R and nothing else. This asymmetry is why A bounded function on [a,b] whose set of discontinuities is at most countable is Riemann integrable appears in the table with no cost at all: it uses the converse half only, together with Every at most countable subset of R has measure zero, whose own statement records that no choice principle is used there.

Heine-Cantor is the page's other source, and it is a single use. Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous, proved R-natively from sequential compactness states that its proof invokes ACω exactly once, to select one bad pair of points from each of countably many nonempty sets, and that the implication it borrows from A subset of R is compact iff it is sequentially compact — compact implies sequentially compact — spends nothing. So A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion and A bounded function on [a,b] that is continuous except at finitely many points is Riemann integrable each inherit that one use and add none of their own. The neighbouring ledger for the same expenditure on the continuity page is The sequence-to-ε direction of the Heine criterion uses countable choice for R, and where this library records that cost.

What is deliberately not claimed

Nothing here says that ACω is necessary for any of the three theorems that use it. The independence questions for the Heine-Cantor theorem and for the countable additivity of nullity over R are not settled in this library, and no item on this page asserts anything about them. What the table records is what the proofs on disk actually spend, and it is meant to be checked against them rather than believed.

The one further caution is that a later proof of a result stated here could spend less. The direct argument for A monotone function on [a,b] is Riemann integrable: for the uniform partition into N parts the upper minus lower sum telescopes to ∣f(b)−f(a)∣ (b−a)/ι(N) is kept alongside the shorter route through A bounded function on [a,b] whose set of discontinuities is at most countable is Riemann integrable precisely for that reason: the direct one is elementary and quantitative, and both are choice-free, so nothing is lost by keeping the pair.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

92 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