claimroutine
Tube arrangement: disjoint start, compressed end
Arranges tubes: disjoint at start, outputs in a set of measure
geometric input of the counterexample
Claim·§C Disjoint packets and the weak spacetime norm·inside propWeak-type endpoint smoothing fails logarithmically
Statement (paper)
With , , and , the lines satisfy: for the intervals of radius around the are pairwise disjoint, and the output cores all lie in , where and .
In plain English
With , , the product lines start as pairwise disjoint tubes of radius for . Their output cores all land in a set (with and ) of measure , while the cores' total measure is .
Why it's here
This is the geometric input of the counterexample: disjointness at the start lets the initial packets be summed with the norm of staying bounded. Compression of all the output cores into the small set means the packets' mass concentrates there, which gives the gain in the weak-norm lower bound after random signs are applied in the later claims.
Classified routine:
A Kakeya/Besicovitch-type line arrangement (Perron-tree style construction in which disjoint tubes are compressed into a set of measure about 1/log), used in the standard Bourgain–Fefferman-type counterexamples; here it is a direct geometric verification for the specific product lines.
Uses
Nothing else in the paper
Used by
Sources
PaperOpen
- Section
- §C Disjoint packets and the weak spacetime norm
- Page
- —
- Label
—- Line
sections/weak.tex:15
Leannot aligned
Phase 2 aligns this node to a Lean declaration.