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.
BMO averages on nested cubes grow at most logarithmically
Statement
There is such that for every and all cubes , writing for the side length, .
Facts & Assumptions
Given: and cubes with side lengths , together with the mean , the seminorm and the cube and volume conventions of BMO seminorm and the quotient by constants and Axis-parallel rectangles in and their volume.
For every cube , , and for cubes one has (BMO seminorm and the quotient by constants).
A cube is a nondegenerate axis-parallel cube; the concentric cube with side length has volume , and a cube whose side length is at most that of and which is contained in has volume at most (Axis-parallel rectangles in and their volume).
Proof
If the claim is trivial, so assume . Let be the least integer such that , and let be the cube concentric with of side length . The centres of and both lie in , so their coordinatewise distance is at most ; every point of is therefore within coordinate distance of the centre of , and . Since , , so . Minimality gives and hence . Therefore .
Let be the concentric cubes of side lengths . Since , [F1] gives for each , and the triangle inequality over the steps gives .
Since , [F1] and step 1.1 give .
Combining steps 2.1 and 2.2, . From we get , hence . Therefore , which is the claim with .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- Mark Williams, Notes on Harmonic Analysis (January 11, 2022) (standard reference, not scraped)
- Juha Kinnunen, Harmonic Analysis (Aalto University lecture notes) (standard reference, not scraped)
- Terence Tao, Math 247A Lecture Notes 4 (UCLA, Fall 2006) (standard reference, not scraped)