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 , and , Here is coordinatewise and . The identity is in the bilinear complex convention and requires no choice axiom.
Facts & Assumptions
Distribution derivatives are signed transposes of the continuous test derivatives, whose smooth mixed partials commute (Distributional derivative).
Smooth multiplication is defined by and is associative (Multiplication of a distribution by a smooth function).
Proof
Given: as in the statement.
Fix and a test . The ordinary product rule gives : 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] By F2 this is the first-order formula.
From F1, evaluating two consecutive derivative operations on a test gives the sign times . Commutation of the smooth test partials identifies this with . Hence . The asserted formula for is .
Suppose the formula holds for . Differentiate it by and apply step 1.1 to each smooth coefficient times its distribution. Step 2.1 yields the two terms with indices and , respectively. For each resulting index , their coefficients add to , using zero for an out-of-range binomial coefficient. The equality is Pascal's identity in coordinate with all other coordinate factors unchanged. Thus the formula holds for , and induction on total degree proves every case. All sums are finite. For or every term is zero, and on the empty domain the identity is between zero functionals.