Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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.

Additivity of the integral over finitely many Jordan pieces that fill a Jordan set up to content zero

Statement

Let m1, let ARm be bounded and Jordan measurable, let N1, and let A1,,ANA be bounded Jordan measurable sets such that AiAj has content zero whenever ij and such that Ai=1NAi has content zero. Let f:AR be bounded, Riemann integrable over A and Riemann integrable over each Ai. Then

Af=i=1NAif.

Facts & Assumptions

Given: The sets A and A1,,AN with N1, the content-zero hypotheses on the pairwise intersections and on the residual set AiAi, and the bounded function f integrable over A and over each Ai, all as in the Statement.

[F1]

For bounded Jordan measurable E and bounded f:ER, choosing a nondegenerate rectangle QE and writing f~Q for the extension of f by 0 on QE, the function f is Riemann integrable over E when f~Q is integrable over Q, and then Ef=Qf~Q (The Riemann integral of a bounded function over a bounded Jordan measurable set).

[F2]

A set has content zero when it can be covered by finitely many closed cubes of arbitrarily small total volume, and both nullity and content zero pass to subsets (Measure zero and content zero in Rm by countable and finite cube covers).

[L1]

The definition of Ef is independent of the chosen bounding rectangle (The Riemann integral over a Jordan set is independent of the bounding rectangle).

[L2]

For integrable f,g on a nondegenerate rectangle Q and scalars α,β, the function αf+βg is integrable and its integral is αQf+βQg (Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm).

[L3]

Let E be bounded and Jordan measurable and let f,g:ER be bounded with {xE:f(x)g(x)} of content zero. Then f is Riemann integrable over E if and only if g is, and when they are integrable their integrals are equal (Changing a bounded integrand on a content-zero set does not change its Riemann integral).

[L4]

A metric-bounded set ERm is Jordan measurable if and only if its boundary E is null, equivalently has content zero (A bounded set in Rm is Jordan measurable iff its boundary is null, equivalently of content zero).

[L5]

A continuous graph over a compact nondegenerate rectangle has content zero (The graph of a continuous function on a closed nondegenerate rectangle in Rm has content zero in Rm+1).

Proof

technique · direct
1.1

Fix one nondegenerate rectangle QA; since each AiA, the same Q bounds every one of the N+1 sets. Write f~ for the zero extension of f from A to Q and f~i for the zero extension of fAi from Ai to Q. By hypothesis and [F1], with [L1] licensing the common choice of Q, all N+1 of these functions are integrable over Q, with Qf~=Af and Qf~i=Aif. If m=1, the boundary of Q=[u,v] is the two-point set {u,v}, and each point has content zero because for every ε>0 it lies in a closed interval of length below ε; if m>1, the boundary of Q is the finite union of its coordinate faces, each a continuous graph over a compact nondegenerate rectangle, so [L5] makes every face content zero. Thus Q has content zero by [F2] in every dimension, and therefore Q is Jordan measurable by [L4].

givenF1F2L1L4L5
2.1

Put g:=i=1Nf~if~ on Q. By [L2] it is integrable over Q, being a finite linear combination of the integrable functions of step 1.1. It is bounded as well: if A= then every zero extension and hence g is identically zero, while if A the boundedness of f supplies a real M0 with f(x)M on A, and then g(N+1)M on Q.

step 1.1L2given
3.1

Let S:=(ij(AiAj))(Ai=1NAi) and let xQS. If xA then f~(x)=0 and every f~i(x)=0, because AiA, so g(x)=0. If xA then x lies in some Ai, since otherwise it would lie in the residual set, and in exactly one, since otherwise it would lie in one of the pairwise intersections; hence if~i(x)=f(x)=f~(x) and again g(x)=0. So {xQ:g(x)0}S.

step 2.1givenalgebra
4.1

The set S is the union of the N(N1) pairwise intersections and the residual set, each of content zero by hypothesis. Given ε>0, cover each of those finitely many sets by finitely many closed cubes of total volume at most ε/(N(N1)+1) and take all of those cubes together: this is a finite cover of S by closed cubes of total volume at most ε, so S has content zero by [F2], and so does its subset {xQ:g(x)0}.

step 3.1F2
5.1

By step 1.1 the set Q is bounded and Jordan measurable and g is bounded on it, and by step 4.1 the set where g differs from the zero function has content zero; so [L3] applies with the zero function and gives Qg=0.

step 2.1step 4.1L3
6.1

Expanding Qg by [L2] and using step 1.1, 0=i=1NQf~iQf~=i=1NAifAf, which is the asserted identity. For N=1 there is no pairwise intersection and S is the residual set alone; the hypothesis N1 excludes the empty index set, for which the right-hand side would be 0 while the left need not be.

step 5.1L2F1

Remarks

  • An individual piece may be empty. Nothing above requires Ai: an empty piece contributes the integral 0 and creates no exceptional point, so the hypothesis constrains only the overlaps and the residue.

  • Why integrability over each piece is stated explicitly. For Jordan measurable AiA, this integrability follows from the other hypotheses by restricting the zero extension of f to the integrable indicator of Ai. The proof records it as a hypothesis because step 1.1 starts from the piece integrals, rather than inserting that standard product argument into the additivity calculation.

Depends on

Used by

Dependency tree · two levels

40 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