Alphabeta Math
RemarkRemark: AI-generatedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-10 (gpt-5.6-terra-codex-subscription) rests on unproved material
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 ff on [a,b][a,b] as supPL(f,P)\sup_P L(f,P) and infPU(f,P)\inf_P U(f,P), Darboux integrability as their equality, and the notation abf\int_a^b f, and abf\int_a^b f is the common value of the lower and upper Darboux integrals. By The Darboux and Riemann definitions agree: a bounded ff on [a,b][a,b] is Darboux integrable with integral II if and only if for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that S(f,P,ξ)I<ε|S(f,P,\xi) - I| < \varepsilon for every tagged partition of mesh below δ\delta 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\int_a^a f := 0 and baf:=abf\int_b^a f := -\int_a^b f extends the notation by uuf:=0\int_u^u f := 0 and uvf:=vuf\int_u^v f := -\int_v^u f for u>vu > v. It is notation, not a new integral: the published definition is stated under the standing hypothesis a<ba < 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 GG is differentiable on [a,b][a,b] with G=fG' = f and ff is integrable, then abf=G(b)G(a)\int_a^b f = G(b)-G(a): the classical proof picks a mean-value point ξi\xi_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ΔiG(ti+1)G(ti)MiΔim_i\Delta_i \le G(t_{i+1})-G(t_i) \le M_i\Delta_i and summing it. The same discipline is followed in Bonnet's second mean value theorem: for ff monotone and gg integrable on [a,b][a,b] there is ξ[a,b]\xi\in[a,b] with abfg=f(a)aξg+f(b)ξbg\int_a^b fg = f(a)\int_a^\xi g + f(b)\int_\xi^b g, where the approximating sums are built from the values of the integral function at the partition points and no tags are chosen.

Choice does enter through published items that name their own cost, and those costs are inherited unchanged, not added to: Heine-Cantor in R\mathbb{R}: a continuous real function on a compact subset of R\mathbb{R} is uniformly continuous, proved R\mathbb{R}-natively from sequential compactness spends countable choice once, and every item here that rests on A continuous function on [a,b][a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion or on If ff is integrable on [a,b][a,b] with values in [m,M][m,M] and φ\varphi is continuous on [m,M][m,M], then φf\varphi \circ f is integrable inherits that single use. Lebesgue's criterion for Riemann integrability: a bounded ff on [a,b][a,b] is Riemann integrable if and only if its set of discontinuities has measure zero spends countable choice once in the half that goes from integrability to the discontinuity set being null, and the companion page uses that half; that use too is inherited and not new. The choice ledger of the previous page, 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, records the costs of the published items themselves.

4. Index conventions

N\mathbb{N} contains 00; a sequence is a function on N\mathbb{N}; and a partition of [a,b][a,b] is indexed from i=0i = 0, its first subinterval being [t0,t1][t_0,t_1]. Consequently The integral test: for f0f \ge 0 nonincreasing on [0,)[0,\infty), kf(k)\sum_k f(k) converges if and only if the sequence (0Nf)N\bigl(\int_0^N f\bigr)_N is bounded, with 0Nfk<Nf(k)f(0)+0Nf\int_0^N f \le \sum_{k<N} f(k) \le f(0) + \int_0^N f is stated with both the sum and the integral beginning at 00, and its bracket carries the term f(0)f(0); the classical form beginning at 11 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, which this library records but does not prove

Both are recorded elsewhere as results the library does not establish, and they are mentioned here for orientation only; nothing on this page or its companion rests on either.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 131 results over 20 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