Alphabeta Math
TheoremStatement: 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.

Leibniz rule for distributions

Statement

For a∈C∞(Ω), u∈D′(Ω) and α∈N0n, ∂α(au)=∑β≤α(αβ)(∂βa)∂α−βu. Here β≤α is coordinatewise and (αβ)=∏i(αiβi). The identity is in the bilinear complex convention and requires no choice axiom.

Facts & Assumptions

[F1]

Distribution derivatives are signed transposes of the continuous test derivatives, whose smooth mixed partials commute (Distributional derivative).

[F2]

Smooth multiplication is defined by (av)(φ)=v(aφ) and is associative (Multiplication of a distribution by a smooth function).

Proof

Given: a,u,α as in the statement.

1.1givenF1F2algebra

Fix i and a test φ. The ordinary product rule gives a∂iφ=∂i(aφ)−(∂ia)φ: subtract the product at a point from the product at its coordinate increment, insert the mixed product, divide by the increment and pass to the limit. Therefore [given, F1, F2, algebra] ⟨∂i(au),φ⟩=−⟨u,a∂iφ⟩=⟨∂iu,aφ⟩+⟨u,(∂ia)φ⟩. By F2 this is the first-order formula.

2.1step 1.1F1

From F1, evaluating two consecutive derivative operations on a test gives the sign (−1)∣γ∣+1 times u(∂γ∂iφ). Commutation of the smooth test partials identifies this with (∂γ+eiu)(φ). Hence ∂i∂γu=∂γ+eiu. The asserted formula for α=0 is au=au.

3.1step 2.1step 1.1F1F2algebra

Suppose the formula holds for α. Differentiate it by ∂i and apply step 1.1 to each smooth coefficient times its distribution. Step 2.1 yields the two terms with indices β+ei and β, respectively. For each resulting index η, their coefficients add to (αη−ei)+(αη)=(α+eiη), using zero for an out-of-range binomial coefficient. The equality is Pascal's identity in coordinate i with all other coordinate factors unchanged. Thus the formula holds for α+ei, and induction on total degree proves every case. All sums are finite. For a=0 or u=0 every term is zero, and on the empty domain the identity is between zero functionals. □

Depends on

Dependency tree · 2 levels

Sources