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 bounded on Lp

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 1<p<∞, T extends uniquely to a bounded operator on Lp(Rn) with ∥Tf∥p≤Cn,p(A2+B)max⁡(p,(p−1)−1)∥f∥p, where Cn,p depends only on n and p. In fact Cn,p may be chosen to be a dimensional constant Cn independent of p.

Facts & Assumptions

Given: A Calderón–Zygmund operator T with kernel k, constants A1,A2 and L2 norm bound B; an exponent 1<p<∞ with conjugate p′; a constant δ>0; Countable Choice.

[F1]

T is linear, L2-bounded with ∥Th∥2≤B∥h∥2, and satisfies the off-support representation with kernel k off the support of compactly supported L2 inputs; the kernel obeys the annular bound A1 and Hörmander's condition A2, the latter invariant under reflection: k∗(x):=k(−x)‾ also satisfies both bounds with the same constants (Calderón–Zygmund kernels and their associated operators).

[F2]

T is of weak type (1,1) with constant Cn(A2+B): ∣{∣Th∣>λ}∣≤Cn(A2+B)λ−1∥h∥1 for all h∈L1, and ∥Th∥2≤B∥h∥2 for h∈L2 (Calderón–Zygmund operators are of weak type (1,1)); weak and strong type are as in Sublinear operators and weak or strong type (p,q) bounds.

[F3]

Chebyshev: ∣{∣u∣>t}∣≤t−2∫∣u∣2 for measurable u; layer cake: ∥g∥qq=q∫0∞tq−1∣{∣g∣>t}∣dt; Fubini applies to absolutely integrable complex kernels (Fubini's theorem for L^1 functions on a sigma-finite product); Tonelli applies to nonnegative product-measurable integrands on σ-finite products (Chebyshev-Markov inequality for the integral, For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product); the Lp and Lp′ norms are the quotient norms of The space Lp(μ) as the quotient by null functions, Hölder's inequality is Complex Holder, Minkowski, and the quotient norm, and Cc∞ is dense in Lp for finite p (Complex finite-simple and smooth compact-support density for finite p).

[F4]

For 1≤p<∞ with conjugate q, ∥f∥p=sup⁡{∣∫fg∣:g∈Lq,∥g∥q≤1} (The Lp norm is the supremum of pairings against unit Lq functions); the L2 adjoint satisfies ⟨Th,g⟩=⟨h,T∗g⟩ for the first-variable-linear pairing (The Hilbert-space adjoint of a bounded operator); Monotone convergence is Monotone convergence for the integral; the interpolation-and-duality lemma with explicit constants is The Lp range: interpolation below two and adjoint duality above two.

Proof

technique · direct
1.1F1F2F4givenalgebra

The adjoint kernel k∗(x)=k(−x)‾ satisfies the annular bound and Hörmander's condition with the constants A1,A2: the annular integral of ∣k∗∣ is that of ∣k∣ under the reflection x↦−x, and ∣k∗(x−y)−k∗(x)∣=∣k(y−x)−k(−x)∣=∣k(y−x)‾−k(−x)‾∣, whose integral over ∣x∣≥2∣y∣ equals ∫∣u∣≥2∣y∣∣k(u+y)−k(u)∣du≤A2 by the substitution u=−x and the Hörmander condition applied to −y. The off-support representation for T∗ also follows from that of T. For compactly supported h∈L2 and a compact set E disjoint from its support, u(y)=∫k(x−y)‾h(x) dx is absolutely convergent for almost every y∈E: integrating its absolute majorant over E is bounded by ∥h∥1∫E−supp⁡h∣k(−z)∣ dz<∞, since the difference set is compact and avoids zero. For a bounded test g supported in E, Fubini in the kernel formula for Tg gives ⟨Tg,h⟩=⟨g,u⟩; absolute integrability follows from the same majorant times ∥g∥∞. The adjoint identity then says T∗h=u almost everywhere on E, since both are locally integrable and agree against all such tests. Exhausting the complement of the support by countably many compact sets proves exactly the required representation with k∗. Hence T∗, which is L2-bounded with norm B by [F4], is again a Calderón–Zygmund operator with constants A1,A2,B, and by [F2] both T and T∗ are weak (1,1) with constant A:=Cn(A2+B).

1.2F1F2F3algebra

Sharp two-level interpolation. Let S be any linear operator defined on L1+L2, weak (1,1) with constant A and L2-bounded with constant B, and let 1<q<2. For f∈Lq and any δ>0 put f0:=f1{∣f∣>δt} and f1:=f1{∣f∣≤δt} at height t>0; then f0∈L1 and f1∈L2, since ∥f0∥1≤(δt)1−q∥f∥qq and ∥f1∥22≤(δt)2−q∥f∥qq. Hence {∣Sf∣>t}⊆{∣Sf0∣>t/2}∪{∣Sf1∣>t/2} and the weak (1,1) bound for Sf0 together with Chebyshev and the L2 bound for Sf1 give ∣{∣Sf∣>t}∣≤2At∫{∣f∣>δt}∣f∣+4B2t2∫{∣f∣≤δt}∣f∣2. Integrating tq−1∣{∣Sf∣>t}∣ over (0,∞) and exchanging the integrals by Tonelli gives ∥Sf∥qq≤q[2Aδ1−qq−1+4B2δ2−q2−q]∥f∥qq, because ∫0∣f∣/δtq−2dt=(∣f∣/δ)q−1q−1 and ∫∣f∣/δ∞tq−3dt=(∣f∣/δ)q−22−q; choosing δ:=A/(2B2) when A,B>0 balances the two terms at a constant multiple of A2−qB2q−2, so that ∥Sf∥q≤Cq A2q−1B2−2q∥f∥q≤Cq(A+B)∥f∥q, the last inequality because the exponents 2q−1 and 2−2q are nonnegative and sum to one, so the weighted geometric mean is at most the sum; if A=0, let δ↓0, and if B=0, let δ→∞ in the preceding inequality, obtaining Sf=0 in either case.

2.1F2step 1.1step 1.2algebra

The case 1<p<2: by step 1.1 the operator T has weak (1,1) constant A=Cn(A2+B) and L2 norm B, so step 1.2 with q=p gives ∥Tf∥p≤CpA2/p−1B2−2/p∥f∥p≤Cn,p(A2+B)∥f∥p≤Cn,p(A2+B)max⁡(p,(p−1)−1)∥f∥p for every f∈Lp (which lies in L1+L2 by the canonical split of step 1.2, so Tf is defined).

2.2F3F4step 1.1step 1.2algebra

The case 2<p<∞: apply step 1.2 with q=p′ to the adjoint T∗, which by step 1.1 has weak (1,1) constant A and L2 norm B: for every g∈Lp′, ∥T∗g∥p′≤Cp′(A2+B)∥g∥p′. Then for f∈Lp∩L2 and g∈Lp′∩L2 with ∥g∥p′≤1, the adjoint identity and Hölder's inequality give ∣∫(Tf)g∣=∣⟨f,T∗g‾⟩∣≤∥f∥p∥T∗g‾∥p′≤Cp′(A2+B)∥f∥p, To establish Tf∈Lp before using norm recovery, put u=Tf∈L2, EN=B(0,N)∩{∣u∣≤N} and aN=(∫EN∣u∣p)1/p. If aN>0, take gN=1EN∣u∣p−1θu/aNp−1, with θu=u‾/∣u∣ on u≠0 and zero otherwise. This test is bounded on a finite-measure set, hence lies in Lp′∩L2, and satisfies ∥gN∥p′=1, ∫ugN=aN. The preceding pairing bound gives aN≤Cp′(A2+B)∥f∥p; if aN=0 the same inequality is immediate. Since EN increases to a full-measure set, monotone convergence gives ∥Tf∥p≤Cp′(A2+B)∥f∥p; since Cc∞⊆Lp∩L2 is dense in Lp, this bound extends uniquely to all of Lp, and Cp′(A2+B)≤Cn,p(A2+B)max⁡(p,(p−1)−1).

3.1F2F3F4step 1.1step 1.2step 2.2algebra

The exponent dependence can be made dimension-only. Put D=A2+B. If D=0, then B=0 and T=0. Otherwise normalize S=T/D. Step 1.1 and the weak endpoint give weak (1,1) constants at most an=Cn for both S and S∗, and their L2 norms are at most one. The interpolation-and-duality lemma [F4] at q=3/2 and its conjugate 3 gives ∥S∥3→3,∥S∗∥3→3≤dn with dn depending only on n. For 1<p≤2, split f=f1{∣f∣>t}+f1{∣f∣≤t}. Weak (1,1) on the first part and Chebyshev with the strong (3,3) bound on the second yield ∣{∣Sf∣>t}∣≤2ant−1∫∣f∣>t∣f∣+8dn3t−3∫∣f∣≤t∣f∣3. Layer cake and Tonelli, as in step 1.2, give ∥Sf∥pp≤p[2an/(p−1)+8dn3/(3−p)]∥f∥pp≤Kn(p−1)−1∥f∥pp, with Kn≥1 independent of p. The compatible L1 and L3 actions agree on their intersection by approximation with bounded compact-support functions in both norms. Thus ∥S∥p→p≤Kn/(p−1) for 1<p≤2. Apply this estimate to S∗ at p′=p/(p−1) and use the finite-support tests and density argument of step 2.2 to get ∥S∥p→p≤Kn(p−1)≤Knp for p>2. Consequently ∥T∥p→p≤KnDmax⁡(p,(p−1)−1) throughout the strict range.

4.1F3step 2.1step 2.2step 3.1∎

Steps 2.1 and 2.2 prove boundedness and uniqueness in the two open ranges; the given L2 bound handles p=2. Step 3.1 also proves the stronger bound with a dimensional constant independent of p, and hence the stated estimate.

Depends on

Used by

Dependency tree · two levels

73 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