Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Schwartz approximate identities converge in the sense of tempered distributions

Statement

Assume Countable Choice. Let n≥1, let Φ∈S(Rn) satisfy ∫RnΦ=1, and for t>0 write Φt(x)=t−nΦ(x/t). Then for every f∈S′(Rn) and every ψ∈S(Rn), ⟨Φt∗f,ψ⟩⟶⟨f,ψ⟩(t↓0), where the pairing is against the smooth convolution function of Convolution of a tempered distribution with a schwartz function; in other words Φt∗f→f in S′ as t↓0. Consequently for every sequence tj↓0 one has Φtj∗f→f in S′. If in addition Φ∗Φ denotes the everywhere-defined Schwartz convolution, then Φt∗Φt∗f=(Φ∗Φ)t∗f→f in S′ as t↓0, the dyadic instance being Φ2−j∗Φ2−j∗f→f.

Facts & Assumptions

Given: Countable Choice, n≥1, Φ∈S with ∫Φ=1, f∈S′, ψ∈S; the seminorms and topology of Schwartz space and its seminorms and Schwartz topology and convergence; the convolution of Convolution of a tempered distribution with a schwartz function.

[F1]

For fixed t>0, Φt∈S, ∫Φt=∫Φ=1, and the translated and reflected family x↦Φt(x−⋅) is smooth into S: derivatives in x correspond to derivatives of Φt (Dilations and their normalisations preserve Schwartz space, with scaling identities, Schwartz parameter pairing and integral interchange).

[F2]

For f∈S′ there are C≥0 and integers N,M with ∣⟨f,h⟩∣≤Cmax⁡∣α∣≤N,∣β∣≤Mpαβ(h) for all h∈S (Finite seminorm bound characterizes tempered distributions).

[F3]

Cc∞⊆S and Schwartz functions and all their polynomial multiples are integrable; in particular ∫∣Φ(w)∣(1+∣w∣)N+1 dw<∞ for every N (Schwartz derivatives are integrable).

[F4]

Substitution preserves Lebesgue integrals under Countable Choice, and ∫Φ=∫Φˇ where Φˇ(u)=Φ(−u) (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).

Proof technique: reduce the distributional convergence to a Schwartz-norm estimate for the reflected approximate identity, then apply the finite-seminorm bound.

Proof

technique · direct
1.1F1F3F4algebra

The reflected approximate identity converges in Schwartz space. Put Φˇ(u)=Φ(−u) and Kt=Φˇt∗ψ, so that Kt(y)=∫RnΦt(x−y)ψ(x) dx=∫RnΦˇ(w)ψ(y−tw) dw, the last form by the substitution x=y−tw. Then Kt−ψ=∫Φˇ(w)(ψ(⋅−tw)−ψ(⋅)) dw because ∫Φˇ=∫Φ=1 by [F1], [F4]. Fix multi-indices α,β and t≤1. Differentiating under the integral and applying the mean value theorem along the segment from y to y−tw gives ∣∂βKt(y)−∂βψ(y)∣≤∫Rn∣Φˇ(w)∣ t∣w∣∫01∣∇∂βψ(y−stw)∣ ds dw. Since ∣yα∣≤∑γ≤α(αγ)∣(y−stw)γ∣ (t∣w∣)∣α∣−∣γ∣≤(1+t∣w∣)∣α∣∑γ≤α(αγ)∣(y−stw)γ∣, taking the supremum in y and using t≤1 yields pαβ(Kt−ψ)≤t Cα∫Rn∣Φˇ(w)∣(1+∣w∣)∣α∣+1 dw⋅max⁡i≤nmax⁡γ≤αpγ,β+ei(ψ), with Cα=n∑γ≤α(αγ), and the integral is finite by [F3]. Hence pαβ(Kt−ψ)→0 as t↓0: this is convergence in every Schwartz seminorm, i.e. Kt→ψ in S.

2.1F1F2F3step 1.1given

The pairing identity. For every t>0, ⟨Φt∗f,ψ⟩=⟨f,Kt⟩. Indeed, the parameter-pairing lemma applied to H(x)=ψ(x) Φt(x−⋅) and u=f gives ⟨f,∫H(x) dx⟩=∫⟨f,Φt(x−⋅)⟩ψ(x) dx=∫(Φt∗f)(x)ψ(x) dx, and ∫H(x) dx=Kt by the computation of step 1.1; the seminorm majorants required by that lemma are supplied by [F1] and [F3], since ∣ψ(x)∣(1+∣x∣)N is integrable for every N.

3.1F1F2step 1.1step 2.1algebra∎

Conclusion. By step 1.1 Kt→ψ in S, so the finite-seminorm bound of [F2] gives ⟨f,Kt⟩→⟨f,ψ⟩; step 2.1 identifies this with ⟨Φt∗f,ψ⟩→⟨f,ψ⟩ as t↓0, which is convergence Φt∗f→f in S′ by the definition of that convergence. Sequences and the dyadic scale t=2−j are instances. For the convolution form, Φ∗Φ∈S by Schwartz convolution and product laws, ∫(Φ∗Φ)=(∫Φ)2=1, and the substitution z=tw gives (Φ∗Φ)t=Φt∗Φt, so the statement applies to the Schwartz function Φ∗Φ. This proves the lemma.

Depends on

Used by

Dependency tree · two levels

43 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