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.
The Hilbert and Riesz transforms map L-infinity to BMO
Statement
Assume Countable Choice. The Hilbert transform on and the Riesz transforms on extend to bounded maps , where for and for : for every the class of is well defined modulo constants, agrees with the action of when , and satisfies with a dimensional constant.
Facts & Assumptions
Given: Countable Choice, the Hilbert transform and the Riesz transforms , and a bounded function , with for and for .
The Hilbert transform and each Riesz transform are Calderon-Zygmund operators whose kernels are standard -Holder, with operator norm at most ; the Hilbert transform is the case with kernel and the Riesz transforms have kernels (The Hilbert and Riesz transforms are Calderon-Zygmund operators).
Every Calderon-Zygmund operator with a standard -Holder kernel and norm at most maps into : the class of is well defined modulo constants, agrees with the action when , and has (Calderon-Zygmund operators map L-infinity to BMO).
Proof
The hypotheses of [F2] are satisfied with : [F1] supplies the Calderon-Zygmund operator, the standard -Holder kernel with its constant, and the bound by ; for the Hilbert transform this is the case and for each Riesz transform the case of the corresponding kernel .
Applying [F2] to the Hilbert transform and to each Riesz transform gives, for every in the corresponding dimension, a well-defined class modulo constants with , and when that class is the class of the function ; the constants and hence depend only on .
The assertions of the statement are exactly those of step 2.1 for and , with . Countable Choice is inherited from both [F1] and [F2], including the endpoint gluing and consistency argument.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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
- Mark Williams, Notes on Harmonic Analysis (January 11, 2022) (standard reference, not scraped)
- Terence Tao, Math 247A Lecture Notes 4 (UCLA, Fall 2006) (standard reference, not scraped)