De Finetti's Theorem in Categorical Probability
Not on the map. Why?
Abstract (arXiv)
We present a novel proof of de Finetti's Theorem characterizing permutation-invariant probability measures of infinite sequences of variables, so-called exchangeable measures. The proof is phrased in the language of Markov categories, which provide an abstract categorical framework for probability and information flow. The diagrammatic and abstract nature of the arguments makes the proof intuitive and easy to follow. We also show how the usual measure-theoretic version of de Finetti's Theorem for standard Borel spaces is an instance of this result.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 May 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 1.
4 papers.
- 2024A Pattern Language for Machine Learning Taskscited by 4
- 2024On the Anatomy of Attentioncited by 3
- 2025Topos Causal Modelscited by 0
- 2026Notes on Forr'e's Notion of Conditional Independence and Causal Calculus for Continuous Variablescited by 0
- 2026Notes on Forr'e's Notion of Conditional Independence and Causal Calculus for Continuous Variables25 Mar 2026
- 2025Topos Causal Models5 Aug 2025
- 2024A Pattern Language for Machine Learning Tasks2 Jul 2024
- 2024On the Anatomy of Attention2 Jul 2024