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.
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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
32 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
- Ricky T. Q. Chen, Yulia Rubanova, Jesse Bettencourt, and David Duvenaud, Neural Ordinary Differential Equations, §4 and Appendix A (standard reference, not scraped)
- George Papamakarios, Eric Nalisnick, Danilo Jimenez Rezende, Shakir Mohamed, and Balaji Lakshminarayanan, Normalizing Flows for Probabilistic Modeling and Inference, §4.1 (standard reference, not scraped)