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

Range truncations preserve the BMO seminorm up to a constant

Statement

For every real-valued b∈BMO(Rn) and every c∈R the one-sided truncations satisfy ∥max⁡(b,c)∥BMO≤32∥b∥BMO and ∥min⁡(b,c)∥BMO≤32∥b∥BMO; consequently for −∞<L≤K<∞ the two-sided truncation b[L,K]:=min⁡(K,max⁡(L,b)) satisfies ∥b[L,K]∥BMO≤94∥b∥BMO. For a complex-valued b the componentwise truncation bM:=min⁡(M,max⁡(−M,Re⁡b))+imin⁡(M,max⁡(−M,Im⁡b)) satisfies ∣bM∣≤∣b∣, bM→b pointwise as M→∞, and ∥bM∥BMO≤92∥b∥BMO.

Facts & Assumptions

Given: A function b∈BMO(Rn), a cube Q and constants c∈R, −∞<L≤K<∞ and M>0, with 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∣; for every constant d one has (b+d)Q=bQ+d and hence ∥b+d∥BMO=∥b∥BMO (BMO seminorm and the quotient by constants).

[F2]

The reverse triangle inequality gives ∣∣u∣−∣v∣∣≤∣u−v∣ for real or complex numbers u,v, and for real b,c the maximum and minimum decompose as max⁡(b,c)=c+12((b−c)+∣b−c∣) and min⁡(b,c)=c+12((b−c)−∣b−c∣).

Proof

technique · direct
1.1F1

For a locally integrable g, a cube Q and a constant d, one has ∣gQ−d∣≤∣Q∣−1∫Q∣g−d∣, so ∣Q∣−1∫Q∣g−gQ∣≤∣Q∣−1∫Q∣g−d∣+∣gQ−d∣≤2∣Q∣−1∫Q∣g−d∣; taking the supremum over Q gives ∥g∥BMO≤2sup⁡Q∣Q∣−1∫Q∣g−dQ∣ for any choice of constants dQ.

2.1F2step 1.1

Let b be real-valued, fix c∈R and put g=∣b−c∣. For every cube Q, [F2] with d=∣bQ−c∣ gives ∣∣b−c∣−∣bQ−c∣∣≤∣b−bQ∣ pointwise on Q, so choosing dQ=∣bQ−c∣ in step 1.1 yields ∥∣b−c∣∥BMO≤2∥b∥BMO.

3.1F1step 2.1algebra

By [F2], max⁡(b,c)=c+12(b−c)+12∣b−c∣ and min⁡(b,c)=c+12(b−c)−12∣b−c∣; translation by constants leaves the seminorm unchanged by [F1] and the triangle inequality for the supremum gives ∥max⁡(b,c)∥BMO≤12∥b−c∥BMO+12∥∣b−c∣∥BMO≤12∥b∥BMO+∥b∥BMO=32∥b∥BMO, and the same computation applies to min⁡(b,c).

4.1step 3.1algebra

If −∞<L≤K<∞, then b[L,K]=min⁡(K,max⁡(L,b)) and applying step 3.1 twice gives ∥b[L,K]∥BMO≤32∥max⁡(L,b)∥BMO≤94∥b∥BMO.

5.1step 4.1algebra

Let b=u+iv be complex-valued and put uM=min⁡(M,max⁡(−M,u)) and vM=min⁡(M,max⁡(−M,v)), so bM=uM+ivM. Then ∣uM∣≤∣u∣ and ∣vM∣≤∣v∣, hence ∣bM∣=(uM2+vM2)1/2≤(u2+v2)1/2=∣b∣, and uM→u, vM→v pointwise as M→∞. Moreover ∥Re⁡b∥BMO≤∥b∥BMO and ∥Im⁡b∥BMO≤∥b∥BMO, because ∣Re⁡(b−bQ)∣≤∣b−bQ∣ and similarly for the imaginary part; step 4.1 applied to u and v gives ∥bM∥BMO≤∥uM∥BMO+∥vM∥BMO≤94(∥u∥BMO+∥v∥BMO)≤92∥b∥BMO.

6.1step 3.1step 4.1step 5.1∎

Steps 3.1, 4.1 and 5.1 are the three assertions of the statement. No choice principle is used: only linearity of the integral, the definition of the seminorm and elementary real and complex inequalities.

Depends on

Used by

Dependency tree · two levels

5 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