Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generated
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 d≥1 and let h:[0,1]d→R be bounded and nondecreasing in each coordinate while the other coordinates are fixed. Then h is Riemann integrable on [0,1]d.

Facts & Assumptions

Given: A bounded function h:[0,1]d→R that is nondecreasing in each coordinate.

[F1]

A coordinate grid has product cells, and each cell volume is the product of its side lengths. (Grid partitions of a rectangle in Rm, their cells, refinements and mesh, Axis-parallel rectangles in Rm and their volume)

[F2]

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 Rm)

[F3]

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 Rm: integrability is equivalent to arbitrarily small Darboux gaps)

[F4]

For every η>0 there is a positive integer n with 1/n<η. (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε)

Proof

1.1F1F2givenconstruct

For a positive integer n, partition each coordinate into [k/n,(k+1)/n], 0≤k<n, and write Ck for the product cell with lower vertex ℓk=(k1/n,…,kd/n) and upper vertex uk=((k1+1)/n,…,(kd+1)/n). Coordinatewise monotonicity gives inf⁡Ckh=h(ℓk) and sup⁡Ckh=h(uk). Each cell volume is n−d, so its contribution to U−L is n−d(h(uk)−h(ℓk)).

2.1givenstep 1.1algebra

For each k, let zk(j) have its first j coordinates at the upper knots of Ck and the remaining coordinates at the lower knots, for 0≤j≤d. Then zk(0)=ℓk, zk(d)=uk, and h(uk)−h(ℓk)=∑j=1d(h(zk(j))−h(zk(j−1))); all summands are nonnegative. Fix j and the other d−1 indices. Summing its increments over kj=0,…,n−1 telescopes to h(y1)−h(y0), where y0,y1 have the other coordinates at the selected lower or upper knots and the jth coordinates 0,1. Since 0≤y0≤y1≤1, this is at most h(1)−h(0). There are nd−1 choices of the other indices for each j, so ∑k(h(uk)−h(ℓk))≤dnd−1(h(1)−h(0)).

3.1F3F4step 2.1∎

By step 1.1, the grid's Darboux gap is at most d(h(1)−h(0))/n. Choose n 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

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