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.
Random signed dyadic sums have uniform Mihlin and Lp multiplier bounds
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). For every sequence of complex numbers with the symbol of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators is a Mihlin symbol with constants for , where does not depend on the coefficients and the series is locally finite. Consequently, for every and every , with independent of the coefficients. In particular the bound is uniform over all sign sequences and over all finite truncations, that is over for every and every choice of signs.
Facts & Assumptions
Given: the fixed partition of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators; a sequence with ; ; a real .
Each satisfies , with a locally finite sum, for and ; for every multi-index there is with for and all , with (Existence of a smooth inhomogeneous dyadic frequency partition, The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators).
Mihlin's theorem: if is a Mihlin symbol with constants and , then is an Fourier multiplier and (Mihlin smoothness convention above half the dimension, The Mihlin–Hörmander Fourier multiplier theorem, Lp Fourier multiplier and its norm, Translation-invariant Fourier multiplier on the Schwartz core).
Proof
The symbol is well defined and bounded. At each fixed at most three of the numbers are nonzero by [F1], so the series is actually a finite sum at every point and converges locally uniformly to a smooth function; and because and .
Uniform Mihlin constants. For step 1.1 gives , which is the required degree-zero bound with constant . Fix with and , and put . By [F1], . If the derivative is nonzero, then , so . For , a nonzero derivative requires ; at most three integers satisfy both inequalities. On each such annulus, [F1] gives . Therefore , which is the required homogeneous Mihlin estimate. Thus is a Mihlin symbol with constants and for , depending only on , uniformly in the coefficients.
Uniform bounds. By step 2.1 the symbol is Mihlin with and, by step 1.1, ; [F2] therefore gives the multiplier bound for every , with constants depending only on .
Truncations and signs. A finite truncation is the symbol for the sequence , which again satisfies ; the bound of step 3.1 therefore applies to all such truncations and to all sign sequences , with the same constant .
Depends on
- Existence of a smooth inhomogeneous dyadic frequency partition
- The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators
- Mihlin smoothness convention above half the dimension
- The Mihlin–Hörmander Fourier multiplier theorem
- Lp Fourier multiplier and its norm
- Translation-invariant Fourier multiplier on the Schwartz core
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
55 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
- Terence Tao, Math 247A Lecture Notes 4 (UCLA, Fall 2006) (standard reference, not scraped)
- Loukas Grafakos, Classical Fourier Analysis, 3rd ed. (Springer GTM 249) (standard reference, not scraped)
- Mark Williams, Notes on Harmonic Analysis (January 11, 2022) (standard reference, not scraped)