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 exponential inequality
Statement
Assume Countable Choice. There are constants such that for every , every cube and every , . If then is constant almost everywhere and the left-hand side is for every , which is the interpretation used throughout.
Facts & Assumptions
Given: Countable Choice, , a cube and a level .
The seminorm is and it vanishes exactly on the almost-everywhere constants (BMO seminorm and the quotient by constants).
For every and every all-generations dyadic cube there are pairwise disjoint dyadic subcubes such that and almost everywhere on for every (John-Nirenberg stopping cubes have geometric decay).
The all-generations dyadic cubes of Dyadic cubes of all generations in R^n partition at each generation, with parent and nesting as in All-generation dyadic cubes: partition, volume and nesting: every point lies in exactly one cube of each generation, and a dyadic cube of a coarser generation containing a point contains every finer dyadic cube through that point.
Proof
If , then is constant almost everywhere by [F1], so almost everywhere for every cube and the asserted left-hand side vanishes for every ; this is the interpretation required by the statement.
Covering by dyadic cubes. Let be the greatest integer with and put , so that . Every coordinate interval of has length at most and therefore meets at most two of the generation- dyadic intervals, so is contained in the union of the generation- dyadic cubes that meet it. Each has side , so .
Small levels. If , then for every one has , because .
Comparison of the means. Fix and a point ; both cubes lie in the cube centred at of side , because their diameters are and respectively. By [F1], for cubes one has . Since and , applying this with and with gives .
Large levels. Suppose and with , and put , , and , where . Then , , and because as . Apply [F2] on each dyadic cube at height : the level- stopping families are pairwise disjoint with , and almost everywhere off their union, so step 2.1 gives there. Hence is contained in up to a Lebesgue-null set and has measure at most . Summing over the cubes of step 1.2 gives with .
Assembly. Take , , and . Steps 3.1 and 1.3 give for every when , covering the large levels and the small levels respectively, and step 1.1 gives the bound when . Both constants depend only on , and the stopping construction inside [F2] is the only place Countable Choice is used.
Depends on
Used by
Dependency tree · two levels
30 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)
- Terence Tao, Math 247A Lecture Notes 4 (UCLA, Fall 2006) (standard reference, not scraped)
- Brooke Wilson, Math 581A Classical and Multilinear Harmonic Analysis (University of Washington, Fall 2024), lecture 18 (standard reference, not scraped)