Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Change of variables on bounded open Jordan sets when both integrands are bounded and Riemann integrable

Statement

Let n≥1, let W⊆Rn be open, let U be a bounded open Jordan set with U‾⊆W, and let g:W→Rn be injective and C1, with invertible derivative throughout W. Put V=g(U) and assume V is a bounded open Jordan set. If f:V→R and h(x)=f(g(x))∣det⁡Dg(x)∣(x∈U) are both bounded and Riemann integrable on their respective Jordan sets, then ∫Vf(y) dy=∫Uh(x) dx. No improper-integral convention is implicit in this statement.

Facts & Assumptions

Given: The bounded open Jordan sets, map, and two bounded integrable functions in the statement.

[L1]

A bounded open Jordan set has a compact grid exhaustion with vanishing-content remainder (A bounded open Jordan set has an increasing exhaustion by compact finite unions of grid rectangles with vanishing content remainder).

[L2]

Compact-Jordan change of variables applies to every member of that exhaustion (Change of variables for an injective C1 map on a compact Jordan set).

[L3]

On a bounding rectangle, the absolute value of an integral is bounded by the integral of the absolute value (Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm); zero extension gives the corresponding supremum-times-content bound on a Jordan subset.

Proof

technique · exhaustion
1.1L1L2given

If U=∅, then V=∅ and both integrals are 0. Otherwise choose the compact grid exhaustion Kj↑U from [L1]. For every j, [L2] gives ∫g(Kj)f=∫Kjh.

2.1L1L3givenstep 1.1

A bound Mh for ∣h∣ gives source error at most Mhcont⁡(U∖Kj), which tends to zero by [L1] and [L3].

3.1L2L3L4givenstep 1.1step 2.1∎

The compact set U‾ is nonempty, and [L4] gives a bound MD for ∣det⁡Dg∣ on it. Apply [L2] to the compact Jordan remainder U‾∖int⁡Kj with the constant-one function. Its content tends to zero with cont⁡(U∖Kj), so cont⁡(V∖g(Kj))≤MDcont⁡(U‾∖int⁡Kj)→0. A bound for ∣f∣ and [L3] make the image error tend to zero as well. Passing to the limit in step 1.1 proves the formula.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

77 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