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
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Banach-Space Differential Calculus and Banach Manifolds
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Conformal Prediction and Exchangeable Ranks
- Conjugate families and Gaussian conditioning
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Function-space priors and sample regularity
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hellinger geometry and posterior consistency
- Hellinger stability and posterior discretization
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Identifiability and approximation bias in computational inference
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Inverse maps, identifiability, and stability
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Likelihood potentials and posterior propriety
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Markov Kernels and Markov Chains
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measure-Preserving Systems and Mixing Criteria
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Outward rounded interval and ball arithmetic
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Posterior computation and error accounting
- Posterior propriety and dominated Bayes formula
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Recurrence Transience and Hitting Times for Markov Chains
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- Stationary Markov Chains and Ergodic Limits
- Statistical Experiments, Models and Identifiability
- Statistical, resampling, simulation, and numerical error ledger
- Strongly Continuous Semigroups and Hille Yosida
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
Grönwall inequality with an integrable coefficient
Statement
Let , let , let be continuous, and let be Lebesgue measurable with . If then If instead for every , then
Statement references
Facts & Assumptions
Given: The interval, nonnegative number , continuous nonnegative function , measurable nonnegative integrable coefficient , and one of the integral inequalities in the Statement.
Assume Countable Choice and Dependent Choice for the library fundamental theorem of calculus for absolutely continuous functions. The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
A measurable function with finite integral of its absolute value represents an function; here . The class of integrable functions
The indefinite integral of an function is absolutely continuous. The indefinite integral of an function is absolutely continuous
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
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
The product of absolutely continuous functions is absolutely continuous. The product of two absolutely continuous functions is absolutely continuous
The exponential has derivative ; the mean-value theorem therefore makes Lipschitz on every compact interval. The exponential function is smooth and , Mean value theorem on a closed real interval
At a point where the inner and outer derivatives exist, the ordinary chain rule gives the derivative of their composition; the product rule gives the derivative of a product. The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sum, product, quotient, and chain rules from difference quotients
When , reflection on is a diffeomorphism, so substitution preserves Lebesgue integrals of functions; the endpoints have measure zero. A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions
For , its indefinite integral is differentiable almost everywhere with derivative . The indefinite integral of an function is differentiable almost everywhere
Proof
Given: The hypotheses and notation in the Statement.
If , both hypotheses reduce to , which is the claimed bound. Hence assume and first consider the forward inequality. Define and . Continuity of on the compact interval makes it bounded, so . By [F2], both and are absolutely continuous, and the hypothesis says . The range of is contained in the compact interval ; [F6] makes Lipschitz there. Thus is absolutely continuous by [F4], and is absolutely continuous by [F5].
Since , [F9] gives and almost everywhere. By [F3], the absolutely continuous function 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 since and . Therefore [F3] yields . As and , we obtain , the claimed forward estimate.
By step 1.1, assume . Set and . By [F8], reflection preserves measurability and integrability and gives . Thus . The forward result in steps 1.1–2.1 applies to these continuous and integrable functions. Substituting into its bound gives .
Global Lipschitz ODE flows and the C1 density formula
Statement
Assume Countable Choice and Dependent Choice. Let , let , and let be jointly continuous on the product Euclidean domain. Suppose that for every compact there are nonnegative Lebesgue-measurable such that for almost every , simultaneously for all and , Here means the functions have finite Lebesgue integral of their absolute values. Then for every and there is a unique continuously differentiable solution of on all of . Its terminal map is a bijection with jointly continuous forward and inverse maps in , and for all and ,
In the separate C clause, suppose additionally that the state derivative exists and is jointly continuous. Then for fixed , is a bijection and both and its inverse are continuously differentiable. For a measurable map and a measure , define its image measure by . The derivative solves with Liouville formula Consequently, if a probability measure on has Lebesgue density , meaning for Borel , the image measure has density The global Lipschitz clause alone gives a bi-Lipschitz flow and does not assert a Jacobian density formula.
Statement references
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 C clause.
Countable Choice and Dependent Choice are available. They are used through the integrable-coefficient Grönwall estimate and the C change-of-variables theorem. The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain, Grönwall inequality with an integrable coefficient, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
The space with the supremum norm is complete on every compact interval . Continuous -valued curves on a nonempty compact interval form a complete supremum-metric space
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
The norm of a vector-valued integral is bounded by the integral of the norm. For and integrable when , ; for , is integrable
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 function is absolutely continuous, Monotonicity and nonnegative homogeneity of the nonnegative integral
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 is integrable on and continuous at , then ; in particular a continuous has as a primitive The Banach-valued version is also available: Fundamental theorem of calculus for Banach-valued continuous curves
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
The difference-quotient proof of 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 on that tube gives the variational equation and continuous dependence of its matrix solution. Here, after fixing , the field domain is , which contains such a tube, and steps 2.1 and 4.1 give common existence and continuous dependence. This is the local use of dependence of solutions on initial data.
The chain rule for total derivatives gives the derivative of a composition of Euclidean maps. The chain rule for total derivatives:
The determinant differential and Jacobi formula give for invertible ; trace is cyclic. The determinant differential is at every matrix, and Jacobi's formula holds on the invertible locus, For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix, The trace as the sum of the diagonal entries, For and ,
A C 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
The scalar chain and product rules, exponential derivative, and mean-value theorem justify the integrating-factor identity and show that a differentiable function with zero derivative on an interval is constant. The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sum, product, quotient, and chain rules from difference quotients, The exponential function is smooth and , Mean value theorem on a closed real interval
consists of measurable functions whose absolute values have finite Lebesgue integral. The class of integrable functions
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
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 ; these bounds need not be Riemann integrable. A continuous function on 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.
Fix a compact parameter set . Let . By [F4] and [F12], is continuous and nondecreasing on , and [F6] makes it uniformly continuous. Choose a finite partition with mesh small enough that on each cell. On a cell , with initial value , consider the closed supremum-norm ball of radius about the constant curve . For in that ball define The integrand is continuous by [F13], so is continuous.
Use [F14] throughout to identify the continuous integrands' Riemann and Lebesgue integrals. Put . The triangle inequality and spatial Lipschitz bound with give almost everywhere. Hence so the ball maps into itself. For two curves, [F3] and the Lipschitz bound give . 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 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 .
For solutions with the same and initial values , subtract their integral equations and use [F3] to obtain The forward clause of the integrable-coefficient Grönwall lemma gives the factor , proving uniqueness and the forward Lipschitz bound. Applying the same existence and uniqueness construction to the reversed drift gives a backward solution from any terminal value; uniqueness shows that its time-zero map is the inverse of and the same estimate gives the inverse Lipschitz bound.
From the integral equation and [F3], . The integrable Grönwall estimate therefore gives , uniformly in and for 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, , and by [F6]. Choose a compact containing a convergent sequence and its limit. For , subtract the integral equations along and ; the result is bounded by , where 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.
In the C clause, fix and an initial state . Steps 2.1 and 4.1 give common existence and continuous dependence for nearby initial states on . Their trajectories and the line segments joining corresponding states lie in a common compact state ball, so times that ball is a compact state tube in the field domain. On this tube is bounded and uniformly continuous. The difference-quotient argument in [F7] therefore applies on : the map is for every , and its derivative is the solution of the variational equation. Apply the same argument to the reversed drift ; its time- map is by uniqueness in step 3.1. The two maps are consequently inverses, so is a diffeomorphism.
Write and . Step 5.1 applied on each restricted interval shows that the time- flow is a diffeomorphism, so is invertible for every (and ). The path is continuous. By [F5], is differentiable on with and has the corresponding one-sided endpoint derivatives. For , the total-derivative chain rule [F8] and the invertible-matrix formula in [F9], applied to the variational equation , give using cyclicity of trace; continuity extends this identity to the endpoints. By the scalar product and chain rules in [F11], has derivative zero on , so the mean-value theorem makes it constant on . Its value at is ; hence , the asserted Liouville formula.
If , then for every Borel , Apply [F10] to the diffeomorphism and the nonnegative measurable integrand . This rewrites the last integral as , which proves the stated density formula. The first part of the Statement used no C assumption; therefore global Lipschitzness alone yields only the bi-Lipschitz flow conclusion.
An exact triangular transport disintegrates to the posterior
Statement
Assume the Axiom of Choice. Let be a probability measure on , where , and let be its second marginal. Let be a probability measure on , and let be a probability kernel satisfying for all Borel and . Suppose is Borel and triangular, , with each a Borel bijection, and define the image measure by . If then as probability measures for -almost every . By disintegration on standard Borel spaces, such a kernel exists and is unique outside one -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.
Statement references
Facts & Assumptions
Given: The Axiom of Choice, the joint law , its second marginal , the reference probability , the supplied probability kernel , and the Borel triangular map and exact joint pushforward identity in the Statement.
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
Finite-dimensional Euclidean spaces with their Borel sigma-algebras are standard Borel. Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel
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
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
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
Integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the parameter. Measurability of integration against a kernel
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
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 C density clause is separate. Global Lipschitz ODE flows and the C1 density formula
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.
By [A1], [F1], and [F2], the supplied is a disintegration of given its second coordinate. For Borel , define . Since is Borel, each is the image probability measure . For fixed , [F4] makes product-measurable; applying [F5] to the constant probability kernel makes measurable. Thus [F3] shows that is a probability kernel.
Fix Borel and . By [F6] and the definition of , . The exact joint pushforward identity makes this , and the disintegration identity in the Statement makes it . Hence also disintegrates .
Apply the simultaneous almost-everywhere uniqueness in [F2] to the disintegration kernels and . There is one Borel -null set such that for every , as measures on every Borel subset of . Since , this proves the asserted fiber identity.
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 C clause or its density formula.
Conditional flow matching for inverse posteriors
Definition
Assume the Axiom of Choice. Let , let be a reference probability on , and let be the proper joint law of an unknown and data in a specified Bayesian inverse model. Write for the data marginal and for a posterior-kernel version of the conditional law of given . Assume Choose a jointly measurable parameterized vector-field family , with parameter set for some , whose candidates have finite population squared loss under the training law below.
Declared inputs. Supply independent sampling routines for , , and ; here is Lebesgue probability on the unit interval. Supply an initialiser returning a parameter in or failure; an optimizer update callable returning a parameter in or failure, with each call counting as one optimizer step; a named stopping statistic callable returning a finite real value when evaluation succeeds; a finite step budget and tolerance ; a flow-check callable; and a numerical ODE solver with a declared finite step or tolerance budget . 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 independent triples and form and . Let and evaluate the empirical squared loss If sampling fails, return sampling-failed. Otherwise call ; if it fails or returns a parameter outside , return optimizer-failed with no fitted field. Set and repeat the following steps in order: evaluate and ; if either evaluation fails or either value is nonfinite, return optimizer-failed with no fitted field; if , stop with status criterion-met; if , stop with status budget-exhausted; otherwise call , returning optimizer-failed with no fitted field if the call fails, returns a parameter outside , or yields a nonfinite value, and then set to its output and increase by one. For either successful stopping status, return , its achieved training loss, the last value of , , , and the optimizer status. A finite-data stopping status does not certify .
The population least-squares target is the conditional-expectation class coordinatewise, evaluated at 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 , call the flow checker on and the data-parameter domain containing . 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 . If it does not return pass, return field-regularity-failed with the optimizer record and no terminal samples. Otherwise, for , draw independent and call the declared solver to integrate on with budget . Record the returned finite endpoint as the terminal approximation 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 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 were known to satisfy , the exact transport theorem would imply for -almost every . 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.
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
In a proper Bayesian model, is the joint unknown/data law and is a version of the posterior conditional law; values on a -null set are not fixed by the conditional identity. Misfit evidence and the potential posterior law, Conditional law given a random element
For a square-integrable target, the conditional expectation given is the unique minimizer of the population squared prediction loss, coordinatewise. Conditional expectation given a sigma algebra, Conditional expectation is the l2 orthogonal projection
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
Independent sampling from , , 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
Under [A1], a fitted field jointly continuous in 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
If the exact triangular terminal map has joint pushforward , its exact conditional fibers push to for -almost every datum; this needs the joint identity as a separate hypothesis. An exact triangular transport disintegrates to the posterior
The six-term posterior-computation budget is a telescoping ledger and supplies no learned-flow regression or optimizer bound. Posterior computation error budget
Population regression and exact-flow meaning of conditional flow matching
Statement
Assume the Axiom of Choice. Let , let be a probability measure on , and let be a proper Bayesian joint law on with data marginal and posterior-kernel version . Assume . Let , and be independent with law , where , and has finite second moment. Write and let be the empirical mean of this squared residual over independent training triples. Then the conditional-expectation class admits a measurable representative in and uniquely minimizes over square-integrable predictors measurable in these coordinates, up to almost-sure equality. For every fixed measurable candidate with finite population loss, 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 . If also , then as probability measures outside one -null set. These conclusions make no assertion that finite training or numerical solver success establishes the exact joint pushforward identity.
Statement references
Facts & Assumptions
Given: The hypotheses, training law, independent triples and fixed candidate in the Statement; the algorithm supplies the empirical-objective convention.
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
In a proper Bayesian model, is the joint unknown/data law and is a version of the posterior conditional law; values on a -null set are not fixed by the conditional identity. Misfit evidence and the potential posterior law, Conditional law given a random element
For a square-integrable target, the conditional expectation given is the unique minimizer of the population squared prediction loss, coordinatewise. Conditional expectation given a sigma algebra, Conditional expectation is the l2 orthogonal projection
Under AC, given a disintegration kernel for a standard-Borel random element conditional on a standard-Borel random element , integrating an integrable real function of against that kernel, with zero filling where its absolute integral is infinite, gives a measurable function of 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
Independent sampling from , , 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
Under [A1], a fitted field jointly continuous in 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
If the exact triangular terminal map has joint pushforward , its exact conditional fibers push to for -almost every datum; this needs the joint identity as a separate hypothesis. An exact triangular transport disintegrates to the posterior
The six-term posterior-computation budget is a telescoping ledger and supplies no learned-flow regression or optimizer bound. Posterior computation error budget
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
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].
The inequality makes 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 , up to almost-sure equality. Set , viewed as a random element of . The maps defining and are Borel, and their Euclidean target spaces are standard Borel by [F3]. Thus [A1] and [F8] applied to the joint law of supply a kernel for given . Apply [F3] to each integrable coordinate function : its zero-filled kernel integral defines a real measurable with almost surely. Combining the finitely many coordinates gives the required measurable . For a fixed measurable with finite loss, every sampled squared residual has expectation under the specified product law. Linearity in [F4] therefore gives . This does not apply to substituting a data-dependent fitted field into the fixed-candidate expectation identity.
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 -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.
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 be a separable real Hilbert space, let be compact, and let be the pointwise potential posterior of a proper Bayesian inverse model, with positive finite evidence and finite second moment for every . Let be finite-rank orthogonal projections on with for every , let , and let be proper posteriors defined by declared finite-rank forward/potential approximations on , with finite second moments for every . Write for inclusion and define the posterior model error where 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 .
Let be the prior-predictive joint law of and assume the global prior-predictive moment condition Let be an independent reference probability on with finite second moment, and use the product training law . Let and let be a chosen continuum conditional regression version. For projected endpoints, define and the finite-rank conditional-target discrepancy The conditional expectation versions at must be chosen on all for these suprema. For a measurable vector field , define its pointwise conditional population loss by using the selected conditional-law version. For a finite training sample of size , let 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 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 where is the chosen class and is its population conditional squared regression loss at datum . Let be a certified coupling bound between the numerical endpoint law at solver budget and the exact learned-flow endpoint law. Finally, let be a proposed bound, uniform in and , 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 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 with independent of . The result should derive usable bounds for the posterior model term from the Bayesian potential and discretization hypotheses, establish the uniform-in- 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.
Open problem references
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
- Gerald Teschl, Ordinary Differential Equations and Dynamical Systems, §2.4, Lemma 2.7
- Carnegie Mellon University, ODE existence and uniqueness notes, 2026, Grönwall inequality section
- Gerald Teschl, Ordinary Differential Equations and Dynamical Systems, §§2.3–2.6
- Carnegie Mellon University, ODE existence and uniqueness notes, 2026
- Gerald B. Folland, Real Analysis, 2nd ed., Theorem 2.47
- Rick Durrett, Probability: Theory and Examples, 5th ed.
- S. R. S. Varadhan, Probability Theory, Chapter 4
- Jan Blechschmidt, Oliver G. Ernst, Moritz Poguntke, and Björn Sprungk, Flow Matching for Fast Posterior Sampling in Bayesian Inverse Problems
- Yaron Lipman, Ricky T. Q. Chen, Heli Ben-Hamu, Maximilian Nickel, and Matt Le, Flow Matching for Generative Modeling
- Alexander Tong, Kilian Fatras, Nikolay Malkin, Guillaume Huguet, Yanlei Zhang, Jarrid Rector-Brooks, Guy Wolf, and Yoshua Bengio, Improving and Generalizing Flow-Based Generative Models with Minibatch Optimal Transport
- Percy S. Zhai, So Won Jeong, and Veronika Ročková, Conditional Flow Matching for Bayesian Posterior Inference
- Blechschmidt et al., Flow Matching for Fast Posterior Sampling in Bayesian Inverse Problems
- Lennon J. Shikhman, Discretization and Statistical Consistency of Functional Flow Matching
- Jannis Chemseddine, Paul Hagemann, Gabriele Steidl, and Christian Wald, Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching, Journal of Machine Learning Research 26(141) (2025)