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.
Dirichlet process
Definition
Let be a standard Borel space and let be a finite nonzero measure on it. Write for the set of probability measures on , equipped with the evaluation sigma-algebra For a probability law on this space, let be the coordinate random probability measure . Call a Dirichlet-process law with base measure if, for every finite measurable partition of , the vector has the Dirichlet distribution with parameters after zero-parameter cells are omitted; each omitted zero-base cell has mass zero. If the partition has one positive-parameter cell, its mass is one. The finite-partition specification determines at most one law on the evaluation sigma-algebra. When such a law exists, denote it by ; the construction theorem on this page proves existence.
The Dirichlet distribution here has the positive-parameter density and one-category convention of Dirichlet distribution, including the one-category case. The definition asserts no weak topology, support statement, or density-contraction result.
Depends on
Used by
- A base-null observation is a prior-predictive null fiber Example
- Finite-partition posterior and Pólya-urn draws Example
- A Dirichlet process assigns exponential mass to a finite-partition simplex neighborhood Lemma
- The mixture prior places local KL and log-square mass near a compact smooth truth Lemma
- The posterior excludes large scales and mixing mass far from compact data Lemma
- Finite-partition conjugacy gives no density-contraction theorem Remark
- Dirichlet normal-mixture posterior contraction Theorem
- Dirichlet-process Pólya-urn predictive law Theorem
- Dirichlet-process posterior update Theorem
- Existence of a Dirichlet process by normalized gamma Poisson random measure Theorem
Dependency tree · two levels
19 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
- Thomas S. Ferguson, A Bayesian Analysis of Some Nonparametric Problems, 1973, Sections 2 and 3 (standard reference, not scraped)
- Günter Last and Mathew Penrose, Lectures on the Poisson Process, 2017, Chapters 1 and 3 (standard reference, not scraped)