Alphabeta Math
RemarkRemark: AI-generatedProof: Not applicable
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.

Conventions of this page, and which sharpenings of the integral are taken up later in the reading order

This item is the ledger of the page: what "integrable" means here, what the orientation convention costs, what the page spends in choice, and which sharpenings of the integral belong to later pages rather than to this one. It establishes no theorem and serves only as a conventions and reading-order ledger.

1. One integral, under two names

"Integrable" on this page means Darboux integrable in the sense of 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 ∫abf, and ∫abf is the common value of the lower and upper Darboux integrals. By 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 δ that is the same class of functions with the same value as Riemann's own definition by tagged partitions of small mesh, so the two words are used interchangeably, as they are in the literature. No other integral is defined or used by a proof on this page or its companion.

2. The orientation convention, and the statements whose form depends on it

The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf extends the notation by ∫uuf:=0 and ∫uvf:=−∫vuf for u>v. It is notation, not a new integral: the published definition is stated under the standing hypothesis a<b and simply says nothing outside it.

Several statements on this page take their shape from that convention; three are worth naming, and no claim is made that they are the only ones.

3. What the page spends in choice

Nothing on this page introduces a new use of a choice principle. Every step that instantiates an existential statement does so finitely many times, which is ordinary first-order reasoning. The one place where a reader might expect a selection is The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): the classical proof picks a mean-value point ξi in each subinterval of a partition and assembles a Riemann sum, and the proof given here does not, deriving instead the per-index inequality miΔi≤G(ti+1)−G(ti)≤MiΔi and summing it. The same discipline is followed in Bonnet's second mean value theorem: for f monotone and g integrable on [a,b] there is ξ∈[a,b] with ∫abfg=f(a)∫aξg+f(b)∫ξbg, where the approximating sums are built from the values of the integral function at the partition points and no tags are chosen.

The current Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous proof uses a finite subcover and no countable choice. Its uses in A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion and If f is integrable on [a,b] with values in [m,M] and φ is continuous on [m,M], then φ∘f is integrable add no choice cost. 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 now uses the choice-free canonical rational-cover lemma, so its uses on this page add no choice cost. The choice ledger of the previous page, Choice ledger for the Riemann integral: the page results are proved in ZF, records the proofs' premises.

4. Index conventions

N contains 0; a sequence is a function on N; and a partition of [a,b] is indexed from i=0, its first subinterval being [t0,t1]. Consequently The integral test: for f≥0 nonincreasing on [0,∞), ∑kf(k) converges if and only if the sequence (∫0Nf)N is bounded, with ∫0Nf≤∑k<Nf(k)≤f(0)+∫0Nf is stated with both the sum and the integral beginning at 0, and its bracket carries the term f(0); the classical form beginning at 1 is a statement about a tail, and this page does not silently substitute one for the other. A natural number multiplying or dividing a real always stands for its canonical natural.

5. What is taken up later in the reading order

Stated as reading order, and as no claim at all about what this library currently proves.

6. Two results a reader will want next

Both are later results in the reading order. The sharp FTC is proved in Fundamental theorem of calculus for absolutely continuous functions and dominated convergence in Dominated convergence.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

66 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