Explore related knowledge and questions →

Question 10160: Derivative of an Oriented Integral with Moving Bounds

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 51

← Question derivation index · Original question batch

R0019-10160 · q-20261007-advance-20261009-r01-fundamental-theorem-calculus-0035

Original question and givens

On all R, continuous f has ascending coefficients [-3, 10, -1, 2], constant term first. Let lower l(x)=(-1)x+(-1) and upper u(x)=(0)x+(-3). Find the derivative of ∫_l(x)^u(x) f(t)dt at x=-1. Use reduced positive-denominator fractions, retaining /1 for integers.

  • G001 — On all R, continuous f has ascending coefficients [-3, 10, -1, 2], constant term first. Let lower l(x)=(-1)x+(-1) and upper u(x)=(0)x+(-3). Find the derivative of ∫_l(x)^u(x) f(t)dt at x=-1. Use reduced positive-denominator fractions, retaining /1 for integers.

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

Step-by-step derivation

S001 · implies

Before

raw integrand f=[-3, 10, -1, 2];ascending powers on all R

After

normalized coefficients=[-3/1, 10/1, -1/1, 2/1];declared continuous real polynomial

Conditions: none

The declared integrand is a continuous real polynomial on all R,and endpoints are oriented.Use FTC only under these supplied sufficient hypotheses;finite checks are not a new general formal FTC proof.

Step identifiers and dependencies

Rule: declared_FTC_continuity_hypothesis · Uses: G001

S002 · calculation

Before

zero primitive coefficient1 := div(-3, 1)

After

zero primitive coefficient1 = -3

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S001

S003 · implies

Before

integrand power=0;coefficient=-3/1

After

primitive power=1;coefficient=-3/1

Conditions: none

For c*x^k place c/(k+1) at x^(k+1),with positive denominator k+1.Differentiating recovers c*x^k.Any additive constant gives another primitive.

Step identifiers and dependencies

Rule: polynomial_primitive_coefficient_rule · Uses: G001, S002

S004 · calculation

Before

zero primitive coefficient2 := div(10, 2)

After

zero primitive coefficient2 = 5

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · implies

Before

integrand power=1;coefficient=10/1

After

primitive power=2;coefficient=5/1

Conditions: none

For c*x^k place c/(k+1) at x^(k+1),with positive denominator k+1.Differentiating recovers c*x^k.Any additive constant gives another primitive.

Step identifiers and dependencies

Rule: polynomial_primitive_coefficient_rule · Uses: G001, S004

S006 · calculation

Before

zero primitive coefficient3 := div(-1, 3)

After

zero primitive coefficient3 = -1/3

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

S007 · implies

Before

integrand power=2;coefficient=-1/1

After

primitive power=3;coefficient=-1/3

Conditions: none

For c*x^k place c/(k+1) at x^(k+1),with positive denominator k+1.Differentiating recovers c*x^k.Any additive constant gives another primitive.

Step identifiers and dependencies

Rule: polynomial_primitive_coefficient_rule · Uses: G001, S006

S008 · calculation

Before

zero primitive coefficient4 := div(2, 4)

After

zero primitive coefficient4 = 1/2

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S007

S009 · implies

Before

integrand power=3;coefficient=2/1

After

primitive power=4;coefficient=1/2

Conditions: none

For c*x^k place c/(k+1) at x^(k+1),with positive denominator k+1.Differentiating recovers c*x^k.Any additive constant gives another primitive.

Step identifiers and dependencies

Rule: polynomial_primitive_coefficient_rule · Uses: G001, S008

S010 · implies

Before

original integrand coefficients=[-3/1, 10/1, -1/1, 2/1]

After

zero-constant primitive coefficients=[0/1, -3/1, 5/1, -1/3, 1/2]

Conditions: none

This is one convenient representative,not a claim that the primitive is unique without its constant family.

Step identifiers and dependencies

Rule: zero_constant_polynomial_primitive · Uses: G001, S009

S011 · calculation

Before

constructed P0 derivative coefficient0 := mul(1, -3)

After

constructed P0 derivative coefficient0 = -3

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S010

S012 · implies

Before

constructed P0:source power=1;coefficient=-3/1

After

derivative power=0;coefficient=-3/1

Conditions: none

Multiply the coefficient by k and lower its power by1.The constant contributes nothing;retain every higher nonzero term.

Step identifiers and dependencies

Rule: polynomial_derivative_coefficient_rule · Uses: G001, S011

S013 · calculation

Before

constructed P0 derivative coefficient1 := mul(2, 5)

After

constructed P0 derivative coefficient1 = 10

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S012

S014 · implies

Before

constructed P0:source power=2;coefficient=5/1

After

derivative power=1;coefficient=10/1

Conditions: none

Multiply the coefficient by k and lower its power by1.The constant contributes nothing;retain every higher nonzero term.

Step identifiers and dependencies

Rule: polynomial_derivative_coefficient_rule · Uses: G001, S013

S015 · calculation

Before

constructed P0 derivative coefficient2 := mul(3, -1/3)

After

constructed P0 derivative coefficient2 = -1

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S014

S016 · implies

Before

constructed P0:source power=3;coefficient=-1/3

After

derivative power=2;coefficient=-1/1

Conditions: none

Multiply the coefficient by k and lower its power by1.The constant contributes nothing;retain every higher nonzero term.

Step identifiers and dependencies

Rule: polynomial_derivative_coefficient_rule · Uses: G001, S015

S017 · calculation

Before

constructed P0 derivative coefficient3 := mul(4, 1/2)

After

constructed P0 derivative coefficient3 = 2

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S016

S018 · implies

Before

constructed P0:source power=4;coefficient=1/2

After

derivative power=3;coefficient=2/1

Conditions: none

Multiply the coefficient by k and lower its power by1.The constant contributes nothing;retain every higher nonzero term.

Step identifiers and dependencies

Rule: polynomial_derivative_coefficient_rule · Uses: G001, S017

S019 · implies

Before

P0 derivative coefficients=[-3/1, 10/1, -1/1, 2/1];f=[-3/1, 10/1, -1/1, 2/1]

After

P0'=f on all R in this declared polynomial model

Conditions: none

The full coefficient identity establishes the primitive relation in the declared model.With the supplied continuity premise use the FTC endpoint difference,not a function guessed from sample points.

Step identifiers and dependencies

Rule: constructed_primitive_coefficient_identity · Uses: G001, S018

S020 · calculation

Before

lower bound m*x := mul(-1, -1)

After

lower bound m*x = 1

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S019

S021 · calculation

Before

lower bound m*x+b := sum(1, -1)

After

lower bound m*x+b = 0

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S020

S022 · calculation

Before

upper bound m*x := mul(0, -1)

After

upper bound m*x = 0

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S021

S023 · calculation

Before

upper bound m*x+b := sum(0, -3)

After

upper bound m*x+b = -3

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S022

S024 · implies

Before

H(x)=P0(u(x))-P0(l(x));P0'=f;lower slope=-1;upper slope=0

After

H'(x)=f(u(x))*upper_slope-f(l(x))*lower_slope

Conditions: none

Use the oriented endpoint difference,then the chain rule for both compositions.Subtract the whole lower-bound term;constant bounds have slope0.Equal bound values at one point do not mean equal velocities or force a zero derivative.

Step identifiers and dependencies

Rule: FTC_moving_bounds_two_chain_factors · Uses: G001, S023

S025 · calculation

Before

f at upper Horner multiply3 := mul(0, -3)

After

f at upper Horner multiply3 = 0

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S024

S026 · calculation

Before

f at upper Horner add3 := sum(0, 2)

After

f at upper Horner add3 = 2

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S025

S027 · calculation

Before

f at upper Horner multiply2 := mul(2, -3)

After

f at upper Horner multiply2 = -6

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S026

S028 · calculation

Before

f at upper Horner add2 := sum(-6, -1)

After

f at upper Horner add2 = -7

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S027

S029 · calculation

Before

f at upper Horner multiply1 := mul(-7, -3)

After

f at upper Horner multiply1 = 21

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S028

S030 · calculation

Before

f at upper Horner add1 := sum(21, 10)

After

f at upper Horner add1 = 31

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S029

S031 · calculation

Before

f at upper Horner multiply0 := mul(31, -3)

After

f at upper Horner multiply0 = -93

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S030

S032 · calculation

Before

f at upper Horner add0 := sum(-93, -3)

After

f at upper Horner add0 = -96

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S031

S033 · calculation

Before

f at lower Horner multiply3 := mul(0, 0)

After

f at lower Horner multiply3 = 0

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S032

S034 · calculation

Before

f at lower Horner add3 := sum(0, 2)

After

f at lower Horner add3 = 2

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S033

S035 · calculation

Before

f at lower Horner multiply2 := mul(2, 0)

After

f at lower Horner multiply2 = 0

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S034

S036 · calculation

Before

f at lower Horner add2 := sum(0, -1)

After

f at lower Horner add2 = -1

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S035

S037 · calculation

Before

f at lower Horner multiply1 := mul(-1, 0)

After

f at lower Horner multiply1 = 0

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S036

S038 · calculation

Before

f at lower Horner add1 := sum(0, 10)

After

f at lower Horner add1 = 10

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S037

S039 · calculation

Before

f at lower Horner multiply0 := mul(10, 0)

After

f at lower Horner multiply0 = 0

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S038

S040 · calculation

Before

f at lower Horner add0 := sum(0, -3)

After

f at lower Horner add0 = -3

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S039

S041 · calculation

Before

upper chain contribution := mul(-96, 0)

After

upper chain contribution = 0

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S040

S042 · calculation

Before

lower chain contribution := mul(-3, -1)

After

lower chain contribution = 3

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S041

S043 · calculation

Before

moving bound derivative upper-minus-lower := sub(0, 3)

After

moving bound derivative upper-minus-lower = -3

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S042

S044 · implies

Before

point=-1;lower=0;upper=-3;f(upper)=-96;f(lower)=-3

After

upper contribution=0;lower contribution=3;derivative=-3/1

Conditions: none

Retain both actual endpoints,integrand values and slopes,then subtract with sign.Do not take an absolute area or discard zero/negative velocities.

Step identifiers and dependencies

Rule: FTC_moving_bounds_actual_values · Uses: G001, S043

Reverse checks

  • S044 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S043 · premise_and_result_audit — Recompute moving bound derivative upper-minus-lower with exact rational arithmetic, not rounded decimals.
  • S042 · premise_and_result_audit — Recompute lower chain contribution with exact rational arithmetic, not rounded decimals.
  • S041 · premise_and_result_audit — Recompute upper chain contribution with exact rational arithmetic, not rounded decimals.
  • S040 · premise_and_result_audit — Recompute f at lower Horner add0 with exact rational arithmetic, not rounded decimals.
  • S039 · premise_and_result_audit — Recompute f at lower Horner multiply0 with exact rational arithmetic, not rounded decimals.
  • S038 · premise_and_result_audit — Recompute f at lower Horner add1 with exact rational arithmetic, not rounded decimals.
  • S037 · premise_and_result_audit — Recompute f at lower Horner multiply1 with exact rational arithmetic, not rounded decimals.
  • S036 · premise_and_result_audit — Recompute f at lower Horner add2 with exact rational arithmetic, not rounded decimals.
  • S035 · premise_and_result_audit — Recompute f at lower Horner multiply2 with exact rational arithmetic, not rounded decimals.
  • S034 · premise_and_result_audit — Recompute f at lower Horner add3 with exact rational arithmetic, not rounded decimals.
  • S033 · premise_and_result_audit — Recompute f at lower Horner multiply3 with exact rational arithmetic, not rounded decimals.
  • S032 · premise_and_result_audit — Recompute f at upper Horner add0 with exact rational arithmetic, not rounded decimals.
  • S031 · premise_and_result_audit — Recompute f at upper Horner multiply0 with exact rational arithmetic, not rounded decimals.
  • S030 · premise_and_result_audit — Recompute f at upper Horner add1 with exact rational arithmetic, not rounded decimals.
  • S029 · premise_and_result_audit — Recompute f at upper Horner multiply1 with exact rational arithmetic, not rounded decimals.
  • S028 · premise_and_result_audit — Recompute f at upper Horner add2 with exact rational arithmetic, not rounded decimals.
  • S027 · premise_and_result_audit — Recompute f at upper Horner multiply2 with exact rational arithmetic, not rounded decimals.
  • S026 · premise_and_result_audit — Recompute f at upper Horner add3 with exact rational arithmetic, not rounded decimals.
  • S025 · premise_and_result_audit — Recompute f at upper Horner multiply3 with exact rational arithmetic, not rounded decimals.
  • S024 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S023 · premise_and_result_audit — Recompute upper bound m*x+b with exact rational arithmetic, not rounded decimals.
  • S022 · premise_and_result_audit — Recompute upper bound m*x with exact rational arithmetic, not rounded decimals.
  • S021 · premise_and_result_audit — Recompute lower bound m*x+b with exact rational arithmetic, not rounded decimals.
  • S020 · premise_and_result_audit — Recompute lower bound m*x with exact rational arithmetic, not rounded decimals.
  • S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S018 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S017 · premise_and_result_audit — Recompute constructed P0 derivative coefficient3 with exact rational arithmetic, not rounded decimals.
  • S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S015 · premise_and_result_audit — Recompute constructed P0 derivative coefficient2 with exact rational arithmetic, not rounded decimals.
  • S014 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S013 · premise_and_result_audit — Recompute constructed P0 derivative coefficient1 with exact rational arithmetic, not rounded decimals.
  • S012 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S011 · premise_and_result_audit — Recompute constructed P0 derivative coefficient0 with exact rational arithmetic, not rounded decimals.
  • S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S008 · premise_and_result_audit — Recompute zero primitive coefficient4 with exact rational arithmetic, not rounded decimals.
  • S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S006 · premise_and_result_audit — Recompute zero primitive coefficient3 with exact rational arithmetic, not rounded decimals.
  • S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S004 · premise_and_result_audit — Recompute zero primitive coefficient2 with exact rational arithmetic, not rounded decimals.
  • S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S002 · premise_and_result_audit — Recompute zero primitive coefficient1 with exact rational arithmetic, not rounded decimals.
  • S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

-3/1

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: 5d2221f189032eb07e991c38e8bb2608741ee1a16cb2eed1c68526239c640bbc
  • candidate record SHA-256: 25a8d81f997eea2817b1593680f122824e084f47e1da1633a4f8ac301170247f
  • semantic review receipt SHA-256: eeb35dc5daab92234bf72827627392b47f38ead4cfb574d4373bebc43c09fbf5
  • question-first witness SHA-256: 3cf8e0d3a00b0df1994db2bfde81f4a31b382e170bdda83ea3d0b68da64e8419
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON