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 — Examples and Counterexamples
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
- Conditional flow matching for inverse posteriors
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- 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
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- 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
- 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
- Measures and Their Basic Properties
- Metric Spaces
- Metropolis–Hastings kernels
- Mixed Partials, Taylor Formulae, and Extrema
- 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 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
- 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
- Statistical Experiments, Models and Identifiability
- 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
None yet.
4 · Examples, counterexamples and false statements
Posterior summaries close to DRAM with low independent-MH acceptance
Example
Assume the Axiom of Choice for the general density-based Metropolis–Hastings interface. In the stationary-diffusion inverse-problem experiment with observations, noise variance , and prior modes, use the baseline conditional-flow-matching MLP with 800 hidden units. The reported flow-matching independent-Metropolis–Hastings acceptance rates for four different true parameters are respectively , , , and . In this same experiment, the reported posterior means and 95% bands agree with the DRAM reference to between and in relative . The first truth is a prior-predictive tail observation: its normalized radius is , the median training radius is , and only of the two million training observations have a larger radius. This reported case shows that close posterior means and bands do not by themselves imply high independent-Metropolis–Hastings acceptance or establish full posterior accuracy.
Example references
Facts & Assumptions
Given: The reported setting and empirical quantities in the Statement.
Assume AC for the general common-density Metropolis–Hastings construction. The Axiom of Choice, The common-density Metropolis–Hastings ratio
In the stated , , setting, Table 1 reports baseline MLP-800 acceptance rates for the four truths. [Blechschmidt et al., §4.2.1, Fig. 6 and Table 1]
In the same Fig. 6 setting, the paper reports that the MLP's posterior means and 95% bands match the DRAM reference between and in relative . [Blechschmidt et al., §4.2.1]
For the first truth the normalized observation radius is versus median training radius , and the source reports that of the two million training observations have a still larger radius. It describes the sine observation as an extreme prior-predictive tail with almost no nearby training data. [Blechschmidt et al., §4.2.2]
The acceptance figures are for the paper's independent-MH correction, which uses a flow-matching proposal and a density-based acceptance ratio; the general density-ratio interface is stated in the published MH lemma. The common-density Metropolis–Hastings ratio
Verification
Given: [A1], [F1]–[F4] and the empirical qualifications in the Statement.
The source labels its proposal model as a conditional-flow-matching MLP. The four rates in [F1] are all below , while the fourth is and the first is . Thus the table itself records low acceptance across all four truths for this baseline configuration; these are the reported finite-experiment rates, not an asymptotic bound.
By [F2], posterior means and 95% bands are nevertheless close to the DRAM reference in relative . By [F3], the first observation lies far into the empirical prior-predictive tail, which accompanies the lowest rate. Under [A1], [F4] identifies the rates as those of the paper's density-based independent-MH correction. Hence this is a concrete reported case where close mean and band summaries coexist with low independent-MH acceptance; it does not prove that every low-acceptance flow has accurate summaries or that these summaries establish full-distribution accuracy.
Likelihood-free conditional flow matching without an MH correction
Example
Assume the Axiom of Choice. Let a proper prior and forward simulator define a joint prior-predictive law for an unknown and data . Suppose the available interface can draw independent pairs and reference states , but supplies neither an evaluable likelihood density nor an auxiliary nonnegative random estimate with , where the expectation is over auxiliary randomness . Conditional flow matching can train from these joint and reference samples and an independent using the linear path and target velocity , without evaluating . For a fixed query datum , suppose the finite-dimensional prior has a finite-valued Lebesgue density with respect to the sigma-finite Lebesgue measure on the standard-Borel state space equipped with its Borel sigma-algebra. Assume the model has a finite-valued measurable likelihood density at this datum, and set . Require , so the posterior is a proper target with finite-valued density . Suppose the reference law has a Lebesgue density and the learned flow satisfies the separate C hypotheses of the ODE lemma; let be a finite-valued measurable version of the resulting proposal density, with . Its independent proposal kernel is for every and Borel . For pairs with positive forward proposal-flow density , the density-based independent-Metropolis–Hastings acceptance probability is The stated sampling interface does not in general supply this ratio, so it does not by itself give an evaluable density-based correction. In a specified special model the likelihood ratio may cancel or be otherwise known without separate likelihood evaluations; such a case needs no missing likelihood oracle. This example concerns the general limitation of the specified density-based correction; it does not rule out pseudo-marginal correction if an appropriate likelihood estimator is supplied, nor other correction methods with different inputs.
Example references
Facts & Assumptions
Given: A proper prior-predictive simulator for , independent reference sampling from , no evaluable likelihood density and no unbiased nonnegative likelihood estimator, and the density-based independent-MH correction specified in the Statement.
Assume the Axiom of Choice for the posterior-kernel and density-based Metropolis–Hastings interfaces; its implications give Dependent Choice and Countable Choice for the ODE flow. The Axiom of Choice, AC implies DC implies countable choice, The common-density Metropolis–Hastings ratio
Blechschmidt et al. specify that conditional flow matching trains from prior-predictive joint samples and reference draws using a conditional velocity regression objective without evaluating the likelihood. Blechschmidt et al., §3.2 and Remark 3.1
The density-based independent-MH correction requires the unnormalized target posterior density in its target/proposal ratio. The common-density Metropolis–Hastings ratio, Owen, Chapter 11 §11.4
Under the stated dominated model, the unnormalized posterior density is prior density times likelihood; evidence normalization does not remove the likelihood from an MH ratio. Misfit evidence and the potential posterior law
The C flow clause can supply a proposal density by the Jacobian formula, independently of whether the likelihood density is available. Global Lipschitz ODE flows and the C1 density formula
If a distinct exact triangular map satisfies the joint pushforward identity, the conditional transport theorem gives the posterior fiber identity only on a set of full measure; for a fixed query datum the example uses this conclusion only when that datum belongs to this set, unless the fiber identity is separately known there. An exact triangular transport disintegrates to the posterior
The Borel state space is standard Borel, as required by the density-based Metropolis–Hastings supplier. Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel
Verification
Given: [F1]–[F5] and the simulator access limitations in the Statement.
Every training quantity in [F1] is formed from , , independent time, the interpolant and its endpoint difference. These are all available under the specified sampling interface, so no likelihood value is needed to form a CFM training example.
The density-based MH acceptance ratio in [F2] contains the unnormalized posterior target. By [F3] its likelihood contribution is the ratio of likelihoods, which sampling access alone does not supply in general; [F4]'s proposal density does not supply it either. This is an interface limitation rather than an impossibility in every specified model: if the likelihood is independent of the parameter, its ratio is one wherever the forward flow is positive, and the prior and proposal ratios suffice. Thus additional knowledge of an evaluable ratio can permit this correction even without separate likelihood evaluations.
[F5] is a separate route: if the exact joint transport identity is established, the disintegration theorem gives the posterior fiber law on its full-measure set; a fixed query datum must lie in that set unless equality is separately established there. The present example makes no claim that finite training establishes the identity, and supplying a likelihood estimator would change the MH interface.
Sources
- Jan Blechschmidt, Oliver G. Ernst, Moritz Poguntke, and Björn Sprungk, Flow Matching for Fast Posterior Sampling in Bayesian Inverse Problems
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms
- Art B. Owen, Monte Carlo Theory, Methods and Examples, Chapter 11 §11.4