Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Differentiation of a variable-limit convolution integral with a C-one matrix kernel

Statement

Let n≥1, equip Rn with the Euclidean inner product and norm of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, and let I⊆R be an interval with nonempty interior (Intervals of R: the nine order-convex forms, nondegeneracy, and length), let t0∈I, let U⊆R be an open interval with I−I:={t−s:t,s∈I}⊆U, let g:U→Mn(R) have C1 entries (The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations, Ck Euclidean maps and diffeomorphisms) and let f:I→Rn be continuous (Vector-valued functions f:A→Rm, their limits and continuity, with the dictionary to the metric notions). For B=(bij)∈Mn(R) and v∈Rn, define (Bv)i:=∑j<nbijvj. This is a linear map by the coordinate formula; the Euclidean norm is a norm by Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation, and the standard coordinate vectors form an ordered basis by The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0, so the map is bounded by A linear map from a finite-dimensional normed space is bounded. Let ∥B∥ denote its induced operator norm (The operator norm as the least bound and as the unit-sphere or unit-ball supremum). All matrix actions in the integrals use this convention. Since 0∈I−I⊆U, the value g(0) is defined. Define

F:I⟶Rn,F(t):=∫t0tg(t−s)f(s) ds,

with the oriented integral of The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral and the matrix action just defined; the integrand is continuous in s, hence integrable on every compact subinterval. Then:

  1. F is differentiable at every interior point t of I (The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set) and

F′(t)=g(0)f(t)+∫t0tg′(t−s)f(s) ds.

  1. If moreover g′ is bounded on compact subintervals of U (which holds automatically because g is C1), then F is of class C1 on the interior of I.

Facts & Assumptions

Given: A natural number n≥1, an interval I⊆R with nonempty interior, a point t0∈I, an open interval U⊇I−I, a C1 matrix curve g:U→Mn(R) and a continuous curve f:I→Rn.

[F1]

The vector-valued derivative and the oriented Riemann integral are componentwise: (F′)i=(Fi)′ and (∫abϕ)i=∫abϕi, with ∫ab=−∫ba; the integral is additive over subintervals and linear in the integrand (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral, For a<c<b: f is integrable on [a,b] if and only if it is integrable on [a,c] and on [c,b], and then ∫abf=∫acf+∫cbf; with the oriented form for arbitrary a,b,c).

[F2]

For a<b and an integrable ϕ:[a,b]→Rn one has ∥∫abϕ∥2≤∫ab∥ϕ∥2, and for real integrable u≤v one has ∫abu≤∫abv (For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable, If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a)). Consequently, for a continuous ψ on the interval with endpoints a and a+h, h≠0, ∥1h∫aa+hψ∥2≤sup⁡s∥ψ(s)∥2, the supremum over that interval.

[F3]

Leibniz's rule on a compact rectangle: if G,H:[a,b]×[c,d]→R are continuous and for every fixed t∈[c,d] the slice x↦G(x,t) is differentiable on (a,b) with derivative H(x,t), then x↦∫cdG(x,t) dt is differentiable on [a,b] with derivative ∫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). The component maps below satisfy these hypotheses: sums and products of C1 functions are C1 by the chain rule and the algebra of derivatives (The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c), Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0).

[F5]

Differentiability at t means that the difference quotients [F(t+h)−F(t)]/h converge to F′(t) as h→0 through nonzero values (The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set).

Proof

technique · direct; split the difference quotient into a parameter-derivative term and a moving-endpoint term, take the two limits separately, then check continuity of the derivative
1.1F1given

Fix t∈I˚ and choose η>0 with [t−η,t+η]⊆I and [−η,η]⊆U. For 0<∣h∣≤η, additivity and linearity of the integral [F1] give F(t+h)−F(t)=∫t0t[g(t+h−s)−g(t−s)]f(s) ds+∫tt+hg(t+h−s)f(s) ds, with the second integral oriented and taken over the interval with endpoints t and t+h; both integrands are continuous on their compact intervals, since every difference of two points of I lies in I−I⊆U.

2.1step 1.1F1F3F6given

For a component index i<n, put ϕi(u,s):=(g(u−s)f(s))i=∑j<ngij(u−s)fj(s) for (u,s)∈[t−η,t+η]×J, where J is the compact interval with endpoints t0 and t. This is continuous, and for fixed s it is differentiable in u with ∂uϕi(u,s)=∑j<ngij′(u−s)fj(s), which is continuous on the rectangle; [F3] therefore gives lim⁡h→01h∫t0t[g(t+h−s)−g(t−s)]f(s) ds=∫t0tg′(t−s)f(s) ds, for t0<t directly, and for t0>t after reversing the orientation and applying [F3] on [t,t0]; [F1] identifies the components.

2.2step 1.1F1F2F4F6given

For the second term put ψh(s):=g(t+h−s)f(s) on the interval with endpoints t and t+h. Since g(0)f(t) is the value of the constant function g(0)f(t) there, [F1] gives 1h∫tt+hg(t+h−s)f(s) ds−g(0)f(t)=1h∫tt+h[ψh(s)−g(0)f(t)]ds, and [F2] bounds its norm by sup⁡s∥ψh(s)−g(0)f(t)∥2=sup⁡s∥g(t+h−s)f(s)−g(0)f(t)∥2 over the interval with endpoints t and t+h. As h→0 the arguments t+h−s lie between 0 and h (in either order) and tend to 0, and s→t, so continuity of g at 0 and of f at t makes this supremum tend to 0; hence the second term tends to g(0)f(t).

3.1step 1.1step 2.1step 2.2F5

Dividing the identity of step 1.1 by h, the two summands are precisely the terms analysed in steps 2.1 and 2.2; their limits exist and sum to g(0)f(t)+∫t0tg′(t−s)f(s) ds. By [F5] this is exactly the differentiability assertion of clause 1 at t, and t∈I˚ was arbitrary.

4.1step 3.1F1F2F4F6∎

For clause 2 write F′(t)=g(0)f(t)+H(t) by step 3.1, with H(t):=∫t0tg′(t−s)f(s) ds. The term g(0)f(t) is continuous. Fix t1∈I˚, let J0 be the closed interval with endpoints t0,t1, and put Q:=t1−J0=[α,β]⊆I−I⊆U. Since U is an open interval containing the compact interval Q, choose η>0 small enough that [t1−η,t1+η]⊆I and K0:=[α−η,β+η]⊆U. Put J1:=[min⁡(t0,t1−η),max⁡(t0,t1+η)]⊆I. For t∈[t1−η/2,t1+η/2], additivity [F1] gives H(t)−H(t1)=∫t1tg′(t−s)f(s) ds+∫t0t1[g′(t−s)−g′(t1−s)]f(s) ds. In the first integral, s lies between t1 and t, so t−s∈K0; in the second, u:=t1−s∈Q and t−s=u+(t−t1)∈K0. By [F2], the first integral has norm at most ∣t−t1∣sup⁡u∈K0∥g′(u)∥sup⁡s∈J1∥f(s)∥2, which tends to 0. The second has norm at most ∣t1−t0∣sup⁡s∈J0∥f(s)∥2sup⁡u∈Q, ∣δ∣≤∣t−t1∣∥g′(u+δ)−g′(u)∥, which tends to 0 by uniform continuity of the matrix-valued g′ on K0. Hence H is continuous at t1, so F′ is continuous on I˚, proving clause 2.

Depends on

Dependency tree · 2 levels

Sources