Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Initial-data sensitivity of an ODE flow on a common compact tube

Statement

Let a<b, let Ω⊆R×Rd be open, and let f:Ω→Rd be C1. Let K⊆Ω be compact and convex, and let U⊆Rd be open. Assume that for every s∈U the unique IVP solution ϕ(⋅;s) from ϕ(a;s)=s exists on [a,b] and (t,ϕ(t;s))∈K for every t. Then s↦ϕ(t;s) is C1 on U for each t∈[a,b]. Its derivative matrix S(t;s):=Dsϕ(t;s) is the unique solution of

S(t;s)=Id+∫atDyf(r,ϕ(r;s))S(r;s) dr,

and hence satisfies ∂tS=Dyf(t,ϕ(t;s))S, S(a;s)=Id. The claim is local to the stated common compact tube; it does not assert differentiability beyond it.

Facts & Assumptions

Given: a<b, the open state-time domain Ω, the C1 vector field f, compact convex K⊆Ω, open U, and the stated common existence and tube assumptions.

[F1]

Continuously differentiable maps, local inverses, and local diffeomorphisms: C1 means total differentiability at every point and continuity of the derivative entries.

[F2]

A first-order initial value problem is equivalent to its Volterra integral equation: each continuous IVP solution satisfies ϕ(t;s)=s+∫atf(r,ϕ(r;s)) dr.

[F3]

Gronwall's integral inequality with variable and constant coefficients: if u(t)≤A+L∫atu(r)dr for nonnegative continuous u and constants A,L≥0, then u(t)≤AeL(t−a).

[F4]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous map on a compact metric space is uniformly continuous; its proof uses no choice principle.

[F5]

For a≤b and f:[a,b]→Rm integrable when a<b, ∥∫abf∥2≤∫ab∥f∥2; for a<b, ∥f∥2 is integrable: for an integrable vector-valued function on [a,b], ∥∫abg∥2≤∫ab∥g∥2.

[F6]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): the derivative of a composition is the composition of the derivatives.

[F7]

The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a): a vector curve continuous on a closed interval with derivative norm at most M in its interior changes by at most M times the interval length.

[F8]

Picard-Lindelöf local existence and uniqueness for first-order systems: a continuous vector field locally Lipschitz in the state has a unique local IVP solution; any two solutions through the same data agree on their common interval.

[F9]

Every Picard–Lindelöf initial value problem has one maximal solution on an open interval: every Picard-Lindelöf IVP has a unique maximal solution, and every other solution through the data is its restriction.

Proof technique: Uniform continuity of Dyf on the common compact tube controls the difference-quotient remainder; Gronwall controls both the flow difference and its linearized remainder.

Proof

1.1F1F2F3F4F5F7given

Compactness of K and continuity of Dyf give a finite constant L bounding ∥Dyf∥op and a modulus ω(η)→0 such that ∥Dyf(z)−Dyf(w)∥op≤ω(∥z−w∥2) for z,w∈K; this uses [F1] and [F4]. For fixed s∈U and sufficiently small h with s+h∈U, set Δh(t)=ϕ(t;s+h)−ϕ(t;s). The two Volterra equations, convexity of K, and [F7] applied to the line segment between the two state values give ∥f(t,ϕ(t;s+h))−f(t,ϕ(t;s))∥2≤L∥Δh(t)∥2. Applying [F3] to the norm inequality from the integral equations yields sup⁡t∥Δh(t)∥2≤eL(b−a)∥h∥2.

1.2F3F8F9given

For each fixed s, the matrix equation S′=A(t)S, S(a)=Id, with A(t)=Dyf(t,ϕ(t;s)) has a unique solution on [a,b]. View matrices as vectors in Rd2 with the Frobenius norm and extend A continuously by its endpoint values to an open interval containing [a,b]. The extended linear vector field is locally Lipschitz in the matrix state, so the linear IVP has a unique maximal solution by [F8] and [F9]. Gronwall bounds ∥S(t)∥F on every finite subinterval. If its maximal interval ended at a finite time at or before b, then S′=AS would be bounded there, making S(t) Cauchy with a finite limit; local existence from that limit extends the solution, a contradiction. Its integral equation is unique by [F3].

2.1F1F4F6F7step 1.1

Uniform continuity of Dyf on K implies, with z=(t,ϕ(t;s)) and v=Δh(t), that ∥f(t,ϕ(t;s)+v)−f(t,ϕ(t;s))−Dyf(z)v∥2≤ω(∥v∥2)∥v∥2. The line segment remains in K by convexity. For g(θ)=f(t,ϕ(t;s)+θv)−f(t,ϕ(t;s))−θDyf(z)v, the chain rule [F6] gives g′(θ)=[Dyf(z+θ(0,v))−Dyf(z)]v, whose norm is at most ω(∥v∥2)∥v∥2; applying [F7] on [0,1] gives the claimed remainder bound.

3.1F1F2F3F5step 1.1step 1.2step 2.1

Put Eh(t)=Δh(t)−S(t;s)h. Subtract the integral equations for ϕ(t;s+h), ϕ(t;s), and S(t;s)h. The result is Eh(t)=∫atA(r)Eh(r)dr+∫atqh(r)dr, where ∥qh(r)∥2≤ω(eL(b−a)∥h∥2)eL(b−a)∥h∥2 by steps 1.1 and 2.1. Applying [F3] gives sup⁡t∥Eh(t)∥2/∥h∥2≤(b−a)e2L(b−a)ω(eL(b−a)∥h∥2)→0. Thus Dsϕ(t;s)=S(t;s) in the total-derivative definition [F1].

4.1F1F3F4step 1.1step 1.2∎

If sn→s in U, step 1.1 gives uniform convergence ϕ(⋅;sn)→ϕ(⋅;s). Uniform continuity of Dyf on K then gives uniform convergence A(⋅;sn)→A(⋅;s). Subtract the two integral equations for S(⋅;sn) and S(⋅;s); [F3], together with the uniform bound on S obtained from its integral equation, implies sup⁡t∥S(t;sn)−S(t;s)∥F→0; equivalence of matrix norms gives the same convergence in operator norm. The derivative is continuous, so the flow is C1 on U.

Depends on

Used by

Dependency tree · two levels

75 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