Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Distributional derivatives commute with test-function convolution

Statement

For a distribution T on Rn and a test function φ, every multi-index α satisfies ∂α(T∗φ)=(∂αT)∗φ=T∗(∂αφ), as smooth functions on their common safe domain.

Facts & Assumptions

Given: T∈D′(Rn), φ∈D(Rn), and a multi-index α∈N0n. The convolution is bilinear and uses the test y↦φ(x−y).

[F1]

For u∈D′(Ω) and ψ∈D(Rn), u∗ψ is smooth on its open safe domain and ∂α(u∗ψ)=(∂αu)∗ψ=u∗(∂αψ) there. (Convolution with a test function is smooth).

[F2]

The convolution is (T∗φ)(x)=⟨T(y),φ(x−y)⟩ wherever the translated test is supported in the distribution domain. (Convolution of a distribution with a test function).

[F3]

Distributional differentiation satisfies ⟨∂αT,ψ⟩=(−1)∣α∣⟨T,∂αψ⟩. (Distributional derivative).

Proof

technique · direct
1.1givenF2

For Ω=Rn, every translated compact support x−supp⁡φ lies in Ω, so the safe domain is all of Rn. Also ∂αφ is a test function with support contained in supp⁡φ. Thus all three convolutions are defined there by [F2].

1.2F1F2

By the smoothness and parameter-differentiation conclusion in [F1], differentiating the pairing in [F2] gives ∂xα(T∗φ)(x)=⟨T(y),(∂αφ)(x−y)⟩=T∗(∂αφ)(x).

2.1step 1.2F2F3algebra

The signed derivative definition [F3] gives (∂αT)∗φ(x)=(−1)∣α∣⟨T(y),∂yαφ(x−y)⟩. Since ∂yαφ(x−y)=(−1)∣α∣(∂αφ)(x−y), the two signs cancel and this equals the expression in step 1.2. Hence all three smooth functions agree on the safe domain.

3.1step 1.1step 1.2step 2.1F1cases∎

The same calculation includes α=0; if φ=0 or T=0 each side is zero; for n=1 it is the same one-variable derivative calculation, and formally for n=0 the only multi-index is zero and the identity is tautological. There are no spatial boundary endpoints on Rn, and no choice is used.

Source notes

Hunter §§2.5–2.7, printed pp. 32–42. The exact identity is already a consequence of the published whole-domain convolution-smoothness theorem in the library; this item records the whole-space specialization and displays the signed derivative computation in the repository's bilinear convention.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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