Sparse domination implies convex body domination

Lineage and corrections

This event attributed to Aapo Laukkarinen

This event attributed to Emiel Lorist

This event attributed to GPT-5.6 Sol Pro

Sparse domination implies convex body domination evidence for this event

Sparse domination implies convex body domination parent of this event

VibeMathed record: Sparse domination implies convex body domination evidence for this event

Problem source evidence for this event

If a bilinear form admits an $(r,s)$-sparse bound, its coordinate-wise extension to $\mathbb C^n$-valued functions admits an $(r,s)$-convex body sparse bound, for $1\le r,s<\infty$ with $\tfrac1r+\tfrac1s>1$. It holds both in a fixed dyadic lattice (Theorem 2.6, constants independent of the ambient dimension) and for arbitrary cubes (Theorem 3.4), via a randomization of the good part of the form. On scope, two things separate. What Nazarov, Petermichl, Treil and Volberg proposed was the principle for the classical sparse setting, and that is settled outright, the hypothesis holding comfortably there. The $(r,s)$ range is the authors' own generalization beyond what was asked, and the restriction bites only inside it, leaving $\tfrac1r+\tfrac1s\le1$ open. Their summary: "we provide a proof of the full general statement". It also gives sparse domination for iterated commutators directly from that of the underlying form. The dependence on $n$ is not claimed optimal. parent of this event