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.
Calderón–Zygmund kernels and their associated operators
Definition
Fix an integer ; Lebesgue measure, the Euclidean norm, and the complex test-function conventions are those of Complex Lp classes and Euclidean test-function conventions. A Calderón–Zygmund kernel with constants is a pair consisting of a measurable function that is integrable on compact subsets of (A locally integrable function on ) and finite numbers such that and Condition (1) is an annular size condition: it bounds the mass of every dyadic annulus by , uniformly in the scale . It is an integral, not a pointwise, bound: the pointwise estimate implies (1) with , and not conversely. Since every compact subset of lies in with , and the latter is covered by the finitely many annuli for with , condition (1) also implies the local integrability listed above. Condition (2) is Hörmander's condition: an integral smoothness bound at scale . It is translation invariant, in that substituting for and leaving unchanged leaves the value of the integral unchanged, so it may be applied with the origin replaced by any centre .
A linear map with finite operator norm is a Calderón–Zygmund operator with kernel when for every compactly supported the integral converges absolutely for almost every and satisfies Here is the essential support defined in Complex Lp classes and Euclidean test-function conventions; compact support means that this closed set is compact. These conditions depend only on the almost-everywhere class of . Thus the only link between the operator and the kernel is the off-support representation (3): the action of on functions, on general bounded functions, or off the diagonal is not presupposed, and need not be convolution with any distribution. In the mean-zero applications below the absolute convergence in (3) is recovered from Hörmander's condition (2) by Tonelli's theorem; it is automatic whenever is locally square-integrable on .
A principal-value distribution for is a tempered distribution on (Tempered distribution, Schwartz space and its seminorms) that agrees with on , in the sense that for every supported in , and for which some sequence satisfies for every .
Neither the existence of a principal-value distribution nor the existence of any truncation limit is part of the definition of a Calderón–Zygmund kernel: a kernel may fail to have one, and the operator of (3) need not arise from one. Only the annular size condition (1), Hörmander's condition (2), the bound, and the off-support representation (3) are assumed. No choice principle is used in this definition.
Depends on
Used by
- The Hilbert transform is bounded on Lp Corollary
- The Riesz transforms are bounded on Lp Corollary
- Size without cancellation does not give a principal value Counterexample
- Standard (Hölder) Calderón–Zygmund kernels Definition
- Newtonian Hessian kernels fit the Calderón–Zygmund framework Example
- The Riesz kernel is a standard Calderón–Zygmund kernel Example
- Cotlar's inequality for maximal truncations Lemma
- Standard Hölder kernels satisfy the Hörmander condition Lemma
- The bad part is integrable away from expanded cubes Lemma
- The good part has controlled L2 image Lemma
- Calderón–Zygmund operators are bounded on Lp Theorem
- Calderón–Zygmund operators are of weak type (1,1) Theorem
- Maximal truncations: weak (1,1) and strong Lp bounds Theorem
- The Mihlin–Hörmander Fourier multiplier theorem Theorem
Dependency tree · two levels
23 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
- Loukas Grafakos, Classical Fourier Analysis, third edition (standard reference, not scraped)
- Terence Tao, Math 247A Lecture Notes 4 (standard reference, not scraped)