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

Hilbert and Riesz transforms are bounded on weighted L-p

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 (Dependent choice implies countable choice) for the truncation definitions. Let 1<p<∞ and w∈Ap (Muckenhoupt A_p and A_1 weights). Then the Hilbert transform H on R (Truncated Hilbert transform and principal value) and each Riesz transform Rj on Rn (Riesz transforms on Euclidean space) extend boundedly to Lp(w) (Weights, their associated measures, and the spaces L^p(w)), with norms bounded by C(n,p,[w]Ap)(A1+A2′+A3+B), where the kernel constants are those recorded for the kernels 1/(πx) and cnxj/∣x∣n+1: for the Hilbert kernel A1=1/π, A2′=2/π, A3=0 and B=1, and for each Riesz kernel A1=cn, A2′=cn2n+1(3n+4), A3=0 and B=1. The maximal truncations of these transforms obey the same bound, and for w∈A1 they satisfy the weighted weak (1,1) estimate with the same structure of constants.

Facts & Assumptions

Given: Dependent Choice; 1<p<∞; w∈Ap, and in the endpoint discussion w∈A1; the Hilbert transform H on R and the Riesz transforms Rj, 1≤j≤n, on Rn.

[F1]

The Hilbert kernel k(x)=1/(πx) satisfies ∣k(x)∣=1/(π∣x∣) for x≠0 and ∣k(x−y)−k(x)∣≤(2/π)∣y∣ ∣x∣−2 whenever ∣x∣≥2∣y∣>0, is odd, and is recorded as a standard 1-Hölder Calderón–Zygmund kernel with these constants; H is the L2-bounded convolution operator with norm one for the principal-value distribution W=pv 1/(πx), and the truncations Hεg converge at every point of every Schwartz input to the corresponding value of the L2 class (The Hilbert transform is bounded on Lp, The Hilbert transform is the tempered convolution with pv(1/(pi x)) and has signum Fourier multiplier, Truncated Hilbert transform and principal value).

[F2]

Each Riesz kernel Kj(x)=cnxj/∣x∣n+1 satisfies ∣Kj(x)∣≤cn∣x∣−n, ∣Kj(x−h)−Kj(x)∣≤Cn∣h∣ ∣x∣−(n+1) with Cn=cn2n+1(3n+4) whenever ∣h∣≤∣x∣/2, and ∫Sn−1Kj(rω) dσ(ω)=0 for every r>0; Rj is the L2-bounded Fourier multiplier with symbol −iξj/∣ξ∣ and operator norm at most one, and its truncations converge at every point of every Schwartz input to the corresponding value of the L2 class (Riesz kernel size, difference and spherical-cancellation bounds, The Riesz transforms are bounded on Lp, The Riesz transform is the principal value of its kernel, with the matching constant, Riesz transforms on Euclidean space).

[F3]

Weighted Calderón–Zygmund theorem: under the standing Dependent Choice hypothesis, for 1<p<∞, w∈Ap, and any kernel data A1,A2′,A3,B as in that theorem, every f∈Lp(w) has ∥T∗∗f∥Lp(w)≤C(n,p,δ,[w]Ap)(A1+A2′+A3+B)∥f∥Lp(w) with the same bound for T∗; if w∈A1 the weak (1,1) bound w({T∗∗f>λ})≤C(n,δ,[w]A1)(A1+A2′+A3+B)λ−1∥f∥L1(w) holds; and if the truncations converge almost everywhere to a measurable limit on a dense subspace of Lp(w), then the limit exists almost everywhere for every f∈Lp(w) and satisfies the same Lp(w) bound (Weighted L-p bounds for standard Calderon-Zygmund maximal truncations).

[F4]

w dλ is a Radon measure and Cc∞(Rn) is dense in Lp(w dλ) for 1≤p<∞ under Dependent Choice (Weights, their associated measures, and the spaces L^p(w), Weighted L-p bounds for standard Calderon-Zygmund maximal truncations, Facts [F5], which combines Radon Cc density with uniform compact-support smoothing).

[F5]

The principal-value truncations of the Hilbert and Riesz transforms converge almost everywhere on the dense class S(Rn) of Schwartz functions; indeed the published convergence theorem applies to these kernels with that dense class (Almost-everywhere convergence of principal-value truncations).

Proof

technique · direct
1.1F1F2givenalgebra

Kernel data in normalized form. For the Hilbert kernel, ∣k(x)∣=π−1∣x∣−1 gives the pointwise size constant A1=1/π, the difference estimate of [F1] is the standard 1-Hölder condition with A2′=2/π, and oddness gives ∫r<∣x∣<Rk(x) dx=0 for all 0<r<R, so the cancellation constant is A3=0; the L2 norm bound is B=1, and H is the convolution operator with the principal-value distribution of [F1] satisfying the off-support representation with kernel k. For each Riesz kernel, [F2] gives the size constant A1=cn, the standard 1-Hölder constant A2′=Cn=cn2n+1(3n+4), vanishing annulus integrals and hence A3=0, and B=1, together with the principal value on Schwartz functions. Hence both families meet the hypotheses of the weighted theorem [F3] with the constants displayed in the statement.

1.2F1F2F3givenalgebra

Weighted bounds for the maximal truncations. By [F3] applied to the Hilbert kernel and to each Riesz kernel: for f∈Lp(w) one has ∥H∗∗f∥Lp(w)≤C(n,p,[w]Ap)(1/π+2/π+0+1)∥f∥Lp(w) and ∥Rj∗∗f∥Lp(w)≤C(n,p,[w]Ap)(cn+Cn+0+1)∥f∥Lp(w), with the same bounds for H∗ and Rj∗ since T∗≤T∗∗≤2T∗; for w∈A1 the theorem gives the weighted weak (1,1) bounds for the maximal truncations with the corresponding constants.

2.1F3F4F5step 1.2givenalgebra∎

Almost-everywhere convergence and the bounded extension. Let 1<p<∞ and w∈Ap. The subspace Cc∞(Rn) is dense in Lp(w) by [F4], and for every g∈Cc∞(Rn) — a Schwartz function — the truncations converge almost everywhere by [F5]. The final clause of [F3] applied to the Hilbert kernel and to each Riesz kernel therefore gives, for every f∈Lp(w), an almost-everywhere limit Hf or Rjf satisfying the displayed Lp(w) bounds; these limits define the stated bounded extensions. For w∈A1 and f∈L1(w) the same closure argument applies with the weak (1,1) bound in place of the strong bound: for g∈Cc∞(Rn), lim sup⁡ε,ε′↓0∣Tεf−Tε′f∣≤2T∗(f−g) off the null set where the truncations of g converge, and w({T∗(f−g)>η})≤C(n,δ,[w]A1)(A1+A2′+A3+B)η−1∥f−g∥L1(w) tends to zero by density [F4], so the truncations converge w-almost everywhere and the limit obeys ∣Tf∣≤T∗f.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

98 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