Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Deconvolution of a Schwartz function along the dyadic dilates of a fixed kernel

Statement

Assume Countable Choice. Let n≥1 and let φ∈S(Rn) satisfy ∫Rnφ≠0. Then there is a constant s0>0 (depending only on φ and n) such that for all integers L,N>0 there exist C>0 and M>0 (depending on φ,n,L,N but not on the input function) with the following property: for every ψ∈S there are ηj∈S, j≥0, such that ψ=∑j=0∞ηj∗φs02−jin S(Rn), and ∥ηj∥SN≤C 2−jnL ∥ψ∥SM(j≥0), where φt(x)=t−nφ(x/t) and ∥h∥SN:=sup⁡x∈Rnmax⁡(1,∣x∣)Nmax⁡∣α∣≤N∣∂αh(x)∣. Any smaller positive value of s0 also works, with the same conclusion and constants depending on the chosen value. The point of the estimate is that the coefficients ηj become rapidly small in the strong Schwartz norm as j→∞, uniformly in ψ: this is what makes the deconvolution usable inside maximal-function estimates. Countable Choice is used through the Fourier automorphism, differentiation identities, and Schwartz convolution laws cited below.

Facts & Assumptions

Given: Countable Choice, n≥1, φ∈S with ∫φ≠0, and the seminorms and topology of Schwartz space and its seminorms, Schwartz topology and convergence, Ck maps and multi-index derivative notation in Euclidean space.

[F1]

Fourier transformation is a topological automorphism of S(Rn), with φt^(ξ)=φ^(tξ) for t>0 (Fourier transform is a topological automorphism of Schwartz space, Fourier differentiation and multiplication identities on tempered distributions). In particular, the inverse transform of a compactly supported smooth function is Schwartz, and F(f∗g)=f^g^ for Schwartz f,g (Schwartz convolution and product laws).

[F2]

For every m∈N there is Cm with ∥h^∥Sm≤Cm∥h∥Sm+n+1 for all h∈S: for multi-indices ∣α∣,∣β∣≤m the identity (2πi)∣β∣ξβ∂αh^(ξ)=(−2πi)∣α∣∫Rne−2πix⋅ξ ∂β(xαh(x)) dx combined with the higher product rule and ∫(1+∣x∣)−n−1 dx<∞ bounds ∣ξβ∂αh^(ξ)∣ by a finite sum of Sm+n+1 seminorms of h (Fourier differentiation and multiplication identities on tempered distributions, Basic operations are continuous on Schwartz space).

[F3]

Dilations act on S with pαβ(φt)=t∣α∣−∣β∣−npαβ(φ), so φt∈S for every t>0 (Dilations and their normalisations preserve Schwartz space, with scaling identities).

Proof technique: Fourier-side construction of a smooth dyadic partition and inversion of the symbol φ^ on the annuli where it does not vanish.

Proof

technique · constructive
1.1givenF1construct

Normalisation and scaling of the kernel. The construction below is uniform in the scale: for a fixed parameter s0>0 the annuli {∣ξ∣≍s0−12j} play the role of the annuli {∣ξ∣≍2j} at s0=1, and every estimate keeps the same form with constants depending on s0; in particular the same argument run at a smaller parameter gives the statement for every smaller scale, the constants changing by a fixed factor. Since φ^(0)=∫φ≠0 and φ^ is continuous, after multiplying φ by the nonzero complex multiple (1/∫φ) and then replacing it by a suitable positive dilation δnφ(δ ⋅)=φ1/δ, we may assume ∫Rnφ=1,∣φ^(ξ)∣≥12for ∣ξ∣≤2. We prove the lemma in this normalisation with s0=1; undoing the dilation replaces the scale 1 by the fixed positive number 1/δ and does not change the form of the estimates.

2.1step 1.1givenalgebra

A smooth dyadic partition of unity. With the smooth step σ of The standard smooth step function, take ζ(ξ)=σ((9/4−∣ξ∣2)/(5/4)); it equals one on B(0,1) and its support is contained in the closed ball of radius 3/2, hence in B(0,2), and put ζ0=ζ and ζj(ξ)=ζ(2−jξ)−ζ(2−j+1ξ) for j≥1. Then for every J≥0, ∑j=0Jζj(ξ)=ζ(2−Jξ), so ∑j≥0ζj(ξ)=1 for every ξ: at ξ=0 both sides equal one because ζ(0)=1, and for ξ≠0 the limit ζ(2−Jξ)→ζ(0)=1 as J→∞ gives the identity. If ζj(ξ)≠0, then 2−jξ∈supp⁡ζ or 2−j+1ξ∈supp⁡ζ, so ∣2−jξ∣≤2 in either case; by step 1.1, ∣φ^(2−jξ)∣≥12 on supp⁡ζj.

3.1F1F3step 2.1givenalgebra

The deconvolution coefficients and convergence. For ψ∈S and j≥0 define the compactly supported smooth function ηj^(ξ)=ζj(ξ)φ^(2−jξ) ψ^(ξ). The quotient is well defined and smooth on a neighbourhood of supp⁡ζj by step 2.1, and ηj^∈Cc∞(Rn)⊆S; hence ηj:=F−1ηj^∈S by [F1]. On the Fourier side, for every J≥0, F(∑j=0Jηj∗φ2−j)(ξ)=ψ^(ξ)∑j=0Jζj(ξ)=ψ^(ξ) ζ(2−Jξ), where we used φ2−j^(ξ)=φ^(2−jξ) from [F1]. To prove convergence in S, put χJ(ξ)=ζ(2−Jξ)−1. The multiplier χJ itself is not Schwartz and does not converge to zero in S; instead we prove ψ^χJ→0 in every Schwartz seminorm. Fix multi-indices α,β. Leibniz's rule writes ∂β(ψ^χJ) as a finite sum of terms Cγ,β(∂γψ^)(∂β−γχJ), γ≤β. For the term with γ=β, the cutoff is undifferentiated: χJ=0 on ∣ξ∣≤2J because ζ=1 on B(0,1), and ∣χJ∣≤1+∥ζ∥∞ everywhere. Thus its pαβ contribution is bounded by (1+∥ζ∥∞)sup⁡∣ξ∣≥2J∣ξα∂βψ^(ξ)∣, which tends to zero by Schwartz decay. For every term with γ<β, let δ=β−γ≠0. The chain rule gives ∂δχJ(ξ)=2−J∣δ∣(∂δζ)(2−Jξ), supported in the annulus 2J≤∣ξ∣≤2J+1 since ζ is constant on B(0,1) and vanishes outside B(0,2). Its contribution is therefore bounded by Cδ2−J∣δ∣sup⁡∣ξ∣≥2J∣ξα∂γψ^(ξ)∣, which also tends to zero. There are only finitely many terms for each α,β, so pαβ(ψ^χJ)→0. This proves ψ^ζ(2−J⋅)→ψ^ in S. Since Fourier transformation is a homeomorphism of S [F1], the partial sums converge to ψ in S, and (with ∑j≥0 denoting that limit) ψ=∑j≥0ηj∗φ2−j.

4.1step 2.1step 3.1F1F2algebra

The rapid norm decay. Fix L,N>0; all constants below depend on φ,n,L,N only. For j≥1, on supp⁡ζj one has (1+∣ξ∣)≍2j: if ζj(ξ)≠0 then 2−j∣ξ∣≤2, while 2−j+1∣ξ∣≥1 because otherwise both ζ(2−jξ) and ζ(2−j+1ξ) would equal one, so 12⋅2j≤1+∣ξ∣≤3⋅2j. For j=0, the support lies in a fixed ball and all the following estimates hold by enlarging the constant, since the target factor is 2−0nL=1. The quotient ξ↦ζj(ξ)/φ^(2−jξ) is smooth on the neighbourhood {∣ξ∣<2j+1} of supp⁡ζj, and its derivatives of order at most N+n+1 are bounded by a constant C0=C0(n,N,φ) independent of j: the chain rule contributes the factors 2−j∣β∣≤1 to the derivatives both of ζj and of the composition of 1/φ^ with ξ↦2−jξ, and 1/φ^ is smooth with bounded derivatives on the fixed ball ∣z∣≤2, where ∣φ^∣≥12 by step 1.1. Multiplying by ψ^ with the higher product rule, ∣∂αηj^(ξ)∣≤C1max⁡∣β∣≤N+n+1∣∂βψ^(ξ)∣,∣α∣≤N+n+1, ξ∈supp⁡ζj. Multiplying by (1+∣ξ∣)N+n+1 and using the definition of the SM norm with M≥N+n+1 together with the lower bound just proved, ∥ηj^∥SN+n+1≤C1sup⁡ξ∈supp⁡ζj(1+∣ξ∣)N+n+1−M∥ψ^∥SM≤C2 2−j(M−N−n−1)∥ψ^∥SM, so with M≥N+n+1+nL the right-hand side is at most C2 2−jnL∥ψ^∥SM. Finally [F2] applied with the roles of a function and its transform interchanged gives ∥ηj∥SN≤C3∥ηj^∥SN+n+1 (the Fourier transform of ηj^ is ηj(−⋅), which has the same seminorms), and [F2] gives ∥ψ^∥SM≤CM∥ψ∥SM+n+1. Hence ∥ηj∥SN≤C 2−jnL∥ψ∥SM+n+1 with C=C2C3CM independent of ψ and j, so the statement holds with M replaced by M+n+1.

5.1step 1.1step 2.1step 3.1step 4.1discharge-construct∎

Conclusion. Steps 2.1 and 3.1 construct ηj∈S with ψ=∑j≥0ηj∗φ2−j in S, and step 4.1 gives the estimate ∥ηj∥SN≤C2−jnL∥ψ∥SM with constants independent of ψ. Undoing the normalisation of step 1.1 replaces the scale family 2−j by s02−j with the fixed s0=1/δ and does not affect the convergence or the estimates, and the same construction run at a smaller parameter gives the statement there. This proves the lemma.

Depends on

Used by

Dependency tree · two levels

38 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