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 bounded coordinatewise nondecreasing function on a cube is Riemann integrable
Statement
Let and let be bounded and nondecreasing in each coordinate while the other coordinates are fixed. Then is Riemann integrable on .
Facts & Assumptions
Given: A bounded function that is nondecreasing in each coordinate.
A coordinate grid has product cells, and each cell volume is the product of its side lengths. (Grid partitions of a rectangle in , their cells, refinements and mesh, Axis-parallel rectangles in and their volume)
The lower and upper Darboux sums use the cell infima and suprema weighted by cell volumes. (Lower and upper Darboux sums over a grid partition in )
A bounded function on a nondegenerate rectangle is Riemann integrable exactly when it has arbitrarily small Darboux gaps over grid partitions. (Riemann's criterion on a nondegenerate rectangle in : integrability is equivalent to arbitrarily small Darboux gaps)
For every there is a positive integer with . (For every in a complete ordered field there is a natural with )
Proof
For a positive integer , partition each coordinate into , , and write for the product cell with lower vertex and upper vertex . Coordinatewise monotonicity gives and . Each cell volume is , so its contribution to is .
For each , let have its first coordinates at the upper knots of and the remaining coordinates at the lower knots, for . Then , , and ; all summands are nonnegative. Fix and the other indices. Summing its increments over telescopes to , where have the other coordinates at the selected lower or upper knots and the th coordinates . Since , this is at most . There are choices of the other indices for each , so .
By step 1.1, the grid's Darboux gap is at most . Choose large enough using [F4] to make this less than any prescribed positive tolerance (if the range is zero, every gap is zero). The criterion [F3] then gives Riemann integrability.
Depends on
- Grid partitions of a rectangle in $\mathbb{R}^m$, their cells, refinements and mesh
- Axis-parallel rectangles in $\mathbb{R}^m$ and their volume
- Lower and upper Darboux sums over a grid partition in $\mathbb{R}^m$
- Riemann's criterion on a nondegenerate rectangle in $\mathbb{R}^m$: integrability is equivalent to arbitrarily small Darboux gaps
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
Used by
Dependency tree · two levels
30 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
- Art B. Owen and Daniel Rudolf, A strong law of large numbers for scrambled net integration, Section 2 (standard reference, not scraped)