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 for inverse posteriors

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Grönwall inequality with an integrable coefficient

Statement

Let a≤b, let A≥0, let u:[a,b]→[0,∞) be continuous, and let ℓ:[a,b]→[0,∞) be Lebesgue measurable with ∫abℓ(s) ds<∞. If u(t)≤A+∫atℓ(s)u(s) ds(a≤t≤b), then u(t)≤Aexp⁡ ⁣(∫atℓ(s) ds)(a≤t≤b). If instead u(t)≤A+∫tbℓ(s)u(s) ds for every t∈[a,b], then u(t)≤Aexp⁡ ⁣(∫tbℓ(s) ds)(a≤t≤b).

Facts & Assumptions

Given: The interval, nonnegative number A, continuous nonnegative function u, measurable nonnegative integrable coefficient ℓ, and one of the integral inequalities in the Statement.

[A1]

Assume Countable Choice and Dependent Choice for the library fundamental theorem of calculus for absolutely continuous functions. The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[F1]

A measurable function with finite integral of its absolute value represents an L1 function; here ℓ∈L1[a,b]. The class L1(μ) of integrable functions

[F2]

The indefinite integral of an L1 function is absolutely continuous. The indefinite integral of an L1 function is absolutely continuous

[F3]

Under [A1], every absolutely continuous function is the integral of its almost-everywhere derivative, and that derivative is integrable. Fundamental theorem of calculus for absolutely continuous functions

[F4]

If an absolutely continuous function is followed by a Lipschitz function on its image, the composition is absolutely continuous. A Lipschitz function after an absolutely continuous function is absolutely continuous

[F5]

The product of absolutely continuous functions is absolutely continuous. The product of two absolutely continuous functions is absolutely continuous

[F6]

The exponential has derivative er; the mean-value theorem therefore makes r↦e−r Lipschitz on every compact interval. The exponential function is smooth and (exp⁡)′=exp⁡, Mean value theorem on a closed real interval

[F8]

When a<b, reflection on (a,b) is a C1 diffeomorphism, so substitution preserves Lebesgue integrals of L1 functions; the endpoints have measure zero. A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions

[F9]

For g∈L1[a,b], its indefinite integral x↦∫axg(s) ds is differentiable almost everywhere with derivative g. The indefinite integral of an L1 function is differentiable almost everywhere

Proof

Given: The hypotheses and notation in the Statement.

1.1F1F2F4F5F6givenconstruct

If a=b, both hypotheses reduce to u(a)≤A, which is the claimed bound. Hence assume a<b and first consider the forward inequality. Define C(t)=∫atℓ(s) ds and V(t)=A+∫atℓ(s)u(s) ds. Continuity of u on the compact interval makes it bounded, so ℓu∈L1. By [F2], both C and V are absolutely continuous, and the hypothesis says 0≤u(t)≤V(t). The range of C is contained in the compact interval [0,C(b)]; [F6] makes r↦e−r Lipschitz there. Thus e−C is absolutely continuous by [F4], and W(t):=e−C(t)V(t) is absolutely continuous by [F5].

2.1A1F3F7F9step 1.1givenalgebra

Since ℓ,ℓu∈L1[a,b], [F9] gives C′=ℓ and V′=ℓu almost everywhere. By [F3], the absolutely continuous function W has an integrable derivative and is the integral of that derivative after its initial value. Intersecting these full-measure sets, at every remaining point [F7] gives W′=e−C(V′−C′V)=e−Cℓ(u−V)≤0, since u≤V and ℓ≥0. Therefore [F3] yields W(t)−W(a)=∫atW′(s) ds≤0. As W(a)=A and u(t)≤V(t), we obtain u(t)≤V(t)≤AeC(t), the claimed forward estimate.

3.1F8step 1.1step 2.1givenalgebra∎

By step 1.1, assume a<b. Set u~(r)=u(a+b−r) and ℓ~(r)=ℓ(a+b−r). By [F8], reflection preserves measurability and integrability and gives ∫arℓ~(q)u~(q) dq=∫a+b−rbℓ(s)u(s) ds. Thus u~(r)≤A+∫arℓ~(q)u~(q) dq. The forward result in steps 1.1–2.1 applies to these continuous and integrable functions. Substituting r=a+b−t into its bound gives u(t)≤Aexp⁡(∫tbℓ(s) ds).

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Global Lipschitz ODE flows and the C1 density formula

Statement

Assume Countable Choice and Dependent Choice. Let T>0, let d,m≥1, and let b:[0,T]×Rd×Rm→Rd be jointly continuous on the product Euclidean domain. Suppose that for every compact K⊆Rm there are nonnegative Lebesgue-measurable aK,LK∈L1([0,T]) such that for almost every t, simultaneously for all y∈K and x,x′∈Rd, ∣b(t,0,y)∣≤aK(t),∣b(t,x,y)−b(t,x′,y)∣≤LK(t)∣x−x′∣. Here L1([0,T]) means the functions have finite Lebesgue integral of their absolute values. Then for every x0∈Rd and y∈Rm there is a unique continuously differentiable solution xy(⋅;x0) of x˙(t)=b(t,x(t),y),x(0)=x0, on all of [0,T]. Its terminal map Ty(x0):=xy(T;x0) is a bijection with jointly continuous forward and inverse maps in (x0,y), and for all x0,x1 and y∈K, ∣Ty(x0)−Ty(x1)∣≤e∫0TLK(t)dt∣x0−x1∣,∣Ty−1(x0)−Ty−1(x1)∣≤e∫0TLK(t)dt∣x0−x1∣.

In the separate C1 clause, suppose additionally that the state derivative Dxb exists and is jointly continuous. Then for fixed y, Ty is a bijection and both Ty and its inverse are continuously differentiable. For a measurable map S and a measure μ, define its image measure by S#μ(E):=μ(S−1(E)). The derivative Ay(t,x0):=Dx0xy(t;x0) solves A˙y(t,x0)=Dxb(t,xy(t;x0),y)Ay(t,x0),Ay(0,x0)=Id, with Liouville formula det⁡Ay(t,x0)=exp⁡ ⁣(∫0ttr⁡Dxb(s,xy(s;x0),y) ds). Consequently, if a probability measure η on Rd has Lebesgue density q, meaning η(E)=∫Eq(x) dx for Borel E, the image measure Ty#η has density z⟼q(Ty−1(z)) ∣det⁡DTy−1(z)∣. The global Lipschitz clause alone gives a bi-Lipschitz flow and does not assert a Jacobian density formula.

Facts & Assumptions

Given: Countable Choice, Dependent Choice, and the jointly continuous drift and integrable uniform-in-space bounds in the Statement; the additional spatial differentiability assumptions only in its C1 clause.

[F1]

The space C(J,Rd) with the supremum norm is complete on every compact interval J. Continuous Rn-valued curves on a nonempty compact interval form a complete supremum-metric space

[F2]

Every contraction of a nonempty complete metric space has a unique fixed point, obtained by iterating from any initial point. A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point

[F4]

The indefinite integral of an integrable scalar function is continuous and absolutely continuous; integrals of nonnegative functions are nonnegative and monotone. The indefinite integral of an L1 function is absolutely continuous, Monotonicity and nonnegative homogeneity of the nonnegative integral

[F5]

The primitive of a continuous Euclidean-valued curve is continuously differentiable, coordinatewise by the scalar fundamental theorem, with one-sided derivatives at the endpoints. The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive The Banach-valued version is also available: Fundamental theorem of calculus for Banach-valued continuous curves

[F6]

A continuous real function on a compact metric space is uniformly continuous. Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous

[F7]

The difference-quotient proof of C1 dependence applies on a common compact time interval when a compact state tube around the reference trajectory lies in the field domain and solutions through nearby initial states exist there; continuity of Dxb on that tube gives the variational equation and continuous dependence of its matrix solution. Here, after fixing y, the field domain is [0,T]×Rd, which contains such a tube, and steps 2.1 and 4.1 give common existence and continuous dependence. This is the local use of C1 dependence of solutions on initial data.

[F8]

The chain rule for total derivatives gives the derivative of a composition of C1 Euclidean maps. The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)

[F10]

A C1 diffeomorphism of open Euclidean sets satisfies the change-of-variables formula for every nonnegative Lebesgue-measurable integrand under Countable Choice. A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions

[F12]

L1([0,T]) consists of measurable functions whose absolute values have finite Lebesgue integral. The class L1(μ) of integrable functions

[F13]

Joint continuity is continuity for the product Euclidean topology and is preserved by composition with a continuous curve. Continuity of a map of topological spaces at a point and globally

[F14]

A continuous scalar function on a compact interval is bounded and Riemann integrable; under Countable Choice its Riemann and Lebesgue integrals agree. Apply this to each coordinate and to the norm of every continuous vector integrand below. Thus the componentwise vector integral and the norm integral in [F3] may be compared using Lebesgue almost-everywhere inequalities and the integrable bounds aK,LK; these bounds need not be Riemann integrable. A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion, A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral

Proof

Given: The drift, bounds, axioms and notation in the Statement.

1.1F4F5F6F12F13givenconstruct

Fix a compact parameter set K. Let C(t)=∫0tLK(s)ds. By [F4] and [F12], C is continuous and nondecreasing on [0,T], and [F6] makes it uniformly continuous. Choose a finite partition 0=t0<⋯<tN=T with mesh small enough that C(ti+1)−C(ti)=∫titi+1LK(s)ds≤1/2 on each cell. On a cell J=[ti,ti+1], with initial value zi, consider the closed supremum-norm ball of radius R=2(1+∣zi∣+∫JaK) about the constant curve zi. For z in that ball define Tz(t)=zi+∫titb(s,z(s),y) ds. The integrand is continuous by [F13], so Tz is continuous.

2.1A1F1F2F3F5F14step 1.1givenalgebra

Use [F14] throughout to identify the continuous integrands' Riemann and Lebesgue integrals. Put qJ=∫JLK≤1/2. The triangle inequality and spatial Lipschitz bound with x′=0 give ∣b(s,z(s),y)∣≤aK(s)+LK(s)∣z(s)∣ almost everywhere. Hence ∥Tz−zi∥∞≤∫JaK+qJ(∣zi∣+R)≤R, so the ball maps into itself. For two curves, [F3] and the Lipschitz bound give ∥Tz−Tw∥∞≤qJ∥z−w∥∞. The ball is nonempty and complete by [F1], so [F2] gives a unique fixed point, which solves the integral equation and hence the ODE on J by [F5]. Applying this construction successively on the finite partition, with each cell's endpoint as the next initial value, gives a solution on all of [0,T].

3.1A1F3F14step 2.1givenalgebra

For solutions x(t),x′(t) with the same y and initial values x0,x0′, subtract their integral equations and use [F3] to obtain ∣x(t)−x′(t)∣≤∣x0−x0′∣+∫0tLK(s)∣x(s)−x′(s)∣ ds. The forward clause of the integrable-coefficient Grönwall lemma gives the factor exp⁡(∫0tLK), proving uniqueness and the forward Lipschitz bound. Applying the same existence and uniqueness construction to the reversed drift bˉ(s,z,y)=−b(T−s,z,y) gives a backward solution from any terminal value; uniqueness shows that its time-zero map is the inverse of Ty and the same estimate gives the inverse Lipschitz bound.

4.1A1F3F4F6F14step 3.1givenalgebra

From the integral equation and [F3], ∣xy(t;x0)∣≤∣x0∣+∫0TaK+∫0tLK(s)∣xy(s;x0)∣ds. The integrable Grönwall estimate therefore gives ∣xy(t;x0)∣≤(∣x0∣+∫0TaK)exp⁡(∫0TLK), uniformly in t and for x0,y in compact sets. Thus all such trajectories lie in a common compact state ball. The drift is uniformly continuous on the product of this ball, [0,T], and K by [F6]. Choose a compact K containing a convergent sequence yn and its limit. For (xn,yn)→(x,y), subtract the integral equations along xyn(⋅;xn) and xy(⋅;x); the result is bounded by ∣xn−x∣+Tω(∣yn−y∣)+∫0tLK(s)∣xyn(s;xn)−xy(s;x)∣ds, where ω(r)→0 is a modulus from [F6]. Grönwall proves uniform convergence of the paths. Repeating for the reversed drift proves continuity of the inverse map in initial value and parameter.

5.1F7F8step 2.1step 3.1step 4.1given

In the C1 clause, fix y and an initial state x0. Steps 2.1 and 4.1 give common existence and continuous dependence for nearby initial states on [0,T]. Their trajectories and the line segments joining corresponding states lie in a common compact state ball, so [0,T] times that ball is a compact state tube in the field domain. On this tube Dxb is bounded and uniformly continuous. The difference-quotient argument in [F7] therefore applies on [0,T]: the map x0↦xy(t;x0) is C1 for every t, and its derivative is the solution of the variational equation. Apply the same argument to the reversed drift bˉ(s,x,y)=−b(T−s,x,y); its time-T map is Ty−1 by uniqueness in step 3.1. The two maps are consequently C1 inverses, so Ty is a C1 diffeomorphism.

6.1F5F7F8F9F11step 5.1givenalgebra

Write B(t)=Dxb(t,xy(t;x0),y) and A(t)=Ay(t,x0). Step 5.1 applied on each restricted interval [0,t] shows that the time-t flow is a C1 diffeomorphism, so A(t) is invertible for every t (and A(0)=Id). The path B is continuous. By [F5], G(t):=∫0ttr⁡B(s) ds is differentiable on (0,T) with G′(t)=tr⁡B(t) and has the corresponding one-sided endpoint derivatives. For 0<t<T, the total-derivative chain rule [F8] and the invertible-matrix formula in [F9], applied to the variational equation A′=BA, give ddtdet⁡A(t)=Ddet⁡(A(t))[A′(t)]=det⁡A(t)tr⁡(A(t)−1B(t)A(t))=det⁡A(t)tr⁡B(t), using cyclicity of trace; continuity extends this identity to the endpoints. By the scalar product and chain rules in [F11], e−G(t)det⁡A(t) has derivative zero on (0,T), so the mean-value theorem makes it constant on [0,T]. Its value at t=0 is 1; hence det⁡A(t)=exp⁡(G(t)), the asserted Liouville formula.

7.1A1F10step 5.1givenalgebra∎

If η(dx)=q(x)dx, then for every Borel E⊆Rd, Ty#η(E)=∫Ty−1(E)q(x)dx. Apply [F10] to the diffeomorphism Ty−1 and the nonnegative measurable integrand x↦1Ty−1(E)(x)q(x). This rewrites the last integral as ∫Eq(Ty−1(z))∣det⁡DTy−1(z)∣dz, which proves the stated density formula. The first part of the Statement used no C1 assumption; therefore global Lipschitzness alone yields only the bi-Lipschitz flow conclusion.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

An exact triangular transport disintegrates to the posterior

Statement

Assume the Axiom of Choice. Let π be a probability measure on Rd×Rm, where d,m≥1, and let πY(B):=π(Rd×B) be its second marginal. Let η be a probability measure on Rd, and let y↦πy be a probability kernel satisfying π(A×B)=∫Bπy(A) πY(dy) for all Borel A⊆Rd and B⊆Rm. Suppose T:Rd×Rm→Rd×Rm is Borel and triangular, T(x,y)=(Ty(x),y), with each Ty a Borel bijection, and define the image measure by T#μ(E):=μ(T−1(E)). If T#(η⊗πY)=π, then Ty#η=πy as probability measures for πY-almost every y. By disintegration on standard Borel spaces, such a kernel πy exists and is unique outside one πY-null set. In a proper Bayesian model, when π is the joint parameter/data law, this conditional kernel is the posterior kernel; the conclusion says an exact triangular transport maps the reference law to the data-conditioned posterior for almost every datum.

For the triangular terminal flow in the preceding ODE lemma, joint continuity supplies the Borel map and each fiber is a bijection. The theorem requires only the exact joint pushforward identity; it does not require a density or a Jacobian formula.

Facts & Assumptions

Given: The Axiom of Choice, the joint law π, its second marginal πY, the reference probability η, the supplied probability kernel πy, and the Borel triangular map and exact joint pushforward identity in the Statement.

[A1]

Assume the Axiom of Choice for standard-Borel disintegration existence and simultaneous almost-everywhere uniqueness; the choice-implication theorem gives Dependent Choice and Countable Choice from AC for the ODE supplier. The Axiom of Choice, AC implies DC implies countable choice, Disintegration of a joint law on standard borel spaces

[F1]

Finite-dimensional Euclidean spaces with their Borel sigma-algebras are standard Borel. Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel

[F2]

For a probability measure on a product of standard-Borel spaces, a probability-kernel disintegration satisfies the rectangle identity and is unique outside one common marginal-null set. The theorem also gives the corresponding iterated-integral identity for nonnegative product-measurable functions. Disintegration of a joint law on standard borel spaces

[F3]

A probability kernel has a probability-measure section at every parameter, and each fixed-set evaluation is measurable in the parameter. Measure kernel and probability kernel

[F4]

Borel coordinate maps and finite coordinate permutations are measurable for the relevant finite-product Borel sigma-algebras, which agree with the product sigma-algebras. The product sigma-algebra and its finite iterates, A measurable function between measurable spaces, Coordinate maps and permutations are measurable on finite products

[F5]

Integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the parameter. Measurability of integration against a kernel

[F6]

The product of probability measures has the rectangle formula, and Tonelli identifies its nonnegative integral with either iterated integral. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F7]

Under the Countable Choice and Dependent Choice supplied by [A1], the stated ODE hypotheses give a jointly continuous triangular terminal flow with bijective fibers; the optional C1 density clause is separate. Global Lipschitz ODE flows and the C1 density formula

[F8]

In a proper Bayesian model on standard-Borel parameter and data spaces, the data-indexed conditional posterior kernel is a version of the posterior and is unique as a probability measure outside one data-marginal-null set. Misfit evidence and the potential posterior law

Proof

Given: [A1], [F1]–[F8], and the hypotheses and notation in the Statement.

1.1A1F1F2F3F4F5givenconstruct

By [A1], [F1], and [F2], the supplied πy is a disintegration of π given its second coordinate. For Borel A⊆Rd, define κy(A):=η({x:Ty(x)∈A})=∫Rd1A(Ty(x)) η(dx). Since Ty is Borel, each κy is the image probability measure Ty#η. For fixed A, [F4] makes (y,x)↦1A(Ty(x)) product-measurable; applying [F5] to the constant probability kernel y↦η makes y↦κy(A) measurable. Thus [F3] shows that κ is a probability kernel.

2.1F2F4F6step 1.1givenalgebra

Fix Borel A⊆Rd and B⊆Rm. By [F6] and the definition of κy, ∫Bκy(A) πY(dy)=(η⊗πY)({(x,y):Ty(x)∈A, y∈B})=(η⊗πY)(T−1(A×B)). The exact joint pushforward identity makes this π(A×B), and the disintegration identity in the Statement makes it ∫Bπy(A) πY(dy). Hence κ also disintegrates π.

3.1F2step 2.1given

Apply the simultaneous almost-everywhere uniqueness in [F2] to the disintegration kernels κ and πy. There is one Borel πY-null set N such that for every y∉N, κy=πy as measures on every Borel subset of Rd. Since κy=Ty#η, this proves the asserted fiber identity.

4.1F7F8step 1.1step 3.1given∎

For a terminal map satisfying the ODE flow hypotheses, [F7] gives joint continuity and bijectivity of every fiber, so the exact pushforward case is covered by steps 1.1–3.1. By [F8], when π is the proper Bayesian parameter/data joint law, the conditional kernel is a posterior version. No step uses the separate C1 clause or its density formula.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Conditional flow matching for inverse posteriors

Definition

Assume the Axiom of Choice. Let d,m,n,B≥1, let η be a reference probability on Rd, and let π be the proper joint law of an unknown X1∈Rd and data Y∈Rm in a specified Bayesian inverse model. Write πY for the data marginal and πy for a posterior-kernel version of the conditional law of X1 given Y=y. Assume ∫Rd×Rm∣x1∣2 π(dx1,dy)+∫Rd∣x0∣2 η(dx0)<∞. Choose a jointly measurable parameterized vector-field family vθ:[0,1]×Rd×Rm→Rd, with parameter set Θ⊆Rp for some p≥1, whose candidates have finite population squared loss under the training law below.

Declared inputs. Supply independent sampling routines for Unif⁡[0,1], η, and π; here Unif⁡[0,1] is Lebesgue probability on the unit interval. Supply an initialiser Init returning a parameter in Θ or failure; an optimizer update callable Update(k,θ,L^n,Dn) returning a parameter in Θ or failure, with each call counting as one optimizer step; a named stopping statistic callable S(k,θ,L^n,Dn) returning a finite real value when evaluation succeeds; a finite step budget M≥1 and tolerance εopt>0; a flow-check callable; and a numerical ODE solver with a declared finite step or tolerance budget h. Every callable must return its specified value or a failure status in finite time. Any randomization used by these callables is part of the declared input.

Training and optimizer instructions. Draw n independent triples (ti,X0i,(X1i,Yi))∼Unif⁡[0,1]⊗η⊗π, and form Xti=(1−ti)X0i+tiX1i and Vi=X1i−X0i. Let Dn=((ti,Xti,Yi,Vi))i=1n and evaluate the empirical squared loss L^n(θ)=1n∑i=1n∣vθ(ti,Xti,Yi)−Vi∣2. If sampling fails, return sampling-failed. Otherwise call Init; if it fails or returns a parameter outside Θ, return optimizer-failed with no fitted field. Set k=0 and repeat the following steps in order: evaluate L^n(θk) and S(k,θk,L^n,Dn); if either evaluation fails or either value is nonfinite, return optimizer-failed with no fitted field; if S≤εopt, stop with status criterion-met; if k=M, stop with status budget-exhausted; otherwise call Update(k,θk,L^n,Dn), returning optimizer-failed with no fitted field if the call fails, returns a parameter outside Θ, or yields a nonfinite value, and then set θk+1 to its output and increase k by one. For either successful stopping status, return v^=vθk, its achieved training loss, the last value of S, k, M, εopt and the optimizer status. A finite-data stopping status does not certify v^=v∗.

The population least-squares target is the conditional-expectation class v∗(t,x,y)=E[X1−X0∣σ(t,Xt,Y)] coordinatewise, evaluated at (t,x,y) through a chosen measurable representative. A conditional expectation is only an almost-sure equivalence class, so this formula does not specify an off-support pointwise extension.

Flow and sampling instructions. For a query datum y, call the flow checker on v^ and the data-parameter domain containing y. It returns pass only when it certifies all hypotheses of the ODE flow lemma, including joint continuity and the integrable global spatial-Lipschitz and origin-growth bounds on compact data-parameter sets containing y. If it does not return pass, return field-regularity-failed with the optimizer record and no terminal samples. Otherwise, for j=1,…,B, draw independent Z0j∼η and call the declared solver to integrate on 0≤t≤1 Z˙tj=v^(t,Ztj,y),Z0j, with budget h. Record the returned finite endpoint as the terminal approximation Z^1j only when the solver reports success; treat a success response with a nonfinite endpoint as a failed integration. Also record each status and any certified solver error estimate, marking an unavailable estimate unquantified. Continue through all B calls after a solver failure. Return the successful terminal approximations and all per-call records, together with the field and optimizer records; the overall status is completed if every integration succeeds and solver-failed otherwise. A sampling-call failure returns sampling-failed and the records collected so far.

If the exact triangular flow of v^ were known to satisfy T#(η⊗πY)=π, the exact transport theorem would imply Ty#η=πy for πY-almost every y. Finite regression loss, optimizer termination, and solver success alone do not establish this joint pushforward identity or exact posterior sampling. Record posterior model, discretization, kernel, burn-in, Monte Carlo and solver components under the declared posterior-computation error budget when applicable. The budget does not supply a learned-flow regression or optimizer-error estimate; report those separately as measured or certified quantities, and mark unavailable quantities unquantified rather than zero.

Definition references

Facts & Assumptions

Given: AC; proper joint posterior law π on finite-dimensional unknown/data spaces; independent reference law η; finite second moments; a chosen measurable vector-field family with finite squared population loss; finite optimizer and ODE budgets; and a numerical solver that returns either an endpoint or an explicit status.

[A1]

AC is assumed for the conditional-expectation projection and standard-Borel posterior-kernel interfaces. Its implications include Countable Choice and Dependent Choice for the flow lemma. The Axiom of Choice, AC implies DC implies countable choice, Conditional expectation is the l2 orthogonal projection, Misfit evidence and the potential posterior law

[F1]

In a proper Bayesian model, π is the joint unknown/data law and πy is a version of the posterior conditional law; values on a πY-null set are not fixed by the conditional identity. Misfit evidence and the potential posterior law, Conditional law given a random element

[F2]

For a square-integrable target, the conditional expectation given σ(t,Xt,Y) is the unique L2 minimizer of the population squared prediction loss, coordinatewise. Conditional expectation given a sigma algebra, Conditional expectation is the l2 orthogonal projection

[F3]

Under AC, a conditional expectation given a random element in a standard Borel space has a measurable representative as a function of that conditioning element; the identity with the conditional expectation holds almost surely. Conditional expectation as a measurable function of the conditioning variable, Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel

[F4]

Independent sampling from Unif⁡[0,1], η, and π gives the stated product training law; product probabilities have the rectangle formula, and the expectation of a finite sum of integrable losses is the sum of their expectations. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, The Lebesgue integral is linear on L1(μ)

[F5]

Under [A1], a fitted field jointly continuous in (t,x,y) and satisfying the ODE lemma's compact-parameter-uniform integrable global spatial-Lipschitz and origin-growth bounds, holding almost everywhere in time simultaneously for all states and parameters in each compact set, has a unique global flow and a jointly continuous terminal map; these facts do not certify that its output law is the target. Global Lipschitz ODE flows and the C1 density formula

[F6]

If the exact triangular terminal map has joint pushforward π, its exact conditional fibers push η to πy for πY-almost every datum; this needs the joint identity as a separate hypothesis. An exact triangular transport disintegrates to the posterior

[F7]

The six-term posterior-computation budget is a telescoping ledger and supplies no learned-flow regression or optimizer bound. Posterior computation error budget

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Population regression and exact-flow meaning of conditional flow matching

Statement

Assume the Axiom of Choice. Let d,m,n≥1, let η be a probability measure on Rd, and let π be a proper Bayesian joint law on Rd×Rm with data marginal πY and posterior-kernel version πy. Assume ∫∣x0∣2η(dx0)+∫∣x1∣2π(dx1,dy)<∞. Let t, X0 and (X1,Y) be independent with law Unif⁡[0,1]⊗η⊗π, where Xt=(1−t)X0+tX1, and V=X1−X0 has finite second moment. Write L(v):=E∣v(t,Xt,Y)−V∣2 and let L^n(v) be the empirical mean of this squared residual over n≥1 independent training triples. Then the conditional-expectation class v∗(t,Xt,Y)=E[V∣σ(t,Xt,Y)] admits a measurable representative in (t,x,y) and uniquely minimizes L over square-integrable predictors measurable in these coordinates, up to almost-sure equality. For every fixed measurable candidate v with finite population loss, E[L^n(v)]=L(v). This expectation identity is for a fixed candidate, not a data-dependent fitted field.

If a fitted field satisfies all hypotheses of the global ODE flow lemma, it has an exact triangular terminal map T(x,y)=(Ty(x),y). If also T#(η⊗πY)=π, then Ty#η=πy as probability measures outside one πY-null set. These conclusions make no assertion that finite training or numerical solver success establishes the exact joint pushforward identity.

Facts & Assumptions

Given: The hypotheses, training law, independent triples and fixed candidate in the Statement; the algorithm supplies the empirical-objective convention.

[A1]

AC is assumed for the conditional-expectation projection and standard-Borel posterior-kernel interfaces. Its implications include Countable Choice and Dependent Choice for the flow lemma. The Axiom of Choice, AC implies DC implies countable choice, Conditional expectation is the l2 orthogonal projection, Misfit evidence and the potential posterior law

[F1]

In a proper Bayesian model, π is the joint unknown/data law and πy is a version of the posterior conditional law; values on a πY-null set are not fixed by the conditional identity. Misfit evidence and the potential posterior law, Conditional law given a random element

[F2]

For a square-integrable target, the conditional expectation given σ(t,Xt,Y) is the unique L2 minimizer of the population squared prediction loss, coordinatewise. Conditional expectation given a sigma algebra, Conditional expectation is the l2 orthogonal projection

[F3]

Under AC, given a disintegration kernel for a standard-Borel random element U conditional on a standard-Borel random element W, integrating an integrable real function of U against that kernel, with zero filling where its absolute integral is infinite, gives a measurable function of W representing the conditional expectation almost surely. Finite-dimensional Euclidean Borel spaces are standard Borel. Conditional expectation as a measurable function of the conditioning variable, Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel

[F4]

Independent sampling from Unif⁡[0,1], η, and π gives the stated product training law; product probabilities have the rectangle formula, and the expectation of a finite sum of integrable losses is the sum of their expectations. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, The Lebesgue integral is linear on L1(μ)

[F5]

Under [A1], a fitted field jointly continuous in (t,x,y) and satisfying the ODE lemma's compact-parameter-uniform integrable global spatial-Lipschitz and origin-growth bounds, holding almost everywhere in time simultaneously for all states and parameters in each compact set, has a unique global flow with bijective fibers and a jointly continuous terminal map; these facts do not certify that its output law is the target. Global Lipschitz ODE flows and the C1 density formula

[F6]

If the exact triangular terminal map has joint pushforward π, its exact conditional fibers push η to πy for πY-almost every datum; this needs the joint identity as a separate hypothesis. An exact triangular transport disintegrates to the posterior

[F7]

The six-term posterior-computation budget is a telescoping ledger and supplies no learned-flow regression or optimizer bound. Posterior computation error budget

[F8]

Under AC, the joint probability law of two standard-Borel random elements admits a probability disintegration kernel giving the conditional law of the first given the second. Disintegration of a joint law on standard borel spaces

[F0]

The training law, empirical objective and procedure are as specified in Conditional flow matching for inverse posteriors.

Proof

Given: The hypotheses in the Statement and the empirical-objective convention [F0].

1.1A1F0F2F3F4F8givenalgebra

The inequality ∣V∣2≤2∣X1∣2+2∣X0∣2 makes V square-integrable. By [A1] and [F2], coordinatewise conditional expectation uniquely minimizes the sum of squared prediction errors among square-integrable predictors measurable with respect to σ(t,Xt,Y), up to almost-sure equality. Set W=(t,Xt,Y), viewed as a random element of R1+d+m. The maps defining V and W are Borel, and their Euclidean target spaces are standard Borel by [F3]. Thus [A1] and [F8] applied to the joint law of (V,W) supply a kernel K(w,du) for V given W=w. Apply [F3] to each integrable coordinate function u↦uj: its zero-filled kernel integral defines a real measurable vj∗(w) with vj∗(W)=E[Vj∣σ(W)] almost surely. Combining the finitely many coordinates gives the required measurable v∗(t,x,y). For a fixed measurable v with finite loss, every sampled squared residual has expectation L(v) under the specified product law. Linearity in [F4] therefore gives E[L^n(v)]=n−1∑i=1nL(v)=L(v). This does not apply to substituting a data-dependent fitted field into the fixed-candidate expectation identity.

2.1F1F5F6F7given∎

For a fitted field satisfying all stated ODE hypotheses, [F5] gives its exact flow, joint continuity of the terminal map and bijective fibers. If that map also satisfies the exact joint pushforward hypothesis, [F1] and [F6] identify its image of η with the posterior kernel outside one πY-null set. A finite optimizer status or a solver-success response supplies neither that joint identity nor an exact numerical endpoint. The bookkeeping budget in [F7] supplies no missing regression or optimizer estimate.

Open problemQuestion: Literature-sourcedProof: Not applicable‡ sources checked 2026-10-22‡ not proved hereOpen item page →
‡ Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Dimension-uniform conditional flow error for function-valued Bayesian posteriors

Open problem

Assume the Axiom of Choice. Its implications supply Dependent Choice and Countable Choice for the finite-dimensional ODE flow assumptions.

Let H be a separable real Hilbert space, let K⊆Rm be compact, and let y↦Πy be the pointwise potential posterior of a proper Bayesian inverse model, with positive finite evidence and finite second moment for every y∈K. Let Pn be finite-rank orthogonal projections on H with Pnx→x for every x∈H, let Hn=PnH, and let Πny be proper posteriors defined by declared finite-rank forward/potential approximations on Hn, with finite second moments for every y∈K. Write in:Hn↪H for inclusion and define the posterior model error epost,n:=sup⁡y∈KW2,H(in#Πny,Πy), where W2,H(μ,ν) is the infimum, over joint laws with marginals μ,ν, of the square root of the expected squared Hilbert distance. This term includes both posterior-potential and finite-rank model error; the known Hellinger potential/discretization estimates would need an explicit moment or tail argument to control it in W2.

Let π be the prior-predictive joint law of (X1,Y) and assume the global prior-predictive moment condition ∫H×Rm∥x1∥H2 π(dx1,dy)<∞. Let η be an independent reference probability on H with finite second moment, and use the product training law Unif⁡[0,1]⊗η⊗π. Let Xt=(1−t)X0+tX1 and let v∗(t,Xt,Y)=E[X1−X0∣σ(t,Xt,Y)] be a chosen continuum conditional regression version. For projected endpoints, define vn∗(t,PnXt,Y)=E[Pn(X1−X0)∣σ(t,PnXt,Y)] and the finite-rank conditional-target discrepancy etarget,n:=sup⁡y∈K(∫01E ⁣[∥Pnv∗(t,Xt,y)−vn∗(t,PnXt,y)∥H2∣Y=y]dt)1/2. The conditional expectation versions at Y=y must be chosen on all y∈K for these suprema. For a measurable vector field v: [0,1]×Hn×K→Hn, define its pointwise conditional population loss by Ln,y(v):=∫01E ⁣[∥v(t,PnXt,y)−Pn(X1−X0)∥H2∣Y=y]dt, using the selected conditional-law version. For a finite training sample of size N, let vˉn,N be an empirical-risk minimizer in the specified vector-field class, when it exists. On realizations where the declared optimizer returns a field (status criterion-met or budget-exhausted), let v^n,N be that field; the optimizer-failed case has no learned field and is outside this formulation. Define the uniform conditional statistical and optimizer excess-risk terms by estat,n,N2:=sup⁡y∈K[Ln,y(vˉn,N)−inf⁡v∈VnLn,y(v)],eopt,n,N2:=sup⁡y∈K[Ln,y(v^n,N)−Ln,y(vˉn,N)]+ where Vn is the chosen class and Ln,y is its population conditional squared regression loss at datum y. Let esolver,n,N,h be a certified W2 coupling bound between the numerical endpoint law at solver budget h and the exact learned-flow endpoint law. Finally, let Λ be a proposed bound, uniform in n and y∈K, for the time-integrated spatial Lipschitz constants of the learned drifts.

Find checkable assumptions under which the learned finite-rank flow defines a posterior sampler Π^n,N,hy and, for each training realization satisfying explicit risk certificates (or with a stated probability over training data), satisfies a dimension-uniform bound of the form sup⁡y∈KW2,H(in#Π^n,N,hy,Πy)≤epost,n+esolver,n,N,h+CeΛ(etarget,n+estat,n,N+eopt,n,N), with C independent of n. The result should derive usable bounds for the posterior model term from the Bayesian potential and discretization hypotheses, establish the uniform-in-y training terms from prior-predictive data, and state the required flow regularity and numerical coupling assumptions. It must not assume that a finite-sample learned field or numerical solver already has the exact joint pushforward property; that property is the conclusion to be certified through the displayed error terms.

Status

Status reviewed 2026-10-19 against the inspected full texts. The older broad wording that function-space flow-matching error theory is simply open is stale: Blechschmidt et al. give finite-dimensional inverse-problem CFM theory and function-valued numerical experiments; Zhai, Jeong, and Ročková prove finite-dimensional posterior Wasserstein accuracy in expectation and uniform-in-data consistency under compact-domain, bounded-velocity, smooth-flow and Sobolev assumptions; Shikhman proves generic Hilbert-space functional-flow discretization and end-to-end Wasserstein bounds with sensing, excess-risk, optimizer and solver terms under controlled reconstruction and stability assumptions. Shikhman's stated scope excludes infinite-dimensional likelihoods and arbitrary refinement, while Blechschmidt et al. identify a function-space Wasserstein error analysis as future work. The precise combined posterior-potential, function-space, finite-rank and uniform-conditional result formulated above is not supplied by these inspected sources. This is a bounded source review, not an exhaustive proof that no resolution exists.

4 · Examples, counterexamples and false statements

None yet.

Sources