How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Conditional flow matching and transport paths — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional flow matching and transport paths
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- 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
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed effects and longitudinal models
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- 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
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- 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 Spectral Theorem, Positive Operators and Singular Value Decomposition
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- 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
A one-dimensional Gaussian prior-to-data conditional interpolation
Example
Assume the Axiom of Choice. Fix and , let , and set Then , with density and a conditional velocity field is For every fixed , the particle path is a straight line from to . The endpoint map is quadratic-cost optimal from to , and its squared transport cost is .
Example references
Facts & Assumptions
Given: AC, , , and a standard normal random variable .
The Axiom of Choice is the assertion that every family of nonempty sets has a choice function (The Axiom of Choice); it is required by the Gaussian-law and density suppliers used by [F1].
The Gaussian conditional affine map is quadratic-cost optimal: under AC, for , fixed , and , the affine conditional Gaussian path has mean , scale , the stated Gaussian density and velocity, and a quadratic-cost optimal endpoint map with cost .
Verification
Given: The hypotheses in the Example.
Apply [F1] with and . It gives the law and density of , the field , and the optimality of with cost .
For fixed , differentiation gives . Substituting into the displayed field yields which is that particle derivative. Since , its dependence on is affine and the endpoints are and .
Diagram
The graph uses and . The horizontal coordinate is time and the vertical coordinate is particle state . The three line segments are the exact paths for starting values , evaluated from . The plotted endpoints are the images of those starting values under ; the diagram illustrates the formulas and is not used in the verification.
Source notes
The two sources present the same scalar Gaussian interpolation and its affine velocity. The optimality and cost statement here are inherited from the complete coupling proof in the Gaussian theorem, not from the diagram.
A mixture of straight Gaussian paths has a nonlinear marginal velocity
Example
Assume the Axiom of Choice and fix and . Let the endpoint law assign probability to each endpoint and . For each endpoint, use the one-dimensional Gaussian path with For either endpoint and each fixed , the conditional particle trajectory is a straight line. The marginal density is and its marginal velocity field, defined by averaging the conditional velocity against the endpoint density at fixed , is The denominator in the definition of is positive for every real input. The density is strictly positive, and on . For every , is nonlinear.
Example references
Facts & Assumptions
Given: AC, , , the two-point endpoint law, and the Gaussian conditional path in the Example.
The Axiom of Choice is the assertion that every family of nonempty sets has a choice function (The Axiom of Choice); it is required by the Gaussian-law and density suppliers used by [F1].
The Gaussian conditional affine map is quadratic-cost optimal: under AC, for each fixed endpoint the mean-linear Gaussian path has the displayed density and affine conditional velocity, and its density and flux satisfy the conditional continuity equation.
Probability paths and velocity fields: the marginal density is and its velocity, where and the flux is finite, is .
A conditional mixture is a probability path: the endpoint mixture of normalized conditional densities is a probability density at each time.
A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a compact metric space is bounded.
Conditional continuity equations pass to the marginal path: if the conditional PDE derivatives admit the stated local integrable endpoint majorant, then the marginal density and flux satisfy the continuity equation.
The real exponential function and the number by a power series: the real exponential is defined on every real input by its convergent power series.
The exponential addition formula : for all real .
The exponential is positive and satisfies : and for every real .
Verification
Given: The hypotheses in the Example.
Apply [F1] to the two endpoints and . Their conditional densities are positive and continuous in , as are their time derivatives, fluxes, and spatial flux derivatives; throughout . Hence for each compact the finitely many such functions are bounded on by [F4]. Taking a common bound as the constant function gives an element of because has total mass one. Thus [F5] applies. The mixture density is normalized by [F3] and is strictly positive because it is a sum of two positive Gaussian densities.
Put The common Gaussian normalizing factor cancels in the endpoint-weighted mean, so [F2] gives Expanding the two squares gives by [F7] and [F9]. Multiplying numerator and denominator by therefore yields .
For endpoint , [F1] gives Taking the endpoint-weighted mean and using step 1.2 gives . Since , we have and hence . Substitution gives the marginal velocity formula in the Example.
Fix and put and . The formula for , the addition formula [F7], and the reciprocal identity [F9] give , so is odd. For , [F7] gives , and positivity [F9] therefore gives ; strict increase [F8] now yields . Put . Rewriting and using [F7, F9] gives Thus for every , step 2.1 gives An odd affine function must be linear through the origin, and every such function has . Hence is not affine and is nonlinear.
Source notes
The cited sources give the straight conditional Gaussian paths and the conditional-to-marginal velocity formula. The explicit two-endpoint mixture calculation is local. Its conclusion concerns nonlinearity of the marginal velocity; it makes no claim that the marginal field is a globally optimal transport field.
Sources
- Yaron Lipman et al., Flow Matching for Generative Modeling, §4.1 Example II
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.2 Example 8
- Yaron Lipman et al., Flow Matching for Generative Modeling, §4.1 Example II and the note on marginal optimal transport
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §§3.2–3.3