Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Basic operations are continuous on Schwartz space

Statement

On S(Rn), differentiation, multiplication by a fixed polynomial, translation by a fixed vector, and modulation by a fixed frequency are continuous complex-linear maps. Reflection is continuous linear and conjugation continuous antilinear. Pointwise multiplication S×S→S is continuous bilinear. These assertions require no choice.

Facts & Assumptions

Proof

technique · direct
1.1F1givenalgebra

By [F1], pαβ(∂δf)=pα,β+δ(f). For a monomial multiplier xδ, its product-rule term indexed by γ≤β,δ is (βγ)δ!/(δ−γ)! times xδ−γ∂β−γf, giving the bound by the corresponding finite sum of pα+δ−γ,β−γ(f). A polynomial is a finite sum of these monomials. For Taf(x)=f(x−a), put y=x−a and expand (y+a)α; then pαβ(Taf)≤∑γ≤α(αγ)∣aα−γ∣pγβ(f).

1.2F1F2givenalgebra

For Mbf(x)=e2πib⋅xf(x), [F1] and [F2] give pαβ(Mbf)≤∑γ≤β(βγ)∣(2πib)γ∣pα,β−γ(f). Reflection Rf(x)=f(−x) has pαβ(Rf)=pαβ(f), and conjugation has the same identity, since coordinate derivatives commute with real and imaginary parts. These formulas also prove the asserted linearity or antilinearity.

2.1step 1.1step 1.2F1given∎

All bounds in steps 1.1 and 1.2 are finite seminorm sums; requiring their finitely many input seminorms to be sufficiently small proves continuity at zero directly from the topology, and linearity or antilinearity translates this to every point. Product Leibniz further gives pαβ(fg)≤∑γ≤β(βγ)pαγ(f)p0,β−γ(g), proving closure. At (f0,g0) write fg−f0g0=(f−f0)g0+f0(g−g0)+(f−f0)(g−g0) and apply this bound to all three terms. Each of the finitely many errors tends to zero with the relevant input seminorms, proving joint continuity and bilinearity.

Depends on

Dependency tree · 2 levels

Sources