Math 2.0

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 SS be a Polish space with its Borel σ-algebra, and let 𝒫(S)\mathcal{P}(S) be the set of probability measures on SS. Give 𝒫(S)\mathcal{P}(S) the smallest σ-algebra that makes the maps m↦m(A)m \mapsto m(A) measurable for all Borel sets A⊆SA \subseteq S. Let X1,X2,…X_1, X_2, \dots be an infinite exchangeable sequence of random variables with values in SS. Then there is a unique probability measure ν\nu on 𝒫(S)\mathcal{P}(S) such that for every n≥1n \ge 1 and all Borel sets A1,…,An⊆SA_1, \dots, A_n \subseteq S, P(X1∈A1,…,Xn∈An)=∫𝒫(S)m(A1)⋯m(An) ν(dm).P(X_1 \in A_1, \dots, X_n \in A_n) = \int_{\mathcal{P}(S)} m(A_1) \cdots m(A_n) \, \nu(dm).

Remarks

In words, the sequence is a mixture of i.i.d. sequences: first draw a law mm from ν\nu, then draw X1,X2,…X_1, X_2, \dots i.i.d. with law mm. For S={0,1}S = \set{0, 1} the theorem says that there is a unique probability measure μ\mu on [0,1][0, 1] with P(X1=x1,…,Xn=xn)=∫01pk(1−p)n−k μ(dp),k=x1+⋯+xn,P(X_1 = x_1, \dots, X_n = x_n) = \int_0^1 p^k (1 - p)^{n - k} \, \mu(dp), \qquad k = x_1 + \dots + x_n, so the sequence is a mixture of Bernoulli sequences. In this case the random parameter is the almost sure limit of the frequencies (X1+⋯+Xn)/n(X_1 + \dots + X_n)/n, and its law is μ\mu. 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 (X1,X2)(X_1, X_2) with P(X1=X2=1)=0P(X_1 = X_2 = 1) = 0 and P(X1=X2=0)=0P(X_1 = X_2 = 0) = 0. A mixture would need ∫p2 μ(dp)=0\int p^2 \, \mu(dp) = 0 and ∫(1−p)2 μ(dp)=0\int (1 - p)^2 \, \mu(dp) = 0, which is impossible. In the {0,1}\set{0,1} case, Cov⁡(X1,X2)=∫p2 dμ−(∫p dμ)2≥0\operatorname{Cov}(X_1, X_2) = \int p^2 \, d\mu - \left(\int p \, d\mu\right)^2 \ge 0, 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 ν\nu 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 ν\nu 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 ν\nu 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Bernoulli distribution concept
  2. Borel sigma-algebra concept
  3. Exchangeable random variables concept
  4. Independent and identically distributed random variables concept
  5. Probability measure concept
  6. De Finetti's theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/De_Finetti%27s_theorem
About this page
TagW19129PVKQ
URIm2://W19129PVKQ
Kindstatement, theorem
WritingW0 stub
MSC60G09, 62F15
StatusThis copy of the site has no build data. Run m2 status W19129PVKQ.
AboutExchangeable random variables
UsesExchangeable random variables, Independent and identically distributed random variables, Probability measure, Borel sigma-algebra, Bernoulli distribution
Same as
Changed2 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.