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.

The Littlewood-Paley reproducing formula in tempered distributions

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). With the fixed partition and companion operators of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators:

  1. for every f∈S′(Rn) the partial sums ∑j<NΔ~jΔjf converge to f in S′(Rn) as N→∞, that is f=∑j≥0Δ~jΔjf in S′;
  2. for every f,g∈S(Rn) and every N≥0, with the Hermitian pairing ⟨u,v⟩=∫Rnuvˉ one has ⟨∑j<NΔ~jΔjf,g⟩=∑j<N⟨Δjf,Δ~jg⟩. If in addition ∥Sf∥p<∞ and ∥S~g∥p′<∞ for some 1<p<∞, with p′ conjugate to p, then the series ∑j≥0⟨Δjf,Δ~jg⟩ converges absolutely to ⟨f,g⟩ and satisfies ∑j≥0∣⟨Δjf,Δ~jg⟩∣≤∫RnSf S~g.

Facts & Assumptions

Given: the fixed partition (φj), companions (φ~j) and operators of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators; the partial symbols σN:=∑j<Nφ~jφj for N≥0.

[F1]

Each φj,φ~j lies in Cc∞(Rn), 0≤φj≤1, 0≤φ~j≤1 and ∣∂αφj(ξ)∣≤Cα2−j∣α∣, ∣∂αφ~j(ξ)∣≤Cα′2−j∣α∣ for constants depending only on n,ψ,α; the supports satisfy supp⁡φj⊂{2j−1≤∣ξ∣≤2j+1} for j≥1 and supp⁡φ~j⊂{∣ξ∣≤2j+2} (Existence of a smooth inhomogeneous dyadic frequency partition, The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators).

[F2]

∑j≥0φ~jφj=1 pointwise with a locally finite sum, and the operators satisfy TmTn=Tmn on S for smooth polynomially bounded symbols; for f∈S′ the products φj⋅Ff are the transposed multiplications by smooth polynomially bounded symbols, and Δjf=F−1(φjFf) (The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators, Smooth polynomially bounded multipliers on schwartz space).

[F3]

The distributional pairing is bilinear, with ⟨Ff,g⟩=⟨f,Fg⟩ and ⟨F−1f,g⟩=⟨f,F−1g⟩. F is an automorphism of S′(Rn) and F−1F=FF−1=id; for f∈S′ the map g↦⟨f,g⟩ is a continuous linear functional on S (Fourier transform of a tempered distribution, Fourier transform is a topological automorphism of tempered distributions, Fourier transform is a topological automorphism of Schwartz space, Schwartz topology and convergence, Weak and strong topologies on tempered distributions).

[F4]

Parseval's pairing: for u,v∈S(Rn), ∫u^ v^‾=∫uvˉ; consequently, for a real symbol m∈Cc∞ and u,v∈S, writing Tmu^=mu^, ⟨Tmu,v⟩=∫Tmu^ v^ˉ=∫mu^ v^ˉ=∫u^ mv^‾=⟨u,Tmv⟩ (Parseval pairing on Schwartz space, The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators).

[F5]

For h∈S and R>0, sup⁡∣ξ∣≥R∣ξα∂βh(ξ)∣≤R−1∑l=1npα+el,β(h): multiply by ∣ξ∣≤∑l∣ξl∣ and use the seminorm bounds. Thus the tail tends to 0, uniformly when h ranges over a bounded subset of S; a sequence converges in S exactly when all seminorms tend to 0 (Schwartz topology and convergence).

[F6]

Holder's inequality and the monotone convergence theorem for nonnegative measurable functions; finite sums act termwise on integrals (Complex Holder, Minkowski, and the quotient norm, Monotone convergence for the integral).

Proof

technique · direct
1.1F1F2algebra

The partial symbols. For every N≥0 the function σN=∑j<Nφ~jφj lies in Cc∞(Rn) by [F1] and satisfies 0≤σN≤1 with 1−σN=∑j≥Nφ~jφj≥0 by [F2]. For N≥1 it equals 1 on {∣ξ∣<2N−2}: a term φ~jφj with j≥N vanishes wherever φj does, and φj=0 on {∣ξ∣≤2j−1}, so every tail term vanishes on this ball. (For N=0, σ0=0 and no plateau assertion is made.) Moreover, for every multi-index α there is Cα<∞, depending only on n,ψ,α, with ∣∂α(1−σN)(ξ)∣≤Cα2−N∣α∣ for all ξ and N: by the Leibniz rule and [F1] each summand satisfies ∣∂α(φ~jφj)(ξ)∣≤Cα2−j∣α∣, and ∑j≥N2−j∣α∣≤2⋅2−N∣α∣ for ∣α∣≥1, while for α=0 the bound is just 0≤1−σN≤1.

1.2F4F6algebra

The finite duality identity and absolute convergence. For f,g∈S and N, [F4] applied to the real symbol φ~j gives ⟨Δ~jΔjf,g⟩=⟨Δjf,Δ~jg⟩ for each j<N, and summing yields the first identity of part 2. For the series bound, the pointwise Cauchy-Schwarz inequality in ℓ2 gives ∑j<N∣Δjf(x)∣ ∣Δ~jg(x)∣≤Sf(x)S~g(x) for every x, and integrating the finite sum, which is legitimate termwise by [F6], gives ∑j<N∫∣Δjf∣∣Δ~jg∣≤∫Sf S~g≤∥Sf∥p∥S~g∥p′<∞ by Holder; hence the nonnegative series ∑j∫∣Δjf∣∣Δ~jg∣ converges (its partial sums are increasing and bounded) and dominates ∑j∣⟨Δjf,Δ~jg⟩∣, so that series converges absolutely with the stated bound.

2.1F1F5step 1.1algebra

The tail vanishes in S. For every h∈S the products (1−σN)h tend to 0 in the Schwartz topology: for multi-indices α,β, the Leibniz rule writes ∂β((1−σN)h)=∑γ≤β(βγ)∂β−γ(1−σN) ∂γh, and every term with γ≠β is bounded by Cβ−γ2−N∣β−γ∣∣ξα∂γh(ξ)∣≤C2−Npαγ(h)→0 uniformly in ξ, while, for N≥1, the term with γ=β satisfies ∣ξα(1−σN)∂βh(ξ)∣≤sup⁡∣ξ∣≥2N−2∣ξα∂βh(ξ)∣→0 by [F5], since 1−σN vanishes for ∣ξ∣<2N−2. Hence pαβ((1−σN)h)→0 for every pair α,β, which is convergence to 0 in S by [F5], uniformly on bounded subsets because the finitely many seminorms in these estimates are uniformly bounded.

3.1F2F3step 2.1algebra

Convergence in S′ (part 1). The multiplier composition in [F2] gives ∑j<NΔ~jΔjf=F−1(σNFf) for every f∈S′. For a Schwartz test g, the bilinear transposition convention [F3] gives ⟨F−1(σNFf)−f,g⟩=⟨Ff,(σN−1)F−1g⟩. By step 2.1 the test on the right tends to zero in S, and continuity of Ff makes the pairing tend to zero. The same estimates are uniform for g in any bounded subset: F−1 maps bounded sets to bounded sets, step 2.1 is uniform there, and a continuous functional is bounded by finitely many Schwartz seminorms. Hence the partial sums converge to f in both the weak and strong dual topologies.

4.1step 1.2step 3.1∎

Identification of the sum (part 2). Apply step 3.1 to the Schwartz test gˉ; the resulting distributional pairing is the Hermitian integral pairing of part 2. Thus ⟨∑j<NΔ~jΔjf,g⟩→⟨f,g⟩ in that convention. Step 1.2 identifies each partial sum with ∑j<N⟨Δjf,Δ~jg⟩ and proves absolute convergence with the stated bound, so the sum is ⟨f,g⟩.

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