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 operators are of weak type (1,1)
Statement
Assume Countable Choice (The Axiom of Countable Choice ()).
Let be a Calderón–Zygmund operator with kernel constants and norm . Then for every and every , with a dimensional constant independent of , and ; equivalently, extends to a bounded operator .
Facts & Assumptions
Given: A Calderón–Zygmund operator with kernel constants and norm bound ; and ; a constant to be fixed; Countable Choice.
is linear, -bounded with , and has the off-support kernel representation with constants (Calderón–Zygmund kernels and their associated operators); weak type with constant means exactly the inequality for all and (Sublinear operators and weak or strong type bounds).
The Calderón–Zygmund decomposition of at height writes a.e. with , , a.e., , and (Calderón–Zygmund decomposition at height λ); the good part satisfies (The good part has controlled L2 image). If additionally , then for the dilated cube of side times that of one has (The bad part is integrable away from expanded cubes); step 1.1 verifies this additional hypothesis before the estimate is used.
Chebyshev: for nonnegative measurable (Chebyshev-Markov inequality for the integral); dilation: for measurable (For a nonzero real , dilation by multiplies Lebesgue outer measure by , and reflection in the origin preserves it); Tonelli applies to nonnegative product-measurable integrands over -finite products (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product); the convention is The class of integrable functions and Countable Choice is The Axiom of Countable Choice ().
For nonnegative measurable , (Fatou's lemma).
Proof
Assume first and , and apply the decomposition [F2] at height with ; write , . The series converges in : the are supported on the pairwise disjoint cubes , and by and (the value of on ), so because and ; hence and, by linearity and -continuity of in [F1], as classes, so almost everywhere: choose image partial sums whose squared errors relative to are at most . By Chebyshev the sets where the errors exceed have measures at most ; their tail unions have measures tending to zero, so this subsequence converges almost everywhere, and the finite triangle inequalities pass to the limit. The good part is controlled at the target level directly: Chebyshev's inequality for at level , the bound of [F1] and the decomposition bound at height from [F2] give the last equality by the choice .
The dilated cubes satisfy by the dilation identity [F3] applied to the concentric dilation of , so the union bound and the decomposition's summability give
On the complement, Tonelli's theorem for the nonnegative series and the bad-part bound of [F2] give and the decomposition's bounds and show this is at most ; hence Chebyshev [F3] at level yields .
Combining step 1.1 (which supplies the almost-everywhere inequality and the good-part estimate), step 1.2 and step 1.3, where is the maximum of the three dimensional constants collected from steps 1.1–1.3; this is the assertion for .
Extension to all and . If , extend the zero operator on by zero on . Otherwise put and . The integrable tails show , so step 2.1 applied to differences makes Cauchy in measure. Select increasing such that . The measure of the union of these exceptional sets for is at most ; outside their null limsup the successive differences are eventually bounded by , so converges to a finite measurable limit, denoted . For each , almost everywhere. Fatou's lemma [F4] and step 2.1 yield . The same difference estimate implies uniqueness of limits in measure and independence of the chosen approximants; it also proves linearity by approximating two inputs and their linear combination. For these truncations converge in , so agrees with the original operator. Thus the compatible linear extension satisfies the required weak bound on all of .
Depends on
- Calderón–Zygmund kernels and their associated operators
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The class $L^1(\mu)$ of integrable functions
- Sublinear operators and weak or strong type $(p,q)$ bounds
- Calderón–Zygmund decomposition at height λ
- The bad part is integrable away from expanded cubes
- The good part has controlled L2 image
- Chebyshev-Markov inequality for the integral
- For a nonzero real $c$, dilation by $c$ multiplies Lebesgue outer measure by $|c|^n$, and reflection in the origin preserves it
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Fatou's lemma
Used by
Dependency tree · two levels
56 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)