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.
Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with
Statement
Let be reals and let be bounded (Lower bound, bounded below, bounded set). Then is Darboux integrable on (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation ) if and only if
(For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and , Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).
This is the criterion every later integrability proof on this page uses. It replaces a statement about a supremum and an infimum over all partitions, which cannot be checked directly, by the exhibition of a single partition for each . The criterion says nothing about the value of the integral; that separate lower-and-upper-sum estimate places the integral between and for the same .
Facts & Assumptions
Given: Reals and a bounded .
The criterion: for every real there is a partition of with .
for every partition ; and over the nonempty sets of lower sums and of upper sums; is integrable exactly when the two are equal (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation , For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and ).
-characterisation of the supremum: if with nonempty then for every real there is with (Epsilon characterisation of the supremum). Dually, if then for every real there is with (Epsilon characterisation of the infimum, Greatest lower bound (infimum)).
If refines then and ; the common refinement refines both and (Refining a partition raises the lower Darboux sum and lowers the upper one, and every lower sum is at most every upper sum: when refines , and for arbitrary partitions and ; moreover the two changes are at most , Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).
Ordered-field arithmetic: adding a constant to both sides preserves an inequality, the order is total and transitive, and for (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
Write , a real number with by [L1]; is integrable exactly when .
The criterion is sufficient. Assume [A1] and let a real be given. Fix a partition with . By [L1], and , so .
The criterion is necessary; this half of the proof is steps 1.3, 2.2 and 3.1, and its symbols are its own. Assume is integrable and write for the common value . Let a real be given; then by [L4].
So for every real . If , taking gives , which is false; hence and is integrable by step 1.1.
By [L2] applied to , whose supremum is , there is a partition with ; by [L2] applied to , whose infimum is , there is a partition with .
Put , which refines both by [L3]. Then and , so by [L4]. Since was arbitrary, the criterion holds.
Steps 1.2 and 2.1 give the implication from the criterion to integrability, and steps 1.3, 2.2 and 3.1 give the converse; the two halves are independent and use no symbol in common, and together they are the stated equivalence.
Remarks
-
The strict inequality is not essential. Requiring for every defines the same condition, since a partition working for works strictly for . Statements below use whichever form is convenient and no consequence turns on the difference.
-
The common refinement is where the two partitions are reconciled. Step 2.2 produces one partition good for the lower sum and another good for the upper sum, and there is no reason for them to be the same. Refining a partition raises the lower Darboux sum and lowers the upper one, and every lower sum is at most every upper sum: when refines , and for arbitrary partitions and ; moreover the two changes are at most is exactly what allows a single partition to inherit both properties, and it is the only place in this proof where anything beyond the definitions is used.
-
No choice principle is used. Steps 1.2, 2.2 and 3.1 instantiate finitely many existential statements, which is ordinary first-order reasoning. See Choice ledger for the Riemann integral: the page results are proved in ZF.
Depends on
For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and
The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation
Refining a partition raises the lower Darboux sum and lowers the upper one, and every lower sum is at most every upper sum: when refines , and for arbitrary partitions and ; moreover the two changes are at most
Epsilon characterisation of the supremum
Epsilon characterisation of the infimum
Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
Lower bound, bounded below, bounded set
Greatest lower bound (infimum)
Complete ordered field (least-upper-bound property)
Ordered field
Order is preserved by adding a constant and by adding inequalities
Sign rules for products and monotonicity of multiplication