Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-11
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.

Linearity, power rule, Leibniz rule and the degree bound for the formal derivative

Statement

For a commutative ring R, polynomials f,g∈R[x], and c∈R:

  1. (f+g)′=f′+g′ and (cf)′=cf′;
  2. (xn)′=nxn−1 for every positive n, while every constant has derivative 0;
  3. (fg)′=f′g+fg′;
  4. if f′ is nonzero, then deg⁡f′≤deg⁡f−1.

Facts & Assumptions

Given: A commutative ring R and polynomials f=∑iaixi and g=∑jbjxj.

[L1]

The coefficient of xn in f′ is (n+1)an+1 (The formal derivative of a polynomial).

[L2]

Proof

technique · direct
1.1

Comparing the coefficient at each index in [L1] proves additivity and scalar linearity; applying [L1] to a monomial gives the power rule, including derivative 0 for constants.

givenL1algebra
1.2

The coefficient of xn in (fg)′ is (n+1)∑i+j=n+1aibj=∑r+s=n((r+1)ar+1bs+ar(s+1)bs+1), where [L2] reindexes the two finite sums; these are exactly the coefficients of f′g+fg′.

givenL1L2algebra
2.1

If f has degree d and f′≠0, then [L1] makes every coefficient of f′ above index d−1 zero, so deg⁡f′≤d−1; steps 1.1 and 1.2 establish all remaining claims.

step 1.1step 1.2L1∎

Depends on

Used by

Cited to discharge well-definedness by The formal derivative of a polynomial.

Dependency tree · two levels

8 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