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.
The support of a convolution lies in the closure of the support sumset
Statement
Let be represented by Borel functions still denoted . For any complex-valued function on , use the support convention
which extends the real-valued definition of The support of a function on and its compactly supported Riemann integral. Define Then
Facts & Assumptions
Given: Borel representatives and the function defined above.
The displayed integral defines convolution wherever it converges absolutely (Convolution of two functions on ).
Support is defined by the closure of the nonzero set (The support of a function on and its compactly supported Riemann integral).
Proof
Let [L1, L2, given, choose] . Choose an open neighborhood of disjoint from that closure. For and , one has , so ; and if then . Hence for every and every .
Therefore for every : by step 1.1 the integrand [L1, L2, step 1.1] vanishes for every , so the convolution integral exists and equals at each such . So lies outside the support of in the sense of [L2].
Since every point outside [step 2.1] lies outside , the support inclusion follows.
Depends on
Used by
- If 1 < p < ∞ and q is conjugate to p, then f*g is continuous and vanishes at infinity Corollary
- Hilbert transform does not map L-infinity to L-infinity Counterexample
- Hilbert transform is not strong type (1,1) Counterexample
- Hilbert transform of an interval indicator Example
- Complex translation, convolution, approximate identities, and mollification Lemma
- Mollification rates for compactly supported Slobodeckij functions Lemma
- Simultaneous L1 and L2 smooth approximation Lemma
- Smooth compactly supported functions of an open set are dense in L² Lemma
- C_c^∞(ℝⁿ) is dense in Lᵖ(ℝⁿ) for 1 ≤ p < ∞ Theorem
Dependency tree · two levels
8 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)