Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)audited 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.

The lower and upper Darboux integrals over a nondegenerate rectangle in Rm\mathbb{R}^m

Definition

For a bounded function f:QRf:Q\to\mathbb R on a nondegenerate rectangle QRmQ\subseteq\mathbb R^m, define Qf:=supPL(f,P),Qf:=infPU(f,P),\underline{\int_Q}f:=\sup_P L(f,P),\qquad \overline{\int_Q}f:=\inf_P U(f,P), over all grid partitions PP of QQ. The grid family is nonempty, since the endpoints in each coordinate give a one-cell grid. Every lower sum is at most every upper sum by a common refinement and Refinement raises multidimensional lower sums and lowers upper sums, with a quantitative boundary-slab estimate, so the two sets of sums are nonempty and bounded and the extrema exist (Complete ordered field (least-upper-bound property), Every nonempty set bounded below has an infimum, Greatest lower bound (infimum), Suprema and infima are unique).

The function is Riemann integrable over QQ when the two values agree. Their unique common real is Qf\int_Q f. No integral is defined here for a degenerate rectangle, because the grid definition requires every coordinate interval to have distinct endpoints. This is the multidimensional Darboux definition; its agreement with the published one-dimensional definition is proved separately.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 56 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources