Explore related knowledge and questions →

Question 10153: 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-10153 · q-20261007-advance-20261009-r01-fundamental-theorem-calculus-0028

Original question and givens

On all R, continuous f has ascending coefficients [3, 1], constant term first. Let lower l(x)=(2)x+(1) and upper u(x)=(2)x+(1). 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, 1], constant term first. Let lower l(x)=(2)x+(1) and upper u(x)=(2)x+(1). 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, 1];ascending powers on all R

After

normalized coefficients=[3/1, 1/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(1, 2)

After

zero primitive coefficient2 = 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, S003

S005 · implies

Before

integrand power=1;coefficient=1/1

After

primitive power=2;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, S004

S006 · implies

Before

original integrand coefficients=[3/1, 1/1]

After

zero-constant primitive coefficients=[0/1, 3/1, 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, S005

S007 · 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, S006

S008 · 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, S007

S009 · calculation

Before

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

After

constructed P0 derivative coefficient1 = 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, S008

S010 · implies

Before

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

After

derivative power=1;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, S009

S011 · implies

Before

P0 derivative coefficients=[3/1, 1/1];f=[3/1, 1/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, S010

S012 · calculation

Before

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

After

lower bound m*x = -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, S011

S013 · calculation

Before

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

After

lower bound m*x+b = -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, S012

S014 · calculation

Before

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

After

upper bound m*x = -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, S013

S015 · calculation

Before

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

After

upper bound m*x+b = -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

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

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, S015

S017 · calculation

Before

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

After

f at upper 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, S016

S018 · calculation

Before

f at upper Horner add1 := sum(0, 1)

After

f at upper Horner add1 = 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, S017

S019 · calculation

Before

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

After

f at upper Horner multiply0 = -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, S018

S020 · calculation

Before

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

After

f at upper Horner add0 = 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, S019

S021 · calculation

Before

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

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, S020

S022 · calculation

Before

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

After

f at lower Horner add1 = 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, S021

S023 · calculation

Before

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

After

f at lower Horner multiply0 = -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, S022

S024 · calculation

Before

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

After

f at lower Horner add0 = 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, S023

S025 · calculation

Before

upper chain contribution := mul(2, 2)

After

upper chain contribution = 4

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

lower chain contribution := mul(2, 2)

After

lower chain contribution = 4

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

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

After

moving bound derivative upper-minus-lower = 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, S026

S028 · implies

Before

point=-1;lower=-1;upper=-1;f(upper)=2;f(lower)=2

After

upper contribution=4;lower contribution=4;derivative=0/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, S027

Reverse checks

  • S028 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S027 · premise_and_result_audit — Recompute moving bound derivative upper-minus-lower with exact rational arithmetic, not rounded decimals.
  • S026 · premise_and_result_audit — Recompute lower chain contribution with exact rational arithmetic, not rounded decimals.
  • S025 · premise_and_result_audit — Recompute upper chain contribution with exact rational arithmetic, not rounded decimals.
  • S024 · premise_and_result_audit — Recompute f at lower Horner add0 with exact rational arithmetic, not rounded decimals.
  • S023 · premise_and_result_audit — Recompute f at lower Horner multiply0 with exact rational arithmetic, not rounded decimals.
  • S022 · premise_and_result_audit — Recompute f at lower Horner add1 with exact rational arithmetic, not rounded decimals.
  • S021 · premise_and_result_audit — Recompute f at lower Horner multiply1 with exact rational arithmetic, not rounded decimals.
  • S020 · premise_and_result_audit — Recompute f at upper Horner add0 with exact rational arithmetic, not rounded decimals.
  • S019 · premise_and_result_audit — Recompute f at upper Horner multiply0 with exact rational arithmetic, not rounded decimals.
  • S018 · premise_and_result_audit — Recompute f at upper Horner add1 with exact rational arithmetic, not rounded decimals.
  • S017 · premise_and_result_audit — Recompute f at upper Horner multiply1 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 upper bound m*x+b with exact rational arithmetic, not rounded decimals.
  • S014 · premise_and_result_audit — Recompute upper bound m*x with exact rational arithmetic, not rounded decimals.
  • S013 · premise_and_result_audit — Recompute lower bound m*x+b with exact rational arithmetic, not rounded decimals.
  • S012 · premise_and_result_audit — Recompute lower bound m*x with exact rational arithmetic, not rounded decimals.
  • S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Recompute constructed P0 derivative coefficient1 with exact rational arithmetic, not rounded decimals.
  • S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S007 · premise_and_result_audit — Recompute constructed P0 derivative coefficient0 with exact rational arithmetic, not rounded decimals.
  • S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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

0/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: 896c7568fb7c1d714bd6477f1b25bc6b4e0e342d001bf92197d55eea1d5a8488
  • candidate record SHA-256: e37c7fae956896b9e357269d3bf2209e7c7ff25ff75a96b5a22b51c399ce40e0
  • semantic review receipt SHA-256: eeb35dc5daab92234bf72827627392b47f38ead4cfb574d4373bebc43c09fbf5
  • question-first witness SHA-256: 3cf8e0d3a00b0df1994db2bfde81f4a31b382e170bdda83ea3d0b68da64e8419
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON