Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Differentiating an integral with moving endpoints

Statement

Let I⊆R be an open interval, let α,β∈C1(I) with α(t)<β(t) for t∈I, let J⊆R be an open interval containing the closure of the union of the intervals [α(t),β(t)] over t∈I, and let F:I×J→R be continuous with continuous partial derivative ∂tF. Then G(t):=∫α(t)β(t)F(t,y) dy is C1 on I and G′(t)=F(t,β(t))β′(t)−F(t,α(t))α′(t)+∫α(t)β(t)∂tF(t,y) dy.

Facts & Assumptions

Given: open intervals I,J, functions α,β∈C1(I) with α<β, and a continuous F:I×J→R whose partial derivative ∂tF exists and is continuous on I×J, with J containing the closure of the union of the intervals [α(t),β(t)].

[F1]

If I0⊆R is order-convex with at least two elements and f:I0→R is continuous, then for c0∈I0, F(x)=∫c0xf is a primitive of f and ∫abf=G(b)−G(a) for every primitive G of f and a<b in I0 (Every continuous function on an interval has a primitive; two primitives differ by a constant; and ∫abf=G(b)−G(a) for any primitive G).

[F2]

Let a<b, c<d and let g,h:[a,b]×[c,d]→R be continuous with x↦g(x,t) differentiable on (a,b) and derivative h(x,t) for every fixed t∈[c,d]. Then G(x)=∫cdg(x,t) dt is differentiable on [a,b] with G′(x)=∫cdh(x,t) dt (Leibniz's rule on a compact rectangle: an interior parameter derivative with a continuous extension may be passed through a Riemann integral).

[F3]

If f:U→V⊆Rn is totally differentiable at a and g:V→Rp is totally differentiable at f(a), then g∘f is totally differentiable at a with D(g∘f)(a)=Dg(f(a))∘Df(a) (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)). The required total differentiability follows from continuous coordinate partial derivatives (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative).

Proof

1.1F1given

Localisation. Fix t0∈I. Choose a compact interval K⊂I with t0 in its interior I0. The endpoint functions are bounded on K by A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, so choose a<b in J with a<α(t)<β(t)<b for t∈K, and choose r∗∈J with r∗<a. Define Φ(u,t):=∫r∗uF(t,y) dy on (a,b)×I0. By [F1], G(t)=Φ(β(t),t)−Φ(α(t),t).

1.2F1F2algebra

The primitive is C1 on an open neighbourhood of the endpoint curves. By [F1], ∂uΦ(u,t)=F(t,u); by [F2] on compact rectangles inside I×J, ∂tΦ(u,t)=∫r∗u∂tF(t,y) dy. This last expression is jointly continuous: on a fixed compact rectangle, uniform continuity of ∂tF (Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous) bounds the change in t by the interval length times a uniform error, and boundedness bounds the change in u by a constant times ∣u−u0∣. Thus both partial derivatives are continuous, and If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative makes Φ totally differentiable.

2.1F1F3F4step 1.2algebra∎

Apply [F3] to the curves t↦(β(t),t) and t↦(α(t),t) in the open domain of Φ, and subtract using [F4]. Evaluation of the primitive gives G′(t)=F(t,β(t))β′(t)−F(t,α(t))α′(t)+∫α(t)β(t)∂tF(t,y) dy. The same uniform estimate as in step 1.2 shows this derivative is continuous. Since t0 was arbitrary, the formula holds throughout I.

Depends on

Used by

Dependency tree · two levels

67 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