Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 (ACω)). For every sequence (cj)j≥0 of complex numbers with ∣cj∣≤1 the symbol m:=∑j≥0cjφj of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators is a Mihlin symbol with constants Cα≤Aα(n,ψ) for ∣α∣≤⌊n/2⌋+1, where Aα does not depend on the coefficients and the series is locally finite. Consequently, for every 1<p<∞ and every f∈Lp(Rn;C), ∥Tmf∥p≤Cn,ψmax⁡(p,(p−1)−1)∥f∥p with Cn,ψ independent of the coefficients. In particular the bound is uniform over all sign sequences cj=±1 and over all finite truncations, that is over ∑j<Nεjφj for every N and every choice of signs.

Facts & Assumptions

Given: the fixed partition (φj) of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators; a sequence (cj) with ∣cj∣≤1; q:=⌊n/2⌋+1; a real 1<p<∞.

[F1]

Each φj∈Cc∞(Rn) satisfies 0≤φj≤1, ∑jφj=1 with a locally finite sum, supp⁡φj⊂{2j−1≤∣ξ∣≤2j+1} for j≥1 and supp⁡φ0⊂{∣ξ∣≤2}; for every multi-index α there is Cα<∞ with ∣∂αφj(ξ)∣≤Cα2−j∣α∣ for j≥1 and all ξ, with ∣∂αφ0(ξ)∣≤Cα (Existence of a smooth inhomogeneous dyadic frequency partition, The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators).

[F2]

Mihlin's theorem: if m is a Mihlin symbol with constants Cα and A:=max⁡∣α∣≤qCα, then m is an Lp Fourier multiplier and ∥m∥Mp≤Cnmax⁡(p,(p−1)−1)(A+∥m∥∞) (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

technique · direct
1.1F1algebra

The symbol is well defined and bounded. At each fixed ξ at most three of the numbers φj(ξ) are nonzero by [F1], so the series m(ξ)=∑jcjφj(ξ) is actually a finite sum at every point and converges locally uniformly to a smooth function; and ∣m(ξ)∣≤∑jφj(ξ)=1 because ∣cj∣≤1 and φj≥0.

2.1F1step 1.1algebra

Uniform Mihlin constants. For α=0 step 1.1 gives ∣m∣≤1, which is the required degree-zero bound with constant 1. Fix α with 1≤∣α∣≤q and ξ≠0, and put k:=∣α∣. By [F1], ∣∂αm(ξ)∣≤∑j≥0∣∂αφj(ξ)∣. If the j=0 derivative is nonzero, then ∣ξ∣≤2, so ∣ξ∣k∣∂αφ0(ξ)∣≤2kCα. For j≥1, a nonzero derivative requires 2j−1≤∣ξ∣≤2j+1; at most three integers j satisfy both inequalities. On each such annulus, [F1] gives ∣ξ∣k∣∂αφj(ξ)∣≤∣ξ∣kCα2−jk≤2kCα. Therefore ∣ξ∣k∣∂αm(ξ)∣≤4⋅2kCα, which is the required homogeneous Mihlin estimate. Thus m is a Mihlin symbol with constants A0:=1 and Aα:=4⋅2∣α∣Cα for 1≤∣α∣≤q, depending only on n,ψ,α, uniformly in the coefficients.

3.1F2step 1.1step 2.1algebra

Uniform Lp bounds. By step 2.1 the symbol m is Mihlin with A:=max⁡∣α∣≤qAα and, by step 1.1, ∥m∥∞≤1; [F2] therefore gives the Lp multiplier bound ∥Tmf∥p≤Cnmax⁡(p,(p−1)−1)(A+1)∥f∥p for every f∈Lp, with constants depending only on n,ψ,p.

4.1step 3.1algebra∎

Truncations and signs. A finite truncation ∑j<Nεjφj is the symbol m for the sequence cj=εj1j<N, which again satisfies ∣cj∣≤1; the bound of step 3.1 therefore applies to all such truncations and to all sign sequences cj=±1, with the same constant Cn,ψ.

Depends on

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