de Finetti's theorem: an infinite exchangeable – sequence is a unique mixture of Bernoulli trials
OpenDeFinetti.exchangeable_zero_one_mixtureThis is de Finetti's theorem for exchangeable sequences of – random variables: every such sequence is a mixture of i.i.d. Bernoulli sequences.
Let be a probability space and let be random variables on it that take only the values and . The finite family is called exchangeable if for every permutation of the random vector has the same -dimensional distribution as ; the infinite sequence is exchangeable if are exchangeable for every . Write .
Theorem (de Finetti). If the infinite sequence is exchangeable, then there is a probability distribution concentrated on the interval such that for all integers :
- the probability that the first variables equal and the next equal is
- the number of successes among the first trials has the mixed binomial law
Moreover is unique: if is any probability distribution concentrated on such that identity 1 holds with in place of for all , then . (Taking shows that and have the same moments , and a distribution on the compact interval is determined by its moments — the uniqueness half of the Hausdorff moment problem.)
In words: an infinite exchangeable – sequence behaves as if a success probability were first drawn at random from and the trials were then independent Bernoulli trials. This representation is the foundation of the subjectivist (Bayesian) interpretation of probability, where plays the role of a prior distribution, and it is the prototype of the representation theorems for symmetric measures (Hewitt–Savage) and for exchangeable sequences in general Borel spaces (Ryll-Nardzewski). The hypothesis that the sequence is infinite cannot be dropped: finite exchangeable families need not be mixtures of i.i.d. sequences.
Formalization Note The sequence is indexed from : X i stands for , so the event in (1) is and is ∑ i ∈ Finset.range n, X i. The variables are real-valued, measurable, and take the value or at every point. Exchangeability is stated directly: for every and every σ : Equiv.Perm (Fin n), the push-forward of under equals the push-forward under . The mixing distribution is a probability measure on with , so the integrands are bounded -almost everywhere and the Bochner integrals are genuine. Probabilities are converted to real numbers with ENNReal.toReal. The case is included and reduces to . Uniqueness is stated among probability measures on with , assuming of only identity 1 for all , and concludes the equality of measures G = F; this is equivalent to uniqueness among Borel probability measures on .
import Mathlib open MeasureTheory ProbabilityTheory
namespace DeFinetti
/-- **de Finetti's theorem** for exchangeable `0`-`1` sequences (Feller, Vol. II, §VII.4).
Let `X 0, X 1, …` be random variables on a probability space `(Ω, P)` taking only the values
`0` and `1`, and suppose they are exchangeable: for every `n` and every permutation `σ` of
`{0, …, n-1}`, the vector `(X (σ 0), …, X (σ (n-1)))` has the same law as `(X 0, …, X (n-1))`.
Then there is a unique probability distribution `F` on `ℝ` concentrated on `[0, 1]` such that
for all `k ≤ n`
`P{X 0 = 1, …, X (k-1) = 1, X k = 0, …, X (n-1) = 0} = ∫ θ^k (1-θ)^(n-k) dF(θ)`.
Moreover `P{X 0 + ⋯ + X (n-1) = k} = (n choose k) ∫ θ^k (1-θ)^(n-k) dF(θ)`.
Uniqueness: any probability distribution `G` on `ℝ` concentrated on `[0, 1]` satisfying the
first identity for all `k ≤ n` equals `F`. -/
theorem exchangeable_zero_one_mixture {Ω : Type*} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P] (X : ℕ → Ω → ℝ)
(hXmeas : ∀ i, Measurable (X i))
(hX01 : ∀ i ω, X i ω = 0 ∨ X i ω = 1)
(hexch : ∀ (n : ℕ) (σ : Equiv.Perm (Fin n)),
P.map (fun ω (i : Fin n) => X (σ i) ω) = P.map (fun ω (i : Fin n) => X i ω)) :
∃ F : Measure ℝ, IsProbabilityMeasure F ∧ F (Set.Icc (0 : ℝ) 1)ᶜ = 0 ∧
(∀ n k : ℕ, k ≤ n →
(P {ω | ∀ i < n, X i ω = if i < k then 1 else 0}).toReal
= ∫ θ, θ ^ k * (1 - θ) ^ (n - k) ∂F ∧
(P {ω | ∑ i ∈ Finset.range n, X i ω = k}).toReal
= (n.choose k : ℝ) * ∫ θ, θ ^ k * (1 - θ) ^ (n - k) ∂F) ∧
∀ G : Measure ℝ, IsProbabilityMeasure G → G (Set.Icc (0 : ℝ) 1)ᶜ = 0 →
(∀ n k : ℕ, k ≤ n →
(P {ω | ∀ i < n, X i ω = if i < k then 1 else 0}).toReal
= ∫ θ, θ ^ k * (1 - θ) ^ (n - k) ∂G) →
G = F := by sorry
end DeFinetti