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 , let be an all-generations dyadic cube and let . Then there are families of dyadic subcubes , , pairwise disjoint for each fixed , such that, with : (i) each is contained in a unique level- stopping cube. Its immediate dyadic parent is contained in that stopping cube but need not belong to the preceding stopping family; (ii) for every , ; and (iii) for every , almost everywhere on , and a fortiori there, so up to a Lebesgue-null set.
Facts & Assumptions
Given: Countable Choice, , an all-generations dyadic cube and a real number .
The all-generations dyadic cubes partition at each generation, have volumes , and for two dyadic cubes one contains the other or they are disjoint; the parent of a cube of generation is its unique ancestor of generation , with volume times that of the cube (Dyadic cubes of all generations in R^n, All-generation dyadic cubes: partition, volume and nesting).
For and , the dyadic cubes with that are maximal under inclusion form a countable family of pairwise disjoint cubes; their union is exactly the dyadic maximal superlevel set ; each such satisfies ; and (Maximal dyadic cubes above a level).
In the Calderon-Zygmund decomposition of at height , the good part equals outside the union of those maximal cubes and satisfies almost everywhere (Calderón–Zygmund decomposition at height λ).
Almost every point of is a Lebesgue point of a given function (Almost every point is a Lebesgue point of a locally integrable function).
A countable union of at most countable sets is at most countable, and a countable union of Lebesgue-null subsets of is Lebesgue-null (Countable unions of at most countable sets, assuming , Subsets and countable unions of null subsets of are null).
For every cube , (BMO seminorm and the quotient by constants).
Proof
Put . Then with by [F6] and the hypothesis on . Let be the family of dyadic cubes with maximal under inclusion. By [F2] applied to and , the family is countable and pairwise disjoint, each satisfies , and . Every is a proper dyadic subcube of : it meets because its average of is positive, and if then , a contradiction, while is excluded by the same average bound. By [F3] the good part of the decomposition of equals off , so almost everywhere there.
Recursion. Let be a countable pairwise disjoint family of proper dyadic subcubes of , and for each put and let be the family of maximal dyadic cubes with . The argument of step 1.1, with replaced by and by , shows that every is a proper dyadic subcube of , that is countable and pairwise disjoint, that and , and that the good part of the decomposition of satisfies almost everywhere off . Each selected has a unique stopping parent . Its immediate dyadic parent is contained in : since and both contain , [F1] makes them nested; if , the generations of and differ by one and is impossible, so . The dyadic parent has the exact volume ratio by [F1]. Maximality gives , and hence . Thus the stopping parent is , while the immediate dyadic parent need only be contained in and need not itself belong to the preceding stopping family. Define ; indexed by pairs it is countable by [F5], its members are pairwise disjoint because distinct cubes are disjoint and each is a pairwise disjoint family of subcubes of its , and each member is a proper dyadic subcube of a unique , so its interior is contained in that cube.
By induction on , : step 1.1 is the case , and the ratio estimate of step 2.1 gives , which is the induction step.
Fix 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 for of level at most ; by [F4] and [F5] the discarded set is Lebesgue-null. Let lie outside it, and let be the largest integer such that lies in some cube of level , where ; such an exists because , and is unique because the families at each level are pairwise disjoint. Since lies in no cube of level , the good-part bound of [F3] for the ambient cube gives ; moreover, because is a Lebesgue point of , the dyadic cubes of generation containing lie in with volume comparable to , so their averages of converge to , giving by [F2] and [F4]. For , with , because was selected inside the ambient cube . Hence , using and for , . The complement of inside therefore satisfies the asserted almost-everywhere bound, its exceptional set being a countable union of Lebesgue-null sets by [F5].
Steps 1.1 and 2.1 construct, for every , a countable pairwise disjoint family of proper dyadic subcubes of , 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
- BMO seminorm and the quotient by constants
- Maximal dyadic cubes above a level
- Calderón–Zygmund decomposition at height λ
- All-generation dyadic cubes: partition, volume and nesting
- Dyadic cubes of all generations in R^n
- Almost every point is a Lebesgue point of a locally integrable function
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
- Subsets and countable unions of null subsets of $\mathbb{R}^m$ are null
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
- Juha Kinnunen, Harmonic Analysis (Aalto University lecture notes) (standard reference, not scraped)
- Mark Williams, Notes on Harmonic Analysis (January 11, 2022) (standard reference, not scraped)
- Brooke Wilson, Math 581A Classical and Multilinear Harmonic Analysis (University of Washington, Fall 2024), lecture 18 (standard reference, not scraped)