Skip to main content Accessibility help

Disintegration and Bayesian inversion via string diagrams

  • Kenta Cho (a1) and Bart Jacobs (a2)


The notions of disintegration and Bayesian inversion are fundamental in conditional probability theory. They produce channels, as conditional probabilities, from a joint state, or from an already given channel (in opposite direction). These notions exist in the literature, in concrete situations, but are presented here in abstract graphical formulations. The resulting abstract descriptions are used for proving basic results in conditional probability theory. The existence of disintegration and Bayesian inversion is discussed for discrete probability, and also for measure-theoretic probability – via standard Borel spaces and via likelihoods. Finally, the usefulness of disintegration and Bayesian inversion is illustrated in several examples.


Corresponding author

*Corresponding author. Email:


Hide All
Abramsky, S. and Coecke, B. (2009). Categorical quantum mechanics. In: Handbook of Quantum Logic and Quantum Structures: Quantum Logic, Elsevier, 261323.
Ackerman, N. L., Freer, C. E. and Roy, D. M. (2011). Noncomputable conditional distributions. In: Logic in Computer Science, IEEE, 107116.
Barber, D. (2012). Bayesian Reasoning and Machine Learning, Cambridge, Cambridge University Press.
Bernardo, J. and Smith, A. (2000). Bayesian Theory, Chichester, John Wiley & Sons.
Borgström, J., Gordon, A., Greenberg, M., Margetson, J. and Gael, J. V. (2013). Measure transformer semantics for Bayesian machine learning. Logical Methods in Computer Science 9 (3) 139.
Chang, J. T. and Pollard, D. (1997). Conditioning as disintegration. Statistica Neerlandica 51 (3) 287317.
Cho, K. and Jacobs, B. (2017). The EfProb library for probabilistic calculations. In: Conference on Algebra and Coalgebra in Computer Science, LIPIcs, vol. 72, Schloss Dagstuhl.
Cho, K., Jacobs, B., Westerbaan, A. and Westerbaan, B. (2015). An introduction to effectus theory. Preprint arXiv:1512.05813 [cs.LO].
Clerc, F., Danos, V., Dahlqvist, F. and Garnier, I. (2017). Pointless learning. In: Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, vol. 10203, Springer, 355369.
Coecke, B. (2016). Terminality implies no-signalling …and much more than that. New Generation Computing 34 (1) 6985.
Coecke, B. and Kissinger, A. (2017). Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning, Cambridge, Cambridge University Press.
Coumans, D. and Jacobs, B. (2013). Scalars, monads and categories. In: Heunen, C., Sadrzadeh, M. and Grefenstette, E. (eds.) Quantum Physics and Linguistics. A Compositional, Diagrammatic Discourse, Oxford University Press, 184216.
Culbertson, J. and Sturtz, K. (2014). A categorical foundation for Bayesian probability. Applied Categorical Structures 22 (4) 647662.
D’Ariano, G. M., Chiribella, G. and Perinotti, P. (2017). Quantum Theory from First Principles: An Informational Approach, Cambridge, Cambridge University Press.
Dawid, A. (2001). Separoids: a mathematical framework for conditional independence and irrelevance. Annals of Mathematics and Artificial Intelligence 32 (1) 335372.
Doberkat, E.-E. (2007). Stochastic Relations: Foundations for Markov Transition Systems, Boca Raton, FL, Chapman and Hall/CRC.
Faden, A. M. (1985). The existence of regular conditional probabilities: necessary and sufficient conditions. The Annals of Probability 13 (1) 288298.
Fong, B. (2012). Causal Theories: Categorical Perspective on Bayesian Networks. Master’s thesis, University of Oxford. arXiv:1301.6201 [math.PR].
Fremlin, D. H. (2000). Measure Theory, 5 volumes, Colchester, Torres Fremlin.
Geiger, D., Verma, T. and Pearl, J. (1990). Identifying independence in Bayesian networks. Networks 20 507534.
Giry, M. (1982). A categorical approach to probability theory. In: Categorical Aspects of Topology and Analysis, Lecture Notes in Mathematics, vol. 915, Springer, 6885.
Gordon, A., Henzinger, T., Nori, A. and Rajamani, S. (2014). Probabilistic programming. In: Future of Software Engineering, ACM, 167181.
Jacobs, B. (2015). New directions in categorical logic, for classical, probabilistic and quantum logic. Logical Methods in Computer Science 11 (3) 176.
Jacobs, B. (2018). From probability monads to commutative effectuses. Journal of Logical and Algebraic Methods in Programming, 94 200237.
Jacobs, B., Westerbaan, B. and Westerbaan, A. (2015). States of convex sets. In: Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, vol. 9034, Springer, 87101.
Jacobs, B. and Zanasi, F. (2016). A predicate/state transformer semantics for Bayesian learning. In: Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science, vol. 325, Elsevier, 185200.
Jacobs, B. and Zanasi, F. (2017). A formal semantics of influence in Bayesian reasoning. In: Mathematical Foundations of Computer Science, LIPIcs, vol. 83, Schloss Dagstuhl.
Jacobs, B. and Zanasi, F. (2018). The logical essentials of Bayesian reasoning. Preprint, arXiv:1804.01193 [cs.AI].
Joyal, A. and Street, R. (1991). The geometry of tensor calculus, I. Advances in Mathematics 88 (1) 55112.
Kallenberg, O. (2017). Random Measures, Theory and Applications, Cham, Switzerland, Springer.
Katoen, J.-P., Gretz, F., Jansen, N., Lucien Kaminski, B. and Olmedo, F. (2015). Understanding probabilistic programs. In: Correct System Design, Lecture Notes in Computer Science, vol. 9360, Springer, 1532.
Mac Lane, S. (1998). Categories for the Working Mathematician, 2nd ed., New York, Springer.
Pachl, J. K. (1978). Disintegration and compact measures. Mathematica Scandinavica 43 157168.
Panangaden, P. (2009). Labelled Markov Processes, London, Imperial College Press.
Pawitan, Y. (2001). In All Likelihood. Statistical Modelling and Inference Using Likelihood, Oxford, Clarendon Press.
Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems, San Francisco, CA, Morgan Kaufmann.
Pollard, D. (2002). A User’s Guide to Measure Theoretic Probability, Cambridge, Cambridge University Press.
Selinger, P. (2010). A survey of graphical languages for monoidal categories. In: New Structures for Physics, Lecture Notes in Physics, vol. 813, Springer, 289355.
Shan, C.-c. andRamsey, N. (2017). Exact Bayesian inference by symbolic disintegration. In: Principles of Programming Languages, ACM, 130144.
Simpson, A. (2018). Category-theoretic structure for independence and conditional independence. In: Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science, vol. 336, Elsevier, 281297.
Staton, S. (2017). Commutative semantics for probabilistic programming. In: European Symposium on Programming, Lecture Notes in Computer Science, vol. 10201, Springer, 855879.
Staton, S., Yang, H., Heunen, C., Kammar, O. and Wood, F. (2016). Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. In: Logic in Computer Science, ACM, 525534.
Stoyanov, J. M. (2014). Counterexamples in Probability, 3rd ed., New York, Dover.
Verma, T. and Pearl, J. (1988). Causal networks: semantics and expressiveness. In: Fourth Conference on Uncertainty in Artificial Intelligence, 352359.
Witten, I., Frank, E. and Hall, M. (2011). Data Mining– Practical Machine Learning Tools and Techniques, Amsterdam, Elsevier.


Disintegration and Bayesian inversion via string diagrams

  • Kenta Cho (a1) and Bart Jacobs (a2)


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed