In mathematics, the Giry monad is a construction that assigns to a measurable space a space of probability measures over it, equipped with a canonical sigma-algebra.[1][2][3][4][5] It is one of the main examples of a probability monad.
It is implicitly used in probability theory whenever one considers probability measures which depend measurably on a parameter (giving rise to Markov kernels), or when one has probability measures over probability measures (such as in de Finetti's theorem).
Like many iterable constructions, it has the category-theoretic structure of a monad, on the category of measurable spaces.
Construction
editThe Giry monad, like every monad, consists of three structures:[6][7][8]
- A functorial assignment, which in this case assigns to a measurable space a space of probability measures over it;
- A natural map called the unit, which in this case assigns to each element of a space the Dirac measure over it;
- A natural map called the multiplication, which in this case assigns to each probability measure over probability measures its expected value.
The space of probability measures
editLet be a measurable space. Denote by the set of probability measures over . We equip the set with a sigma-algebra as follows. First of all, for every measurable set , define the map by . We then define the sigma algebra on to be the smallest sigma-algebra which makes the maps measurable, for all (where is assumed equipped with the Borel sigma-algebra). [6]
Equivalently, can be defined as the smallest sigma-algebra on which makes the maps
measurable for all bounded measurable .[9]
The assignment is part of an endofunctor on the category of measurable spaces, usually denoted again by . Its action on morphisms, i.e. on measurable maps, is via the pushforward of measures. Namely, given a measurable map , one assigns to the map defined by
for all and all measurable sets . [6]
The Dirac delta map
editGiven a measurable space , the map maps an element to the Dirac measure , defined on measurable subsets by[6]
The expectation map
editLet , i.e. a probability measure over the probability measures over . We define the probability measure by
for all measurable . This gives a measurable, natural map .[6]
Example: mixture distributions
editA mixture distribution, or more generally a compound distribution, can be seen as an application of the map . Let's see this for the case of a finite mixture. Let be probability measures on , and consider the probability measure given by the mixture
for all measurable , for some weights satisfying . We can view the mixture as the average , where the measure on measures , which in this case is discrete, is given by
More generally, the map can be seen as the most general, non-parametric way to form arbitrary mixture or compound distributions.
Relationship with Markov kernels
editOne of the properties of the sigma-algebra is that given measurable spaces and , we have a bijective correspondence between measurable functions and Markov kernels . This allows to view a Markov kernel, equivalently, as a measurably parametrized probability measure.[10]
In more detail, given a measurable function , one can obtain the Markov kernel as follows,
for every and every measurable (note that is a probability measure). Conversely, given a Markov kernel , one can form the measurable function mapping to the probability measure defined by
for every measurable . The two assignments are mutually inverse.
From the point of view of category theory, we can interpret this correspondence as an adjunction
between the category of measurable spaces and the category of Markov kernels. In particular, the category of Markov kernels can be seen as the Kleisli category of the Giry monad.[3][4][5]
Product distributions
editGiven measurable spaces and , one can form the measurable space with the product sigma-algebra, which is the product in the category of measurable spaces. Given probability measures and , one can form the product measure on . This gives a natural, measurable map
usually denoted by or by .[4]
The map is in general not an isomorphism, since there are probability measures on which are not product distributions, for example in case of correlation. However, the maps and the isomorphism make the Giry monad a monoidal monad, and so in particular a commutative strong monad.[4]
Further properties
edit- If a measurable space is standard Borel, so is . Therefore the Giry monad restricts to the full subcategory of standard Borel spaces.[1][4]
- The algebras for the Giry monad include compact convex subsets of Euclidean spaces, as well as the extended positive real line , with the algebra structure map given by taking expected values.[11] For example, for , the structure map is given by
- whenever is supported on and has finite expected value, and otherwise.
See also
editCitations
edit- ^ a b c Giry (1982)
- ^ a b Avery (2016), pp. 1231–1234
- ^ a b c Jacobs (2018), pp. 205–106
- ^ a b c d e f Fritz (2020), pp. 19–23
- ^ a b c Moss & Perrone (2022), pp. 3–4
- ^ a b c d e Giry (1982), p. 69
- ^ Riehl (2016)
- ^ Perrone (2024)
- ^ Perrone (2024), p. 238
- ^ Giry (1982), p. 71
- ^ Doberkat (2006), pp. 1772–1776
References
edit- Giry, Michèle (1982). "A categorical approach to probability theory". Categorical Aspects of Topology and Analysis. Lecture Notes in Mathematics. Vol. 915. Springer. pp. 68–85. doi:10.1007/BFb0092872. ISBN 978-3-540-11211-2.
- Doberkat, Ernst-Erich (2006). "Eilenberg-Moore algebras for stochastic relations". Information and Computation. 204 (12): 1756–1781. doi:10.1016/j.ic.2006.09.001.
- Avery, Tom (2016). "Codensity and the Giry monad". Journal of Pure and Applied Algebra. 220 (3): 1229–1251. arXiv:1410.4432. doi:10.1016/j.jpaa.2015.08.017. S2CID 119695729.
- Jacobs, Bart (2018). "From probability monads to commutative effectuses". Journal of Logical and Algebraic Methods in Programming. 94: 200–237. doi:10.1016/j.jlamp.2016.11.006. hdl:2066/182000.
- Fritz, Tobias (2020). "A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics". Advances in Mathematics. 370. arXiv:1908.07021. doi:10.1016/j.aim.2020.107239. S2CID 201103837.
- Moss, Sean; Perrone, Paolo (2022). "Probability monads with submonads of deterministic states". LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:2204.07003. doi:10.1145/3531130.3533355.
- Riehl, Emily (2016). "Chapter 5. Monads and their Algebras". Category Theory in Context. Dover. ISBN 978-0486809038.
- Perrone, Paolo (2024). "Chapter 5. Monads and Comonads". Starting Category Theory. World Scientific. doi:10.1142/9789811286018_0005. ISBN 978-981-12-8600-1.
Further reading
editExternal links
edit- What is a probability monad?, video tutorial.