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.
A conditional mixture is a probability path
Statement
Let , , and satisfy the conditional probability-density path definition, and for each set . Then is a nonnegative measurable function and for every ; hence it is a probability density with respect to .
Statement references
Facts & Assumptions
Given: A sigma-finite Borel measure , a Borel probability measure , and a conditional density normalized for -almost every endpoint.
Probability paths and velocity fields: is product-measurable, nonnegative, and has -integral for -almost every ; is its -mixture.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for a nonnegative product-measurable function on two sigma-finite measure spaces, the section integrals are measurable and either iterated integral equals the product integral.
Proof
Given: The hypotheses in the Statement.
Fix . The measures and are sigma-finite, and is nonnegative and product-measurable by [F1]. Tonelli's theorem [F2] therefore makes measurable and gives
The inner integral in step 1.1 equals for -almost every by [F1]. Since is a probability measure, the right-hand side is . The mixture is nonnegative by [F1], so is a probability density with respect to .
Source notes
The normalization is proved locally by Tonelli; the source citations document the conditional-to-marginal mixture convention.
Depends on
Used by
Dependency tree · two levels
11 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Yaron Lipman et al., Flow Matching for Generative Modeling, §3.1 (standard reference, not scraped)
- Peter Holderrieth and Ezra Erives, Introduction to Flow Matching and Diffusion Models, §3.1 (standard reference, not scraped)