Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

John-Nirenberg stopping cubes have geometric decay

Statement

Assume Countable Choice. Let b∈BMO(Rn), let Q be an all-generations dyadic cube and let s>∥b∥BMO. Then there are families of dyadic subcubes Qj(k)⊆Q, k≥1, pairwise disjoint for each fixed k, such that, with Q1(0):=Q: (i) each Qj(k) is contained in a unique level-(k−1) stopping cube. Its immediate dyadic parent is contained in that stopping cube but need not belong to the preceding stopping family; (ii) for every k, ∑j∣Qj(k)∣≤(∥b∥BMO/s)k∣Q∣; and (iii) for every k≥1, ∣b−bQ∣≤k2ns almost everywhere on Q∖⋃jQj(k), and a fortiori ∣b−bQ∣≤2nks there, so {x∈Q:∣b−bQ∣>2nks}⊆⋃jQj(k) up to a Lebesgue-null set.

Facts & Assumptions

Given: Countable Choice, b∈BMO(Rn), an all-generations dyadic cube Q and a real number s>∥b∥BMO.

[F1]

The all-generations dyadic cubes partition Rn at each generation, have volumes 2−kn, and for two dyadic cubes one contains the other or they are disjoint; the parent of a cube of generation k is its unique ancestor of generation k−1, with volume 2n times that of the cube (Dyadic cubes of all generations in R^n, All-generation dyadic cubes: partition, volume and nesting).

[F2]

For f∈L1(Rn) and λ>0, the dyadic cubes E with ∣E∣−1∫E∣f∣>λ that are maximal under inclusion form a countable family of pairwise disjoint cubes; their union is exactly the dyadic maximal superlevel set {Mdf>λ}; each such E satisfies ∣E∣−1∫E∣f∣≤2nλ; and ∑E∣E∣≤λ−1∥f∥1 (Maximal dyadic cubes above a level).

[F3]

In the Calderon-Zygmund decomposition of f∈L1 at height λ>0, the good part g equals f outside the union of those maximal cubes and satisfies ∣g∣≤2nλ almost everywhere (Calderón–Zygmund decomposition at height λ).

[F4]

Almost every point of Rn is a Lebesgue point of a given Lloc1 function (Almost every point is a Lebesgue point of a locally integrable function).

[F5]

A countable union of at most countable sets is at most countable, and a countable union of Lebesgue-null subsets of Rn is Lebesgue-null (Countable unions of at most countable sets, assuming ACω, Subsets and countable unions of null subsets of Rm are null).

[F6]

For every cube E, ∣E∣−1∫E∣b−bE∣≤∥b∥BMO (BMO seminorm and the quotient by constants).

Proof

technique · direct
1.1F2F3F6algebra

Put F=(b−bQ)1Q. Then F∈L1(Rn) with ∫Rn∣F∣=∫Q∣b−bQ∣≤∣Q∣ ∥b∥BMO<s∣Q∣ by [F6] and the hypothesis on s. Let Q(1) be the family of dyadic cubes E with ∣E∣−1∫E∣F∣>s maximal under inclusion. By [F2] applied to F and s, the family Q(1) is countable and pairwise disjoint, each E∈Q(1) satisfies s<∣E∣−1∫E∣F∣≤2ns, and ∑E∈Q(1)∣E∣≤s−1∫Rn∣F∣≤(∥b∥BMO/s)∣Q∣. Every E∈Q(1) is a proper dyadic subcube of Q: it meets Q because its average of ∣F∣ is positive, and if Q⊊E then ∣E∣−1∫E∣F∣≤(∣Q∣/∣E∣)∥b∥BMO<s, a contradiction, while E=Q is excluded by the same average bound. By [F3] the good part of the decomposition of F equals F off ⋃E∈Q(1)E, so ∣F∣≤2ns almost everywhere there.

2.1step 1.1F1F2F3F5algebra

Recursion. Let Q(k) be a countable pairwise disjoint family of proper dyadic subcubes of Q, and for each P∈Q(k) put FP=(b−bP)1P and let QP be the family of maximal dyadic cubes E with ∣E∣−1∫E∣FP∣>s. The argument of step 1.1, with Q replaced by P and F by FP, shows that every E∈QP is a proper dyadic subcube of P, that QP is countable and pairwise disjoint, that s<∣E∣−1∫E∣FP∣≤2ns and ∑E∈QP∣E∣≤(∥b∥BMO/s)∣P∣, and that the good part of the decomposition of FP satisfies ∣FP∣≤2ns almost everywhere off ⋃E∈QPE. Each selected E has a unique stopping parent P∈Q(k). Its immediate dyadic parent R is contained in P: since R and P both contain E, [F1] makes them nested; if P⊊R, the generations of R and E differ by one and E⊊P⊊R is impossible, so R⊆P. The dyadic parent has the exact volume ratio ∣R∣=2n∣E∣ by [F1]. Maximality gives ∣R∣−1∫R∣FP∣≤s, and hence ∣E∣−1∫E∣FP∣≤2ns. Thus the stopping parent is P, while the immediate dyadic parent R need only be contained in P and need not itself belong to the preceding stopping family. Define Q(k+1)=⋃P∈Q(k)QP; indexed by pairs it is countable by [F5], its members are pairwise disjoint because distinct cubes P are disjoint and each QP is a pairwise disjoint family of subcubes of its P, and each member is a proper dyadic subcube of a unique P∈Q(k), so its interior is contained in that cube.

3.1step 1.1step 2.1

By induction on k≥1, ∑E∈Q(k)∣E∣≤(∥b∥BMO/s)k∣Q∣: step 1.1 is the case k=1, and the ratio estimate of step 2.1 gives ∑E∈Q(k+1)∣E∣=∑P∈Q(k)∑E∈QP∣E∣≤(∥b∥BMO/s)∑P∈Q(k)∣P∣, which is the induction step.

3.2step 1.1step 2.1F2F3F4F5algebra

Fix k≥1 and discard the exceptional Lebesgue-null sets of steps 1.1 and 2.1 together with the null sets of non-Lebesgue points of the countably many functions FP for P of level at most k−1; by [F4] and [F5] the discarded set is Lebesgue-null. Let x∈Q∖⋃E∈Q(k)E lie outside it, and let 0≤l≤k−1 be the largest integer such that x lies in some cube Pl of level l, where P0:=Q; such an l exists because x∈Q, and Pl is unique because the families at each level are pairwise disjoint. Since x lies in no cube of level l+1, the good-part bound of [F3] for the ambient cube Pl gives ∣b(x)−bPl∣=∣FPl(x)∣≤2ns; moreover, because x is a Lebesgue point of FPl, the dyadic cubes of generation m containing x lie in B(x,n 2−m) with volume comparable to 2−mn, so their averages of FPl converge to FPl(x), giving ∣FPl(x)∣≤MdFPl(x)≤s by [F2] and [F4]. For l≥1, ∣bPl−bQ∣≤∑i=1l∣bPi−bPi−1∣ with ∣bPi−bPi−1∣≤∣Pi∣−1∫Pi∣b−bPi−1∣=∣Pi∣−1∫Pi∣FPi−1∣≤2ns, because Pi was selected inside the ambient cube Pi−1. Hence ∣b(x)−bQ∣≤s+l2ns≤(l+1)2ns≤k2ns≤2nks, using l+1≤k and k≤2n(k−1) for k≥1, n≥1. The complement of ⋃E∈Q(k)E inside Q therefore satisfies the asserted almost-everywhere bound, its exceptional set being a countable union of Lebesgue-null sets by [F5].

4.1step 1.1step 2.1step 3.1step 3.2∎

Steps 1.1 and 2.1 construct, for every k≥1, a countable pairwise disjoint family Q(k) of proper dyadic subcubes of Q, each with a unique stopping parent in the preceding family and with its immediate dyadic parent contained in that stopping parent, which is (i); step 3.1 is the geometric-decay estimate (ii); and step 3.2 is the level bound (iii). The construction applies the published maximal-cube and decomposition lemmas countably many times, which is exactly where Countable Choice is used, together with the countable-union facts in [F5].

Depends on

Used by

Dependency tree · two levels

47 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources