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.

Finite-time linearization error bound: quadratic remainder, exponential growth bound and the variation-of-constants estimate

Statement

Let n≥1, let U⊆Rn be open with 0∈U, let F:U→Rn be continuous and locally Lipschitz in the state variable, and let r>0, C≥0, L≥0 and A∈Mn(R) satisfy B‾(0,r)⊆U (Open ball, closed ball and sphere in a metric space) and

∥F(z)−Az∥2≤C∥z∥22,∥F(z)∥2≤L∥z∥2(∥z∥2≤r), where Az and ∥A∥ use the matrix-action and induced Euclidean operator-norm convention of Variation of constants for z′=Az+b(t) via the matrix exponential.

Let z0∈Rn with δ:=∥z0∥2>0, let T>0 with δeLT<r, and let y:R→Rn be the solution of the linear system y′=Ay, y(0)=z0 (Variation of constants for z′=Az+b(t) via the matrix exponential). Then:

  1. The maximal solution z of z′=F(z), z(0)=z0 is defined on [0,T] and satisfies ∥z(t)∥2≤δeLt for t∈[0,T] (Extensions, maximal solutions, maximal intervals, and global solutions).
  2. For every t∈[0,T], ∥z(t)−y(t)∥2≤Cδ2∫0te∥A∥(t−s)e2Ls ds≤Cδ2 t e(∥A∥+2L)t, where ∥A∥ is the operator norm of A for the Euclidean norm (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Remarks

Facts & Assumptions

Given: The field F and constants A,r,C,L as in the statement, the datum z0 with δ=∥z0∥2>0, the time T>0 with δeLT<r, and the linear solution y(t)=E(t)z0 with E(t) the matrix exponential of A.

[F1]
[F2]

Local existence on a Picard-Lindelof cylinder and the a priori Lipschitz estimate are provided by Continuous and Lipschitz dependence on the initial condition on a Picard-Lindelof cylinder; every initial value problem has a unique maximal solution, and any solution is a restriction of it (Every Picard–Lindelöf initial value problem has one maximal solution on an open interval, Extensions, maximal solutions, maximal intervals, and global solutions). [given]

[F3]

Compact continuation: a solution whose graph stays in a compact subset of U near a finite endpoint extends past that 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). [given]

[F5]

Gronwall: if continuous u≥0 satisfies u(t)≤A0+K∫0tu on [0,T], then u(t)≤A0eKt there (Gronwall's integral inequality with variable and constant coefficients). [given]

[F6]

Matrix exponential data (Variation of constants for z′=Az+b(t) via the matrix exponential, The operator norm as the least bound and as the unit-sphere or unit-ball supremum): E is C1, E′(t)=AE(t)=E(t)A, E(t)E(s)=E(t+s), and ∥E(u)∥≤e∥A∥∣u∣; in particular y(t)=E(t)z0 is the global solution of y′=Ay, y(0)=z0, obtained by taking the globally continuous forcing b≡0.

Proof

technique · direct; bound the maximal solution by Gronwall while it stays in the ball, extend it to $[0,T]$ by compact continuation, and derive the finite-interval comparison identity with an integrating factor
1.1F1F4F5given

Let z be the maximal solution through z0 and let J⊆[0,∞) be that part of its interval on which ∥z(t)∥2≤r; while t∈J, [F4] and the bound ∥F(z(s))∥2≤L∥z(s)∥2 give ∥z(t)∥2≤δ+∫0tL∥z(s)∥2 ds, so [F5] yields ∥z(t)∥2≤δeLt for all t∈J. In particular, if t∈J and t≤T then ∥z(t)∥2≤δeLT<r.

2.1step 1.1F2F3given

The maximal solution is defined on all of [0,T]. Indeed, if its forward interval ended at some τ≤T, then the graph of z on [0,τ) would lie in the compact set [0,T]×B‾(0,r) by step 1.1 applied on J∩[0,τ) — more precisely, should z reach ∥z∥2=r at some first time τ0, step 1.1 would give ∥z(τ0)∥2≤δeLτ0≤δeLT<r at that time, a contradiction; so ∥z(t)∥2<r for all t in the maximal forward interval that are ≤T, and the graph stays in the compact subset [0,T]×B‾(0,r)⊆[0,T]×U. By [F3] the solution extends past every finite endpoint below or at T, so it is defined on [0,T] and step 1.1 gives ∥z(t)∥2≤δeLt there; this is clause 1.

3.1step 2.1F6given

Finite-interval comparison identity: on [0,T] put q:=z−y and b(t):=F(z(t))−Az(t). The curve b is continuous on [0,T], and q′=Aq+b, q(0)=0. Define r(t):=E(−t)q(t). By [F6], the chain rule and product rule, r′(t)=−AE(−t)q(t)+E(−t)(Aq(t)+b(t))=E(−t)b(t), since AE(−t)=E(−t)A. The vector-valued fundamental theorem of calculus, applied on the actual interval [0,T], gives r(t)=∫0tE(−s)b(s) ds; multiplying by E(t) and using [F6]'s group law yields q(t)=∫0tE(t−s)b(s) ds. This derivation uses only the continuous values of b on [0,T]. Consequently, using ∥E(t−s)∥≤e∥A∥(t−s) for 0≤s≤t, the quadratic remainder hypothesis and clause 1, ∥z(t)−y(t)∥2≤∫0te∥A∥(t−s)∥F(z(s))−Az(s)∥2 ds≤Cδ2∫0te∥A∥(t−s)e2Ls ds, for every t∈[0,T].

4.1step 3.1algebra∎

For the final estimate, e∥A∥(t−s)≤e∥A∥t and e2Ls≤e2Lt on 0≤s≤t, so ∫0te∥A∥(t−s)e2Lsds≤t e(∥A∥+2L)t; substituting into step 3.1 gives the displayed product bound. This proves clause 2.

Depends on

Dependency tree · 2 levels

Sources