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.
For : is integrable on if and only if it is integrable on and on , and then ; with the oriented form for arbitrary
Statement
Let be reals and let be bounded (Lower bound, bounded below, bounded set). Then:
- is 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 its restrictions to and to are integrable;
- and in that case
- Oriented form. Let be reals, let be integrable, and let be arbitrary. Then, with the convention of The integral with oriented limits: and ,
Claim 3 is where The integral with oriented limits: and earns its place: it holds for every arrangement of the three points, including the degenerate ones, and it is the form used everywhere below.
Statement references
Facts & Assumptions
Given: Reals and a bounded ; and, for claim 3, reals , an integrable and points . Let a real be given.
Riemann's criterion on any closed bounded interval with distinct endpoints (Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with ).
A function integrable on is integrable on every with (A function integrable on is integrable on every closed subinterval).
For a partition and bounded : , , and , the integral being the common value of the two when they agree (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 ).
A partition of is a pair with , , for and for ; its subintervals are for (Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Finite sums split at an intermediate index, with (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clause 3).
With oriented limits, and (The integral with oriented limits: and ).
Ordered-field arithmetic: adding a constant preserves an inequality, the order is total and transitive, and a real of absolute value below every positive real is (Ordered field, Complete ordered field (least-upper-bound property)).
Proof
Claim 1, forward. If is integrable on then, since and , [L2] gives integrability on and on .
The splice. Let be a partition of and one of . Define by for , for , and for . The two prescriptions agree at , where ; and , , with for every . So is a partition of .
Claim 1, converse. Suppose is integrable on and on , and use [L1] on each to fix with and with .
The first subintervals of are those of and the last are those of , with the matching lengths, so by [L3] and the splitting law [L5], and .
For the splice of those two, step 2.1 gives ; as was arbitrary and is bounded, [L1] makes integrable on .
Claim 2. With , and as above, [L3] puts between and , that is between and by step 2.1; and [L3] applied on and on puts between the same two numbers.
Those two numbers differ by less than by step 1.3, so ; as was arbitrary the difference is , which is claim 2.
Claim 3, first the sorted case. Let in . Then . Indeed if this is claim 2 applied on , where is integrable by [L2]; if the middle term is by [L6] and the identity is trivial; and if the last term is by [L6] and the identity is again trivial.
Put for , which is defined by [L2] and [L6]. Then for all : for this is step 6.1 rearranged; for both sides are by [L6]; and for the case already proved gives , and [L6] negates both sides.
Claim 3. For arbitrary , step 7.1 gives .
Remarks
-
The oriented form is not proved by listing six orderings. Step 7.1 shows that the oriented integral between two points is a difference of values of one function of one variable, after which claim 3 is the cancellation , valid however the three points are arranged and however many of them coincide. The case analysis is confined to the two lines of step 7.1, and no appeal to symmetry is made anywhere.
-
The function of step 7.1 is the integral function, and it is given its own item, The integral function of an integrable , because the rest of the page is about it. Nothing there re-proves step 7.1; it cites this theorem.
-
Boundedness on the whole of is a hypothesis of claim 1 in both directions. Boundedness on and on separately does give boundedness on the union, so the converse could be stated with the hypothesis split; it is stated globally because For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and needs it globally to make meaningful for a partition of .
Depends on
A function integrable on is integrable on every closed subinterval
The integral with oriented limits: and
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
Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
Laws of finite sums and finite products
Finite sums and finite products, by recursion
Lower bound, bounded below, bounded set
Intervals of : the nine order-convex forms, nondegeneracy, and length
Ordered field
Complete ordered field (least-upper-bound property)