Probability theory and stochastic processes Independence Theorem
De Finetti's theorem
Builds on Exchangeable random variablesIndependent and identically distributed random variablesProbability measureBorel sigma-algebraBernoulli distribution
Statement
Let be a Polish space with its Borel σ-algebra, and let be the set of probability measures on . Give the smallest σ-algebra that makes the maps measurable for all Borel sets . Let be an infinite exchangeable sequence of random variables with values in . Then there is a unique probability measure on such that for every and all Borel sets ,
Remarks
In words, the sequence is a mixture of i.i.d. sequences: first draw a law from , then draw i.i.d. with law . For the theorem says that there is a unique probability measure on with so the sequence is a mixture of Bernoulli sequences. In this case the random parameter is the almost sure limit of the frequencies , and its law is . One proof shows that, given the σ-algebra of events invariant under finite permutations, the variables are conditionally i.i.d.; a reverse martingale argument gives the limit of the empirical measures. The theorem fails for finite sequences: drawing both balls without replacement from an urn with one red and one blue ball gives an exchangeable pair with and . A mixture would need and , which is impossible. In the case, , so infinite exchangeable sequences of this kind are never negatively correlated.
Going deeper
For a student
The theorem is the main justification for the Bayesian model "parameter with a prior, data i.i.d. given the parameter": the measure plays the role of the prior. The Pólya urn model gives an example: its colour sequence is exchangeable, and the mixing measure is a beta distribution. For general exchangeable sequences, the Dirichlet process is a standard choice of in nonparametric Bayesian statistics. The Hewitt–Savage zero–one law is a related result: for an i.i.d. sequence, the exchangeable σ-algebra is trivial, which matches being a point mass.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Bernoulli distribution concept
- Borel sigma-algebra concept
- Exchangeable random variables concept
- Independent and identically distributed random variables concept
- Probability measure concept
- De Finetti's theorem statement
Further reading
About this page
| Tag | W19129PVKQ |
|---|---|
| URI | m2://W19129PVKQ |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 60G09, 62F15 |
| Status | This copy of the site has no build data. Run m2 status W19129PVKQ. |
| About | Exchangeable random variables |
| Uses | Exchangeable random variables, Independent and identically distributed random variables, Probability measure, Borel sigma-algebra, Bernoulli distribution |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.