Alphabeta Math
LemmaStatement: 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.

ℓp sums of atoms converge in S′ and in Hp

Statement

Assume Countable Choice. Let n≥1, 0<p≤1, s≥⌊n(1/p−1)⌋, fix the admissible kernel φ defining Hp, and let N be an admissible order for the grand maximal function with N≥max⁡(N0(n,p,φ),n+s+1). Let (aj) be a sequence of (p,∞,s)-atoms and (λj)∈ℓp. Then the series ∑jλjaj converges absolutely in S′(Rn) to an element g∈S′(Rn); the partial sums converge to g in the Hp quasi-norm of The real Hardy space Hp defined by a radial maximal function; g∈Hp; and with Cp=C(n,p,s,N,φ)<∞ independent of the atoms and coefficients, ∥g∥Hp≤Cp(∑j∣λj∣p)1/p,∥g−∑j≤Jλjaj∥Hp≤Cp(∑j>J∣λj∣p)1/p.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p≤1, s≥⌊n(1/p−1)⌋, the fixed admissible kernel φ, an admissible order N≥max⁡(N0(n,p,φ),n+s+1), atoms aj, coefficients (λj)∈ℓp.

[F1]

Uniform atom bound: there is C=C(n,p,s) with ∥MNaj∥Lp≤C and ∣⟨aj,ψ⟩∣≤C∥ψ∥Cs+1(Rn),∥ψ∥Cs+1(Rn):=max⁡∣β∣≤s+1sup⁡x∈Rn∣∂βψ(x)∣, for every ψ∈S. The pairing estimate follows from assertion 2 of Atoms have uniformly bounded Hp quasi-norm and uniformly bounded test pairings because its minimum cube-volume factor is at most one; in particular this is a uniform bound by a continuous Schwartz seminorm.

[F2]

Domination: Mφ0g≤2NPN(φ)MNg for every g∈S′ (The grand maximal function dominates every admissible radial and nontangential maximal function).

[F3]

Convergence in S′ of the partial sums implies pointwise convergence of the convolutions: if gJ→g in S′, then (gJ∗φt)(y)→(g∗φt)(y) for every t>0 and y, since (gJ∗φt)(y)=⟨gJ,φt(y−⋅)⟩ and φt(y−⋅)∈S (Convolution of a tempered distribution with a schwartz function, Tempered distribution).

[F4]

MN is Borel measurable and the p-th power inequality ∣∑jzj∣p≤∑j∣zj∣p holds for 0<p≤1; monotone convergence applies to the nonnegative measurable partial sums (Measurability and lower semicontinuity of the smooth maximal functions, Monotone convergence for the integral).

Proof technique: absolute convergence of pairings, monotone maximal control and monotone convergence.

Proof

technique · direct
1.1F1givenalgebra

Absolute convergence in S′. Fix ψ∈S. By [F1], ∣λj⟨aj,ψ⟩∣≤C∥ψ∥Cs+1(Rn)∣λj∣, and ∑j∣λj∣<∞ because (λj)∈ℓp and p≤1. Thus the scalar series ∑jλj⟨aj,ψ⟩ converges absolutely for every ψ. Its limit defines a linear functional g satisfying ∣⟨g,ψ⟩∣≤C∥ψ∥Cs+1(Rn)∑j∣λj∣; this continuous-seminorm bound proves g∈S′, and the partial sums converge to g on every Schwartz test.

1.2F3givenalgebra

Maximal control of the sum. For every J put gJ=∑j≤Jλjaj. For fixed Ψ∈FN, t>0 and y with ∣y−x∣≤t, [F3] gives (g∗Ψt)(y)=lim⁡J(gJ∗Ψt)(y), so ∣(g∗Ψt)(y)∣≤lim sup⁡J∑j≤J∣λj∣∣(aj∗Ψt)(y)∣≤∑j∣λj∣∣(aj∗Ψt)(y)∣. Taking the defining suprema and using ∣(aj∗Ψt)(y)∣≤MNaj(x) for each such Ψ,t,y gives MNg(x)=sup⁡Ψ∈FNsup⁡t>0sup⁡∣y−x∣≤t∣(g∗Ψt)(y)∣≤∑j∣λj∣MNaj(x) pointwise.

2.1step 1.1step 1.2F1F2F4algebra

Hp bound and convergence. By [F4] and the p-power inequality for finite sums, letting the number of terms increase in the display of step 1.2 gives (MNg)p≤∑j∣λj∣p(MNaj)p. The nonnegative partial sums on the right are measurable; monotone convergence and [F1] therefore give ∥MNg∥Lpp≤Cp∑j∣λj∣p, so ∥g∥Hp≤2NPN(φ)C(∑j∣λj∣p)1/p by [F2]. Applying the same argument to the tail g−∑j≤Jλjaj=∑j>Jλjaj gives the stated tail bound; in particular the partial sums converge to g in the Hp quasi-norm.

3.1step 1.1step 1.2step 2.1∎

Conclusion. Steps 1.1 and 1.2 establish the absolute convergence in S′, and step 2.1 establishes the membership g∈Hp, the quasi-norm bound and the tail bound. This proves the lemma.

Depends on

Used by

Dependency tree · two levels

45 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