Step-by-step derivation
S001 · implies
Before
domain=R; coefficient lists are in ascending powers
After
constant term first; rational pairs=[numerator,denominator]
Conditions: none
Fix coefficient order;do not read ascending coefficients as descending or swap numerator and denominator.
Step identifiers and dependencies
Rule: polynomial_representation · Uses: G001
S002 · implies
Before
f coefficients ascending=[0, 0, 0, -16]
After
seek F₀ with constant coefficient0 and F₀′=f
Conditions: none
Antiderivatives are not generally unique; this task additionally fixes the constant coefficient at0.
Step identifiers and dependencies
Rule: canonical_primitive_domain · Uses: G001, S001
S003 · calculation
Before
primitive coefficient at degree1 := div(0, 1)
After
primitive coefficient at degree1 = 0
Conditions: none
Since (x^(k+1))′=(k+1)x^k,divide the coefficient by the positive nonzero integer k+1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
differentiate back coefficient0 := mul(0, 1)
After
differentiate back coefficient0 = 0
Conditions: none
Differentiation multiplies back by k+1 and must recover the original coefficient.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · calculation
Before
primitive coefficient at degree2 := div(0, 2)
After
primitive coefficient at degree2 = 0
Conditions: none
Since (x^(k+1))′=(k+1)x^k,divide the coefficient by the positive nonzero integer k+1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · calculation
Before
differentiate back coefficient1 := mul(0, 2)
After
differentiate back coefficient1 = 0
Conditions: none
Differentiation multiplies back by k+1 and must recover the original coefficient.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · calculation
Before
primitive coefficient at degree3 := div(0, 3)
After
primitive coefficient at degree3 = 0
Conditions: none
Since (x^(k+1))′=(k+1)x^k,divide the coefficient by the positive nonzero integer k+1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation
Before
differentiate back coefficient2 := mul(0, 3)
After
differentiate back coefficient2 = 0
Conditions: none
Differentiation multiplies back by k+1 and must recover the original coefficient.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · calculation
Before
primitive coefficient at degree4 := div(-16, 4)
After
primitive coefficient at degree4 = -4
Conditions: none
Since (x^(k+1))′=(k+1)x^k,divide the coefficient by the positive nonzero integer k+1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S008
S010 · calculation
Before
differentiate back coefficient3 := mul(-4, 4)
After
differentiate back coefficient3 = -16
Conditions: none
Differentiation multiplies back by k+1 and must recover the original coefficient.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · implies
Before
[0, 0, 0, 0, -4]
After
all derivative coefficients agree with f
Conditions: none
Coefficient agreement proves the polynomial identity on all reals,not merely equality at a few points.
Step identifiers and dependencies
Rule: global_polynomial_identity · Uses: G001, S010
S012 · implies
Before
[0, 0, 0, 0, -4]
After
reduced coefficients;integer coefficients retain /1
Conditions: none
Return ascending coefficients,trim redundant leading-in-degree zeros,and retain[0/1] for the zero polynomial.
Step identifiers and dependencies
Rule: coefficient_output_protocol · Uses: G001, S011