Alphabeta Math
TheoremStatement: 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 exponential inequality

Statement

Assume Countable Choice. There are constants cn,Cn∈(0,∞) such that for every b∈BMO(Rn), every cube Q and every λ>0, ∣{x∈Q:∣b(x)−bQ∣>λ}∣≤Cn∣Q∣exp⁡(−cnλ/∥b∥BMO). If ∥b∥BMO=0 then b is constant almost everywhere and the left-hand side is 0 for every λ>0, which is the interpretation used throughout.

Facts & Assumptions

Given: Countable Choice, b∈BMO(Rn), a cube Q and a level λ>0.

[F1]

The seminorm is ∥b∥BMO=sup⁡E∣E∣−1∫E∣b−bE∣ and it vanishes exactly on the almost-everywhere constants (BMO seminorm and the quotient by constants).

[F2]

For every s>∥b∥BMO and every all-generations dyadic cube Q′ there are pairwise disjoint dyadic subcubes Qj′(k) such that ∑j∣Qj′(k)∣≤(∥b∥BMO/s)k∣Q′∣ and ∣b−bQ′∣≤k2ns almost everywhere on Q′∖⋃jQj′(k) for every k≥1 (John-Nirenberg stopping cubes have geometric decay).

[F3]

The all-generations dyadic cubes of Dyadic cubes of all generations in R^n partition Rn 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

technique · direct
1.1F1

If ∥b∥BMO=0, then b is constant almost everywhere by [F1], so ∣b−bQ∣=0 almost everywhere for every cube Q and the asserted left-hand side vanishes for every λ>0; this is the interpretation required by the statement.

1.2F3algebra

Covering by dyadic cubes. Let m be the greatest integer with 2−m≥ℓ(Q) and put S:=2−m, so that ℓ(Q)≤S<2ℓ(Q). Every coordinate interval of Q has length at most S and therefore meets at most two of the generation-m dyadic intervals, so Q is contained in the union of the N≤2n generation-m dyadic cubes Q1,…,QN that meet it. Each Qj has side S, so ∣Q∣=ℓ(Q)n≤Sn=∣Qj∣<2n∣Q∣.

1.3algebra

Small levels. If 0<λ≤Λn∥b∥BMO, then for every γ>0 one has ∣{x∈Q:∣b−bQ∣>λ}∣≤∣Q∣=eγΛn∣Q∣e−γΛn≤eγΛn∣Q∣e−γλ/∥b∥BMO, because λ/∥b∥BMO≤Λn.

2.1step 1.2F1algebra

Comparison of the means. Fix j and a point p∈Q∩Qj; both cubes lie in the cube Rj centred at p of side 4n S, because their diameters are n ℓ(Q)≤n S and n S respectively. By [F1], for cubes E⊆R one has ∣bE−bR∣≤∣E∣−1∫E∣b−bR∣≤(∣R∣/∣E∣)∣R∣−1∫R∣b−bR∣≤(∣R∣/∣E∣)∥b∥BMO. Since ∣Rj∣=(4n)n∣Qj∣ and ∣Rj∣=(4n S/ℓ(Q))n∣Q∣<(8n)n∣Q∣, applying this with E=Qj and with E=Q gives ∣bQj−bQ∣≤2(8n)n∥b∥BMO=:Bn∥b∥BMO.

3.1step 1.2step 2.1F2algebra

Large levels. Suppose ∥b∥BMO>0 and λ>Λn∥b∥BMO with Λn:=max⁡{2Bn,22n+3}, and put s:=2n+1∥b∥BMO>∥b∥BMO, λ′:=λ−Bn∥b∥BMO>λ/2, and k:=⌊λ′/(2ns)⌋, where 2ns=22n+1∥b∥BMO. Then k≥1, k2ns≤λ′, and k>λ/(22n+3∥b∥BMO) because k>λ′/(22n+1∥b∥BMO)−1>λ/(22n+2∥b∥BMO)−1≥λ/(22n+3∥b∥BMO) as λ>22n+3∥b∥BMO. Apply [F2] on each dyadic cube Qj at height s: the level-k stopping families are pairwise disjoint with ∑i∣Qj,i(k)∣≤(∥b∥BMO/s)k∣Qj∣=2−(n+1)k∣Qj∣, and ∣b−bQj∣≤k2ns≤λ′ almost everywhere off their union, so step 2.1 gives ∣b−bQ∣≤λ there. Hence {x∈Qj:∣b−bQ∣>λ} is contained in ⋃iQj,i(k) up to a Lebesgue-null set and has measure at most 2−(n+1)k∣Qj∣≤2−(n+1)k2n∣Q∣. Summing over the N≤2n cubes of step 1.2 gives ∣{x∈Q:∣b−bQ∣>λ}∣≤22n2−(n+1)k∣Q∣≤22n∣Q∣e−kln⁡2≤22n∣Q∣e−γλ/∥b∥BMO with γ:=ln⁡2/22n+3.

4.1step 1.1step 3.1step 1.3F2∎

Assembly. Take γ:=ln⁡2/22n+3, Bn:=2(8n)n, Λn:=max⁡{2Bn,22n+3} and Cn:=max⁡{22n,eγΛn}. Steps 3.1 and 1.3 give ∣{x∈Q:∣b(x)−bQ∣>λ}∣≤Cn∣Q∣e−γλ/∥b∥BMO for every λ>0 when ∥b∥BMO>0, covering the large levels and the small levels respectively, and step 1.1 gives the bound when ∥b∥BMO=0. Both constants depend only on n, 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