Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-01
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.

Lower and upper Darboux sums over a grid partition in Rm

Definition

Let f:Q→R be bounded on a nondegenerate rectangle and let P be a grid. For each cell Qi, put mi:=inf⁡f[Qi],Mi:=sup⁡f[Qi],L(f,P):=∑imivol⁡(Qi),U(f,P):=∑iMivol⁡(Qi). The extrema exist as finite reals because each nonempty image is bounded (Lower bound, bounded below, bounded set, Complete ordered field (least-upper-bound property), Every nonempty set bounded below has an infimum, Greatest lower bound (infimum), Suprema and infima are unique), and the sums use the iterated convention of Grid partitions of a rectangle in Rm, their cells, refinements and mesh.

Since mi≤Mi and cell volumes are nonnegative, L(f,P)≤U(f,P). Moreover U(f,P)−L(f,P)=∑i(Mi−mi)vol⁡(Qi), the sum of cell oscillations weighted by volume (Laws of finite sums and finite products).

Depends on

Used by

Dependency tree · two levels

28 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