Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Lemma 4.35, p. 22, of Cabrelli, Lacey, Molter and Pipher, Variations on the theme of Journé's lemma, in the edition named on the source card.

Statement

Lemma 4.35 (p. 22). For every ϵ>0\epsilon>0 and every collection U\mathcal U of rectangles whose shadow has finite measure there are a set V⊃sh⁡(U)V\supset\operatorname{sh}(\mathcal U) with ∣V∣≲∣sh⁡(U)∣\lvert V\rvert\lesssim\lvert\operatorname{sh}(\mathcal U)\rvert, a map emb⁡:U→[1,∞)\operatorname{emb}:\mathcal U\to[1,\infty) and a map ı:U→{1,2,…,d}\imath:\mathcal U\to\{1,2,\ldots,d\} such that emb⁡(R)⋅R⊂V\operatorname{emb}(R)\cdot R\subset V for every R∈UR\in\mathcal U, and for every collection U′⊂U\mathcal U'\subset\mathcal U,

∑j=1d∑v=0∞∑I∈D2−(d+ϵ)v∣F(I,j,v,U′)∣≲∣sh⁡(U′)∣,\sum_{j=1}^d\sum_{v=0}^\infty\sum_{I\in\mathcal D}2^{-(d+\epsilon)v}\lvert F(I,j,v,\mathcal U')\rvert \lesssim\lvert\operatorname{sh}(\mathcal U')\rvert,

where

F(I,j,v,U′)=⋃{R∈U′:2v<emb⁡(R)≤2v+1, R(j)=I, ı(R)=j}.F(I,j,v,\mathcal U')=\bigcup\{R\in\mathcal U':2^v<\operatorname{emb}(R)\le2^{v+1},\ R_{(j)}=I,\ \imath(R)=j\}.

Here emb⁡(R)⋅R\operatorname{emb}(R)\cdot R dilates every side of RR by emb⁡(R)\operatorname{emb}(R) about its center, so the embeddedness is uniform across coordinates, while the coordinate ı(R)\imath(R) selects which side indexes the sum. The paper remarks (p. 22) that the price is a worse power: the weight decays like emb⁡−(d+ϵ)\operatorname{emb}^{-(d+\epsilon)}, a power strictly below −d-d.

Proof pointer

Pp. 22--24. Apply Lemma 4.34 inductively, one coordinate at a time, on products of shifted dyadic grids: each stage enlarges the current rectangles in one coordinate to the extent of their embeddedness and builds a new set VmV^m, and V=VnV=V^n. The map emb⁡\operatorname{emb} is 116\frac1{16} of the infimum over mm of inductively defined embeddedness quantities βm(R)\beta^m(R), and ı(R)\imath(R) is the coordinate attaining it. The final step bounds the shadow of the enlarged rectangles by 2dk2^{dk} times the shadow of U′\mathcal U', using the one-dimensional weak L1L^1 bound in each coordinate; this is where the power dd is lost.

Dependencies

Lemma 4.34. Read depth: claims checked; the statement was read clause by clause on p. 22, the proof for structure only. Nothing here is independently reviewed.

Bears on

The paper names no Erdős problem.