Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 Hp for 0<p≤1

Statement

Assume Countable Choice. Let n≥1, 0<p≤1, fix the admissible kernel φ defining Hp, and set s=⌊n(1/p−1)⌋. Fix an integer K≥n/p and the associated reproducing pair from Calderon reproducing pair and the telescoping identity in S′. Fix an admissible grand-maximal order N≥max⁡{N0(n,p,φ),n+s+1} as in the two cited lemmas. For f∈S′(Rn) the following are equivalent:

  1. f∈Hp(Rn) in the sense of The real Hardy space Hp defined by a radial maximal function;
  2. there exist a sequence (λj)∈ℓp and a sequence (aj) of (p,∞,s)-atoms (Hp atoms with a prescribed moment order) with f=∑jλjaj converging in S′(Rn).

In that case ∥f∥Hp≍n,p,N,K,φinf⁡(∑j∣λj∣p)1/p, the infimum being taken over all atomic representations of f, and every such series converges also in the Hp quasi-norm.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p≤1, the fixed kernel φ and reproducing order K≥n/p, s=⌊n(1/p−1)⌋, an admissible order N≥max⁡{N0(n,p,φ),n+s+1} as in the two cited lemmas, and f∈S′.

[F1]

Level decomposition: if f∈Hp then there are (p,∞,s)-atoms aB and coefficients λB>0 with f=∑BλBaB in S′ and ∑BλBp≤C1∥f∥Hpp, where C1=C(n,p,N,K,φ,Φ) includes the auxiliary flat reproducing kernel Φ (Level decomposition of an Hp distribution produces atoms). For the norm bound, use Countable Choice over the integer pairs (n,K) to fix once one admissible kernel Φn,K from Calderon reproducing pair and the telescoping identity in S′. With this fixed family, C(n,p,N,K,φ,Φn,K) is a function of n,p,N,K,φ. 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.

[F2]

ℓp sums: if (aj) are (p,∞,s)-atoms and (λj)∈ℓp, then g=∑jλjaj converges absolutely in S′, lies in Hp and satisfies ∥g∥Hp≤C2(∑j∣λj∣p)1/p with C2 depending on n,p,s,N,φ; the tail bound of that lemma gives convergence in the Hp quasi-norm (ℓp sums of atoms converge in S′ and in Hp).

Proof technique: the two implications supplied by the level decomposition and the ℓp-summation lemma, then the infimum.

Proof

technique · direct
1.1F2algebra

2⇒1 and the upper norm bound. Let f=∑jλjaj with (λj)∈ℓp and atoms aj. By [F2], f∈Hp and ∥f∥Hp≤C2(∑j∣λj∣p)1/p; taking the infimum over all representations gives the inequality ∥f∥Hp≤C2inf⁡(∑j∣λj∣p)1/p.

1.2F1algebra

1⇒2 and the lower norm bound. Let f∈Hp and apply [F1] using the auxiliary kernel Φn,K fixed there, obtaining f=∑BλBaB. Then (λB)∈ℓp with ∑BλBp≤C1∥f∥Hpp, so f has an atomic representation and inf⁡(∑j∣λj∣p)1/p≤C11/p∥f∥Hp.

2.1F2step 1.2

Hp convergence. If f=∑jλjaj with (λj)∈ℓp, the tail estimate of [F2] applied to the partial sums gives ∥f−∑j≤Jλjaj∥Hp≤C2(∑j>J∣λj∣p)1/p→0; hence the series converges in the Hp quasi-norm. This applies in particular to the level-decomposition representation of [F1] and to any atomic representation of f∈Hp.

3.1step 1.1step 1.2step 2.1∎

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

Used by

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