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.
Conditional flow matching and transport paths
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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 effects and longitudinal models
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Neural ODEs and continuous normalizing flows
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
Probability paths and velocity fields
Definition
Fix an integer , a sigma-finite measure on the Borel subsets of , and a Borel probability measure on . Here sigma-finite means that there are Borel sets with and for each . A conditional probability-density path with endpoint law is a function measurable for on time, state, and endpoint variables such that, for every , for -almost every endpoint . Its mixture function is For a vector field measurable for the same product sigma-algebra, call it a conditional velocity field for when, for -almost every , and every component of are continuously differentiable in on , the functions and are locally integrable there with respect to , and for every continuously differentiable real function with compact support in . Here denotes the supplied Lebesgue measure on time, and local integrability means absolute integrability on every compact subset. This is the conditional continuity equation for the measures . In the Lebesgue-reference case , its classical form under the stated differentiability is on . This unweighted divergence formula is not the convention for a general reference measure. Only the interior-time equation is imposed; no endpoint continuity or existence or uniqueness of an ODE flow is asserted. At any where and the numerator is a finite componentwise Lebesgue integral, the marginal velocity field is This definition assigns no value to the quotient where or , or where the numerator is not finite.
A conditional mixture is a probability path
Statement
Let , , and satisfy the conditional probability-density path definition, and for each set . Then is a nonnegative measurable function and for every ; hence it is a probability density with respect to .
Statement references
Facts & Assumptions
Given: A sigma-finite Borel measure , a Borel probability measure , and a conditional density normalized for -almost every endpoint.
Probability paths and velocity fields: is product-measurable, nonnegative, and has -integral for -almost every ; is its -mixture.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for a nonnegative product-measurable function on two sigma-finite measure spaces, the section integrals are measurable and either iterated integral equals the product integral.
Proof
Given: The hypotheses in the Statement.
Fix . The measures and are sigma-finite, and is nonnegative and product-measurable by [F1]. Tonelli's theorem [F2] therefore makes measurable and gives
The inner integral in step 1.1 equals for -almost every by [F1]. Since is a probability measure, the right-hand side is . The mixture is nonnegative by [F1], so is a probability density with respect to .
Source notes
The normalization is proved locally by Tonelli; the source citations document the conditional-to-marginal mixture convention.
Conditional continuity equations pass to the marginal path
Statement
Let , , and be as in the conditional probability-path definition, and let be a jointly measurable vector field. Suppose that for -almost every , and each component of are continuously differentiable in and satisfy the classical coordinate equation on . This is an explicit algebraic hypothesis; for general it is not the definition of measure transport. Suppose also that for every compact there is a nonnegative which, for -almost every , bounds on the absolute values of , , each component of , and each derivative . If on , define Then and each indicated flux derivative exist and are continuous locally in , and the marginal continuity equation holds on . The domination hypothesis is a sufficient Leibniz condition for the time and spatial derivatives to pass through the integral.
Statement references
Facts & Assumptions
Given: The conditional path and field, the conditional continuity equation, local C1 regularity, local integrable domination in the endpoint variable, and positivity of the mixture density as stated.
Probability paths and velocity fields: . The classical coordinate equation and the local regularity used here are separate hypotheses in the Statement.
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a real function is continuous on a closed interval and differentiable in its interior, some interior derivative equals its endpoint difference quotient.
Dominated convergence: pointwise convergence under one integrable majorant permits passage of a sequence of integrals to the limit.
The Lebesgue integral is linear on : the integral is linear for integrable scalar components.
Proof
Given: The hypotheses in the Statement.
Fix a compact neighborhood of an interior point . The bounds on and make and finite, so positivity makes the quotient well-defined. For any sequence of nonzero increments small enough that the time segment from to stays in , the mean value theorem [F2] bounds the difference quotient of by . The quotient converges for -almost every to . Dominated convergence [F3] therefore gives The same argument for each flux component on its spatial coordinate segment gives The local continuity of these derivatives follows from their pointwise continuity in and the same integrable majorant.
Integrate the conditional continuity equation over . All terms are integrable by , so linearity [F4] and the identities of step 1.1 yield By definition wherever , proving the marginal continuity equation.
Source notes
The source proofs explicitly require differentiation under the endpoint integral. This item states local integrable domination for every derivative it exchanges and derives those exchanges from the mean value theorem and dominated convergence.
An affine conditional path has the stated velocity field
Statement
Let , fix , and let and be continuously differentiable on , with one-sided derivatives at the endpoints. For , define the affine map For each , this map is a diffeomorphism with inverse . The unique vector field satisfying for every is
Statement references
Facts & Assumptions
Given: , , and the continuously differentiable functions and in the Statement.
The Euclidean inner product on : vectors in have coordinatewise addition and scalar multiplication.
Proof
Given: The hypotheses in the Statement.
Fix . Since , solving gives the unique inverse . Both the map and inverse are continuously differentiable in , so is a diffeomorphism.
For fixed , differentiation gives . Substitute the inverse expression from step 1.1 to obtain Thus the displayed satisfies the flow equation.
If another field satisfies the same equation for every , then for any choose the explicit inverse value . The flow equation forces , proving uniqueness.
Source notes
The proof is the explicit affine inversion and differentiation argument. The cited paper and two independent treatments were inspected for the same formula and schedule convention.
A centered law and its affine dilation have an optimal affine coupling
Statement
Let be a Borel probability measure on with finite second moment, mean , and . Fix and , define , and let be the law of when has law . For every Borel probability measure on whose coordinate marginals are and , The law of under attains equality. Thus is an optimal transport map for the squared Euclidean cost between and its translated dilation .
Statement references
Facts & Assumptions
Given: The Borel probability measure , its zero mean and finite second moment , the affine map , and a coupling with the stated marginals.
Probability measures and probability spaces: and are countably additive probability measures on their stated Borel spaces.
Law or distribution of a random element: the law of a Borel map under assigns to each Borel set the value .
Change of variables for expectation: integrating a nonnegative or integrable function against the law of a random element equals integrating its composition against the original probability measure.
The law of a random element is a probability measure: the law of a measurable random element is a Borel probability measure.
A continuous map has Borel preimages of Borel sets: a continuous map between Euclidean spaces has Borel preimages of Borel sets.
The Lebesgue integral is linear on : the integral is linear for integrable scalar components.
The Euclidean inner product on : on , with the coordinatewise Euclidean inner product.
Cauchy-Schwarz for random variables: for square-integrable real random variables , .
Expectation of a nonnegative or integrable random variable: expectation on a probability space is integration against its probability measure.
Proof
Given: The hypotheses in the Statement.
The affine maps and are continuous, so their Borel preimages are Borel by [F5]; their laws are probability measures by [F2, F4]. Let have joint law . The first marginal gives and . The second marginal is the law of under , so change of variables [F3] and linearity [F6] give and . These second moments make all displayed costs finite; Cauchy–Schwarz [F8, F9] makes the cross term integrable.
Expand . The expectation of the cross term with vanishes because , so By [F8], pointwise . Applying [F9] to the two scalar norms gives . Substitution proves the lower bound.
The law of for is a coupling with marginals and by [F2, F4, F5]. Under this coupling , so . The expansion in step 2.1 therefore gives cost , attaining the lower bound.
Source notes
The cited flow-matching paper states the Gaussian special case. The local proof above establishes the more general centered finite-second-moment dilation case directly by Cauchy–Schwarz and does not import Brenier's theorem.
Conditional and marginal flow-matching objectives differ by a constant
Statement
Let , let be a sigma-finite measure on the Borel subsets of , let be a Borel probability measure on , and let be a conditional probability-density path relative to and a jointly measurable vector field. Set Assume and is finite on , and define . Suppose that for -almost every , and each component of are continuously differentiable in and satisfy on . This classical coordinate equation is a separate algebraic hypothesis, not a measure-transport convention for general . Suppose also that for every compact there is a nonnegative that bounds on , for -almost every , the absolute values of , , each component of , and each corresponding spatial flux derivative.
Let be open, and let be jointly measurable and continuously differentiable in , with jointly measurable parameter derivative. Define and Assume and are finite for every , and define and assume . For every compact and coordinate , suppose there are nonnegative integrable majorants on and on such that for every , outside fixed null sets, and Then both objectives are finite and continuously differentiable on , and . In particular, is independent of and . Under the stated classical coordinate PDE and local domination, also satisfies on . Uniform boundedness of on compact parameter neighborhoods is a sufficient special case of the integrability and derivative-majorant assumptions above.
Statement references
Facts & Assumptions
Given: The sigma-finite Borel measure , endpoint probability measure , conditional probability path , finite positive marginal density and finite flux, local endpoint domination, open parameter domain , parameter-regular vector field , finite loss and variance integrals, and the integrable derivative majorants in the Statement.
Probability paths and velocity fields supplies the normalized measurable density path and its mixture . The classical coordinate PDE and C1 density/flux regularity are separate Statement hypotheses.
A conditional mixture is a probability path: integrating a conditional density normalized for -almost every endpoint gives a measurable mixture density of -integral one at each time.
Conditional continuity equations pass to the marginal path: the stated local bounds permit the conditional time and flux derivatives to pass through the endpoint integral and imply .
The Euclidean inner product on : and the Euclidean inner product is bilinear.
Fubini's theorem for L^1 functions on a sigma-finite product: an function on a product of sigma-finite measure spaces may be integrated in either order, with equality of the iterated integrals.
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : a differentiable real function on an interval has each difference quotient equal to a derivative at an intermediate point.
Dominated convergence: pointwise convergence under one integrable majorant permits passage of the limit through the integral.
The Lebesgue integral is linear on : the integral is linear on .
Cauchy-Schwarz for random variables: square-integrable scalar functions on a probability space satisfy .
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for a nonnegative product-measurable function on sigma-finite spaces, its section integrals are measurable and either iterated integral equals the product integral.
Proof
Given: The hypotheses in the Statement.
By [F1] and the mixture normalization result [F2], each is a probability density with respect to . Positivity makes well-defined on the open time interval. The hypotheses on are exactly the local domination assumptions of [F3], so the explicitly assumed classical coordinate equation passes to the marginal and .
Let be the measure on time, state, and endpoint variables with density relative to . Product measurability from [F1], conditional normalization, and Tonelli [F14] show that has total mass one and that its time-state marginal has density relative to . In particular, Tonelli gives , so the finite marginal loss makes square-integrable under . The same identity gives , so is square-integrable under . By Euclidean Cauchy–Schwarz [F9] and random-variable Cauchy–Schwarz [F10], their inner-product term is integrable. At every where the integrals are defined, the definition of and gives Expanding by bilinearity [F4], integrating first over , and using Fubini [F5] for the integrable cross term gives The last integral is independent of and is the finite constant defined in the Statement.
Fix and choose a compact parameter ball whose interior contains . For any , fix to be either or and put . For sufficiently small nonzero with , bilinearity and symmetry [F4] give Dividing by and taking the limit, differentiability of yields The functions and dominate the weighted derivatives on . For a sequence of nonzero increments tending to zero in coordinate , the mean value theorem [F6] bounds the weighted difference quotients by the same majorants; the pointwise quotients converge to the displayed derivatives. Dominated convergence [F7] therefore differentiates both objectives under their integrals. Applying the same domination to convergent parameter sequences shows the derivative integrals are continuous in , so both objectives are .
Step 1.2 proves for every , with one finite constant independent of . Both sides are differentiable by step 1.3, so differentiating this identity gives .
Source notes
Lipman et al. state Theorem 2 under positive marginal density and give the Appendix A argument using squared-norm expansion, the mixture density, the marginal conditional-average formula, and Fubini; they explicitly assume sufficient decay and bounded . Holderrieth and Erives give the complete direct expansion in §3.3, Theorem 12, including the parameter-independent squared-error term. This item states exact integrability and dominated-derivative hypotheses, of which bounded fields on compact parameter neighborhoods are a sufficient case, and gives a local endpoint majorant for the marginal continuity equation. Thus no informal tail-decay phrase is needed: the proof uses absolute integrability and no integration by parts at spatial infinity. It makes no optimizer, training-convergence, or sample-quality claim.
The Gaussian conditional affine map is quadratic-cost optimal
Statement
Assume the Axiom of Choice. Let , fix , and choose . Let have the standard multivariate normal law . For , define and let be the law of . Then is the Gaussian probability path with mean and covariance , and its Lebesgue density is A conditional velocity field for this path is For each endpoint , these densities and fields form a conditional path in the probability-path definition; hence they can be mixed against any Borel endpoint law. At the law is , and at it is the law of , a Gaussian with mean and covariance . The affine endpoint map is optimal for squared Euclidean cost between these two laws: every coupling has cost at least and the law of attains this value.
Statement references
Facts & Assumptions
Given: AC, , , , and .
AC supplies the axiom required by the standard and multivariate Gaussian-law definitions and the Gaussian density theorem. The Axiom of Choice
Standard normal and normal laws and Multivariate normal law, including singular covariance: scalar normal laws are affine images of the standard normal; has scalar projections , mean , and covariance .
A positive-definite multivariate normal law has its Gaussian density: if is positive definite, has Lebesgue density .
An affine conditional path has the stated velocity field: for a differentiable affine flow with , its unique Eulerian field is .
A centered law and its affine dilation have an optimal affine coupling: for any centered probability law with second moment , the map , , is optimal for squared Euclidean cost to its affine image and has cost .
Sums, scalar multiples, products and quotients: , , , and when : sums, products, and quotients by nonzero functions obey the ordinary derivative rules.
The chain rule for total derivatives: : derivatives of compositions of differentiable Euclidean maps obey the chain rule.
Proof
Given: The hypotheses in the Statement.
Since , every affine map is invertible. For each , the projection of is . By [F1], this is normal with mean and variance . Thus is multivariate normal with mean and covariance , which is positive definite.
By [F2], the Lebesgue density of is It integrates to one for every and is continuous in because . Therefore for any endpoint probability law it is product-measurable and satisfies the conditional-density requirement in Probability paths and velocity fields.
We have and . Applying [F3] gives . The density formula in step 1.2 and this affine field are continuously differentiable in by the algebra, chain, and exponential derivative rules [F6, F7, F8]. Thus and each component of meet the regularity clauses of the conditional probability-path definition.
At the parameters are ; at they are . Thus the endpoints are the standard Gaussian law and the law of .
Put and write . We have and by the product and quotient rules [F6]. Applying the chain rule [F7] to and then the exponential derivative [F8] gives The field in step 2.1 has .
The product rule gives Adding this to in step 3.1 cancels each term, so the conditional continuity equation holds.
The standard Gaussian vector has mean and covariance by [F1]. Summing its coordinate second moments gives . The endpoint law is the affine image under . Applying [F4] with , , and shows that every coupling has cost at least , and that the law of attains equality.
Source notes
The paper and book give Gaussian optimal-transport context; the complete proof of optimality used here is the local choice-free coupling argument in [lem-affine-dilation-is-quadratic-cost-optimal].
Conditional flow-matching training and exact-flow sampling
Definition
Let , , and be open. Let be a sigma-finite Borel measure on , let be a Borel probability measure on , and let and be jointly measurable. Assume for every and for -almost every , and that for -almost every , and every component of are continuously differentiable in on and satisfy For every compact , suppose there is a nonnegative bounding on , for -almost every , the absolute values of , , each component of , and each corresponding spatial flux derivative.
Define and . Assume and is finite on , and put . Let be jointly measurable and continuously differentiable in , with jointly measurable parameter derivative. Define and Assume, almost surely, that and are finite for every , and that is finite. Write for the matrix with entries . For every compact and coordinate , suppose nonnegative integrable majorants on and on satisfy, for every outside fixed null sets, and Let be the probability law of a training triple, with Lebesgue probability measure on . Take as fixed and let be the trivial history. At iteration , let be the history before the batch, so is -measurable; draw independent triples with law , independently of , and set to be the sigma-algebra generated by and that batch. For a triple , define For each , set and require it to be integrable on the joint training probability space.
Given the fixed initial parameter and deterministic step sizes , for each set Assume all iterates remain in almost surely. Training uses only conditional samples and does not solve the parameterized ODE during these updates. After training, condition on the history , draw from a supplied initial probability law independently of , and return , where solves with . This last step is well-defined if the field extends to an open time interval containing , is jointly in time, state, and parameter, and on every compact parameter set has uniform constants satisfying for , , and . Conditional on , the output law assigns mass to each Borel set . The procedure gives no convergence guarantee for the parameter updates or equality of this output law with a desired data law.
Definition references
Source notes
The cited papers specify the conditional sample, squared regression loss, parameter update, and ODE sampling steps. This algorithm makes the sampler law, batch gradient, exact global-flow conditions, and output law explicit. Its parameter updates carry no optimization convergence guarantee, and the exact flow is a mathematical solution rather than a numerical solver with an error bound.
Conditional flow-matching batch gradients and exact-flow output law
Statement
Take all inputs, laws, histories, notation, hypotheses, and instructions of the conditional flow-matching training and exact-flow sampling procedure, including its full conditional-path regularity, marginal positivity, finite-loss, derivative-majorant, fresh-batch independence, random-iterate integrability, and parameter-domain assumptions. In particular, the number of training rounds satisfies , the batch size satisfies , each is measurable with respect to the pre-batch history , and the training triples at round have the supplied law independently of that history. For every , both and are integrable, and
The arithmetic update is defined for every prescribed nonnegative step size; remaining in the open parameter domain is a hypothesis, not a consequence of unbiasedness. If the additional exact-flow sampling hypotheses in that procedure hold, namely a jointly smooth extension of the field to an open time interval containing and the uniform state-Lipschitz and origin bounds on every compact parameter set, then its terminal output is well-defined and measurable. For every Borel set its conditional output law is
For , there is no batch update, , and the exact-flow conclusion still applies under the same sampling hypotheses. These statements supply neither convergence of the parameter updates nor equality of the output law with a desired data law, nor a numerical solver or an error or cost bound.
Statement references
Facts & Assumptions
Given: The conditional probability-density path and algebraic regression field, endpoint sampler, parameterized vector field and its sampled gradients, initial parameter, batch size, step sizes, supplied initial law, and exact-flow regularity hypotheses in the Algorithm.
Probability paths and velocity fields: a conditional density path is normalized for the endpoint law almost everywhere. The algorithm separately supplies its algebraic regression field and classical density/flux equation; no general-reference measure-transport assertion is needed for its gradient identity.
Conditional and marginal flow-matching objectives differ by a constant: under finite loss, positive finite marginal density, local endpoint domination for the conditional continuity equation, and dominated parameter derivatives, the conditional and marginal squared-loss gradients agree.
A parameterized neural ordinary differential equation: for a fixed parameter, the parameterized ODE is the initial-value problem with the stated initial condition.
A globally Lipschitz neural ODE has a global smooth flow: a jointly smooth field on an open time interval containing , with uniform state-Lipschitz and origin bounds on compact parameter sets, has a unique global flow on , and its terminal map is jointly smooth in initial state and parameter.
The Euclidean inner product on : the squared Euclidean loss is .
The Lebesgue integral is linear on : the expectation of a finite sum of integrable random vectors is the sum of their expectations, componentwise.
Law or distribution of a random element: the law of a measurable map under assigns a Borel set the measure .
Conditional expectation given a sigma algebra: for an integrable real random variable, a conditional-expectation version is measurable, integrable, and has the same integrals on every event in the conditioning sigma-algebra; vector statements apply coordinatewise.
Independent random elements have product joint law: independent random elements have the product of their marginal laws as their joint law.
Change of variables for expectation: the expectation of an integrable function of a random element equals its integral against the law of that element.
Fubini's theorem for L^1 functions on a sigma-finite product: an integrable function on a sigma-finite product can be integrated in either order with equal results.
The modulus of an integral is bounded by the integral of the modulus: the absolute value of an integrable scalar function's integral is bounded by the integral of its absolute value.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative product-measurable function has a measurable section-integral function and equal iterated and product integrals.
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : a real function continuous on a closed interval and differentiable in its interior has each difference quotient equal to an interior derivative.
Proof
Given: The hypotheses in the Algorithm.
Fix and a history for which and both losses at are finite. Choose a compact parameter box with in its interior. Changing coordinates one at a time, the mean value theorem [F14] and the derivative majorants in [F2] bound the differences between each loss integrand at and at by the corresponding sums of and . Integrating these bounds proves local finiteness of both losses throughout the interior of , so [F2] applies there and gives . For fixed , put . Bilinearity and symmetry [F5] give Dividing by and taking the limit using differentiability of shows that the th coordinate of the sample gradient is , exactly the th coordinate of . Since the triple has law , the expectation change-of-variables formula [F10] identifies its -mean with . Thus its -mean is .
Each , and hence , is integrable by the explicit batch-integrability assumption. For fixed , put . Joint measurability, Tonelli [F13], and the local derivative majorants make measurable and finite; at each visited parameter step 1.1 gives . Fubini [F11] and the integral triangle inequality [F12] show that each coordinate of is integrable, with its absolute expectation bounded by that of the corresponding sample-gradient coordinate. For every , independence and the product-law fact [F9], the change-of-variables formula [F10], and Fubini [F11] give where step 1.1 identifies each fixed-parameter -mean and [F6] gives linearity. Thus [F8] makes a version of ; the batch estimate is unbiased conditionally on its pre-batch history. The arithmetic update is defined for every nonnegative step size when .
For the realized satisfying the exact-flow bounds, [F3] identifies the sampling equation as a parameterized ODE and [F4] gives its unique solution on the full interval and joint continuity of . The terminal output is therefore measurable as a function of the independent initial draw and the training history. Conditional on , is fixed, so [F7] identifies the conditional output law by for each Borel set . This verifies that the exact-flow output is defined; it makes no claim that the learned field realizes the target path.
Source notes
The cited flow-matching sources motivate conditional regression and exact ODE sampling. The local conditional-unbiasedness argument explicitly treats random iterates, fresh-batch independence, and integrability. The smooth-flow supplier establishes global well-definedness under the stated additional regularity and uniform bounds. No learned-field target-distribution guarantee or numerical approximation bound is asserted.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Yaron Lipman et al., Flow Matching for Generative Modeling, §§2–3
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §§3.1–3.2
- Filippo Santambrogio, Optimal Transport for Applied Mathematicians, §4.1.2, Definition 4.1
- Yaron Lipman et al., Flow Matching for Generative Modeling, §3.1
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.1
- Yaron Lipman et al., Flow Matching for Generative Modeling, §3.1 and Appendix A
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.2
- Yaron Lipman et al., Flow Matching for Generative Modeling, §4 Theorem 3 and Appendix A
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.2 Example 10
- Tor Fjelde, Emile Mathieu, and Vincent Dutordoir, An Introduction to Flow Matching, Gaussian conditional path derivation
- Yaron Lipman et al., Flow Matching for Generative Modeling, §4.1
- Gabriel Peyré and Marco Cuturi, Computational Optimal Transport, §2.6 Remark 2.31
- Yaron Lipman et al., Flow Matching for Generative Modeling, §3.2 Theorem 2 and Appendix A
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.3 Theorem 12 and direct proof
- Yaron Lipman et al., Flow Matching for Generative Modeling, §4 Theorem 3 and §4.1
- Yaron Lipman et al., Flow Matching for Generative Modeling, §§3.2 and 6.2
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.3 Algorithm 3