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.
An integrable function whose sections vanish outside finite sets has multiple integral zero
Statement
Let and be nondegenerate closed rectangles, and let be Riemann integrable. If the set is finite, then . The analogous assertion holds with the coordinate blocks exchanged.
Facts & Assumptions
Given: An integrable whose nonzero -sections are indexed by a finite set .
Riemann--Fubini permits a content-zero exceptional set of parameters and identifies the multiple integral with the resulting iterated integral (Riemann--Fubini on product rectangles, with lower and upper section integrals and content-zero exceptional sections).
A set has content zero when it admits finite cube covers of arbitrarily small total volume (Measure zero and content zero in by countable and finite cube covers).
Proof
A finite subset of has content zero by [L2]: for a given , cover its finitely many points by cubes whose total volume is below .
Outside every section is identically zero and has integral zero. Complete the section-integral function by the value on and apply [L1]; the resulting outer function is identically zero, so the multiple integral is zero.
If is empty then itself is identically zero, and step 2.1 still applies. Exchanging the coordinate blocks proves the symmetric assertion.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- J. Lebl, Basic Analysis II, Exercise 10.2.4 (standard reference, not scraped)