Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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.

Every Jordan exhaustion computes a nonnegative improper multiple integral

Statement

Every compact Jordan exhaustion computes the nonnegative improper integral, independently of the exhaustion.

Precisely, if f:D[0,) is locally Riemann integrable and (Kj) is a compact Jordan exhaustion, then

Df=supjNKjf.

Facts & Assumptions

Given: An open DRn, a locally Riemann-integrable f0, and a compact Jordan exhaustion (Kj).

[L1]

For nonnegative f, its improper integral is the extended-real supremum of its compact Jordan integrals (Improper multiple integrals and absolute convergence on open sets).

[L2]

On a nondegenerate rectangle, proper multidimensional Riemann integrals are monotone: fg implies fg (Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm).

[L3]

The integral over a bounded Jordan set is the integral over a bounding rectangle of the function extended by zero outside that set (The Riemann integral of a bounded function over a bounded Jordan measurable set).

[L4]

Compact cofinality is part of every compact Jordan exhaustion: every compact subset of the open domain lies in some member (Compact Jordan exhaustions of open subsets of Rn).

Proof

technique · direct
1.1

Since KjKj+1, extend both restricted functions by zero to one common bounding rectangle. Their zero extensions are ordered pointwise, so [L2] and [L3] make the numbers Kjf increasing, and every one is bounded above by the defining supremum Df of [L1].

L1L2L3
1.2

Every compact Jordan set KD lies in some Kj by [L4]. Extending the two restrictions by zero to one bounding rectangle and applying [L2] and [L3] gives KfKjfsupiKif.

L1L2L3L4
2.1

Taking the supremum over all compact Jordan K in step 1.2 gives DfsupiKif, while step 1.1 gives the reverse inequality; equality follows, including when the value is +.

step 1.1step 1.2L1

Depends on

Used by

Dependency tree · two levels

23 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