claimroutineinferred_dep

Random signs give weak-norm lower bound

Random signs give ∥gN∥p≲1\|g_N\|_p\lesssim1 and weak norm ≳kd(1/2−1/p)\gtrsim k^{d(1/2-1/p)}
combines the geometry into the weak-norm lower bound
Claim·§C Disjoint packets and the weak spacetime norm·inside propWeak-type endpoint smoothing fails logarithmically

Statement (paper)

There is a choice of signs ϵν\epsilon_\nu such that, with f=∑νϵνfνf=\sum_\nu\epsilon_\nu f_\nu and gN=QNfg_N=Q_Nf, one has ∥gN∥p≲n,p1\|g_N\|_p\lesssim_{n,p}1, supp⁡g^N⊂{5N/4<∣ξ∣<7N/4}\supp\widehat g_N\subset\{5N/4<|\xi|<7N/4\}, ∫E×I0∣U(t)gN(x)∣2 dx dt≳n1\int_{E\times I_0}|U(t)g_N(x)|^2\dd x\dd t\gtrsim_n 1, and consequently ∥U(t)gN∥Lp,∞(Rn×I)≳n,pkd(1/2−1/p)\|U(t)g_N\|_{L^{p,\infty}(\RR^n\times I)}\gtrsim_{n,p}k^{d(1/2-1/p)} for p>2p>2.

In plain English

Signs ϵν\epsilon_\nu can be chosen so that gN=QN∑νϵνfνg_N=Q_N\sum_\nu\epsilon_\nu f_\nu has ∥gN∥p≲1\|g_N\|_p\lesssim 1, Fourier support in {5N/4<∣ξ∣<7N/4}\{5N/4<|\xi|<7N/4\}, and ∫E×I0∣U(t)gN∣2≳1\int_{E\times I_0}|U(t)g_N|^2\gtrsim 1. Consequently, for p>2p>2, ∥U(t)gN∥Lp,∞(Rn×I)≳kd(1/2−1/p)\|U(t)g_N\|_{L^{p,\infty}(\RR^n\times I)}\gtrsim k^{d(1/2-1/p)}.

Why it's here

This claim combines the two geometric facts: the packets start disjoint, which keeps the LpL^p norm of gNg_N bounded, and their output cores all land in the small set EE with amplitude about 1. Random signs (Khintchine-type averaging) make the sum on E×I0E\times I_0 have square-function size, giving an L2L^2 lower bound of order 1 on a set of measure ≲k−d\lesssim k^{-d}. Hölder then converts this into the weak LpL^p lower bound kd(1/2−1/p)k^{d(1/2-1/p)}, and since k≍log⁡Nk\asymp\log N this gives the parent proposition's (log⁡N)d(1/2−1/p)(\log N)^{d(1/2-1/p)} lower bound.
Classified routine:
Combines the two preceding claims with Khintchine's inequality over random signs (averaging in expectation) and Hölder's inequality on a set of small measure to convert an L^2 lower bound into a weak-L^p lower bound. This is the standard randomization argument from Kakeya/Besicovitch-type counterexamples.

Uses

claimTube arrangement: disjoint start, compressed endclaimModulated packets transport along tubes

Used by

Nothing in the paper

Sources

PaperOpen
Section
§C Disjoint packets and the weak spacetime norm
Page
—
Label
—
Line
sections/weak.tex:102
Leannot aligned

Phase 2 aligns this node to a Lean declaration.

Friction

  • info
    inferred_dep
    outline: "Random signs give weak-norm lower bound" rests on claim-prop-weak-obstruction-1
  • info
    inferred_dep
    outline: "Random signs give weak-norm lower bound" rests on claim-prop-weak-obstruction-2