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.

Conditional flow matching and transport paths

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Probability paths and velocity fields

Definition

Fix an integer d≥1, a sigma-finite measure λ on the Borel subsets of Rd, and a Borel probability measure π on Rd. Here sigma-finite means that there are Borel sets En with Rd=⋃n≥1En and λ(En)<∞ for each n. A conditional probability-density path with endpoint law π is a function measurable for B([0,1])⊗B(Rd)⊗B(Rd) on time, state, and endpoint variables ρ:[0,1]×Rd×Rd→[0,∞] such that, for every t∈[0,1], ∫Rdρt(x∣x1) λ(dx)=1 for π-almost every endpoint x1. Its mixture function is pt(x):=∫Rdρt(x∣x1) π(dx1). For a vector field ut(x∣x1)=(ut1,…,utd) measurable for the same product sigma-algebra, call it a conditional velocity field for ρ when, for π-almost every x1, ρt(⋅∣x1) and every component of ρt(⋅∣x1)ut(⋅∣x1) are continuously differentiable in (t,x) on (0,1)×Rd, the functions ρt and ρtutj are locally integrable there with respect to dt λ(dx), and ∫01 ⁣∫Rdρt(x∣x1)(∂tφ(t,x)+∑j=1dutj(x∣x1)∂xjφ(t,x))λ(dx) dt=0 for every continuously differentiable real function φ with compact support in (0,1)×Rd. Here dt 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 ρt(⋅∣x1)λ. In the Lebesgue-reference case λ(dx)=dx, its classical form under the stated differentiability is ∂tρt(x∣x1)+∑j=1d∂xj ⁣(ρt(x∣x1)utj(x∣x1))=0 on (0,1)×Rd. 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 (t,x) where 0<pt(x)<∞ and the numerator is a finite componentwise Lebesgue integral, the marginal velocity field is ut(x):=∫Rdρt(x∣x1)ut(x∣x1) π(dx1)pt(x). This definition assigns no value to the quotient where pt(x)=0 or pt(x)=∞, or where the numerator is not finite.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A conditional mixture is a probability path

Statement

Let λ, π, and ρ satisfy the conditional probability-density path definition, and for each t∈[0,1] set pt(x)=∫Rdρt(x∣x1) π(dx1). Then pt is a nonnegative measurable function and ∫Rdpt(x) λ(dx)=1 for every t; hence it is a probability density with respect to λ.

Facts & Assumptions

Given: A sigma-finite Borel measure λ, a Borel probability measure π, and a conditional density ρt normalized for π-almost every endpoint.

[F1]

Probability paths and velocity fields: ρt(x∣x1) is product-measurable, nonnegative, and has λ-integral 1 for π-almost every x1; pt(x) is its π-mixture.

[F2]

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.

1.1givenF1F2

Fix t∈[0,1]. The measures λ and π are sigma-finite, and (x,x1)↦ρt(x∣x1) is nonnegative and product-measurable by [F1]. Tonelli's theorem [F2] therefore makes x↦pt(x) measurable and gives ∫Rdpt(x) λ(dx)=∫Rd(∫Rdρt(x∣x1) λ(dx))π(dx1).

2.1step 1.1F1algebra∎

The inner integral in step 1.1 equals 1 for π-almost every x1 by [F1]. Since π is a probability measure, the right-hand side is ∫1 dπ=1. The mixture is nonnegative by [F1], so pt 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Conditional continuity equations pass to the marginal path

Statement

Let λ, π, and ρ be as in the conditional probability-path definition, and let u be a jointly measurable vector field. Suppose that for π-almost every x1, ρ and each component of ρu are continuously differentiable in (t,x) and satisfy the classical coordinate equation ∂tρt+∑j=1d∂xj(ρtutj)=0 on (0,1)×Rd. This is an explicit algebraic hypothesis; for general λ it is not the definition of measure transport. Suppose also that for every compact K⊂(0,1)×Rd there is a nonnegative GK∈L1(π) which, for π-almost every x1, bounds on K the absolute values of ρt(x∣x1), ∂tρt(x∣x1), each component of ρt(x∣x1)ut(x∣x1), and each derivative ∂xj(ρtutj)(x∣x1). If pt(x)>0 on (0,1)×Rd, define Jt(x):=∫Rdρt(x∣x1)ut(x∣x1) π(dx1),ut(x):=Jt(x)pt(x). Then ∂tpt and each indicated flux derivative ∂xjJtj exist and are continuous locally in (t,x), and the marginal continuity equation ∂tpt(x)+∑j=1d∂xj ⁣(pt(x)utj(x))=0 holds on (0,1)×Rd. The domination hypothesis is a sufficient Leibniz condition for the time and spatial derivatives to pass through the x1 integral.

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.

[F1]

Probability paths and velocity fields: pt(x)=∫ρt(x∣x1) π(dx1). The classical coordinate equation and the local regularity used here are separate hypotheses in the Statement.

[F2]

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∈(a,b) with f(b)−f(a)=f′(c)(b−a): if a real function is continuous on a closed interval and differentiable in its interior, some interior derivative equals its endpoint difference quotient.

[F3]

Dominated convergence: pointwise convergence under one integrable majorant permits passage of a sequence of integrals to the limit.

[F4]

The Lebesgue integral is linear on L1(μ): the integral is linear for integrable scalar components.

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2F3

Fix a compact neighborhood K of an interior point (t,x). The bounds on ρ and ρu make pt(x) and Jt(x) finite, so positivity makes the quotient well-defined. For any sequence of nonzero increments hn→0 small enough that the time segment from t to t+hn stays in K, the mean value theorem [F2] bounds the difference quotient of ρt+hn(x∣x1)−ρt(x∣x1) by GK(x1). The quotient converges for π-almost every x1 to ∂tρt(x∣x1). Dominated convergence [F3] therefore gives ∂tpt(x)=∫Rd∂tρt(x∣x1) π(dx1). The same argument for each flux component on its spatial coordinate segment gives ∂xjJtj(x)=∫Rd∂xj ⁣(ρt(x∣x1)utj(x∣x1))π(dx1). The local continuity of these derivatives follows from their pointwise continuity in (t,x) and the same integrable majorant.

2.1givenF1F4step 1.1algebra∎

Integrate the conditional continuity equation over π. All terms are integrable by GK, so linearity [F4] and the identities of step 1.1 yield ∂tpt(x)+∑j=1d∂xjJtj(x)=∫Rd(∂tρt(x∣x1)+∑j=1d∂xj(ρtutj)(x∣x1))π(dx1)=0. By definition Jt=ptut wherever pt>0, 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

An affine conditional path has the stated velocity field

Statement

Let d≥1, fix x1∈Rd, and let t↦μt(x1)∈Rd and t↦σt(x1)∈(0,∞) be continuously differentiable on [0,1], with one-sided derivatives at the endpoints. For z∈Rd, define the affine map ψt(z∣x1):=σt(x1)z+μt(x1). For each t, this map is a diffeomorphism with inverse ψt−1(x∣x1)=(x−μt(x1))/σt(x1). The unique vector field satisfying ddtψt(z∣x1)=ut(ψt(z∣x1)∣x1) for every z∈Rd is ut(x∣x1)=σ˙t(x1)σt(x1)(x−μt(x1))+μ˙t(x1).

Facts & Assumptions

Given: d, x1, and the continuously differentiable functions μt(x1) and σt(x1)>0 in the Statement.

[F1]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: vectors in Rd have coordinatewise addition and scalar multiplication.

Proof

Given: The hypotheses in the Statement.

1.1givenF1algebra

Fix t∈[0,1]. Since σt(x1)>0, solving x=σt(x1)z+μt(x1) gives the unique inverse z=(x−μt(x1))/σt(x1). Both the map and inverse are continuously differentiable in z, so ψt(⋅∣x1) is a diffeomorphism.

2.1givenstep 1.1algebra

For fixed z, differentiation gives ddtψt(z∣x1)=σ˙t(x1)z+μ˙t(x1). Substitute the inverse expression from step 1.1 to obtain ddtψt(z∣x1)=σ˙t(x1)σt(x1)(ψt(z∣x1)−μt(x1))+μ˙t(x1). Thus the displayed ut satisfies the flow equation.

3.1step 1.1step 2.1algebra∎

If another field u~t satisfies the same equation for every z, then for any x choose the explicit inverse value z=ψt−1(x∣x1). The flow equation forces u~t(x∣x1)=σ˙t(x1)σt(x1)(x−μt(x1))+μ˙t(x1), 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.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A centered law and its affine dilation have an optimal affine coupling

Statement

Let μ be a Borel probability measure on Rd with finite second moment, mean ∫x μ(dx)=0, and m2:=∫∥x∥22 μ(dx)<∞. Fix a∈Rd and s>0, define T(x):=a+sx, and let ν be the law of T(X) when X has law μ. For every Borel probability measure γ on Rd×Rd whose coordinate marginals are μ and ν, ∫Rd×Rd∥y−x∥22 γ(dx,dy) ≥ ∥a∥22+(1−s)2m2. The law of (X,T(X)) under μ attains equality. Thus T is an optimal transport map for the squared Euclidean cost between μ and its translated dilation ν.

Facts & Assumptions

Given: The Borel probability measure μ, its zero mean and finite second moment m2, the affine map T(x)=a+sx, and a coupling γ with the stated marginals.

[F1]

Probability measures and probability spaces: μ and γ are countably additive probability measures on their stated Borel spaces.

[F2]

Law or distribution of a random element: the law of a Borel map T under μ assigns to each Borel set B the value μ(T−1(B)).

[F3]

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.

[F4]

The law of a random element is a probability measure: the law of a measurable random element is a Borel probability measure.

[F5]

A continuous map has Borel preimages of Borel sets: a continuous map between Euclidean spaces has Borel preimages of Borel sets.

[F6]

The Lebesgue integral is linear on L1(μ): the integral is linear for integrable scalar components.

[F7]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: ∥x∥22=⟨x,x⟩ on Rd, with the coordinatewise Euclidean inner product.

[F9]

Cauchy-Schwarz for random variables: for square-integrable real random variables U,V, E∣UV∣≤(EU2)1/2(EV2)1/2.

[F10]

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.

1.1givenF1F2F3F4F5F6F7F8F9F10

The affine maps T(x)=a+sx and x↦(x,T(x)) are continuous, so their Borel preimages are Borel by [F5]; their laws are probability measures by [F2, F4]. Let (X,Y) have joint law γ. The first marginal gives EγX=0 and Eγ∥X∥22=m2. The second marginal is the law of a+sX under μ, so change of variables [F3] and linearity [F6] give Eγ(Y−a)=0 and Eγ∥Y−a∥22=s2m2. These second moments make all displayed costs finite; Cauchy–Schwarz [F8, F9] makes the cross term integrable.

2.1step 1.1F8F9algebra

Expand Y−X=a+(Y−a)−X. The expectation of the cross term with a vanishes because Eγ(Y−a)=EγX=0, so Eγ∥Y−X∥22=∥a∥22+(1+s2)m2−2Eγ⟨X,Y−a⟩. By [F8], pointwise ∣⟨X,Y−a⟩∣≤∥X∥2∥Y−a∥2. Applying [F9] to the two scalar norms gives Eγ⟨X,Y−a⟩≤m2 s2m2=sm2. Substitution proves the lower bound.

3.1step 2.1F2F3F4F5F6F10algebra∎

The law of (X,T(X)) for X∼μ is a coupling with marginals μ and ν by [F2, F4, F5]. Under this coupling Y−a=sX, so E⟨X,Y−a⟩=sm2. The expansion in step 2.1 therefore gives cost ∥a∥22+(1−s)2m2, 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Conditional and marginal flow-matching objectives differ by a constant

Statement

Let d,q≥1, let λ be a sigma-finite measure on the Borel subsets of Rd, let π be a Borel probability measure on Rd, and let ρ be a conditional probability-density path relative to (λ,π) and uc a jointly measurable vector field. Set pt(x):=∫Rdρt(x∣x1) π(dx1),Jt(x):=∫Rdρt(x∣x1)utc(x∣x1) π(dx1). Assume 0<pt(x)<∞ and Jt(x) is finite on [0,1]×Rd, and define utm(x):=Jt(x)/pt(x). Suppose that for π-almost every x1, ρ and each component of ρuc are continuously differentiable in (t,x) and satisfy ∂tρt+div⁡x(ρtutc)=0 on (0,1)×Rd. This classical coordinate equation is a separate algebraic hypothesis, not a measure-transport convention for general λ. Suppose also that for every compact K⊂(0,1)×Rd there is a nonnegative GK∈L1(π) that bounds on K, for π-almost every x1, the absolute values of ρt(x∣x1), ∂tρt(x∣x1), each component of ρtutc, and each corresponding spatial flux derivative.

Let Θ⊆Rq be open, and let v: [0,1]×Rd×Θ→Rd be jointly measurable and continuously differentiable in θ, with jointly measurable parameter derivative. Define LC(θ):=∫01 ⁣∫Rd ⁣∫Rdρt(x∣x1)∥v(t,x;θ)−utc(x∣x1)∥22 π(dx1)λ(dx) dt, and LM(θ):=∫01 ⁣∫Rdpt(x)∥v(t,x;θ)−utm(x)∥22 λ(dx) dt. Assume LC(θ) and LM(θ) are finite for every θ∈Θ, and define C:=∫01 ⁣∫Rd ⁣∫Rdρt(x∣x1)∥utc(x∣x1)−utm(x)∥22 π(dx1)λ(dx) dt, and assume C<∞. For every compact H⊂Θ and coordinate j, suppose there are nonnegative integrable majorants GH,jC on dt λ(dx) π(dx1) and GH,jM on dt λ(dx) such that for every θ∈H, outside fixed null sets, 2ρt(x∣x1)∣⟨∂θjv(t,x;θ),v(t,x;θ)−utc(x∣x1)⟩∣≤GH,jC(t,x,x1), and 2pt(x)∣⟨∂θjv(t,x;θ),v(t,x;θ)−utm(x)⟩∣≤GH,jM(t,x). Then both objectives are finite and continuously differentiable on Θ, and LC(θ)=LM(θ)+C. In particular, C is independent of θ and ∇θLC(θ)=∇θLM(θ). Under the stated classical coordinate PDE and local domination, (p,um) also satisfies ∂tp+div⁡x(pum)=0 on (0,1)×Rd. Uniform boundedness of uc,um,v,Dθv on compact parameter neighborhoods is a sufficient special case of the integrability and derivative-majorant assumptions above.

Facts & Assumptions

Given: The sigma-finite Borel measure λ, endpoint probability measure π, conditional probability path (ρ,uc), finite positive marginal density and finite flux, local endpoint domination, open parameter domain Θ, parameter-regular vector field v, finite loss and variance integrals, and the integrable derivative majorants in the Statement.

[F1]

Probability paths and velocity fields supplies the normalized measurable density path and its mixture pt=∫ρt(⋅∣x1) dπ. The classical coordinate PDE and C1 density/flux regularity are separate Statement hypotheses.

[F2]

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.

[F3]

Conditional continuity equations pass to the marginal path: the stated local L1(π) bounds permit the conditional time and flux derivatives to pass through the endpoint integral and imply ∂tp+div⁡x(pum)=0.

[F4]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: ∥a∥22=⟨a,a⟩ and the Euclidean inner product is bilinear.

[F5]

Fubini's theorem for L^1 functions on a sigma-finite product: an L1 function on a product of sigma-finite measure spaces may be integrated in either order, with equality of the iterated integrals.

[F7]

Dominated convergence: pointwise convergence under one integrable majorant permits passage of the limit through the integral.

[F8]

The Lebesgue integral is linear on L1(μ): the integral is linear on L1.

[F10]

Cauchy-Schwarz for random variables: square-integrable scalar functions U,V on a probability space satisfy ∫∣UV∣≤(∫U2)1/2(∫V2)1/2.

[F14]

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.

1.1givenF1F2F3

By [F1] and the mixture normalization result [F2], each pt is a probability density with respect to λ. Positivity makes um=J/p well-defined on the open time interval. The hypotheses on GK are exactly the local domination assumptions of [F3], so the explicitly assumed classical coordinate equation passes to the marginal and ∂tp+div⁡x(pum)=0.

1.2givenF1F2F4F5F8F9F10F14algebra

Let Q be the measure on time, state, and endpoint variables with density ρt(x∣x1) relative to dt λ(dx) π(dx1). Product measurability from [F1], conditional normalization, and Tonelli [F14] show that Q has total mass one and that its time-state marginal has density pt(x) relative to dt λ(dx). In particular, Tonelli gives LM(θ)=∫∥v−um∥22 dQ, so the finite marginal loss makes v−um square-integrable under Q. The same identity gives C=∫∥uc−um∥22 dQ, so uc−um is square-integrable under Q. By Euclidean Cauchy–Schwarz [F9] and random-variable Cauchy–Schwarz [F10], their inner-product term is integrable. At every t,x where the integrals are defined, the definition of Jt and utm gives ∫Rdρt(x∣x1)(utc(x∣x1)−utm(x)) π(dx1)=Jt(x)−pt(x)utm(x)=0. Expanding v−uc=(v−um)+(um−uc) by bilinearity [F4], integrating first over x1, and using Fubini [F5] for the integrable cross term gives LC(θ)=LM(θ)+∫01 ⁣∫ ⁣∫ρt(x∣x1)∥utc(x∣x1)−utm(x)∥22 π(dx1)λ(dx)dt. The last integral is independent of θ and is the finite constant C defined in the Statement.

1.3givenF2F4F5F6F7

Fix θ0∈Θ and choose a compact parameter ball H⊂Θ whose interior contains θ0. For any θ∈int⁡H, fix w to be either utc(x∣x1) or utm(x) and put aθ:=v(t,x;θ)−w. For sufficiently small nonzero ε with θ+εej∈H, bilinearity and symmetry [F4] give ∥aθ+εej∥22−∥aθ∥22=⟨aθ+εej−aθ,aθ+εej+aθ⟩. Dividing by ε and taking the limit, differentiability of v yields ∂θj∥v(t,x;θ)−w∥22=2⟨∂θjv(t,x;θ),v(t,x;θ)−w⟩. The functions GH,jC and GH,jM dominate the weighted derivatives on H. For a sequence of nonzero increments tending to zero in coordinate j, 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 C1.

2.1step 1.2step 1.3algebra∎

Step 1.2 proves LC(θ)=LM(θ)+C for every θ, with one finite constant independent of θ. Both sides are differentiable by step 1.3, so differentiating this identity gives ∇θLC(θ)=∇θLM(θ).

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 ut,vt,∇θvt. 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The Gaussian conditional affine map is quadratic-cost optimal

Statement

Assume the Axiom of Choice. Let d≥1, fix x1∈Rd, and choose σmin⁡>0. Let Z have the standard multivariate normal law Nd(0,Id). For t∈[0,1], define μt(x1):=tx1,σt:=1−(1−σmin⁡)t,ψt(z∣x1):=σtz+μt(x1), and let Pt(⋅∣x1) be the law of ψt(Z∣x1). Then Pt(⋅∣x1) is the Gaussian probability path with mean μt(x1) and covariance σt2Id, and its Lebesgue density is ρt(x∣x1)=(2πσt2)−d/2exp⁡ ⁣(−∥x−μt(x1)∥222σt2). A conditional velocity field for this path is ut(x∣x1)=σmin⁡−1σt(x−tx1)+x1. For each endpoint x1, these densities and fields form a conditional path in the probability-path definition; hence they can be mixed against any Borel endpoint law. At t=0 the law is Nd(0,Id), and at t=1 it is the law of x1+σmin⁡Z, a Gaussian with mean x1 and covariance σmin⁡2Id. The affine endpoint map T(z)=x1+σmin⁡z is optimal for squared Euclidean cost between these two laws: every coupling has cost at least ∥x1∥22+d(1−σmin⁡)2, and the law of (Z,T(Z)) attains this value.

Facts & Assumptions

Given: AC, d≥1, x1∈Rd, σmin⁡>0, and Z∼Nd(0,Id).

[A1]

AC supplies the axiom required by the standard and multivariate Gaussian-law definitions and the Gaussian density theorem. The Axiom of Choice

[F1]

Standard normal and normal laws and Multivariate normal law, including singular covariance: scalar normal laws are affine images of the standard normal; Nd(m,Σ) has scalar projections N(uTm,uTΣu), mean m, and covariance Σ.

[F2]

A positive-definite multivariate normal law has its Gaussian density: if Σ is positive definite, Nd(m,Σ) has Lebesgue density (2π)−d/2det⁡(Σ)−1/2exp⁡(−12(x−m)TΣ−1(x−m)).

[F3]

An affine conditional path has the stated velocity field: for a differentiable affine flow ψt(z)=σtz+μt with σt>0, its unique Eulerian field is μ˙t+(σ˙t/σt)(x−μt).

[F4]

A centered law and its affine dilation have an optimal affine coupling: for any centered probability law with second moment m2, the map z↦a+sz, s>0, is optimal for squared Euclidean cost to its affine image and has cost ∥a∥22+(1−s)2m2.

[F7]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): derivatives of compositions of differentiable Euclidean maps obey the chain rule.

Proof

Given: The hypotheses in the Statement.

1.1givenA1F1F5algebra

Since σt=(1−t)+tσmin⁡>0, every affine map ψt is invertible. For each v∈Rd, the projection of ψt(Z∣x1) is vTμt(x1)+σtvTZ. By [F1], this is normal with mean vTμt(x1) and variance σt2∥v∥22. Thus Pt(⋅∣x1) is multivariate normal with mean μt(x1) and covariance σt2Id, which is positive definite.

1.2givenF2

By [F2], the Lebesgue density of Pt(⋅∣x1) is ρt(x∣x1)=(2πσt2)−d/2exp⁡ ⁣(−∥x−μt(x1)∥222σt2). It integrates to one for every x1 and is continuous in (t,x,x1) because σt>0. Therefore for any endpoint probability law π it is product-measurable and satisfies the conditional-density requirement in Probability paths and velocity fields.

2.1givenstep 1.2F3F6F7F8algebra

We have μ˙t(x1)=x1 and σ˙t=σmin⁡−1. Applying [F3] gives ut(x∣x1)=x1+σmin⁡−1σt(x−tx1). The density formula in step 1.2 and this affine field are continuously differentiable in (t,x) by the algebra, chain, and exponential derivative rules [F6, F7, F8]. Thus ρt and each component of ρtut meet the regularity clauses of the conditional probability-path definition.

2.2givenstep 1.1algebra

At t=0 the parameters are μ0=0,σ0=1; at t=1 they are μ1=x1,σ1=σmin⁡. Thus the endpoints are the standard Gaussian law and the law of x1+σmin⁡Z.

3.1step 1.1step 1.2step 2.1F5F6F7F8algebra

Put r=x−tx1 and write σ˙=σmin⁡−1. We have ∂tr=−x1 and ∂t(σt−d)=−dσ˙σt−d−1 by the product and quotient rules [F6]. Applying the chain rule [F7] to −∥r∥22/(2σt2) and then the exponential derivative [F8] gives ∂tρt=ρt(−dσ˙σt+⟨r,x1⟩σt2+σ˙∥r∥22σt3),∇xρt=−ρtrσt2. The field in step 2.1 has div⁡xut=dσ˙/σt.

4.1step 3.1F5F6F7algebra

The product rule gives div⁡x(ρtut)=⟨∇xρt,ut⟩+ρtdiv⁡xut=ρt(−⟨r,x1⟩σt2−σ˙∥r∥22σt3+dσ˙σt). Adding this to ∂tρt in step 3.1 cancels each term, so the conditional continuity equation holds.

5.1givenA1F1F4F5step 2.2algebra∎

The standard Gaussian vector has mean 0 and covariance Id by [F1]. Summing its d coordinate second moments gives ∫∥z∥22 Nd(0,Id)(dz)=d. The endpoint law is the affine image under T(z)=x1+σmin⁡z. Applying [F4] with a=x1, s=σmin⁡, and m2=d shows that every coupling has cost at least ∥x1∥22+d(1−σmin⁡)2, and that the law of (Z,T(Z)) 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].

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Conditional flow-matching training and exact-flow sampling

Definition

Let d,q,B≥1, N≥0, and Θ⊆Rq be open. Let λ be a sigma-finite Borel measure on Rd, let π be a Borel probability measure on Rd, and let ρ:[0,1]×Rd×Rd→[0,∞] and uc:[0,1]×Rd×Rd→Rd be jointly measurable. Assume ∫ρt(x∣x1) λ(dx)=1 for every t and for π-almost every x1, and that for π-almost every x1, ρt(⋅∣x1) and every component of ρtutc(⋅∣x1) are continuously differentiable in (t,x) on (0,1)×Rd and satisfy ∂tρt(x∣x1)+∑j=1d∂xj(ρt(x∣x1)(utc)j(x∣x1))=0. For every compact K⊂(0,1)×Rd, suppose there is a nonnegative GK∈L1(π) bounding on K, for π-almost every x1, the absolute values of ρt, ∂tρt, each component of ρtutc, and each corresponding spatial flux derivative.

Define pt(x):=∫ρt(x∣x1) π(dx1) and Jt(x):=∫ρt(x∣x1)utc(x∣x1) π(dx1). Assume 0<pt(x)<∞ and Jt(x) is finite on [0,1]×Rd, and put utm(x):=Jt(x)/pt(x). Let v:[0,1]×Rd×Θ→Rd be jointly measurable and continuously differentiable in θ, with jointly measurable parameter derivative. Define LC(θ):=∫01 ⁣∫ ⁣∫ρt(x∣x1)∥v(t,x;θ)−utc(x∣x1)∥22 π(dx1)λ(dx)dt and LM(θ):=∫01 ⁣∫pt(x)∥v(t,x;θ)−utm(x)∥22 λ(dx)dt. Assume, almost surely, that LC(θk) and LM(θk) are finite for every k=0,…,N, and that C:=∫01 ⁣∫ ⁣∫ρt(x∣x1)∥utc(x∣x1)−utm(x)∥22 π(dx1)λ(dx)dt is finite. Write Dθv for the matrix with entries (Dθv)ij=∂θjvi. For every compact H⊂Θ and coordinate j, suppose nonnegative integrable majorants GH,jC on dt λ(dx) π(dx1) and GH,jM on dt λ(dx) satisfy, for every θ∈H outside fixed null sets, 2ρt(x∣x1)∣⟨∂θjv(t,x;θ),v(t,x;θ)−utc(x∣x1)⟩∣≤GH,jC(t,x,x1) and 2pt(x)∣⟨∂θjv(t,x;θ),v(t,x;θ)−utm(x)⟩∣≤GH,jM(t,x). Let Q(dt,dx1,dx):=dt π(dx1)ρt(x∣x1)λ(dx) be the probability law of a training triple, with dt Lebesgue probability measure on [0,1]. Take θ0 as fixed and let F0 be the trivial history. At iteration k, let Fk be the history before the batch, so θk is Fk-measurable; draw B independent triples with law Q, independently of Fk, and set Fk+1 to be the sigma-algebra generated by Fk and that batch. For a triple w=(t,x1,x), define ζ(θ,w):=2 Dθv(t,x;θ)T(v(t,x;θ)−utc(x∣x1)). For each k,b, set ζk,b:=ζ(θk,(Tk,b,X1,k,b,Xk,b)) and require it to be integrable on the joint training probability space.

Given the fixed initial parameter θ0∈Θ and deterministic step sizes η0,…,ηN−1≥0, for each k=0,…,N−1 set gk:=1B∑b=1Bζk,b,θk+1:=θk−ηkgk. Assume all iterates θ0,…,θN 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 FN, draw X0 from a supplied initial probability law μ0 independently of FN, and return X1=Φ1,0θN(X0), where Φt,sθN solves z˙(t)=v(t,z(t);θN) with z(s)=X0. This last step is well-defined if the field extends to an open time interval containing [0,1], is jointly C∞ in time, state, and parameter, and on every compact parameter set H⊂Θ has uniform constants LH,MH≥0 satisfying ∥v(t,z;θ)−v(t,w;θ)∥2≤LH∥z−w∥2,∥v(t,0;θ)∥2≤MH for t∈[0,1], θ∈H, and z,w∈Rd. Conditional on FN, the output law assigns mass μ0({x:Φ1,0θN(x)∈A}) to each Borel set A⊆Rd. The procedure gives no convergence guarantee for the parameter updates or equality of this output law with a desired data law.

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.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

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 N≥0, the batch size satisfies B≥1, each θk is measurable with respect to the pre-batch history Fk, and the B training triples at round k have the supplied law Q independently of that history. For every k=0,…,N−1, both gk and ∇θLM(θk) are integrable, and

E[gk∣Fk]=∇θLM(θk)almost surely.

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 [0,1] and the uniform state-Lipschitz and origin bounds on every compact parameter set, then its terminal output X1=Φ1,0θN(X0) is well-defined and measurable. For every Borel set A⊆Rd its conditional output law is

P(X1∈A∣FN)=μ0({x:Φ1,0θN(x)∈A})almost surely.

For N=0, there is no batch update, θN=θ0, 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.

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.

[F1]

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.

[F2]

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.

[F3]

A parameterized neural ordinary differential equation: for a fixed parameter, the parameterized ODE is the initial-value problem z˙(t)=v(t,z(t);θ) with the stated initial condition.

[F4]

A globally Lipschitz neural ODE has a global smooth flow: a jointly smooth field on an open time interval containing [0,1], with uniform state-Lipschitz and origin bounds on compact parameter sets, has a unique global flow on [0,1], and its terminal map is jointly smooth in initial state and parameter.

[F5]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: the squared Euclidean loss is ∥a−b∥22=⟨a−b,a−b⟩.

[F6]

The Lebesgue integral is linear on L1(μ): the expectation of a finite sum of integrable random vectors is the sum of their expectations, componentwise.

[F7]

Law or distribution of a random element: the law of a measurable map S under μ0 assigns a Borel set A the measure μ0(S−1(A)).

[F8]

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.

[F9]

Independent random elements have product joint law: independent random elements have the product of their marginal laws as their joint law.

[F10]

Change of variables for expectation: the expectation of an integrable function of a random element equals its integral against the law of that element.

[F11]

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.

[F12]

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.

[F13]

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.

[F14]

Proof

Given: The hypotheses in the Algorithm.

1.1givenF1F2F5F10F14algebra

Fix k and a history for which θk=θ∈Θ and both losses at θ are finite. Choose a compact parameter box H⊂Θ 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 ∣θj′−θj∣GH,jC and ∣θj′−θj∣GH,jM. Integrating these bounds proves local finiteness of both losses throughout the interior of H, so [F2] applies there and gives ∇θLC(θ)=∇θLM(θ). For fixed w=(t,x1,x), put aθ:=v(t,x;θ)−utc(x∣x1). Bilinearity and symmetry [F5] give ∥aθ+εej∥22−∥aθ∥22=⟨aθ+εej−aθ,aθ+εej+aθ⟩. Dividing by ε and taking the limit using differentiability of v shows that the jth coordinate of the sample gradient is 2⟨∂θjv,v−uc⟩, exactly the jth coordinate of ζ(θ,w). Since the triple has law Q, the expectation change-of-variables formula [F10] identifies its Q-mean with ∇θLC(θ). Thus its Q-mean is ∇θLM(θ).

2.1givenF6F8F9F10F11F12step 1.1algebra

Each ζk,b, and hence gk, is integrable by the explicit batch-integrability assumption. For fixed θ, put m(θ):=∫Qζ(θ,w) Q(dw). Joint measurability, Tonelli [F13], and the local derivative majorants make m measurable and finite; at each visited parameter step 1.1 gives m(θk)=∇θLM(θk). Fubini [F11] and the integral triangle inequality [F12] show that each coordinate of m(θk) is integrable, with its absolute expectation bounded by that of the corresponding sample-gradient coordinate. For every A∈Fk, independence and the product-law fact [F9], the change-of-variables formula [F10], and Fubini [F11] give E[1Agk]=E ⁣[1A∫Q⊗B1B∑b=1Bζ(θk,wb) Q⊗B(d(w1,…,wB))]=E[1A∇θLM(θk)], where step 1.1 identifies each fixed-parameter Q-mean and [F6] gives linearity. Thus [F8] makes ∇θLM(θk) a version of E[gk∣Fk]; the batch estimate is unbiased conditionally on its pre-batch history. The arithmetic update is defined for every nonnegative step size when θk∈Θ.

3.1givenF3F4F7∎

For the realized θN 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 (x,θ)↦Φ1,0θ(x). The terminal output is therefore measurable as a function of the independent initial draw and the training history. Conditional on FN, θN is fixed, so [F7] identifies the conditional output law by μ0({x:Φ1,0θN(x)∈A}) for each Borel set A. 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