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.
A function integrable on is integrable on every closed subinterval
Statement
Let be reals, let be integrable (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation ), and let satisfy
Then the restriction of to is bounded (Lower bound, bounded below, bounded set) and integrable on .
The degenerate case is not an omission: there by The integral with oriented limits: and , and no partition of exists to speak of (Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).
Facts & Assumptions
Given: Reals , an integrable , and reals with . Write for the restriction of to .
Riemann's criterion: a bounded function on a closed bounded interval with distinct endpoints is integrable if and only if for every real there is a partition of that interval with (Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with , The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation ).
For a partition of and a point , the partition satisfies and refines ; a refinement of a refinement refines the original, since the point-set inclusions compose (Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).
For a partition of an interval and bounded on it: , with , , , , and (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, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Finite sums: additivity, scaling, splitting at an intermediate index with , and monotonicity in the terms, so that a sum of nonnegative terms is at most a sum containing those terms among others (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clauses 1 to 4).
A partition of has strictly increasing on indices , hence injective there, so a point of is for exactly one ; and gives (Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).
A restriction of a bounded function is bounded: the same serves fewer points (Lower bound, bounded below, bounded set).
Proof
is bounded on , since and is bounded on , integrability presupposing boundedness.
Let a real be given, and fix a partition of with .
Put , a partition of refining whose point set contains and .
By [L3] applied to the pair , .
Write and fix the unique indices with and ; then , because and is increasing on those indices.
Define by for and for . Then , , and for by [L6], with ; so is a partition of , its -th subinterval is and its -th length is .
For the -th subinterval of is , and agrees with there, so the extreme values of on it are and ; hence by [L4] and [L5].
Every term is nonnegative by [L4], and splitting first at and then at exhibits as one of the three pieces of , the other two being nonnegative; so the displayed sum is at most .
Combining, .
Since was arbitrary and is bounded, [L1] applies on and is integrable there.
Remarks
-
The one step that is not bookkeeping is the re-indexing. A partition in this library is a pair with a tail convention (Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions), not a set of points, so "restrict to " is not a defined operation; step 4.1 writes the restricted list out, shifts its index by and resets its tail to . Everything else follows from the fact that dropping nonnegative terms from a finite sum cannot increase it.
-
The converse is also true, and is proved separately. Integrability on and on gives integrability on ; that direction needs a splice rather than a restriction and is the second half of For : is integrable on if and only if it is integrable on and on , and then ; with the oriented form for arbitrary .
Depends on
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
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
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
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