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 , let , let be open, let be an open interval containing , and let be jointly . For every compact , suppose there are constants such that, for all , , and ,
Then for each , , and , the parameterized ODE has a unique solution on all of . Write for its value at time . For each fixed , the map is locally . For each fixed , is a diffeomorphism with inverse . Its state Jacobian satisfies
Time derivatives at and are one-sided.
Statement references
Facts & Assumptions
Given: The finite interval, open parameter domain, jointly smooth field, and compact-parameter-neighborhood Lipschitz and origin bounds in the Statement.
A parameterized neural ordinary differential equation: for fixed , a trajectory solves with its stated initial value.
On a convex open set, a uniform bound implies : on a convex open state set, a uniform bound on the derivative operator norm implies the same Lipschitz bound for the map.
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.
Heine-Borel in : with the Euclidean metric a subset of 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: a closed bounded subset of a finite-dimensional Euclidean space is compact.
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.
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.
Gronwall's integral inequality with variable and constant coefficients: from , nonnegative continuous , and nondecreasing nonnegative , one obtains ; the theorem also states the time-reflected form.
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.
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.
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.
dependence of solutions on initial data: on a common compact local interval, the solution map is in initial state and its derivative solves the variational equation.
The chain rule for total derivatives: : for totally differentiable Euclidean maps.
Proof
Given: , and the constants from the Statement.
Fix . Choose a closed time interval and a closed state ball about whose product lies in the open domain; it is compact by [F4]. The continuous function is bounded there by [F3]. For each fixed nearby , [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.
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 and a bounded ball of initial states. For every , the assumptions imply on . For a trajectory starting at in , its integral equation gives whenever . Apply [F7] with the nondecreasing function ; time reversal gives the same bound backward. Thus every such maximal trajectory while it lies in has norm at most . If a right endpoint of its maximal interval belonged to , the explicitly defined sequence would increase to , and each graph point would lie in the compact cylinder . By [F8] the solution would extend past , contradicting maximality. The explicit sequence gives the same contradiction at any left endpoint . Therefore every maximal solution contains all of , and uniqueness follows from [F6]. The sequences are specified by their endpoint and use no choice axiom.
Fix a base initial state, parameter, and times ; choose compact neighborhoods and of the state and parameter. Step 2.1 places the trajectories for these data in one closed bounded state ball, so is compact by [F4]. At every point of this cylinder, [F9] and [F10] applied to the smooth augmented field 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 to 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, is locally for every fixed .
By uniqueness from step 2.1, solving from to and then from back to returns the original initial value; hence and are both identity maps. Both maps are smooth by step 3.1, so each is a global diffeomorphism with the stated inverse.
Fix . At every interior time , smoothness of the field and [F10] give a common local interval for nearby initial states at . The hypotheses of [F11] hold there, so satisfies and . Uniqueness gives near ; differentiating this identity in using [F12] yields . Differentiating at therefore gives . Since was arbitrary this holds on ; the local transitions at give the corresponding one-sided derivatives. At , the transition is the identity and so .
Depends on
- A parameterized neural ordinary differential equation
- On a convex open set, a uniform bound $\|Df(z)v\|_2\le M\|v\|_2$ implies $\|f(y)-f(x)\|_2\le M\|y-x\|_2$
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ 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
- 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
- Gronwall's integral inequality with variable and constant coefficients
- A solution whose graph approaches a compact interior region at a finite endpoint extends past that endpoint
- Smooth dependence of ODE solutions on parameters
- The fundamental theorem for nonautonomous smooth ODEs
- $C^1$ dependence of solutions on initial data
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
Used by
- Conditional flow-matching training and exact-flow sampling Algorithm
- Exact continuous adjoint sensitivity for a neural ODE Algorithm
- A finite Euler adjoint gradient can differ from the exact flow gradient Example
- Conditional flow-matching batch gradients and exact-flow output law Lemma
- Instantaneous change of variables along a neural ODE flow Theorem
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
- Gerald Teschl, Ordinary Differential Equations and Dynamical Systems, Chapter 2, §§2.2–2.5 (standard reference, not scraped)