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.

Maximal truncations: weak (1,1) and strong Lp bounds

Statement

Assume Countable Choice. Let n≥1, 0<δ≤1, and let k, W, T satisfy the hypotheses of Cotlar's inequality for maximal truncations: k is measurable and locally integrable on Rn∖{0} with ∣k(x)∣≤A1∣x∣−n,∣k(x−y)−k(x)∣≤A2′∣y∣δ∣x∣−n−δ  (∣x∣≥2∣y∣>0), and cancellation sup⁡0<r<R∣∫r<∣x∣<Rk(x) dx∣≤A3; W is a principal-value distribution for k; and T, the convolution operator with W, is L2-bounded with norm B and satisfies the off-support representation (3) of Calderón–Zygmund kernels and their associated operators with kernel k (so T is also a Calderón–Zygmund operator with kernel k). Then T∗∗ and T∗ are of weak type (1,1): there is a constant Cn,δ, depending only on n and on the fixed exponent δ, with ∣{∣T∗∗f∣>λ}∣≤Cn,δ(A1+A2′+A3+B)λ−1∥f∥1(f∈L1(Rn), λ>0), and for every 1<p<∞ there is a constant Cn,p,δ with ∥T∗∗f∥p≤Cn,p,δ(A1+A2′+A3+B)max⁡(p,(p−1)−1)∥f∥p(f∈Lp(Rn)). The same bounds hold for T∗, which satisfies T∗f≤T∗∗f pointwise. The proof consumes the Hörmander constant A2=∣Sn−1∣2−δδ−1A2′ supplied by the standard δ-Hölder bound; since A2≤Cn,δA2′, this is why the constants depend on the fixed exponent δ.

Facts & Assumptions

Given: Countable Choice; n≥1, 0<δ≤1, finite constants A1,A2′,A3,B≥0; the kernel k, principal-value distribution W and L2-bounded convolution operator T with off-support representation as in the statement; f∈L1(Rn) and λ>0; a height μ=γλ with γ>0 to be fixed; the centered Hardy–Littlewood maximal operator M.

[F1]

For 1≤p<∞ and g∈Lp the integrals defining Tεg and T(ε,N)g converge absolutely at every point, T∗g=sup⁡ε>0∣Tεg∣, T∗∗g=sup⁡0<ε<N<∞∣T(ε,N)g∣, and T∗g≤T∗∗g≤2T∗g pointwise (Maximal truncated singular integrals).

[F2]

Cotlar's inequality: for every u∈S(Rn) and almost every x, T∗u(x)≤M(Tu)(x)+C0(A1+A2′+A3)Mu(x) with a constant C0=Cn,δ (Cotlar's inequality for maximal truncations).

[F3]

Calderón–Zygmund decomposition at height μ: f=g+∑jbj almost everywhere, with the maximal dyadic cubes Qj pairwise disjoint, ∑j∣Qj∣≤μ−1∥f∥1, bj supported in Qj with ∫bj=0 and ∥bj∥1≤2n+1μ∣Qj∣, and the good part satisfying ∥g∥1≤∥f∥1, ∣g∣≤2nμ and ∥g∥22≤2nμ∥f∥1 (Calderón–Zygmund decomposition at height λ).

[F4]

The pointwise size bound gives the annular condition with A1∣Sn−1∣log⁡2, and the standard δ-Hölder bound gives Hörmander's condition with A2=∣Sn−1∣2−δδ−1A2′; hence k is a Calderón–Zygmund kernel in the base sense and, since T is a Calderón–Zygmund operator with kernel k, T extends uniquely to a bounded operator on Lp for 1<p<∞ with ∥Tu∥p≤Cn,p(A2+B)max⁡(p,(p−1)−1)∥u∥p (Standard Hölder kernels satisfy the Hörmander condition, Standard (Hölder) Calderón–Zygmund kernels, Calderón–Zygmund operators are bounded on Lp).

[F5]

M is the centered Hardy–Littlewood maximal operator: ∣{Mu>t}∣≤Cnt−1∥u∥1 for u∈L1, and ∥Mu∥2≤CM∥u∥2, ∥Mu∥p≤Cn,pmax⁡(p,(p−1)−1)∥u∥p for 1<p<∞ (The centered Hardy-Littlewood maximal operator is weak type (1,1), The centered maximal operator is bounded on Lp(Rn) for 1<p<∞, The centered and uncentered Hardy-Littlewood maximal functions).

[F7]

Hölder holds for complex Lp functions; Cc∞ is dense in finite-exponent Euclidean Lp under Countable Choice; dominated convergence applies under an integrable majorant, and Fatou applies to nonnegative measurable functions. (Complex Holder, Minkowski, and the quotient norm, Complex finite-simple and smooth compact-support density for finite p, Dominated convergence, Fatou's lemma)

Proof

technique · direct
1.1F1F2F5F6F7given

Cotlar's inequality extends to L2 inputs. Choose hm∈Cc∞ with hm→h in L2 by [F7]. For each t>0, the size bound makes kt=k1{∣⋅∣>t}∈L2, so Hölder gives ∣Tt(hm−h)(x)∣≤∥kt∥2∥hm−h∥2→0 for every x. Sublinearity and the L2 bound of M imply M(Thm)→M(Th) and Mhm→Mh in L2; [F6] gives a common almost-everywhere convergent subsequence for these two families. Outside the countable union of the exceptional sets for [F2], pass its bound for each hm to the limit at every t>0, then take the supremum to get T∗h≤M(Th)+C0(A1+A2′+A3)Mh almost everywhere. For every finite-exponent input, dominated convergence shows that t↦Tth(x) is continuous on (0,∞) for every x: nearby truncations are dominated by ∣k(z)h(x−z)∣1{∣z∣>t/2}, integrable by [F1]. Thus both maximal suprema can be taken over rational parameters and are measurable.

1.2F3F6algebra

Geometry of the dilated cubes. For each maximal cube Qj with centre cj and side length ℓj, let Qj∗ be the cube concentric with Qj and with side length 5n ℓj; then ∣Qj∗∣=(5n)n∣Qj∣ by the dilation identity [F6]. If x∉⋃kQk∗ and y∈Qj, then ∣x−cj∣∞>5n2ℓj, so ∣x−cj∣≥5n2ℓj>2⋅n2ℓj≥2∣y−cj∣; in particular ∣x−y∣≥∣x−cj∣−∣y−cj∣≥n2ℓj>0. Moreover, if t>0 and j belongs to J3(x,t):={j:∃ y0∈Qj, ∣x−y0∣=t}, then t≥∣x−cj∣−∣y0−cj∣≥(5n2−n2)ℓj=2n ℓj, and consequently every y∈Qj satisfies t2≤t−n ℓj≤∣x−y∣≤t+n ℓj≤3t2; hence ⋃j∈J3(x,t)Qj⊆B(x,3t2)∖B(x,t2).

2.1F1F3step 1.2algebra

Splitting the truncated bad part. Fix x∉⋃kQk∗ and t>0, and split the indices into J1,J2,J3 according to whether ∣x−y∣<t for all y∈Qj, ∣x−y∣>t for all y∈Qj, or ∣x−y∣=t for some y∈Qj. Each index lies in exactly one of the three classes because y↦∣x−y∣ is continuous on the connected cube. For j∈J1 the integrand of Ttb(x) vanishes on Qj; for j∈J2 one has ∣k(x−y)∣≤A1t−n on Qj; for j∈J3 step 1.2 gives ∣k(x−y)∣≤A1(2/t)n on Qj. Hence ∑j∫Qj∩{∣x−y∣>t}∣k(x−y)∣∣bj(y)∣ dy≤∑j∈J2∪J3∫Qj∣k(x−y)∣∣bj(y)∣ dy≤max⁡{A1t−n,A1(2/t)n}∑j∥bj∥1<∞ by [F3], so the series converges absolutely and Ttb(x)=∑j∫Qj∩{∣x−y∣>t}k(x−y)bj(y) dy. For j∈J2 the truncation is inactive on Qj and the mean-zero property of bj gives ∣∫Qjk(x−y)bj(y) dy∣=∣∫Qj[k(x−y)−k(x−cj)]bj(y) dy∣. For j∈J3, put cj(t):=∣Qj∣−1∫Qjbj(y)1{∣x−y∣>t}(y) dy; then ∣cj(t)∣≤∣Qj∣−1∥bj∥1≤2n+1μ and, since ∫Qj(bj1{∣x−y∣>t}−cj(t))=0, ∫Qjk(x−y)bj(y)1{∣x−y∣>t}(y) dy=∫Qj[k(x−y)−k(x−cj)](bj1{∣x−y∣>t}−cj(t))dy+cj(t)∫Qjk(x−y) dy. Summing, using ∣bj1−cj(t)∣≤∣bj∣+2n+1μ on Qj, and using step 1.2 with ∫{∣z∣∈[t/2,3t/2]}∣k(z)∣dz≤A1∣Sn−1∣log⁡3, yields sup⁡t>0∣Ttb(x)∣≤2E1(x)+2n+1μE2(x)+CnμA1, where E1(x):=∑j∫Qj∣k(x−y)−k(x−cj)∣∣bj(y)∣ dy and E2(x):=∑j∫Qj∣k(x−y)−k(x−cj)∣ dy: the J2 sum and the first J3 sum together contribute at most E1+2n+1μE2 (both E1 and E2 majorize their sub-sums over J2 and J3; if one of them is infinite the displayed inequality is trivial), while ∑j∈J3∣cj(t)∣∫Qj∣k(x−y)∣dy≤2n+1μ∫{∣z∣∈[t/2,3t/2]}∣k(z)∣dz by the containment of step 1.2 and the disjointness of the cubes. Since T(ε,N)b=Tεb−TNb, we obtain T∗∗b(x)≤2sup⁡t>0∣Ttb(x)∣≤4E1(x)+2n+2μE2(x)+CnμA1 at every such x (with Cn denoting a dimensional constant, as everywhere).

2.2F3F4F6step 1.2

Integrating E1 and E2 off the dilated cubes. By step 1.2, for x∉Qj∗ and y∈Qj one has ∣x−cj∣≥2∣y−cj∣, so in ∫(⋃kQk∗)cE1≤∑j∫Qj∣bj(y)∣(∫∣x−cj∣≥2∣y−cj∣∣k(x−y)−k(x−cj)∣ dx)dy the inner integral is at most A2 by Hörmander's condition, giving ∫(⋃kQk∗)cE1≤A2∑j∥bj∥1≤A22n+1μ∑j∣Qj∣≤2n+1A2∥f∥1; similarly ∫(⋃kQk∗)cE2≤A2∑j∣Qj∣≤A2μ−1∥f∥1. Both interchanges are Tonelli's theorem applied to nonnegative product-measurable integrands, and A2=∣Sn−1∣2−δδ−1A2′ by [F4].

3.1F6step 2.1step 2.2algebra

The bad part is controlled off the cubes. Choose γ:=(Kn(A1+A2′+A3+B))−1 with a dimensional constant Kn large enough that the last term of step 2.1 satisfies CnμA1=CnγλA1≤λ/3; if A1+A2′+A3+B=0 then k=0 and T∗∗=0, so the theorem is trivial, and otherwise γ>0 is well defined. Then λ/2=λ/3+λ/12+λ/12 and step 2.1 give {x∉⋃kQk∗:T∗∗b(x)>λ/2}⊆{4E1>λ/12}∪{2n+2μE2>λ/12}, so by Chebyshev's inequality and step 2.2, ∣{x∉⋃kQk∗:T∗∗b>λ/2}∣≤48λ∫E1+12⋅2n+2μλ∫E2≤CnA2λ−1∥f∥1≤Cn,δA2′λ−1∥f∥1.

4.1F3F5F6step 1.1

The good part. By step 1.1 and [F1], T∗∗g≤2T∗g≤2M(Tg)+2C0(A1+A2′+A3)Mg almost everywhere, and ∥Tg∥2≤B∥g∥2 by the L2 bound of T. Chebyshev's inequality, the L2 bound of M and ∥g∥1≤∥f∥1 give ∣{T∗∗g>λ/2}∣≤∣{M(Tg)>λ/8}∣+∣{Mg>λ/(8C0(A1+A2′+A3))}∣≤64λ2∥M(Tg)∥22+8CnC0(A1+A2′+A3)λ∥f∥1≤64CM2B2λ2∥g∥22+8CnC0(A1+A2′+A3)λ∥f∥1≤Cn,δ(A1+A2′+A3+B)λ−1∥f∥1, where the last step uses ∥g∥22≤2nμ∥f∥1=2nγλ∥f∥1 and γB2≤B/Kn≤(A1+A2′+A3+B)/Kn (in the degenerate case of step 3.1 the bound is trivial).

5.1F3step 1.2step 3.1step 4.1algebra

Weak (1,1) for f∈L1∩L2. Subadditivity of the supremum gives T∗∗f≤T∗∗g+T∗∗b pointwise, so ∣{∣T∗∗f∣>λ}∣≤∣{T∗∗g>λ/2}∣+∣⋃kQk∗∣+∣{x∉⋃kQk∗:T∗∗b>λ/2}∣≤Cn,δ(A1+A2′+A3+B)λ−1∥f∥1, because the union of cubes has measure at most (5n)n∑j∣Qj∣≤(5n)nμ−1∥f∥1≤(5n)nKn(A1+A2′+A3+B)λ−1∥f∥1 by steps 1.2 and 3.1 and [F3], while steps 3.1 and 4.1 bound the other two terms by dimensional multiples of (A1+A2′+A3+B)λ−1∥f∥1.

6.1F1F7step 5.1algebra

For general f∈L1, put fm=f1B(0,m)1{∣f∣≤m}∈L1∩L2. Then fm→f in L1 and ∥fm∥1≤∥f∥1. For every 0<ε<N, the size bound gives ∣T(ε,N)(fm−f)(x)∣≤A1ε−n∥fm−f∥1→0 at every x. Therefore T∗∗f(x)≤lim inf⁡mT∗∗fm(x): each fixed truncation is bounded by this liminf, and then one takes its supremum. Fatou [F7] applied to superlevel indicators and step 5.1 give the weak (1,1) bound; T∗≤T∗∗ transfers it to T∗. No subsequence selection is needed here.

7.1F1F4F5F7step 1.1step 6.1algebra

For 1<p<∞ and f∈Lp∩L2, step 1.1 gives T∗∗f≤2M(Tf)+2C0(A1+A2′+A3)Mf almost everywhere. The strong Lp bounds [F4,F5] and A2≤Cn,δA2′ yield ∥T∗∗f∥p≤Cn,p,δ(A1+A2′+A3+B)max⁡(p,(p−1)−1)∥f∥p; additional factors depending on p are included in Cn,p,δ, as allowed by the statement. For general f∈Lp, the same bounded compact-support approximants fm converge in Lp and satisfy ∥fm∥p≤∥f∥p. Every doubly truncated kernel lies in Lp′, so Hölder gives T(ε,N)fm(x)→T(ε,N)f(x) at every x for every parameter pair. Hence T∗∗f≤lim inf⁡mT∗∗fm pointwise, and Fatou [F7] applied to the pth powers extends the bound to all Lp. The comparison T∗≤T∗∗ gives its bound too.

8.1F1step 5.1step 6.1step 7.1∎

Steps 5.1 and 6.1 give the weak (1,1) bound for T∗∗, and step 7.1 gives the strong Lp bounds for T∗∗; the pointwise comparison T∗≤T∗∗ of [F1] transfers both to T∗. This proves the theorem.

Depends on

Used by

Dependency tree · two levels

102 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