Alphabeta Math
LemmaStatement: 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.

Cotlar's inequality for maximal truncations

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let k:Rn∖{0}→C satisfy the pointwise size bound ∣k(x)∣≤A1∣x∣−n, the δ-Hölder smoothness bound ∣k(x−y)−k(x)∣≤A2′∣y∣δ∣x∣−n−δ for ∣x∣≥2∣y∣>0 with 0<δ≤1, and the cancellation bound sup⁡0<r<R∣∫r<∣x∣<Rk(x) dx∣≤A3. Let W be a principal-value distribution extending k (Calderón–Zygmund kernels and their associated operators) and let T be the convolution operator with W, bounded on L2(Rn). Then for every f∈S(Rn) and almost every x, T∗f(x)≤M(Tf)(x)+Cn,δ(A1+A2′+A3)Mf(x), where M is the centered Hardy–Littlewood maximal operator of The centered and uncentered Hardy-Littlewood maximal functions and T∗ is the maximal truncated operator of Maximal truncated singular integrals.

Facts & Assumptions

Given: Countable Choice; n≥1; 0<δ≤1; a kernel k with the size, Hölder and cancellation bounds; a principal-value distribution W extending k; the convolution operator T with W, bounded on L2; a Schwartz function f; a point x∈Rn; a scale ε>0; the canonical dimension-dependent nonnegative radially nonincreasing φ∈Cc∞(Rn) with ∫φ=1 and supp⁡φ⊆B(0,1/2), and its mollifiers φε(y)=ε−nφ(y/ε) (The mollifier family generated by a unit-mass smooth bump; the approximate-identity properties are recorded in A unit-mass smooth bump generates an L1 approximate identity).

[F1]

Tεf(x)=∫∣y∣≥εk(y)f(x−y) dy is absolutely convergent and T∗f(x)=sup⁡ε>0∣Tεf(x)∣ (Maximal truncated singular integrals).

[F2]

For u∈S′ and ψ∈S, (u∗ψ)(x)=⟨uy,ψ(x−y)⟩ defines a smooth function of polynomial growth, and Tf=W∗f is the convolution of the tempered distribution W with the Schwartz function f (Convolution of a tempered distribution with a schwartz function, Tempered convolution is smooth with polynomial growth).

[F3]

A principal-value distribution W for k has a sequence δj↓0 such that it satisfies ⟨W,ψ⟩=lim⁡j→∞∫∣z∣≥δjk(z)ψ(z) dz for every ψ∈S(Rn) (Calderón–Zygmund kernels and their associated operators).

[F4]

If ω≥0 is measurable, radially nonincreasing and integrable and g∈Lloc1, then ∫∣g(x−y)∣ω(y) dy≤∥ω∥1Mg(x) for every x (Radially decreasing kernels are dominated by the maximal function).

[F5]

Convolution of functions g,h on Rn is g∗h(x)=∫g(x−y)h(y) dy, whenever the integral converges absolutely (Convolution of two functions on Rn); on σ-finite products a nonnegative product-measurable integrand may be integrated in either order (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product); the Schwartz conventions are those of Schwartz space and its seminorms.

[F6]

Exponentials dominate every fixed polynomial at positive infinity, and Euclidean balls of positive radius have positive finite Lebesgue measure. (The exponential dominates every fixed nonnegative integer power at +∞, Euclidean balls have positive finite Lebesgue measure)

Proof

1.1F2F3F6givenconstruct

Fix the auxiliary bump once as a function of dimension only: let a(t)=e−1/t for t>0 and a(t)=0 otherwise, put ρ(y)=a(1−16∣y∣2) and φ(y)=cnρ(y) with cn=(∫ρ)−1. The derivatives of a on t>0 have the form Pk(1/t)e−1/t, with Pk+1(s)=s2(Pk(s)−Pk′(s)); [F6] makes each derivative and its difference quotient tend to zero at t=0, proving smoothness across that point. Thus ρ is smooth, supported in the closed radius-1/4 ball, nonnegative and radially nonincreasing since a′(t)≥0. Its mass is finite by boundedness and compact support, and positive since it is bounded below by a(3/4)>0 on the radius-1/8 ball, which has positive measure by [F6]. This gives the required unit-mass bump with support inside B(0,1/2). All its derivative bounds and cn depend only on n. For fixed ε>0 put k(ε)=k1{∣⋅∣≥ε} and Rε=k(ε)−W∗φε. By [F2,F3], W∗φε is smooth and equals the principal-value limit lim⁡j→∞∫∣z∣≥δjk(z)φε(x−z) dz. This need not be an absolutely convergent integral near z=0. If ∣x∣≥2ε, the support condition ∣x−z∣≤ε/2 implies ∣z∣≥3ε/2, so in that region the same formula is an ordinary absolutely convergent integral. Near the origin retain the principal-value limit and use the cancellation estimate in the next step.

1.2F3givenalgebra

Case ∣x∣<2ε. Write (W∗φε)(x)=lim⁡j→∞(I1(δ)+I2(δ)+I3(δ)) along δ=δj for all sufficiently large j such that 0<δj<ε/4, with the three pieces obtained by inserting φε(y)=φε(x)+(φε(y)−φε(x)) and splitting at ∣x−y∣=ε/4: I1(δ)=∫∣x−y∣>ε/4k(x−y)φε(y) dy, I2(δ)=∫δ≤∣x−y∣≤ε/4k(x−y)(φε(y)−φε(x))dy, and I3(δ)=φε(x)∫δ≤∣x−y∣≤ε/4k(x−y) dy; the three pieces are absolutely convergent and their sum is the truncation ∫∣x−y∣≥δk(x−y)φε(y) dy. Here ∣I1(δ)∣≤A1(4/ε)n∫φε=A14nε−n because ∣k(x−y)∣≤A1∣x−y∣−n on the domain; ∣I2(δ)∣≤∥∇φε∥∞A1∫∣x−y∣≤ε/4∣x−y∣−n∣x−y∣ dy≤CφA1ε−n by the mean value theorem, the bound ∣k∣≤A1∣⋅∣−n and polar coordinates of the punctured ball; and ∣I3(δ)∣≤∥φε∥∞A3≤CφA3ε−n by the cancellation bound after the substitution z=x−y. Finally ∣k(ε)(x)∣≤A1∣x∣−n1{∣x∣≥ε}≤A1ε−n. Hence ∣Rε(x)∣≤Cn,φ(A1+A3)ε−n≤Cn,δ,φ(A1+A2′+A3)εδ(ε+∣x∣)−n−δ, the last inequality because ∣x∣<2ε gives (ε+∣x∣)−n−δ≥(3ε)−n−δ.

2.1F3givenalgebra

Case ∣x∣≥2ε of the error bound. Since φε is supported in ∣y∣≤ε/2, for ∣x∣≥2ε one has ∣x∣≥2∣y∣ on the support, so k(ε)(x)=k(x) and, substituting z=x−y in the formula of step 1.1, Rε(x)=k(x)−∫k(x−y)φε(y) dy=∫[k(x)−k(x−y)]φε(y) dy, whence the Hölder bound gives ∣Rε(x)∣≤A2′∫∣y∣δφε(y) dy ∣x∣−n−δ=A2′Cφεδ∣x∣−n−δ≤A2′Cφ2n+δεδ(ε+∣x∣)−n−δ.

3.1F1F2F5step 1.2step 2.1algebra

The convolution identity is Tεf=((Tf)∗φε)+f∗Rε. Indeed, by the bounds in steps 1.2 and 2.1, Rε is integrable and its convolution with f converges absolutely; k(ε)∗f=Tεf also converges absolutely by the size bound and Schwartz decay. For the remaining term use the distribution pairing rather than interchange nonabsolute kernel integrals. The compactly supported integral ∫φε(y)f(x−y−⋅) dy converges in every Schwartz seminorm: all derivatives of f decay rapidly, uniformly over y in the fixed compact support. Continuity of the tempered distribution W therefore permits its pairing to pass through that integral. This gives (W∗f)∗φε=W∗(f∗φε). Applying the same argument to ∫f(x−z)φε(z−⋅) dz gives f∗(W∗φε)=W∗(f∗φε): its Schwartz seminorms are bounded by integrals of ∣f(x−z)∣(1+∣z∣)N, finite for every N. Hence f∗(k(ε)−Rε)=(W∗f)∗φε, proving the identity.

3.2step 2.1step 1.2algebra

Steps 2.1 and 1.2 together show that for every ε>0 and every x∈Rn, ∣Rε(x)∣≤Cn,δ(A1+A2′+A3) εδ(ε+∣x∣)−n−δ=Cn,δ(A1+A2′+A3) ωε(x), where ω(x):=(1+∣x∣)−n−δ, ωε(y)=ε−nω(y/ε), and ω is nonnegative, radially nonincreasing and integrable; note εδ(ε+∣x∣)−n−δ=ε−n(1+∣x∣/ε)−n−δ.

4.1F4step 3.1givenalgebra

First term bound: ∣((Tf)∗φε)(x)∣≤∫∣Tf(x−y)∣φε(y) dy≤∥φε∥1M(Tf)(x)=M(Tf)(x), using that φε is radially nonincreasing with ∫φε=1 and applying the domination lemma [F4] with g=Tf (a smooth function of polynomial growth, hence locally integrable).

4.2F4step 3.2givenalgebra

Second term bound: ∣(f∗Rε)(x)∣≤∫∣f(x−y)∣ ∣Rε(y)∣ dy≤Cn,δ(A1+A2′+A3)∫∣f(x−y)∣ ωε(y) dy≤Cn,δ(A1+A2′+A3)∥ω∥1Mf(x) by step 3.2 and the domination lemma [F4] applied to ωε, which is radially nonincreasing, integrable with ∥ωε∥1=∥ω∥1.

5.1F1step 4.1step 4.2∎

For every ε>0 and every x, steps 3.1, 4.1 and 4.2 give ∣Tεf(x)∣≤M(Tf)(x)+Cn,δ(A1+A2′+A3)∥ω∥1Mf(x); taking the supremum over ε>0 and using [F1] yields the asserted inequality with Cn,δ redefined to absorb ∥ω∥1=∫(1+∣y∣)−n−δdy<∞, in particular for almost every x.

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