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 -indexed chain); this supplies Countable Choice (Dependent choice implies countable choice) for the truncation definitions. Let and (Muckenhoupt A_p and A_1 weights). Then the Hilbert transform on (Truncated Hilbert transform and principal value) and each Riesz transform on (Riesz transforms on Euclidean space) extend boundedly to (Weights, their associated measures, and the spaces L^p(w)), with norms bounded by , where the kernel constants are those recorded for the kernels and : for the Hilbert kernel , , and , and for each Riesz kernel , , and . The maximal truncations of these transforms obey the same bound, and for they satisfy the weighted weak estimate with the same structure of constants.
Facts & Assumptions
Given: Dependent Choice; ; , and in the endpoint discussion ; the Hilbert transform on and the Riesz transforms , , on .
The Hilbert kernel satisfies for and whenever , is odd, and is recorded as a standard -Hölder Calderón–Zygmund kernel with these constants; is the -bounded convolution operator with norm one for the principal-value distribution , and the truncations converge at every point of every Schwartz input to the corresponding value of the 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).
Each Riesz kernel satisfies , with whenever , and for every ; is the -bounded Fourier multiplier with symbol and operator norm at most one, and its truncations converge at every point of every Schwartz input to the corresponding value of the 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).
Weighted Calderón–Zygmund theorem: under the standing Dependent Choice hypothesis, for , , and any kernel data as in that theorem, every has with the same bound for ; if the weak bound holds; and if the truncations converge almost everywhere to a measurable limit on a dense subspace of , then the limit exists almost everywhere for every and satisfies the same bound (Weighted L-p bounds for standard Calderon-Zygmund maximal truncations).
is a Radon measure and is dense in for 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 density with uniform compact-support smoothing).
The principal-value truncations of the Hilbert and Riesz transforms converge almost everywhere on the dense class of Schwartz functions; indeed the published convergence theorem applies to these kernels with that dense class (Almost-everywhere convergence of principal-value truncations).
Proof
Kernel data in normalized form. For the Hilbert kernel, gives the pointwise size constant , the difference estimate of [F1] is the standard -Hölder condition with , and oddness gives for all , so the cancellation constant is ; the norm bound is , and is the convolution operator with the principal-value distribution of [F1] satisfying the off-support representation with kernel . For each Riesz kernel, [F2] gives the size constant , the standard -Hölder constant , vanishing annulus integrals and hence , and , 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.
Weighted bounds for the maximal truncations. By [F3] applied to the Hilbert kernel and to each Riesz kernel: for one has and , with the same bounds for and since ; for the theorem gives the weighted weak bounds for the maximal truncations with the corresponding constants.
Almost-everywhere convergence and the bounded extension. Let and . The subspace is dense in by [F4], and for every — 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 , an almost-everywhere limit or satisfying the displayed bounds; these limits define the stated bounded extensions. For and the same closure argument applies with the weak bound in place of the strong bound: for , off the null set where the truncations of converge, and tends to zero by density [F4], so the truncations converge -almost everywhere and the limit obeys .
Depends on
- Weighted L-p bounds for standard Calderon-Zygmund maximal truncations
- Almost-everywhere convergence of principal-value truncations
- The Hilbert transform is bounded on Lp
- The Riesz transforms are bounded on Lp
- Riesz kernel size, difference and spherical-cancellation bounds
- The Hilbert transform is the tempered convolution with pv(1/(pi x)) and has signum Fourier multiplier
- The Riesz transform is the principal value of its kernel, with the matching constant
- Truncated Hilbert transform and principal value
- Riesz transforms on Euclidean space
- Muckenhoupt A_p and A_1 weights
- Weights, their associated measures, and the spaces L^p(w)
- C_c(X) is dense in L^p(mu) for a Radon measure
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Dependent choice implies countable choice
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
- Loukas Grafakos, Classical Fourier Analysis, 3rd ed. (Springer GTM 249, 2014) (standard reference, not scraped)
- Juha Kinnunen, Harmonic Analysis (Aalto University lecture notes) (standard reference, not scraped)