Alphabeta Math
CorollaryStatement: 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.

BMO oscillation norms in Lq are equivalent

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)).

Let 1≤q<∞ and for b∈Lloc1(Rn) put ∥b∥BMO,q:=sup⁡Q(∣Q∣−1∫Q∣b−bQ∣q)1/q∈[0,∞], the supremum over all cubes. Then there are constants 0<cn,q≤Cn,q<∞ such that cn,q∥b∥BMO≤∥b∥BMO,q≤Cn,q∥b∥BMO for every b∈BMO(Rn); indeed (∣Q∣−1∫Q∣b−bQ∣q)1/q≤Cn,q∥b∥BMO for every cube Q. In particular every BMO function lies in Llocq(Rn).

Facts & Assumptions

Given: Countable Choice, 1≤q<∞, a function b∈Lloc1(Rn), a cube Q, and the mean and seminorm of BMO seminorm and the quotient by constants.

[F1]

The mean is bQ=∣Q∣−1∫Qb and ∥b∥BMO=sup⁡Q∣Q∣−1∫Q∣b−bQ∣; the seminorm vanishes exactly on the almost-everywhere constants (BMO seminorm and the quotient by constants).

[F2]

Holder's inequality on the finite-measure cube Q, applied to the nonnegative functions ∣b−bQ∣ and 1, gives ∣Q∣−1∫Q∣b−bQ∣≤(∣Q∣−1∫Q∣b−bQ∣q)1/q for 1≤q<∞ (Holder's inequality for integrals, including the endpoint cases); if the right-hand side is infinite the inequality is immediate, and q=1 is equality.

[F3]

The layer-cake formula gives ∣Q∣−1∫Q∣b−bQ∣q=q∫0∞λq−1∣Q∣−1∣{x∈Q:∣b−bQ∣>λ}∣ dλ (For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function).

[F4]

There are constants cn,Cn∈(0,∞) with ∣{x∈Q:∣b−bQ∣>λ}∣≤Cn∣Q∣e−cnλ/∥b∥BMO for every λ>0, the zero-seminorm case giving the value 0 (John-Nirenberg exponential inequality).

Proof

technique · direct
1.1F1F2

Lower bound. By [F2], ∣Q∣−1∫Q∣b−bQ∣≤(∣Q∣−1∫Q∣b−bQ∣q)1/q for every cube Q; taking the supremum over all cubes gives ∥b∥BMO≤∥b∥BMO,q, so cn,q=1 is admissible.

1.2F3F4F1algebra

Upper bound for a fixed cube. If ∥b∥BMO>0, [F4] inserted into the layer-cake formula [F3] gives ∣Q∣−1∫Q∣b−bQ∣q≤qCn∫0∞λq−1e−cnλ/∥b∥BMO dλ=qCn∥b∥BMOq∫0∞μq−1e−cnμ dμ after the substitution λ=μ∥b∥BMO; the last integral is finite because μq−1e−cnμ is integrable on (0,∞). If ∥b∥BMO=0 the left-hand side is 0 by [F1], so the same estimate holds with either side zero.

2.1step 1.2step 1.1algebra

With Kn,q:=(qCn∫0∞μq−1e−cnμdμ)1/q<∞, step 1.2 gives (∣Q∣−1∫Q∣b−bQ∣q)1/q≤Kn,q∥b∥BMO for every cube Q, and taking the supremum over Q gives ∥b∥BMO,q≤Kn,q∥b∥BMO; so Cn,q=Kn,q is admissible. Both constants depend only on n and q.

3.1step 2.1F1∎

Finally, for b∈BMO(Rn) and a cube Q one has ∣b∣≤∣b−bQ∣+∣bQ∣, hence ∫Q∣b∣q≤2q−1(∫Q∣b−bQ∣q+∣Q∣∣bQ∣q)<∞ by step 2.1 and the finiteness of the local mean bQ; every compact set is covered by finitely many cubes, so b∈Llocq(Rn).

Depends on

Used by

Dependency tree · two levels

32 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