Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Convolution of distributions when one has compact support

Definition

Let u,v∈D′(Rn), n≥1, with at least one compact support. Write S=supp⁡u, T=supp⁡v and a(x,y)=x+y. For ψ∈D(Rn) put Eψ=(S×T)∩a−1(supp⁡ψ). For any χ∈D(R2n) equal to one on a neighborhood of Eψ, set the candidate value Cu,v,ψ(χ)=(u⊗v)(χ ψ∘a).

The tensor and its support are supplied by Tensor product distributions and iterated pairings and Support of a distribution. The set Eψ is compact: if S is compact, it is a closed subset of the compact set S×(supp⁡ψ−S); interchange factors if T is compact. A cutoff therefore exists by Test function cutoffs and euclidean localization. The lemma Convolution of distributions is well defined under the support hypothesis ↗ proves that the candidate value is independent of χ and is a continuous linear functional of ψ; define (u∗v)(ψ) to be this common value. If both supports are compact it agrees with the smooth extension pairing of Compactly supported distributions extend to smooth functions. Empty support gives the zero candidate, and χ=0 is allowed when Eψ is empty. No infinite selection is part of the definition.

Depends on

Dependency tree · 2 levels

Sources