Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 (ACω)).

Let T be a Calderón–Zygmund operator with kernel constants A1,A2 and L2 norm B. Then for every f∈L1(Rn) and every λ>0, ∣{∣Tf∣>λ}∣≤Cn(A2+B)λ−1∥f∥1 with a dimensional constant Cn independent of T, f and λ; equivalently, T extends to a bounded operator L1(Rn)→L1,∞(Rn).

Facts & Assumptions

Given: A Calderón–Zygmund operator T with kernel constants A1,A2 and L2 norm bound B; f∈L1(Rn) and λ>0; a constant γ>0 to be fixed; Countable Choice.

[F1]

T is linear, L2-bounded with ∥Th∥2≤B∥h∥2, and has the off-support kernel representation with constants A1,A2 (Calderón–Zygmund kernels and their associated operators); weak type (1,1) with constant A means exactly the inequality μ({∣Th∣>λ})≤Aλ−1∥h∥1 for all h∈L1 and λ>0 (Sublinear operators and weak or strong type (p,q) bounds).

[F2]

The Calderón–Zygmund decomposition of h∈L1 at height μ>0 writes h=g+∑jbj a.e. with ∥g∥1≤∥h∥1, ∥g∥22≤2nμ∥h∥1, ∣g∣≤2nμ a.e., ∫bj=0, ∥bj∥1≤2n+1μ∣Qj∣ and ∑j∣Qj∣≤μ−1∥h∥1 (Calderón–Zygmund decomposition at height λ); the good part satisfies ∣{∣Tg∣>μ/2}∣≤4B22nμ−1∥h∥1 (The good part has controlled L2 image). If additionally bj∈L2, then for the dilated cube Qj∗ of side 2n times that of Qj one has ∫Rn∖Qj∗∣Tbj∣≤A2∥bj∥1 (The bad part is integrable away from expanded cubes); step 1.1 verifies this additional hypothesis before the estimate is used.

[F3]

Chebyshev: μ({∣u∣≥t})≤t−1∫∣u∣ for nonnegative measurable ∣u∣ (Chebyshev-Markov inequality for the integral); dilation: λ(rE)=rnλ(E) for measurable E (For a nonzero real c, dilation by c multiplies Lebesgue outer measure by ∣c∣n, 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 L1 convention is The class L1(μ) of integrable functions and Countable Choice is The Axiom of Countable Choice (ACω).

[F4]

For nonnegative measurable vr, ∫lim inf⁡rvr≤lim inf⁡r∫vr (Fatou's lemma).

Proof

technique · direct
1.1F1F2F3algebra

Assume first f∈L1∩L2 and B>0, and apply the decomposition [F2] at height μ=γλ with γ:=2−(n+1)B−1; write f=g+b, b=∑jbj. The series ∑jbj converges in L2: the bj are supported on the pairwise disjoint cubes Qj, and ∥bj∥22≤2∫Qj∣f∣2+2 (2nγλ)2∣Qj∣ by bj=(f−∣Qj∣−1∫Qjf)1Qj and ∣∣Qj∣−1∫Qjf∣≤2nγλ (the value of ∣g∣ on Qj), so ∑j∥bj∥22≤2∥f∥22+2⋅4nγλ∥f∥1<∞ because f∈L1∩L2 and ∑j∣Qj∣≤(γλ)−1∥f∥1; hence b∈L2 and, by linearity and L2-continuity of T in [F1], Tf=Tg+∑jTbj as L2 classes, so ∣Tf∣≤∣Tg∣+∑j∣Tbj∣ almost everywhere: choose image partial sums whose squared L2 errors relative to Tb are at most 2−3r. By Chebyshev the sets where the errors exceed 2−r have measures at most 2−r; 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 λ/2 directly: Chebyshev's inequality for ∣Tg∣2 at level (λ/2)2, the L2 bound ∥Tg∥2≤B∥g∥2 of [F1] and the decomposition bound ∥g∥22≤2nγλ∥f∥1 at height μ=γλ from [F2] give ∣{∣Tg∣>λ/2}∣≤4λ2∥Tg∥22≤4B2λ2 2nγλ∥f∥1=4B22nγλ−1∥f∥1=2B λ−1∥f∥1, the last equality by the choice γ=2−(n+1)B−1.

1.2F2F3algebra

The dilated cubes satisfy ∣Qj∗∣=(2n)n∣Qj∣ by the dilation identity [F3] applied to the concentric dilation of Qj, so the union bound and the decomposition's summability give ∣⋃jQj∗∣≤∑j∣Qj∗∣≤(2n)n(γλ)−1∥f∥1=2n+1nn/22nB λ−1∥f∥1.

1.3F2F3algebra

On the complement, Tonelli's theorem for the nonnegative series and the bad-part bound of [F2] give ∫Rn∖⋃jQj∗∑j∣Tbj∣ dx=∑j∫Rn∖⋃kQk∗∣Tbj∣ dx≤∑j∫Rn∖Qj∗∣Tbj∣ dx≤A2∑j∥bj∥1, and the decomposition's bounds ∥bj∥1≤2n+1γλ∣Qj∣ and ∑j∣Qj∣≤(γλ)−1∥f∥1 show this is at most 2n+1γλ(γλ)−1A2∥f∥1=2n+1A2∥f∥1; hence Chebyshev [F3] at level λ/2 yields ∣{x∉⋃jQj∗:∑j∣Tbj∣>λ/2}∣≤2n+2A2λ−1∥f∥1.

2.1step 1.1step 1.2step 1.3algebra

Combining step 1.1 (which supplies the almost-everywhere inequality and the good-part estimate), step 1.2 and step 1.3, ∣{∣Tf∣>λ}∣≤∣{∣Tg∣>λ/2}∣+∣⋃jQj∗∣+∣{x outside the cubes:∑j∣Tbj∣>λ/2}∣≤Cn(A2+B)λ−1∥f∥1, where Cn:=max⁡{2+22n+1nn/2, 2n+2} is the maximum of the three dimensional constants collected from steps 1.1–1.3; this is the assertion for f∈L1∩L2.

3.1F1F4step 2.1algebra∎

Extension to all f∈L1 and B≥0. If B=0, extend the zero operator on L2 by zero on L1. Otherwise put D=Cn(A2+B) and fm=f1B(0,m)1{∣f∣≤m}∈L1∩L2. The integrable tails show ∥fm−f∥1→0, so step 2.1 applied to differences makes um=Tfm Cauchy in measure. Select increasing mr such that ∣{∣umr+1−umr∣>2−r}∣≤2−r. The measure of the union of these exceptional sets for r≥R is at most ∑r≥R2−r→0; outside their null limsup the successive differences are eventually bounded by 2−r, so umr converges to a finite measurable limit, denoted Tf. For each λ>0, 1{∣Tf∣>λ}≤lim inf⁡r1{∣Tfmr∣>λ} almost everywhere. Fatou's lemma [F4] and step 2.1 yield ∣{∣Tf∣>λ}∣≤lim inf⁡r∣{∣Tfmr∣>λ}∣≤Dλ−1∥f∥1. The same difference estimate implies uniqueness of limits in measure and independence of the chosen L1∩L2 approximants; it also proves linearity by approximating two inputs and their linear combination. For f∈L1∩L2 these truncations converge in L2, so Tf agrees with the original operator. Thus the compatible linear extension satisfies the required weak (1,1) bound on all of L1.

Depends on

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