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.

BMO classes define bounded functionals on H1

Statement

Assume the Axiom of Choice, with the fixed H1 kernel φ and admissible atomic order N~ of Atomic characterisation of real Hp for 0<p≤1. For every b∈BMO(Rn) there is a unique bounded linear functional Λb∈(H1(Rn))∗ with Λb(a)=∫ab for every H1 atom a, and ∥Λb∥≤Cn,N~,φ∥b∥BMO with the constant independent of b. The map b↦Λb is linear, annihilates constants, and therefore factors through BMO(Rn)/C; on every finite sum of atoms g one has Λb(g)=∫gb.

Facts & Assumptions

Given: The Axiom of Choice, the fixed φ,N~, a function b∈BMO(Rn), the (1,∞,0)-atoms of Hp atoms with a prescribed moment order, and the space H1(Rn) with its atoms.

[F1]

The atom pairing is bounded: for every atom a the integral ∫ab converges absolutely and ∣∫ab∣≤∥b∥BMO (BMO functions pair uniformly with H1 atoms, Hp atoms with a prescribed moment order); in particular ∫a=0 and atoms are bounded with compact support.

[F2]

If b∈L∞(Rn)∩BMO(Rn) then for every f∈H1(Rn) the integral ∫fb converges absolutely and ∣∫fb∣≤Cn,N~,φ∥b∥BMO∥f∥H1 (Bounded BMO functions dualise H1 boundedly).

[F3]

Every ℓ1 sum of atoms lies in H1: if g=∑j≤Nλjaj is a finite atomic sum then ∥g∥H1≤C∑j≤N∣λj∣, and the finite atomic sums are dense in H1 (Atomic characterisation of real Hp for 0<p≤1, Finite atomic sums are dense in H1).

[F4]

The componentwise truncations bM of b satisfy bM∈L∞, ∣bM∣≤∣b∣, bM→b pointwise and ∥bM∥BMO≤92∥b∥BMO (Range truncations preserve the BMO seminorm up to a constant).

[F5]

The Axiom of Choice implies the ultrafilter lemma (The Axiom of Choice, The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter); under the ultrafilter lemma the closed dual ball of a normed space is weak-star compact (Banach–Alaoglu) and every net in a compact space has a cluster point (Assuming the ultrafilter lemma, compactness is equivalent to every net having a cluster point, every net having a convergent subnet, every filter having a cluster point, and every ultrafilter converging, Convergence and cluster points of a net in a topological space); the evaluations Λ↦Λ(a) are continuous for the weak-star topology (The weak-star topology from finite evaluations).

[F6]

If bM→b pointwise with ∣bM∣≤∣b∣ and a is an atom, then ∫abM→∫ab by dominated convergence, the dominating function ∣a∣∣b∣ being integrable because a is bounded with compact support and b∈Lloc1 (Dominated convergence, BMO seminorm and the quotient by constants).

[F7]

A locally integrable function whose regular distribution vanishes is zero almost everywhere (Locally integrable functions embed in distributions).

Proof

technique · direct
1.1F1F2F3F7

The bounded case. Let b∈L∞∩BMO and let F be the linear span of the atoms, viewed as a subspace of H1 by [F3]. Every g∈F is a finite sum of bounded compactly supported atoms, hence an L1 function with g∈H1, so ∫gb converges absolutely and ∣∫gb∣≤Cn,N~,φ∥b∥BMO∥g∥H1 by [F2]. The value ∫gb depends only on the element g∈H1: if two finite sums g,g′ represent the same element, then the locally integrable function g−g′ has zero regular distribution, so g=g′ almost everywhere by [F7] and the two integrals agree. Thus g↦∫gb is a well-defined linear functional on F, bounded by Cn,N~,φ∥b∥BMO, and it extends uniquely to a bounded Λb∈(H1)∗ by density [F3]; the extension is the unique bounded functional whose value at every atom a is ∫ab, since two such functionals agree on F and F is dense.

2.1step 1.1F4F5F6

The general case, existence of a cluster point. For general b∈BMO let bM be the componentwise truncation of [F4]; step 1.1 gives bounded functionals ΛbM with ∥ΛbM∥≤92Cn,N~,φ∥b∥BMO. The Axiom of Choice yields the ultrafilter lemma [F5], so the closed ball of radius 92Cn,N~,φ∥b∥BMO in (H1)∗ is weak-star compact [F5]; by the compactness characterization [F5] the sequence, viewed as a net, (ΛbM)M∈N, M≥1 has a weak-star cluster point Λ. For every atom a the evaluations converge: ΛbM(a)=∫abM→∫ab by [F6]. Evaluation at a is weak-star continuous [F5], so Λ(a) is a cluster point of the convergent net (ΛbM(a))M in C and therefore equals its limit, Λ(a)=∫ab.

3.1step 2.1F3

Uniqueness and the norm bound. If Λ,Λ′ are bounded functionals with Λ(a)=Λ′(a)=∫ab for every atom a, then by linearity they agree on the span F of the atoms and hence, by density [F3] and continuity, on all of H1; so the functional of step 2.1 is the unique bounded functional with the required atom values, and ∥Λ∥≤92Cn,N~,φ∥b∥BMO.

4.1step 1.1step 3.1F1algebra

Linearity, constants and finite sums. For b,b′∈BMO and λ∈C, the functionals Λb+b′ and Λb+Λb′ both assign to every atom a the value ∫a(b+b′)=∫ab+∫ab′, so they are equal by the uniqueness of step 3.1; the same argument gives Λλb=λΛb. If b is constant almost everywhere, then ∫ab=0 for every atom because ∫a=0 by [F1], so Λb=0 by uniqueness. Hence b↦Λb is linear with image of the constants in the zero functional, so it factors through BMO(Rn)/C. Finally, for a finite atomic sum g=∑j≤Nλjaj, linearity and step 1.1 give Λb(g)=∑j≤Nλj∫ajb=∫gb.

5.1step 1.1step 2.1step 3.1step 4.1∎

Steps 1.1 and 2.1 construct, for every b∈BMO(Rn), a bounded functional with the required atom values, step 3.1 gives uniqueness and the bound ∥Λb∥≤92Cn,N~,φ∥b∥BMO, and step 4.1 gives linearity, the annihilation of constants, the factorisation through the quotient and the finite-sum identity. The Axiom of Choice is spent exactly at the ultrafilter lemma and the Banach-Alaoglu cluster point in step 2.1.

Depends on

Used by

Dependency tree · two levels

74 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