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.
Additivity of the integral over finitely many Jordan pieces that fill a Jordan set up to content zero
Statement
Let , let be bounded and Jordan measurable, let , and let be bounded Jordan measurable sets such that has content zero whenever and such that has content zero. Let be bounded, Riemann integrable over and Riemann integrable over each . Then
Facts & Assumptions
Given: The sets and with , the content-zero hypotheses on the pairwise intersections and on the residual set , and the bounded function integrable over and over each , all as in the Statement.
For bounded Jordan measurable and bounded , choosing a nondegenerate rectangle and writing for the extension of by on , the function is Riemann integrable over when is integrable over , and then (The Riemann integral of a bounded function over a bounded Jordan measurable set).
A set has content zero when it can be covered by finitely many closed cubes of arbitrarily small total volume, and both nullity and content zero pass to subsets (Measure zero and content zero in by countable and finite cube covers).
The definition of is independent of the chosen bounding rectangle (The Riemann integral over a Jordan set is independent of the bounding rectangle).
For integrable on a nondegenerate rectangle and scalars , the function is integrable and its integral is (Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in ).
Let be bounded and Jordan measurable and let be bounded with of content zero. Then is Riemann integrable over if and only if is, and when they are integrable their integrals are equal (Changing a bounded integrand on a content-zero set does not change its Riemann integral).
A metric-bounded set is Jordan measurable if and only if its boundary is null, equivalently has content zero (A bounded set in is Jordan measurable iff its boundary is null, equivalently of content zero).
A continuous graph over a compact nondegenerate rectangle has content zero (The graph of a continuous function on a closed nondegenerate rectangle in has content zero in ).
Proof
Fix one nondegenerate rectangle ; since each , the same bounds every one of the sets. Write for the zero extension of from to and for the zero extension of from to . By hypothesis and [F1], with [L1] licensing the common choice of , all of these functions are integrable over , with and . If , the boundary of is the two-point set , and each point has content zero because for every it lies in a closed interval of length below ; if , the boundary of is the finite union of its coordinate faces, each a continuous graph over a compact nondegenerate rectangle, so [L5] makes every face content zero. Thus has content zero by [F2] in every dimension, and therefore is Jordan measurable by [L4].
Put on . By [L2] it is integrable over , being a finite linear combination of the integrable functions of step 1.1. It is bounded as well: if then every zero extension and hence is identically zero, while if the boundedness of supplies a real with on , and then on .
Let and let . If then and every , because , so . If then lies in some , since otherwise it would lie in the residual set, and in exactly one, since otherwise it would lie in one of the pairwise intersections; hence and again . So .
The set is the union of the pairwise intersections and the residual set, each of content zero by hypothesis. Given , cover each of those finitely many sets by finitely many closed cubes of total volume at most and take all of those cubes together: this is a finite cover of by closed cubes of total volume at most , so has content zero by [F2], and so does its subset .
By step 1.1 the set is bounded and Jordan measurable and is bounded on it, and by step 4.1 the set where differs from the zero function has content zero; so [L3] applies with the zero function and gives .
Expanding by [L2] and using step 1.1, , which is the asserted identity. For there is no pairwise intersection and is the residual set alone; the hypothesis excludes the empty index set, for which the right-hand side would be while the left need not be.
Remarks
-
An individual piece may be empty. Nothing above requires : an empty piece contributes the integral and creates no exceptional point, so the hypothesis constrains only the overlaps and the residue.
-
Why integrability over each piece is stated explicitly. For Jordan measurable , this integrability follows from the other hypotheses by restricting the zero extension of to the integrable indicator of . The proof records it as a hypothesis because step 1.1 starts from the piece integrals, rather than inserting that standard product argument into the additivity calculation.
Depends on
- The Riemann integral of a bounded function over a bounded Jordan measurable set
- The Riemann integral over a Jordan set is independent of the bounding rectangle
- Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in $\mathbb{R}^m$
- A bounded set in $\mathbb{R}^m$ is Jordan measurable iff its boundary is null, equivalently of content zero
- Changing a bounded integrand on a content-zero set does not change its Riemann integral
- Measure zero and content zero in $\mathbb{R}^m$ by countable and finite cube covers
- The graph of a continuous function on a closed nondegenerate rectangle in $\mathbb{R}^m$ has content zero in $\mathbb{R}^{m+1}$
Used by
Dependency tree · two levels
40 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- G. Strang and E. Herman, Calculus Volume 3 (OpenStax), section 6.8 (standard reference, not scraped)