Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-11
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 product grid bounds the Darboux sums of the lower and upper section-integral functions

Statement

Let A⊆Rp and B⊆Rq be nondegenerate closed rectangles, let f:A×B→R be bounded, and let P and R be grids of A and B. With ℓB,uB:A→R the lower and upper B-section-integral functions of Sections, lower and upper section integrals, and iterated Riemann integrals on product rectangles and Jordan sets, L(f,P×R)≤L(ℓB,P)≤U(ℓB,P)≤U(uB,P)≤U(f,P×R). The symmetric chain holds after exchanging A and B. No individual section is assumed integrable.

Facts & Assumptions

Given: Rectangles A,B, a bounded f:A×B→R, grids P,R, and the section envelopes ℓB,uB.

[L1]

For a bounded function on a product rectangle, the lower and upper section integrals are defined for every parameter even when the section is not Riemann integrable (Sections, lower and upper section integrals, and iterated Riemann integrals on product rectangles and Jordan sets).

[L2]

A grid cell of a product rectangle is the product of the corresponding cells of the two factor grids, and a sum over cells is the associated finite iterated sum (Grid partitions of a rectangle in Rm, their cells, refinements and mesh).

[L3]

Lower and upper Darboux sums are the finite sums of the cell infima and suprema weighted by cell volume (Lower and upper Darboux sums over a grid partition in Rm); finite sums may be regrouped and preserve inequalities term by term (Laws of finite sums and finite products).

Proof

technique · direct
1.1

For a cell I of P and a cell J of R, put mIJ:=inf⁡I×Jf and MIJ:=sup⁡I×Jf. Regrouping the finite sums over the product grid gives L(f,P×R)=∑Ivol⁡(I)∑JmIJvol⁡(J) and the analogous formula with MIJ for the upper sum.

L2L3given
2.1

If x∈I, then inf⁡Jfx≥mIJ and sup⁡Jfx≤MIJ for every J. Hence ℓB(x)≥∑JmIJvol⁡(J) and uB(x)≤∑JMIJvol⁡(J). Taking the infimum or supremum over x∈I preserves these inequalities.

L1L3step 1.1algebra
3.1

Multiply the cellwise inequalities by vol⁡(I) and sum over I. Together with ℓB≤uB, this gives the displayed chain. Exchanging the coordinate blocks gives the symmetric chain.

L1L3step 2.1algebra∎

Depends on

Used by

Dependency tree · two levels

27 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