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.33, p. 20, of Cabrelli, Lacey, Molter and Pipher, Variations on the theme of Journé's lemma, in the edition named on the source card. The paper takes the variant from J. Pipher, Journé's covering lemma and its extension to higher dimensions, Duke Math. J. 53 (1986), 683--690.

Statement

Setting (p. 19). Let U⊂RdU\subset\mathbb R^d have finite measure and let U\mathcal U be a set of maximal dyadic rectangles contained in UU. Put

Enl⁡(U)={M1sh⁡(U)>12}(4.31),emb⁡(R,U)=sup⁡{μ≥1:Dil⁡(μ,1,…,1)R⊂Enl⁡(U)}(4.32),\operatorname{Enl}(\mathcal U)=\{M\mathbf 1_{\operatorname{sh}(\mathcal U)}>\tfrac12\}\quad(4.31), \qquad \operatorname{emb}(R,\mathcal U)=\sup\{\mu\ge1:\operatorname{Dil}_{(\mu,1,\ldots,1)}R\subset\operatorname{Enl}(\mathcal U)\}\quad(4.32),

so only the first side of RR is stretched. The text after (4.32) speaks of a first maximal function M1M_1 taken in the first coordinate and a second, the strong maximal function, although the printed displays show a single MM. For U′⊂U\mathcal U'\subset\mathcal U, j∈Nj\in\mathbb N and a dyadic interval II,

F(I,j,U′)=⋃{I×R′:I×R′∈U′, 2j−1≤emb⁡(I×R′,U)<2j}.F(I,j,\mathcal U')=\bigcup\{I\times R':I\times R'\in\mathcal U',\ 2^{j-1}\le\operatorname{emb}(I\times R',\mathcal U)<2^j\}.

Lemma 4.33 (p. 20). For every ϵ>0\epsilon>0,

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

and moreover, for every integer n>1n>1 and every 1<p<∞1<p<\infty,

∥∑j=1∞∑I∈D2−ϵj(M1F(I,j,U′))n∥p≲∣sh⁡(U′)∣1/p.\Bigl\lVert\sum_{j=1}^\infty\sum_{I\in\mathcal D}2^{-\epsilon j}\bigl(M\mathbf 1_{F(I,j,\mathcal U')}\bigr)^n\Bigr\rVert_p \lesssim\lvert\operatorname{sh}(\mathcal U')\rvert^{1/p}.

Both estimates hold for all collections U\mathcal U whose shadow has finite measure and all collections U′⊂U\mathcal U'\subset\mathcal U.

A footnote on p. 20 says the lemma is stated for the first coordinate only for ease of notation, and that in applications any coordinate may play that role. The paper says the estimate is strongest when rectangles are barely embedded in the first coordinate but deeply embedded in the others.

Proof pointer

P. 20. Fix jj and separate scales. Removing from F(I,j,U′)F(I,j,\mathcal U') the sets F(I′,j,U′)F(I',j,\mathcal U') with I⊊I′I\subsetneq I' leaves sets H(I)H(I), disjoint as II varies, that each keep a quarter of every rectangle with first side II; otherwise the rectangle would have embeddedness above 2j2^j. The strong maximal function then gives ∣F(I,j,U′)∣≲∣H(I)∣\lvert F(I,j,\mathcal U')\rvert\lesssim\lvert H(I)\rvert, which proves the first claim, and the Fefferman--Stein maximal inequality gives the second.

Dependencies

None in the corpus. Read depth: claims checked; the setting and statement were read clause by clause on pp. 19--20, the proof for structure only. Nothing here is independently reviewed.

Bears on

The paper names no Erdős problem.