Alphabeta Math
TheoremStatement: 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.

C¹ dependence of an autonomous flow on the initial condition, and the variational equation

Statement

Let n≥1, let U⊆Rn be open, let F:U→Rn be of class C1 (Ck Euclidean maps and diffeomorphisms), let a0∈U, and let T>0, R>0 with B‾(a0,R)⊆U (Open ball, closed ball and sphere in a metric space). Put M:=sup⁡B‾(a0,R)∥F∥2 and L:=sup⁡B‾(a0,R)∥DF∥, where DF(x) is the total derivative of F at x with its operator norm (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The operator norm as the least bound and as the unit-sphere or unit-ball supremum); both are finite. Let 0<ρ<R−MT, so that in particular MT<R. Let Φ be the local flow of x′=F(x) (The local flow of an autonomous first-order system).

Then:

  1. For every a∈B‾(a0,ρ) the maximal solution x( ⋅ ;a) is defined on [0,T] and satisfies ∥x(t;a)−a0∥2≤ρ+Mt<R for t∈[0,T]; moreover

∥x(t;a)−x(t;b)∥2≤eLt∥a−b∥2(a,b∈B‾(a0,ρ), t∈[0,T]),

and (t,a)↦x(t;a) is continuous on the compact set [0,T]×B‾(a0,ρ).

  1. For every a∈B(a0,ρ) the variational equation along x( ⋅ ;a),

Y′(t)=DF(x(t;a))Y(t),Y(0)=In,

has a unique solution Ya:[0,T]→Mn(R) (The variational equation along an ODE solution), and for every t∈[0,T] the map a↦x(t;a) is differentiable on the open ball B(a0,ρ), with

Dax(t;a)h=Ya(t)h(h∈Rn).

  1. The map (t,a)↦Ya(t) is continuous on [0,T]×B(a0,ρ), and consequently (t,a)↦x(t;a) is C1 there with

∂tx(t;a)=F(x(t;a)),Dax(t;a)=Ya(t).

Facts & Assumptions

Given: The open set U, the C1 field F, the point a0∈U, the numbers T,R>0 with B‾(a0,R)⊆U, the finite constants M,L, and 0<ρ<R−MT.

[F10]

Matrix and norm convention (The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations, Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum): a matrix A∈Mn(R) acts on Euclidean Rn by (Av)i=∑j<nAijvj, and every matrix norm in this item is the subordinate Euclidean norm ∥A∥op:=sup⁡∥v∥2≤1∥Av∥2; the undecorated ∥DF∥ in the Statement means this norm. Rowwise Cauchy-Schwarz gives ∥Av∥2≤(∑i,j<nAij2)1/2∥v∥2, so the linear map is bounded and its operator norm is finite. Rescaling gives ∥Av∥2≤∥A∥op∥v∥2; the triangle inequality on vectors gives the triangle inequality on these operator norms. Matrix multiplication represents composition, hence ∥AB∥op≤∥A∥op∥B∥op, and ∥In∥op=1 since n≥1. Moreover ∣∥A∥op−∥B∥op∣≤∥A−B∥op≤(∑i,j<n(Aij−Bij)2)1/2, so entrywise continuity implies continuity in this norm. For a continuous matrix curve C on [r,s], its integral is entrywise; applying the vector integral estimate to C(t)v for each ∥v∥2≤1 and taking the supremum gives ∥∫rsC(t) dt∥op≤∫rs∥C(t)∥op dt when r≤s (The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral, For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable).

[F1]

F is continuous (differentiability implies continuity) and locally Lipschitz in the state variable: on the compact convex cylinder [0,T]×B‾(a0,R) the derivative bound L gives ∥F(x)−F(y)∥2≤L∥x−y∥2, since F is C1 and the segment between two points of the ball lies in the ball; and ∥F∥≤M there. The same segment argument on a closed ball contained in U about any point proves the local Lipschitz hypothesis throughout U. Also B‾(a0,R) is compact, and [F10] makes ∥DF∥op continuous, so both suprema are attained and finite (Local Lipschitz continuity in the state variable, locally uniform in time and parameters, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).

[F2]

Picard-Lindelöf and maximal solutions: local solutions exist uniquely through every initial point, and every initial value problem has a unique maximal solution, of which every other solution through the same data is a restriction (Picard-Lindelöf local existence and uniqueness for first-order systems, Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, Extensions, maximal solutions, maximal intervals, and global solutions, The local flow of an autonomous first-order system).

[F3]

Compact continuation: a solution of x′=F(x) whose graph approaches a compact subset of R×U at a finite endpoint extends past that endpoint; in the autonomous case it suffices that the solution values stay in a compact subset of U near the endpoint (Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it).

[F5]

Norm and integral estimates: ∥∫rsg∥2≤∣∫rs∥g∥2∣, and if ∥g∥2≤c on an interval then the norm of the integral is at most c times the length; the Euclidean norm satisfies the triangle inequality, and for u≠0 the supremum sup⁡∥v∥2=1∣⟨u,v⟩2∣ equals ∥u∥2 (the value v=u/∥u∥2 gives ∥u∥2, and Cauchy-Schwarz bounds every value by ∥u∥2) (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), Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F6]

Gronwall: if continuous u:[0,T]→R, u≥0, satisfies u(t)≤a(t)+∫0tLu with L≥0 and nondecreasing continuous a≥0, then u(t)≤a(t)eLt; with a constant A this reads u(t)≤AeLt (Gronwall's integral inequality with variable and constant coefficients).

[F7]

F is C1, so for x,y with the segment [x,y]⊆U one has F(y)−F(x)=∫01DF(x+τ(y−x))(y−x) dτ, by the chain rule for τ↦F(x+τ(y−x)) and the fundamental theorem; on the compact ball this gives the uniform remainder bound ∥F(y)−F(x)−DF(x)(y−x)∥2≤ω(∥y−x∥2)∥y−x∥2, where ω(s):=sup⁡{∥DF(u)−DF(w)∥:u,w∈B‾(a0,R),∥u−w∥2≤s} and ω(s)→0 as s↓0 by [F10] and Heine-Cantor uniform continuity of DF on the compact ball (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a), For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).

[F8]

The linear matrix initial value problem Y′=C(t)Y, Y(0)=In, with C:[0,T]→Mn(R) continuous, has a unique solution on all of [0,T] (Linear matrix ODEs have unique global solutions on a fixed interval).

[F9]

If the partial derivatives of a map exist on a neighbourhood of a point and are continuous there, the map is totally differentiable at that point (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

technique · direct; first trap the solutions in a compact ball and extend them by continuation, then estimate differences with Gronwall, then compare solutions with the variational equation
1.1givenF1F2F4F5choosealgebra

Fix a∈B‾(a0,ρ) and let x=x( ⋅ ;a):[0,β)→U be the maximal forward solution, with β≤∞. Choose a fixed radius r with ρ+MT<r<R. The curve cannot reach the sphere of radius r about a0 at a time t∗<β with t∗≤T: at the first such time it has stayed in B‾(a0,r)⊆B‾(a0,R), so [F4] and [F5] give ∥x(t∗)−a0∥2≤ρ+Mt∗≤ρ+MT<r, a contradiction. Thus for every 0≤t<β with t≤T the whole curve on [0,t] stays in this fixed ball, and the same integral estimate gives ∥x(t)−a0∥2≤ρ+Mt<R.

2.1step 1.1F3

Consequently, if β≤T the graph of x stays in the compact set [0,T]×B‾(a0,ρ+MT)⊆R×U; by [F3] x extends past β, contradicting maximality of the maximal solution (Extensions, maximal solutions, maximal intervals, and global solutions). Hence β>T, so x( ⋅ ;a) is defined on [0,T], and step 1.1 gives ∥x(t;a)−a0∥2≤ρ+Mt≤ρ+MT<R there.

3.1step 1.12.1F1F4F5F6algebra

For a,b∈B‾(a0,ρ) put e(t):=x(t;a)−x(t;b). By [F4] and [F5], ∥e(t)∥2≤∥a−b∥2+L∫0t∥e(r)∥2 dr for t∈[0,T], because both graphs lie in B‾(a0,R) by step 2.1 and ∥F(x)−F(y)∥≤L∥x−y∥ there. By [F6] with A=∥a−b∥2, ∥e(t)∥2≤eLt∥a−b∥2. Adding the uniform bound ∥x(t;a)−x(s;a)∥2≤M∣t−s∣ obtained from [F4] and [F5] gives continuity of (t,a)↦x(t;a) on [0,T]×B‾(a0,ρ). This is clause 1.

4.1step 3.1F7F8algebra

Fix a∈B(a0,ρ) and let Ya be the unique solution of the variational equation on [0,T], which exists by [F8] since t↦DF(x(t;a)) is continuous (composition of the continuous map DF with the continuous curve x( ⋅ ;a)). For h∈Rn with a+h∈B‾(a0,ρ) put eh:=x( ⋅ ;a+h)−x( ⋅ ;a) and Rh(t):=F(x(t;a+h))−F(x(t;a))−DF(x(t;a))eh(t). By [F7] applied to the pair (x(t;a+h),x(t;a)), whose segment lies in B‾(a0,R) by convexity, ∥Rh(t)∥2≤ω(∥eh(t)∥2)∥eh(t)∥2, and by step 3.1 ∥eh(t)∥2≤eLT∥h∥2.

4.2step 3.1F4F5F6F7F10algebra

The map (t,a)↦Ya(t) is continuous on [0,T]×B(a0,ρ). First, ∥Ya(t)∥op≤eLt≤eLT by the entrywise Volterra equation, the matrix integral and product estimates of [F10], ∥In∥op=1 and [F6]. Second, for a,b the difference Δ:=Ya−Yb satisfies Δ′=DF(x(t;a))Δ+(DF(x(t;a))−DF(x(t;b)))Yb with Δ(0)=0, so [F4], [F5], [F6] and [F10] with ∥Yb∥op≤eLT give ∥Δ(t)∥op≤eLT⋅T⋅sup⁡r∈[0,T]∥DF(x(r;a))−DF(x(r;b))∥op⋅eLT, which tends to 0 as b→a because x(r;b)→x(r;a) uniformly in r by step 3.1 and ∥DF(u)−DF(w)∥≤ω(∥u−w∥2) with ω(s)→0. Finally, ∥Ya(t)−Ya(s)∥op≤LeLT∣t−s∣ by Ya(t)−Ya(s)=∫stDF(x(r;a))Ya(r) dr and [F10]. Combining these three estimates proves continuity.

5.1step 4.1F4F5F6F7algebra

Define δh(t):=eh(t)−Ya(t)h. Differentiating and using the definitions of eh, Rh and Ya gives δh′(t)=DF(x(t;a))δh(t)+Rh(t) with δh(0)=0; hence, by [F4] applied to the curve δh and [F5], ∥δh(t)∥2≤∫0t∥Rh(r)∥2 dr+L∫0t∥δh(r)∥2 dr. Since r↦∫0r∥Rh∥2 is nondecreasing, [F6] gives ∥δh(t)∥2≤eLt∫0t∥Rh(r)∥2 dr≤e2LTT ω(eLT∥h∥2) ∥h∥2 for ∥h∥2≤e−LT; dividing by ∥h∥2 and letting h→0 yields ∥x(t;a+h)−x(t;a)−Ya(t)h∥2/∥h∥2→0 uniformly in t∈[0,T]. Hence a↦x(t;a) is differentiable on B(a0,ρ) with Dax(t;a)h=Ya(t)h for every t. This is clause 2.

6.1step 1.13.14.25.1F2F8F9choose∎

Choose ϵ>0 so small that ρ+M(T+ϵ)<R (if M=0, any sufficiently small positive ϵ works). Steps 1.1-5.1, which did not use [F9], apply with T+ϵ in place of T and show that the positive-time flow has continuous state derivative on [0,T+ϵ]×B(a0,ρ). Apply those same steps to the C1 field −F for time length ϵ, with the same ball and bounds M,L. Its solution Ψ(s,a) gives Φ(t,a)=Ψ(−t,a) for −ϵ≤t≤0: time reversal solves the original equation and agrees with its maximal solution by [F2]. Hence the state derivative exists and is continuous also on this negative-time slab; at t=0 both state derivatives are In, and their joint continuity on the two slabs makes the state derivative continuous across 0. The time derivative exists throughout the open set (−ϵ,T+ϵ)×B(a0,ρ) and equals F(Φ(t,a)), including at 0 because the maximal solution solves the equation on its open interval. Joint continuity follows from step 3.1 on each slab and their common value Φ(0,a)=a. Thus all partial derivatives are continuous on this open set, and [F9] makes the flow C1 there. Its restriction proves clause 3 on [0,T]×B(a0,ρ), with DaΦ(t,a)=Ya(t) by step 5.1; the variational solution on the longer interval restricts to Ya by uniqueness [F8].

Remarks

  • The hypothesis ρ+MT<R is a genuine trapping condition: it keeps the whole graph of every considered solution in a compact subset of the domain, which is what lets Compact continuation for locally Lipschitz ODEs: a solution whose graph stays in a compact subset of the domain near a finite endpoint extends past it extend the maximal solution to the full interval [0,T]. The conclusion is local in the initial condition and in time, and no claim is made that Dax(t;a) is defined at the boundary of the ball or for t outside [0,T].

  • The proof actually shows more than stated: ∥x(t;a+h)−x(t;a)−Ya(t)h∥2≤e2LTTω(eLT∥h∥2)∥h∥2, an explicit first-order error bound. The nonautonomous analogue (with F=F(t,x) and the variational equation along a solution on a compact interval) is the same computation with the time variable kept, and is not needed in this batch.

Depends on

Dependency tree · 2 levels

Sources