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 kernel and admissible atomic order of Atomic characterisation of real for . For every there is a unique bounded linear functional with for every atom , and with the constant independent of . The map is linear, annihilates constants, and therefore factors through ; on every finite sum of atoms one has .
Facts & Assumptions
Given: The Axiom of Choice, the fixed , a function , the -atoms of atoms with a prescribed moment order, and the space with its atoms.
The atom pairing is bounded: for every atom the integral converges absolutely and (BMO functions pair uniformly with H1 atoms, atoms with a prescribed moment order); in particular and atoms are bounded with compact support.
If then for every the integral converges absolutely and (Bounded BMO functions dualise H1 boundedly).
Every sum of atoms lies in : if is a finite atomic sum then , and the finite atomic sums are dense in (Atomic characterisation of real for , Finite atomic sums are dense in H1).
The componentwise truncations of satisfy , , pointwise and (Range truncations preserve the BMO seminorm up to a constant).
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 are continuous for the weak-star topology (The weak-star topology from finite evaluations).
If pointwise with and is an atom, then by dominated convergence, the dominating function being integrable because is bounded with compact support and (Dominated convergence, BMO seminorm and the quotient by constants).
A locally integrable function whose regular distribution vanishes is zero almost everywhere (Locally integrable functions embed in distributions).
Proof
The bounded case. Let and let be the linear span of the atoms, viewed as a subspace of by [F3]. Every is a finite sum of bounded compactly supported atoms, hence an function with , so converges absolutely and by [F2]. The value depends only on the element : if two finite sums represent the same element, then the locally integrable function has zero regular distribution, so almost everywhere by [F7] and the two integrals agree. Thus is a well-defined linear functional on , bounded by , and it extends uniquely to a bounded by density [F3]; the extension is the unique bounded functional whose value at every atom is , since two such functionals agree on and is dense.
The general case, existence of a cluster point. For general let be the componentwise truncation of [F4]; step 1.1 gives bounded functionals with . The Axiom of Choice yields the ultrafilter lemma [F5], so the closed ball of radius in is weak-star compact [F5]; by the compactness characterization [F5] the sequence, viewed as a net, has a weak-star cluster point . For every atom the evaluations converge: by [F6]. Evaluation at is weak-star continuous [F5], so is a cluster point of the convergent net in and therefore equals its limit, .
Uniqueness and the norm bound. If are bounded functionals with for every atom , then by linearity they agree on the span of the atoms and hence, by density [F3] and continuity, on all of ; so the functional of step 2.1 is the unique bounded functional with the required atom values, and .
Linearity, constants and finite sums. For and , the functionals and both assign to every atom the value , so they are equal by the uniqueness of step 3.1; the same argument gives . If is constant almost everywhere, then for every atom because by [F1], so by uniqueness. Hence is linear with image of the constants in the zero functional, so it factors through . Finally, for a finite atomic sum , linearity and step 1.1 give .
Steps 1.1 and 2.1 construct, for every , a bounded functional with the required atom values, step 3.1 gives uniqueness and the bound , 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
- BMO seminorm and the quotient by constants
- Range truncations preserve the BMO seminorm up to a constant
- BMO functions pair uniformly with H1 atoms
- Bounded BMO functions dualise H1 boundedly
- Finite atomic sums are dense in H1
- $H^p$ atoms with a prescribed moment order
- Banach–Alaoglu
- The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter
- The Axiom of Choice
- Atomic characterisation of real $H^p$ for $0<p\le1$
- Locally integrable functions embed in distributions
- Dominated convergence
- 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 weak-star topology from finite evaluations
Used by
- Real H1-BMO duality Theorem
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
- Mark Williams, Notes on Harmonic Analysis (January 11, 2022) (standard reference, not scraped)