Alphabeta Math

Conditional flow matching and transport paths

About this page
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.

1 · Prerequisites
Abstract Algebra
Combinatorics
Coxeter Groups
Differential Geometry
Functional Analysis
Linear Algebra
Machine Learning Algorithms
Measure Theory
Number Theory
Probability
Real Analysis
Set Theory
Statistical Models and Experiments
Topology
2 · Logical flowchart

3 · Items

Definition

Probability paths and velocity fields

Lemma

A conditional mixture is a probability path

Lemma

Conditional continuity equations pass to the marginal path

Lemma

An affine conditional path has the stated velocity field

Lemma

A centered law and its affine dilation have an optimal affine coupling

Theorem

Conditional and marginal flow-matching objectives differ by a constant

Theorem

The Gaussian conditional affine map is quadratic-cost optimal

Algorithm

Conditional flow-matching training and exact-flow sampling

Lemma

Conditional flow-matching batch gradients and exact-flow output law

Sources