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.
Convolution on is independent of the chosen Borel representatives
Statement
Let . If are Borel representatives of and are Borel representatives of , then for almost every ,
Facts & Assumptions
Given: Two Borel representatives for each of the classes and .
The integrands from Borel representatives are measurable (Borel representatives make the convolution integrand Borel measurable).
The Lebesgue integral respects almost-everywhere equality (Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree).
Lebesgue measurability and null sets are translation invariant (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).
Proof
Let and . [L3, given, algebra] These are null sets. For a fixed , the set is also null by [L3]. Hence the two section integrands agree for almost every , outside the null set .
By [L1], both section integrands are measurable, and step 1.1 says they are [L1, L2, step 1.1] equal almost everywhere in . Therefore [L2] gives equality of their integrals whenever either side is defined as an absolutely convergent Lebesgue integral.
This holds for every fixed , so in particular it holds for almost every [step 2.1] on the domain where the convolution is defined. Thus the convolution does not depend on the chosen Borel representatives.
Depends on
Used by
Dependency tree · two levels
24 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
- Walter Rudin, Real and Complex Analysis, 3rd ed. (standard reference, not scraped)