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 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.
Depends on
- Conditional flow-matching training and exact-flow sampling
- Probability paths and velocity fields
- Conditional and marginal flow-matching objectives differ by a constant
- A parameterized neural ordinary differential equation
- A globally Lipschitz neural ODE has a global smooth flow
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- The Lebesgue integral is linear on $L^1(\mu)$
- Law or distribution of a random element
- Conditional expectation given a sigma algebra
- Independent random elements have product joint law
- Change of variables for expectation
- Fubini's theorem for L^1 functions on a sigma-finite product
- The modulus of an integral is bounded by the integral of the modulus
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
Used by
Nothing in the library uses this result yet.
Cited to discharge well-definedness by Conditional flow-matching training and exact-flow sampling.
Dependency tree · two levels
74 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
- Yaron Lipman et al., Flow Matching for Generative Modeling, §§3.2 and 6.2 (standard reference, not scraped)
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.3 Algorithm 3 (standard reference, not scraped)