Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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 is well defined under the support hypothesis

Statement

For an integer n1 and distributions u,v on Rn, if at least one has compact support, the convolution candidate is cutoff-independent and defines a distribution. It is bilinear, commutative, and supp(uv)suppu+suppv. These claims hold in ZF.

Facts & Assumptions

[F1]

The candidate pairs uv with χ(x,y)ψ(x+y); the relevant support intersection is compact (Convolution of distributions when one has compact support).

[F2]

Tensor products are distributions with product support and interchangeable pairing orders (Tensor product distributions and iterated pairings).

[F3]

Compact sets admit smooth compact cutoffs equal to one on neighborhoods (Test function cutoffs and euclidean localization).

[F4]

A distribution vanishes on tests supported outside its support, by the support definition and locality (Support of a distribution, Distributions form a sheaf).

[F5]

Compactwise finite-order bounds characterize distributions (Local finite order characterization of distributions).

Proof

Given: an integer n1, u,v on Rn, and supports S,T, with one compact.

1.1

Two allowed cutoffs have difference zero near Eψ of F1. At every point of S×T outside Eψ, the function ψ(x+y) vanishes on a neighborhood. Thus the compact test (χχ~)ψ(x+y) has support disjoint from S×T. F2 and F4 make its pairing zero. This proves independence; if Eψ is empty the zero cutoff gives zero.

givenF1F2F4
2.1

Fix compact KRn. F1 and F3 give one cutoff for EK=(S×T)a1(K), valid for every test supported in K. The compact support L of this cutoff is fixed. F5 gives an order m tensor estimate there. The ordinary product and chain rules give pm(χψa)Aχ,mpm(ψ): each mixed derivative of ψ(x+y) is a derivative of ψ of the same total order, and the finite Leibniz sum has bounded cutoff coefficients. The candidate is linear in ψ by using this same cutoff for a finite sum, and F5 proves continuity. Bilinearity in the distributions follows similarly from one cutoff for the finite union of their relevant support intersections whenever each convolution is defined under the compact-factor condition.

step 1.1F1F2F3F5
3.1

Reflection of the two coordinate blocks sends an allowed cutoff to an allowed cutoff for vu. By F2 the tensor values agree after this interchange. One may verify the coordinate interchange first on product tests and then on their dense span, as in F2. Hence uv=vu.

step 2.1F1F2
4.1

Suppose S is compact and both sets are nonempty. If zS+T, the continuous function sdist(zs,T) is positive on S, hence has positive minimum d. Every z with zz<d/2 remains outside S+T. Thus S+T is closed. The case of compact T follows by interchange, and empty summands give the empty closed set. A test supported in its complement has Eψ=, so step 1.1 gives zero. F4 proves the support inclusion. Zero factors give the zero distribution; no lower bound or equality of convolution supports is asserted.

step 3.1step 1.1givenF4

Depends on

Used by

Cited to discharge well-definedness by Convolution of distributions when one has compact support.

Dependency tree · two levels

16 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