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 and every collection of rectangles whose shadow has finite measure there are a set with , a map and a map such that for every , and for every collection ,
where
Here dilates every side of by about its center, so the embeddedness is uniform across coordinates, while the coordinate selects which side indexes the sum. The paper remarks (p. 22) that the price is a worse power: the weight decays like , a power strictly below .
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 , and . The map is of the infimum over of inductively defined embeddedness quantities , and is the coordinate attaining it. The final step bounds the shadow of the enlarged rectangles by times the shadow of , using the one-dimensional weak bound in each coordinate; this is where the power 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.