Alphabeta Math
Pipeline-generated
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.

✓ 2 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Neural ODEs and continuous normalizing flows

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

A parameterized neural ordinary differential equation

Definition

Let d,q≥1, let I⊆R and Θ⊆Rq be open, and let v:I×Rd×Θ→Rd. For a parameter θ∈Θ, write vθ(t,z):=v(t,z,θ). The parameterized ordinary differential equation on I is the initial-value problem

z˙(t)=vθ(t,z(t)),z(s)=zs,

where s∈I and zs∈Rd. A trajectory on an interval J⊆I containing s is a differentiable function z:J→Rd satisfying both displayed conditions. Here vθ is the state-velocity field.

It is a parameterized neural ordinary differential equation, or neural ODE, when vθ(t,z) is specified by a neural network with input (t,z) and d 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 (t,z), 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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Instantaneous change of variables along a neural ODE flow

Statement

Assume Countable Choice. 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⊆Θ, assume 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.

Fix θ∈Θ and let Φt:=Φt,0θ:Rd→Rd be its flow. Let p0:Rd→(0,∞) be a continuous probability density with respect to Lebesgue measure, define μ0(E):=∫Ep0(z) dz for Borel E, and define the pushforward measure μt(E):=μ0(Φt−1(E)). For y∈Rd, set

pt(y):=p0(Φt−1(y))∣det⁡DΦt(Φt−1(y))∣.

Then pt is a density of μt. For every z0∈Rd, write zt:=Φt(z0) and Jt:=DΦt(z0); the determinant of Jt is positive and

pt(Φt(z0))=p0(z0)det⁡Jt>0,ddtlog⁡pt(zt)=−tr⁡(Dzv(t,zt,θ))=−∑i=1d∂zivi(t,zt,θ),

The derivative identity holds for 0<t<T and has one-sided meanings at 0 and T.

Facts & Assumptions

Given: Countable Choice, the parameterized ODE hypotheses in the Statement, a fixed θ∈Θ, and the positive continuous initial probability density p0.

[F1]

A parameterized neural ordinary differential equation: for fixed θ, the state satisfies z˙=vθ(t,z) on its interval.

[F2]

A globally Lipschitz neural ODE has a global smooth flow: under the stated smoothness, compact-neighborhood global Lipschitz, and origin-bound hypotheses, Φt,sθ exists on [0,T] and each time slice is a smooth diffeomorphism, with identity flow at t=s.

[F3]

A continuous flow changes log density by minus its divergence: assuming Countable Choice, a common C1 flow of C1 diffeomorphisms and a positive continuous initial probability density, the pushforward density is pt(Φt(x))=p0(x)/det⁡DΦt(x)>0 and its logarithmic derivative along trajectories is minus the state divergence.

[A1]

The Axiom of Countable Choice (ACω): 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

technique · direct

Given: The finite-time parameterized ODE, its compact-neighborhood hypotheses, Countable Choice, and p0 as in the Statement.

1.1givenF1F2F3

Fix θ. By [F1] this is a first-order IVP, and [F2] supplies its flow Φt on all of [0,T]; every slice is a C1 diffeomorphism of Rd and Φ0 is the identity. Hence the flow and initial density satisfy the hypotheses of [F3].

2.1A1F3step 1.1algebra∎

Apply [F3] using the assumed Countable Choice [A1]. It gives that the displayed pt is a density of the pushforward and that pt(Φt(z0))=p0(z0)/det⁡Jt>0 with logarithmic derivative −tr⁡(Dzv(t,zt,θ)). By the definition of trace as the sum of diagonal entries, this is −∑i=1d∂zivi(t,zt,θ); [F3] gives the stated endpoint convention.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Exact continuous adjoint sensitivity for a neural ODE

Definition

Let T>0, let d,q≥1, let Θ⊆Rq be open, and let v:I×Rd×Θ→Rd be jointly C∞ on an open time interval I containing [0,T]. For each 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.

Let Ω⊆Θ be open with compact closure contained in Θ, let U0⊆Θ be an open neighborhood of Ω‾, and let u0:U0→Rd be C1. Write uθ for the exact solution of u˙θ(t)=v(t,uθ(t),θ), uθ(0)=u0(θ), and let T:={(t,uθ(t),θ):t∈[0,T],θ∈Ω‾} be its common compact trajectory tube. Let

TT:={(uθ(T),θ):θ∈Ω‾}

be the terminal state-parameter slice. Let Uϕ⊆Rd×Θ and Uℓ⊆I×Rd×Θ be open sets containing TT and T, respectively, and let ϕ:Uϕ→R and ℓ:Uℓ→R be C1. Assume their first derivatives, measured in Euclidean operator norms, are bounded and uniformly continuous on TT and T, respectively. Define

J(θ)=ϕ(uθ(T),θ)+∫0Tℓ(t,uθ(t),θ) dt.

For each θ∈Ω, the exact continuous adjoint sensitivity procedure is:

  1. Solve the state initial-value problem forward on [0,T].
  2. Solve the terminal adjoint problem backward, −p′(t)=Duv(t,uθ(t),θ)Tp(t)+Duℓ(t,uθ(t),θ)T,p(T)=Duϕ(uθ(T),θ)T.
  3. Return the vector G(θ)=Dθϕ(uθ(T),θ)T+Dθu0(θ)Tp(0)+∫0T(Dθℓ(t,uθ(t),θ)T+Dθv(t,uθ(t),θ)Tp(t))dt.

Here Du and Dθ denote Jacobian matrices in the displayed variables, p(t)∈Rd, and G(θ)∈Rq. 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.

4 · Examples, counterexamples and false statements

None yet.

Sources