Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Weighted L-p bounds for standard Calderon-Zygmund maximal truncations

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain); this supplies Countable Choice (The Axiom of Countable Choice (ACω), Dependent choice implies countable choice), which the published truncation definitions use. Let 1<p<∞, let w∈Ap (Muckenhoupt A_p and A_1 weights), and let k (pointwise size A1, standard δ-Hölder A2′, cancellation A3), a principal-value distribution W for k, and the associated L2-bounded convolution operator T with norm B be as in the published maximal-truncation theorem (Maximal truncations: weak (1,1) and strong Lp bounds, Maximal truncated singular integrals, Standard (Hölder) Calderón–Zygmund kernels, Calderón–Zygmund kernels and their associated operators). If A1+A2′+A3+B=0, the kernel and both maximal truncations vanish; otherwise the constants below are obtained by the indicated homogeneous bounds. Then for every f∈Lp(w) the maximal truncations are finite almost everywhere and ∥T∗∗f∥Lp(w)≤C(A1+A2′+A3+B)∥f∥Lp(w),C=C(n,p,δ,[w]Ap), and the same bound holds for T∗. Moreover, for w∈A1 the weak type (1,1) bound (Sublinear operators and weak or strong type (p,q) bounds) w({T∗∗f>λ})≤C(A1+A2′+A3+B)λ−1∥f∥L1(w) holds with C=C(n,δ,[w]A1). Finally, if the principal-value truncations Tεf converge almost everywhere to a measurable Tf for every f in a dense subspace of Lp(w), then the limit exists almost everywhere for every f∈Lp(w) and satisfies the same Lp(w) bound.

Facts & Assumptions

Given: Dependent Choice; the kernel data A1,A2′,A3,B,δ; a weight w; 1<p<∞; and, when the weak endpoint is treated, w∈A1.

[F1]

For every f∈Lp(w), every x and every ε>0 the truncated integrals are defined by absolutely convergent integrals, ∫∣y∣≥ε∣k(y)∣ ∣f(x−y)∣ dy≤C(n,p,[w]Ap)A1w(Q(x,ε))−1/p∥f∥Lp(w), and the maximal truncations are Borel measurable functions of the centre. Applying the same lemma to the auxiliary kernel ∣y∣−n also establishes ∫∣y∣≥ε∣f(x−y)∣∣y∣−ndy<∞, the finiteness hypothesis of the good-λ lemma (Kernel tail integrals of weighted L-p functions are finite).

[F2]

Quantitative weighted good-λ. Put S=A1+A2′+A3+B. When A1+A2′+A3>0, the local estimate of Unweighted local good-lambda estimate for maximal truncations gives, in each Whitney cube Qj, ∣Ej∣≤Cn,δγS∣Qj∣ for 0<γ<γ0=c0(n,δ)/(A1+A2′+A3). For w∈A∞ (The Muckenhoupt A_infinity class), A_infinity weights satisfy power decay gives w(Ej)≤Cw(∣Ej∣/∣Qj∣)ηw(Qj), with Cw,η>0 depending only on n and a witnessing exponent and characteristic. Summing over the disjoint Whitney cubes, as in Weighted good-lambda inequality for maximal truncations, yields the good-λ bound with δ′=η and C1=CwCn,δηSη. This applies to T∗∗ when its level set is proper and open, and separately to T∗ under the corresponding hypothesis. If A1+A2′+A3=0, the kernel and its truncations vanish and no absorption is needed.

[F3]

Maximal-function bounds: for w∈Ap and f∈Lp(w), ∥Mf∥Lp(w)≤Cn,p[w]Ap1/(p−1)∥f∥Lp(w) (The Hardy-Littlewood maximal operator characterises A_p); for w∈A1 and f∈L1(w), w({Mf>λ})≤5n[w]A1λ−1∥f∥L1(w) (Weighted weak (1,1) bound for the maximal function under A_1); and M(1B(0,1))(x)≥2−n(1+∣x∣)−n for every x, because B(0,1)⊆B(x,2(1+∣x∣)) (The centered and uncentered Hardy-Littlewood maximal functions).

[F4]

Layer cake: for measurable g≥0 and 0<p<∞, ∫gpw dλ=∫0∞pλp−1w({g>λ}) dλ, both sides allowed to be +∞; Fatou's lemma holds for nonnegative measurable functions (For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function, Fatou's lemma).

[F5]

w dλ is Radon. Under DC, Cc is dense in real Lp(w) by C_c(X) is dense in L^p(mu) for a Radon measure; apply it to each component for complex inputs. To obtain smooth density, choose a nonnegative smooth bump equal to one on a small ball and supported in a larger ball by A smooth bump between concentric Euclidean balls, and divide by its positive finite Lebesgue integral to get a unit-mass ρ. For each h∈Cc, the functions h∗ρε are smooth, compactly supported in one fixed bounded ball for ε≤1, and converge uniformly to h (Complex translation, convolution, approximate identities, and mollification, Statement and Proof 1.3–1.4, 2.2, 5.1). Their Lp(w) error is at most the uniform error times the finite w-measure of that ball to the power 1/p. Thus Cc∞ is dense for every finite p, including p=1.

[F6]

Chebyshev's inequality and the dominated convergence theorem (Chebyshev-Markov inequality for the integral, Dominated convergence).

[F7]

Tε and T(ε,N) are the truncations, T∗=sup⁡ε>0∣Tε∣, T∗∗=sup⁡0<ε<N∣T(ε,N)∣, and T∗≤T∗∗≤2T∗ pointwise; the kernel obeys ∣k(y)∣≤A1∣y∣−n and the cancellation bound sup⁡0<r<R∣∫r<∣y∣<Rk(y) dy∣≤A3; and T is the convolution operator with W, L2-bounded with norm B, satisfying the off-support representation with kernel k (Maximal truncated singular integrals, Standard (Hölder) Calderón–Zygmund kernels, Calderón–Zygmund kernels and their associated operators).

[F8]

Polar coordinates integrate radial nonnegative kernels (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma). Applying the one-variable mean value theorem along coordinate line segments, componentwise, gives ∣g(x−z)−g(x)∣≤Lg∣z∣ for a smooth compactly supported g and a finite Lg determined by its bounded first derivatives (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)).

Proof

technique · direct
1.1F1F3F6F7F8givenalgebra

A priori finiteness on the dense class. Fix g∈Cc∞ supported in B(0,Rg). In a double truncation, split at radius one. On the part below one, subtract g(x): [F8] bounds the resulting integral by A1Lg∫∣z∣<1∣z∣1−ndz=A1Lg∣Sn−1∣, while cancellation bounds the constant term by A3∥g∥∞. On the part above one, use the original integrand and ∣k(z)∣≤A1 to obtain the bound A1∥g∥1. Hence T∗∗g is uniformly bounded. If ∣x∣>2Rg+1, the original size estimate gives T∗∗g(x)≤2nA1∥g∥1∣x∣−n, so T∗∗g≤Cg(1+∣x∣)−n. Each finite truncation is continuous by dominated convergence, so its supremum has open level sets; the decay makes these bounded and proper. By [F3], T∗∗g≤2nCgM(1B(0,1)). The maximal bounds in [F3] therefore give finite Lp(w) norm for w∈Ap, p>1, and finite weak L1(w) norm for w∈A1.

2.1F2F3F4step 1.1givenalgebra

Fix p>1, w∈Ap and g∈Cc∞, with A1+A2′+A3>0; if this sum vanishes the truncations are zero and the strong bound is immediate. Write D(μ)=w({T∗∗g>μ}). For every 0<γ<γ0, splitting the level set and applying [F2] gives D(2μ)≤C1γδ′D(μ)+w({Mg>γμ}). By layer cake [F4], ∥T∗∗g∥Lp(w)p=2p∫0∞pμp−1D(2μ) dμ. The second distribution term integrates exactly to γ−p∥Mg∥Lp(w)p by the substitution t=γμ; it is finite by [F3].

2.2F2F3step 1.1givenalgebra

Weak endpoint on the dense class. Let w∈A1 and g∈Cc∞. If A1+A2′+A3=0 the kernel vanishes and the bound is immediate. Otherwise, since A1⊆A∞, [F2] applies; for every λ>0 the same splitting with the weak bound of [F3] in place of the strong one gives w({T∗∗g>2λ})≤C1γδ′w({T∗∗g>λ})+5n[w]A1(γλ)−1∥g∥L1(w). Multiplying by 2λ, taking the supremum over λ>0 (finite by step 1.1) and choosing γ=12min⁡{γ0,(4C1)−1/δ′} gives 2C1γδ′≤12 and γ−1≤C(n,δ,[w]A1)S, and yields ∥T∗∗g∥L1,∞(w)≤C(n,δ,[w]A1)(A1+A2′+A3+B)∥g∥L1(w); the weak (1,1) bound for T∗ follows from T∗≤T∗∗.

3.1F2F3F7step 1.1step 2.1givenalgebra

If A1+A2′+A3=0, both maximal truncations vanish and the bounds are immediate. Otherwise, substituting step 2.1 into the layer-cake identity and using the finiteness of ∥T∗∗g∥Lp(w) from step 1.1 gives ∥T∗∗g∥Lp(w)p≤2pC1γδ′∥T∗∗g∥Lp(w)p+2p(Cn,p[w]Ap1/(p−1))pγ−p∥g∥Lp(w)p; choosing γ=12min⁡{γ0,(2p+1C1)−1/δ′} gives 2pC1γδ′≤12, and since γ0=c0(A1+A2′+A3)−1 and C1≤CwCnδ′(A1+A2′+A3+B)δ′ one has γ−1≤C′(n,p,δ,[w]Ap)(A1+A2′+A3+B); hence ∥T∗∗g∥Lp(w)≤C(n,p,δ,[w]Ap)(A1+A2′+A3+B)∥g∥Lp(w), and T∗ inherits the bound because T∗≤T∗∗≤2T∗ by [F7].

4.1F1F4F5step 3.1step 2.2givenalgebra

Extension to f∈Lp(w). Let w∈Ap, 1<p<∞, f∈Lp(w), and choose gm∈Cc∞ with ∥gm−f∥Lp(w)→0 by [F5]. For every x and every fixed pair 0<ε<N, [F1] gives ∣T(ε,N)f(x)−T(ε,N)gm(x)∣≤C(n,p,[w]Ap)A1w(Q(x,ε))−1/p∥f−gm∥Lp(w)→0, so ∣T(ε,N)f(x)∣=lim⁡m∣T(ε,N)gm(x)∣≤lim inf⁡mT∗∗gm(x) for each fixed pair and, taking the supremum over all pairs, T∗∗f≤lim inf⁡mT∗∗gm pointwise. Fatou's lemma [F4] and step 3.1 then give ∥T∗∗f∥Lp(w)p≤lim inf⁡m∥T∗∗gm∥Lp(w)p≤C(n,p,δ,[w]Ap)p(A1+A2′+A3+B)p∥f∥Lp(w)p, in particular T∗∗f<∞ w-almost everywhere, and T∗f≤T∗∗f≤2T∗f carries the same conclusions. If instead w∈A1 and f∈L1(w), the same approximation gives T∗∗f≤lim inf⁡mT∗∗gm pointwise, hence {T∗∗f>λ}⊆lim inf⁡m{T∗∗gm>λ} for every λ>0 and w({T∗∗f>λ})≤lim inf⁡mw({T∗∗gm>λ})≤C(n,δ,[w]A1)(A1+A2′+A3+B)λ−1∥f∥L1(w) by step 2.2, so again T∗∗f<∞ w-a.e.; T∗ inherits both bounds by the pointwise comparison.

5.1F1F6step 4.1givenalgebra∎

Final clause. Let D⊆Lp(w) be a dense subspace on which Tε converges almost everywhere as ε↓0, and let f∈Lp(w). For g∈D and ε,ε′>0 one has ∣Tεf−Tε′f∣≤2T∗(f−g)+∣Tεg−Tε′g∣ pointwise, so for every η>0 the set where lim sup⁡ε,ε′↓0∣Tεf−Tε′f∣>4η has w-measure at most w({T∗(f−g)>η})≤η−p∥T∗(f−g)∥Lp(w)p≤C(n,p,δ,[w]Ap)p(A1+A2′+A3+B)pη−p∥f−g∥Lp(w)p by Chebyshev [F6] and step 4.1. For every η>0, take the infimum of this bound over g∈D; density makes the infimum zero, so the exceptional set is null; intersecting the resulting full-measure sets over η=1/m, m≥1, shows that (Tεf) is w-almost everywhere Cauchy as ε↓0, so the limit Tf exists w-a.e. and is measurable as an a.e. limit of measurable functions [F1]. It obeys ∣Tf∣≤T∗f pointwise, hence ∥Tf∥Lp(w)≤∥T∗f∥Lp(w)≤C(n,p,δ,[w]Ap)(A1+A2′+A3+B)∥f∥Lp(w) by step 4.1.

Depends on

Used by

Dependency tree · two levels

143 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