Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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 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.

Depends on

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