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.

Bounded BMO functions dualise H1 boundedly

Statement

Assume Countable Choice, fix the H1 kernel φ and admissible atomic order N~ used in Atomic characterisation of real Hp for 0<p≤1. There is Cn,N~,φ<∞ such that for every b∈L∞(Rn)∩BMO(Rn) and every f∈H1(Rn) the integral ∫fb converges absolutely and ∣∫fb∣≤Cn,N~,φ∥b∥BMO∥f∥H1.

Facts & Assumptions

Given: Countable Choice, the fixed φ,N~, b∈L∞(Rn)∩BMO(Rn) and f∈H1(Rn).

[F1]

The atomic characterisation gives (λj)∈ℓ1 and (1,∞,0)-atoms aj with f=∑jλjaj in S′ and with the partial sums SN=∑j≤Nλjaj converging to f in the H1 norm; the coefficients satisfy ∑j∣λj∣≤Cn,N~,φ∥f∥H1 (Atomic characterisation of real Hp for 0<p≤1, ℓp sums of atoms converge in S′ and in Hp).

[F2]

Each atom is bounded, compactly supported and has ∥aj∥L1≤1; the pairing with b satisfies ∣∫ajb∣≤∥b∥BMO (Hp atoms with a prescribed moment order, BMO functions pair uniformly with H1 atoms).

[F3]

Complex L1 is complete, and on any measure space the pairing of an L1 function with an L∞ function obeys ∫∣gh∣≤∥g∥L1∥h∥L∞ (Complex Lp completeness and almost-everywhere subsequences, Holder's inequality for integrals, including the endpoint cases, The space Lp(μ) as the quotient by null functions).

Proof

technique · direct
1.1F1F2F3

By [F1] fix a representation f=∑jλjaj with ∑j∣λj∣≤Cn,N~,φ∥f∥H1. The partial sums are L1 functions with ∥SN∥L1≤∑j≤N∣λj∣∥aj∥L1≤∑j≤N∣λj∣ by [F2]; they therefore form a Cauchy sequence in L1, and by completeness [F3] converge in L1 to some g∈L1 with ∥g∥L1≤∑j∣λj∣. For every test function ψ one has ⟨f,ψ⟩=lim⁡N⟨SN,ψ⟩=lim⁡N∫SNψ=∫gψ by [F3] and the S′-convergence of the partial sums; hence f is represented by the L1 function g, and ∫fb=∫gb converges absolutely with ∫∣gb∣≤∥g∥L1∥b∥L∞<∞.

2.1step 1.1F2F3

Since SN→g in L1 and b∈L∞, [F3] gives ∫SNb→∫gb; and ∣∫SNb∣=∣∑j≤Nλj∫ajb∣≤∑j≤N∣λj∣ ∥b∥BMO≤Cn,N~,φ∥b∥BMO∥f∥H1 by [F2]. Passing to the limit gives ∣∫fb∣=∣∫gb∣≤Cn,N~,φ∥b∥BMO∥f∥H1.

3.1step 1.1step 2.1∎

Step 2.1 is the asserted bound with constant Cn,N~,φ, and step 1.1 is the asserted absolute convergence. Countable Choice is inherited from the suppliers.

Depends on

Used by

Dependency tree · two levels

42 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