Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

A globally Lipschitz neural ODE has a global smooth flow

Statement

Let T>0, let d,q≥1, let Θ⊆Rq be open, let I⊆R be an open interval containing [0,T], and let v:I×Rd×Θ→Rd be jointly C∞. For every compact K⊆Θ, suppose there are constants LK,MK≥0 such that, for all t∈[0,T], θ∈K, and z,w∈Rd,

∥v(t,z,θ)−v(t,w,θ)∥2≤LK∥z−w∥2,∥v(t,0,θ)∥2≤MK.

Then for each θ∈Θ, s,t∈[0,T], and zs∈Rd, the parameterized ODE has a unique solution on all of [0,T]. Write Φt,sθ(zs) for its value at time t. For each fixed s,t, the map (zs,θ)↦Φt,sθ(zs) is locally C∞. For each fixed θ, Φt,sθ:Rd→Rd is a C∞ diffeomorphism with inverse Φs,tθ. Its state Jacobian Jt,s:=DzsΦt,sθ(zs) satisfies

ddtJt,s=Dzv(t,Φt,sθ(zs),θ)Jt,s,Js,s=Id.

Time derivatives at 0 and T are one-sided.

Facts & Assumptions

Given: The finite interval, open parameter domain, jointly smooth field, and compact-parameter-neighborhood Lipschitz and origin bounds in the Statement.

[F1]

A parameterized neural ordinary differential equation: for fixed θ, a trajectory solves z˙(t)=vθ(t,z(t)) with its stated initial value.

[F2]

On a convex open set, a uniform bound ∥Df(z)v∥2≤M∥v∥2 implies ∥f(y)−f(x)∥2≤M∥y−x∥2: on a convex open state set, a uniform bound on the derivative operator norm implies the same Lipschitz bound for the map.

[F3]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space is bounded.

[F5]

Picard-Lindelöf local existence and uniqueness for first-order systems: a continuous field locally Lipschitz in the state has a unique local solution, and solutions through the same data agree on common intervals.

[F6]

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

[F7]

Gronwall's integral inequality with variable and constant coefficients: from u(t)≤a(t)+∫t0tb(s)u(s) ds, nonnegative continuous u,b, and nondecreasing nonnegative a, one obtains u(t)≤a(t)exp⁡(∫t0tb); the theorem also states the time-reflected form.

[F8]

A solution whose graph approaches a compact interior region at a finite endpoint extends past that endpoint: if graph points of a solution approach a finite endpoint inside one compact subset of the open ODE domain, the solution extends past that endpoint; the statement also gives the reflected left-endpoint version.

[F9]

Smooth dependence of ODE solutions on parameters: a jointly smooth field has a common local solution interval and a solution map smooth in initial state and parameters near any base data.

[F10]

The fundamental theorem for nonautonomous smooth ODEs: for a smooth nonautonomous field, the local solution map is smooth in initial time and initial state near each base point.

[F11]

C1 dependence of solutions on initial data: on a common compact local interval, the solution map is C1 in initial state and its derivative solves the variational equation.

[F12]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): D(g∘f)(a)=Dg(f(a))∘Df(a) for totally differentiable Euclidean maps.

Proof

technique · direct

Given: T,d,q,Θ,I,v, and the constants LK,MK from the Statement.

1.1F2F3F4givenconstruct

Fix (t0,z0,θ0)∈I×Rd×Θ. Choose a closed time interval and a closed state ball about (t0,z0) whose product lies in the open domain; it is compact by [F4]. The continuous function (t,z)↦∥Dzv(t,z,θ0)∥ is bounded there by [F3]. For each fixed nearby t, [F2] on the open state ball gives a state-Lipschitz bound, while smoothness gives continuity of the field. Thus the Picard–Lindelöf hypotheses hold locally at every point of the ODE domain.

2.1F4F5F6F7F8givenstep 1.1algebraconstruct

For each fixed θ and initial data, [F5] gives the unique local solution and [F6] gives its unique maximal solution on an open interval. Fix now a nonempty compact K⊆Θ and a bounded ball B of initial states. For every θ∈K, the assumptions imply ∥v(t,z,θ)∥2≤MK+LK∥z∥2 on [0,T]. For a trajectory starting at s in B, its integral equation gives u(τ):=∥z(s+τ)∥2≤sup⁡x∈B∥x∥2+MKτ+LK∫0τu(σ) dσ whenever s+τ∈[0,T]. Apply [F7] with the nondecreasing function a(τ)=sup⁡x∈B∥x∥2+MKτ; time reversal gives the same bound backward. Thus every such maximal trajectory while it lies in [0,T] has norm at most R:=(sup⁡x∈B∥x∥2+MKT)eLKT. If a right endpoint β of its maximal interval belonged to (s,T], the explicitly defined sequence tj=β−(β−s)/(j+1) would increase to β, and each graph point (tj,z(tj)) would lie in the compact cylinder [0,T]×B‾R⊂I×Rd. By [F8] the solution would extend past β, contradicting maximality. The explicit sequence tj=α+(s−α)/(j+1) gives the same contradiction at any left endpoint α∈[0,s). Therefore every maximal solution contains all of [0,T], and uniqueness follows from [F6]. The sequences are specified by their endpoint and use no choice axiom.

3.1F4F9F10givenstep 2.1construct

Fix a base initial state, parameter, and times s,t; choose compact neighborhoods B and K of the state and parameter. Step 2.1 places the trajectories for these data in one closed bounded state ball, so [0,T]×B‾R×K is compact by [F4]. At every point of this cylinder, [F9] and [F10] applied to the smooth augmented field (z,θ)′=(v(t,z,θ),0) give an open neighborhood of initial time, state, and parameter, and a positive time radius on which the local transition map is smooth. A finite subcover exists by [F4], and the minimum of its finitely many time radii is positive. Partition the interval from s to t into finitely many segments shorter than this minimum. Each base trajectory node belongs to a selected chart; continuity lets us shrink the initial state and parameter neighborhoods successively so each perturbed node remains in the next chart. The full transition is therefore a finite composition of smooth local maps on a neighborhood of the base data. Since the base data were arbitrary, (zs,θ)↦Φt,sθ(zs) is locally C∞ for every fixed s,t.

4.1step 2.1step 3.1

By uniqueness from step 2.1, solving from s to t and then from t back to s returns the original initial value; hence Φs,tθ∘Φt,sθ and Φt,sθ∘Φs,tθ are both identity maps. Both maps are smooth by step 3.1, so each Φt,sθ is a global C∞ diffeomorphism with the stated inverse.

5.1F1F10F11F12step 2.1step 3.1∎

Fix s,θ,zs. At every interior time r∈(0,T), smoothness of the field and [F10] give a common local interval for nearby initial states at zr:=Φr,sθ(zs). The hypotheses of [F11] hold there, so A(t):=DyΦt,rθ(zr) satisfies A′(r)=Dzv(r,zr,θ) and A(r)=Id. Uniqueness gives Φt,sθ=Φt,rθ∘Φr,sθ near t=r; differentiating this identity in zs using [F12] yields Jt,s=A(t)Jr,s. Differentiating at t=r therefore gives ddtJt,s=Dzv(r,Φr,sθ(zs),θ)Jr,s. Since r was arbitrary this holds on (0,T); the local transitions at 0,T give the corresponding one-sided derivatives. At t=s, the transition is the identity and so Js,s=Id.

Depends on

Used by

Dependency tree · two levels

80 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