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.
Neural ODEs and continuous normalizing flows
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Discrete continuous and pde adjoint sensitivities
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Global ODE and Log-density Integration Error
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
A parameterized neural ordinary differential equation
Definition
Let , let and be open, and let . For a parameter , write . The parameterized ordinary differential equation on is the initial-value problem
where and . A trajectory on an interval containing is a differentiable function satisfying both displayed conditions. Here is the state-velocity field.
It is a parameterized neural ordinary differential equation, or neural ODE, when is specified by a neural network with input and outputs. Here a network is a fixed finite directed acyclic graph evaluated in an order in which every edge points to a later vertex: input vertices hold the coordinates of , each other vertex applies a fixed scalar activation to an affine combination of earlier vertex values, and the output vertices use the identity activation. The weights and biases are specified functions of and may be shared or fixed. No particular depth, width, or hidden activation is prescribed; affine networks with no hidden vertices are allowed.
The general parameterized ODE remains defined for fields without such a network specification. This definition alone asserts neither solution existence beyond its stated interval nor numerical accuracy.
Definition references
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 .
Instantaneous change of variables along a neural ODE flow
Statement
Assume Countable Choice. Let , let , let be open, let be an open interval containing , and let be jointly . For every compact , assume there are constants such that, for all , , and ,
Fix and let be its flow. Let be a continuous probability density with respect to Lebesgue measure, define for Borel , and define the pushforward measure . For , set
Then is a density of . For every , write and ; the determinant of is positive and
The derivative identity holds for and has one-sided meanings at and .
Statement references
Facts & Assumptions
Given: Countable Choice, the parameterized ODE hypotheses in the Statement, a fixed , and the positive continuous initial probability density .
A parameterized neural ordinary differential equation: for fixed , the state satisfies on its interval.
A globally Lipschitz neural ODE has a global smooth flow: under the stated smoothness, compact-neighborhood global Lipschitz, and origin-bound hypotheses, exists on and each time slice is a smooth diffeomorphism, with identity flow at .
A continuous flow changes log density by minus its divergence: assuming Countable Choice, a common flow of diffeomorphisms and a positive continuous initial probability density, the pushforward density is and its logarithmic derivative along trajectories is minus the state divergence.
The Axiom of Countable Choice (): every countable family of nonempty sets has a choice function; it is assumed only through [F3]'s use of the library change-of-variables theorem.
Proof
Given: The finite-time parameterized ODE, its compact-neighborhood hypotheses, Countable Choice, and as in the Statement.
Fix . By [F1] this is a first-order IVP, and [F2] supplies its flow on all of ; every slice is a diffeomorphism of and is the identity. Hence the flow and initial density satisfy the hypotheses of [F3].
Apply [F3] using the assumed Countable Choice [A1]. It gives that the displayed is a density of the pushforward and that with logarithmic derivative . By the definition of trace as the sum of diagonal entries, this is ; [F3] gives the stated endpoint convention.
Exact continuous adjoint sensitivity for a neural ODE
Definition
Let , let , let be open, and let be jointly on an open time interval containing . For each compact , suppose there are constants such that for all , , and ,
Let be open with compact closure contained in , let be an open neighborhood of , and let be . Write for the exact solution of , , and let be its common compact trajectory tube. Let
be the terminal state-parameter slice. Let and be open sets containing and , respectively, and let and be . Assume their first derivatives, measured in Euclidean operator norms, are bounded and uniformly continuous on and , respectively. Define
For each , the exact continuous adjoint sensitivity procedure is:
- Solve the state initial-value problem forward on .
- Solve the terminal adjoint problem backward,
- Return the vector
Here and denote Jacobian matrices in the displayed variables, , and . All state and adjoint equations and the integral are exact continuous mathematical objects. Replacing them by numerical solver outputs defines a finite computation and is outside this algorithm's accuracy guarantees.
Definition references
4 · Examples, counterexamples and false statements
None yet.
Sources
- Ricky T. Q. Chen, Yulia Rubanova, Jesse Bettencourt, and David Duvenaud, Neural Ordinary Differential Equations
- George Papamakarios, Eric Nalisnick, Danilo Jimenez Rezende, Shakir Mohamed, and Balaji Lakshminarayanan, Normalizing Flows for Probabilistic Modeling and Inference
- Gerald Teschl, Ordinary Differential Equations and Dynamical Systems, Chapter 2, §§2.2–2.5
- Ricky T. Q. Chen, Yulia Rubanova, Jesse Bettencourt, and David Duvenaud, Neural Ordinary Differential Equations, §4 and Appendix A
- George Papamakarios, Eric Nalisnick, Danilo Jimenez Rezende, Shakir Mohamed, and Balaji Lakshminarayanan, Normalizing Flows for Probabilistic Modeling and Inference, §4.1
- Ricky T. Q. Chen, Yulia Rubanova, Jesse Bettencourt, and David Duvenaud, Neural Ordinary Differential Equations, §2 and Appendix B
- George Papamakarios, Eric Nalisnick, Danilo Jimenez Rezende, Shakir Mohamed, and Balaji Lakshminarayanan, Normalizing Flows for Probabilistic Modeling and Inference, §4.2.2