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.
Atomic characterisation of real for
Statement
Assume Countable Choice. Let , , fix the admissible kernel defining , and set . Fix an integer and the associated reproducing pair from Calderon reproducing pair and the telescoping identity in . Fix an admissible grand-maximal order as in the two cited lemmas. For the following are equivalent:
- in the sense of The real Hardy space defined by a radial maximal function;
- there exist a sequence and a sequence of -atoms ( atoms with a prescribed moment order) with converging in .
In that case the infimum being taken over all atomic representations of , and every such series converges also in the quasi-norm.
Facts & Assumptions
Given: Countable Choice, , , the fixed kernel and reproducing order , , an admissible order as in the two cited lemmas, and .
Level decomposition: if then there are -atoms and coefficients with in and , where includes the auxiliary flat reproducing kernel (Level decomposition of an distribution produces atoms). For the norm bound, use Countable Choice over the integer pairs to fix once one admissible kernel from Calderon reproducing pair and the telescoping identity in . With this fixed family, is a function of . No uniformity over all admissible reproducing kernels is asserted or needed: the atomic class and the infimum over representations do not depend on the auxiliary kernel.
sums: if are -atoms and , then converges absolutely in , lies in and satisfies with depending on ; the tail bound of that lemma gives convergence in the quasi-norm ( sums of atoms converge in and in ).
Proof technique: the two implications supplied by the level decomposition and the -summation lemma, then the infimum.
Proof
21 and the upper norm bound. Let with and atoms . By [F2], and ; taking the infimum over all representations gives the inequality .
12 and the lower norm bound. Let and apply [F1] using the auxiliary kernel fixed there, obtaining . Then with , so has an atomic representation and .
convergence. If with , the tail estimate of [F2] applied to the partial sums gives ; hence the series converges in the quasi-norm. This applies in particular to the level-decomposition representation of [F1] and to any atomic representation of .
Conclusion. Steps 1.1-1.2 prove the equivalence and the two-sided norm bound, and step 2.1 gives the quasi-norm convergence. This proves the theorem.
Depends on
- Calderon reproducing pair and the telescoping identity in $\mathcal S'$
- Atoms have uniformly bounded $H^p$ quasi-norm and uniformly bounded test pairings
- $\ell^p$ sums of atoms converge in $\mathcal S'$ and in $H^p$
- Level decomposition of an $H^p$ distribution produces atoms
- Maximal-function characterisations of real Hardy spaces
- $H^p$ atoms with a prescribed moment order
- The real Hardy space $H^p$ defined by a radial maximal function
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Weighted-integrable Hᵖ functions have vanishing moments in the atomic range Corollary
- A compactly supported L¹ function of nonzero integral is not in H¹ Counterexample
- Bounded BMO functions dualise H1 boundedly Lemma
- Finite atomic sums are dense in H1 Lemma
- For 0<p<1 the Hᵖ functional is a quasi-norm, and Hᵖ is a quasi-Banach space Remark
- BMO classes define bounded functionals on H1 Theorem
- Calderon-Zygmund operators map H¹ boundedly into L¹ Theorem
- Fourier transform decay of real Hᵖ elements Theorem
Dependency tree · two levels
59 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
- Shai Dekel, Gerard Kerkyacharian, George Kyriazis, Pencho Petrushev, A New Proof of the Atomic Decomposition of Hardy Spaces, Constructive Theory of Functions (Sozopol 2016), pp. 59-73 (standard reference, not scraped)
- Li-An Daniel Wang, Multiplier Theorems on Anisotropic Hardy Spaces (PhD dissertation, University of Oregon, 2012) (standard reference, not scraped)
- Stefano Meda, Peter Sjogren, Maria Vallarino, Atomic decompositions and operators on Hardy spaces, Revista de la Union Matematica Argentina 50 (2009), no. 2, 15-22 (standard reference, not scraped)