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.
Integrable functions on form a set closed under sums and scalar multiples, and
Statement
Let be reals and let be integrable (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation ). Then:
- is integrable on and ;
- for every real , is integrable on and ;
- consequently, for all reals the function is integrable and
- the same identity holds with oriented limits: if and are integrable between and (The integral with oriented limits: and ), then .
Linearity of the integral is not linearity of the Darboux sums, and the proof of claim 1 has to squeeze rather than compute. On a subinterval the inequality can be strict — take and on , where the left side is and the right side is — so is in general strictly below and no identity between upper sums is available. Claim 2, by contrast, is an identity at the level of the sums, with the roles of and exchanged when .
Facts & Assumptions
Given: Reals , integrable , reals , and a real .
Riemann's criterion: a bounded on is integrable if and only if for every real there is a partition with (Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with ).
For every partition and bounded : , and is integrable exactly when the two integrals agree, their common value being ; the lower integral is and the upper is (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation , Suprema and infima are unique).
and , where and over the subintervals of , with ; an integrable function is bounded, and a sum of two bounded functions and a scalar multiple of a bounded function are bounded (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, Lower bound, bounded below, bounded set).
If refines then ; the common refinement refines both (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).
Finite sums are additive and homogeneous: and (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clauses 1 and 2).
A supremum is the least upper bound and an infimum the greatest lower bound; both exist for a nonempty bounded set and are unique (Complete ordered field (least-upper-bound property), Greatest lower bound (infimum), Suprema and infima are unique).
Reflection: writing , a real is an upper bound of exactly when is a lower bound of , and conversely; hence and for nonempty bounded , by [L6] (Reflection through zero exchanges upper and lower bounds).
The constant function is integrable with (If on then for every partition ; in particular every constant function is integrable, with ).
Ordered-field arithmetic: adding a constant and multiplying by a positive quantity preserve an inequality, the order is total and transitive, and a real with for every real is (Ordered field, Complete ordered field (least-upper-bound property)). These order facts are used in their nonstrict form as well, obtained by adjoining the case of equality.
With oriented limits, and (The integral with oriented limits: and ).
Proof
, , and are bounded on , so all their Darboux sums and integrals are defined.
For every partition and every : for , so is an upper bound of and by [L6]; dually .
Fix partitions and with and , and put .
Claim 2, the case . Then is the constant function , integrable with integral .
Claim 2, the case . For every partition and every , is an upper bound of , and any upper bound of gives the upper bound of , whence and ; so by [L6], and dually .
Claim 2, the case . For every and , , so and by [L7].
By [L4], and .
Summing the inequalities of step 1.2 over against the positive weights and using [L5] gives .
With step 1.5 and [L5], and for ; hence , which [L1] makes smaller than any prescribed positive number by choosing suitably, so is integrable.
With step 1.6 and [L5], and , so and is integrable by [L1]; and by [L7] applied to the sets of Darboux sums, and , so .
Hence , so is integrable by [L1], having been arbitrary.
Moreover the set of lower sums of is times the set of lower sums of , and a supremum scales by a positive factor, by the argument of step 1.5 applied to that set; so , and likewise for the upper integrals, giving .
Both and lie in the interval from to : the first by [L2] and step 2.2, the second by [L2] applied to and to separately.
Claim 2 for . Then and , so steps 2.3, 2.4 and 3.2 give integrability and the required identities and .
That interval has length less than by step 2.1, so ; as was arbitrary the difference is , which is claim 1.
Claim 2 is now proved in all three cases , and , which are exhaustive by trichotomy.
Claim 3. By claim 2 the functions and are integrable with integrals and , and by claim 1 their sum is integrable with the sum of those integrals.
Claim 4. If then and claim 3 applies verbatim on ; if both sides are by [L10]; and if then applying the case to the pair and multiplying by gives the identity, by [L10].
Remarks
-
Why claim 1 cannot be an identity of Darboux sums. The example in the statement shows is possible on a single subinterval, so is false in general. What survives is the pair of inequalities of step 1.2, and they are enough because the gap between them is squeezed to by Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with .
-
The two scalar cases really are different. For the extreme values scale; for they are exchanged, because multiplying by a negative reverses the order (Reflection through zero exchanges upper and lower bounds). Merging the cases and writing for all would be false at , where the correct identity is .
-
The set of integrable functions on is closed under the operations named here and under more. Products, absolute values and the lattice operations are also integrable, but none of them is obtained from linearity alone: the proofs of If are integrable on then so are , , , and , and all pass through If is integrable on with values in and is continuous on , then is integrable, with linearity used only to recombine the pieces.
Depends on
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
Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with
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
If on then for every partition ; in particular every constant function is integrable, with
The integral with oriented limits: and
Reflection through zero exchanges upper and lower bounds
Greatest lower bound (infimum)
Suprema and infima are unique
Laws of finite sums and finite products
Finite sums and finite products, by recursion
Lower bound, bounded below, bounded set
Complete ordered field (least-upper-bound property)
Ordered field