Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Finite-time comparison of bounded vector fields

Statement

Let n≥1, T≥0, U⊆Rn be open, and K⊆U be compact and convex. Let Fϵ,F0:[0,T]×U→Rn be continuous. Suppose that on [0,T]×K both fields are bounded in the Euclidean norm by B≥0, and that there is L≥0 such that

∥F0(t,z)−F0(t,w)∥2≤L∥z−w∥2(t∈[0,T], z,w∈K).

Also suppose

∥Fϵ(t,z)−F0(t,z)∥2≤η(t∈[0,T], z∈K)

for some η≥0. Let zϵ,z0∈C1([0,T],Rn) solve z˙ϵ=Fϵ(t,zϵ) and z˙0=F0(t,z0), with both trajectories contained in K. Then, for every t∈[0,T],

∥zϵ(t)−z0(t)∥2≤(∥zϵ(0)−z0(0)∥2+ηt)eLt.

In particular, equal initial states give sup⁡0≤t≤T∥zϵ(t)−z0(t)∥2≤ηTeLT. The field bound B alone is not a stability hypothesis; the comparison-field Lipschitz bound L and uniform field error η are part of the assumptions. No existence through T follows unless the trajectories are known to exist there.

Facts & Assumptions

Given: The interval, open state domain, compact convex set, bounded continuous fields, the comparison-field state-Lipschitz constant, uniform field-error bound, and the two existing C1 solution curves in the Statement.

[L1]

On a nondegenerate compact interval [a,b] with a<b, a differentiable vector-valued curve with integrable derivative has derivative integral equal to the endpoint difference (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz).

[L2]

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

[L3]

If u,a,b are continuous on [0,T], u,b≥0, u(t)≤a(t)+∫0tb(s)u(s) ds, and a is nondecreasing, then u(t)≤a(t)exp⁡(∫0tb(s) ds) (Gronwall's integral inequality with variable and constant coefficients).

Proof

technique · subtract the integral equations and apply Gronwall's inequality
1.1givenL1L2L4algebra

Write d(t):=∥zϵ(t)−z0(t)∥2. At t=0 the claimed estimate is equality; if T=0, this proves the result. Assume T>0 and fix 0<t≤T. By [L4] each solution derivative is vector-integrable on the nondegenerate interval [0,t], so [L1] applies there. Subtracting the resulting integral equations, adding and subtracting F0(s,zϵ(s)), and applying [L2] gives d(t)≤d(0)+∫0t(∥Fϵ(s,zϵ(s))−F0(s,zϵ(s))∥2+∥F0(s,zϵ(s))−F0(s,z0(s))∥2) ds≤d(0)+ηt+L∫0td(s) ds, because both states lie in K, the uniform field-error bound controls the first integrand term by η, and the Lipschitz bound for F0 controls the second by Ld(s). At t=0 this integral inequality also holds as equality, since the zero-length integral is zero by The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral componentwise. Thus it holds on all of [0,T].

2.1step 1.1L3algebra∎

Set a(t)=d(0)+ηt and b(t)=L on [0,T]. These functions are continuous, a is nondecreasing, and b,d≥0, so [L3] yields d(t)≤(d(0)+ηt)eLt for every t. If d(0)=0, then ηt≤ηT and eLt≤eLT on [0,T], which gives the stated supremum estimate.

Remarks

The trajectories are assumed to exist on the common finite interval and remain in the stated set. Local existence and continuation are separate obligations; compact containment cannot be replaced by pointwise boundedness of the vector field on a larger, unspecified domain.

Depends on

Dependency tree · 2 levels

Sources