A characterisation of ordered abstract probabilities

DOI10.1145/3373718.3394742zbMATH Open1503.81018arXiv1912.10040OpenAlexW3101342170WikidataQ130929676 ScholiaQ130929676MaRDI QIDQ5145693FDOQ5145693

Bas Westerbaan, Abraham Westerbaan, John van de Wetering

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Abstract: In computer science, especially when dealing with quantum computing or other non-standard models of computation, basic notions in probability theory like "a predicate" vary wildly. There seems to be one constant: the only useful example of an algebra of probabilities is the real unit interval. In this paper we try to explain this phenomenon. We will show that the structure of the real unit interval naturally arises from a few reasonable assumptions. We do this by studying effect monoids, an abstraction of the algebraic structure of the real unit interval: it has an addition $x+y$ which is only defined when $x+yleq1$ and an involution $xmapsto1-x$ which make it an effect algebra, in combination with an associative (possibly non-commutative) multiplication. Examples include the unit intervals of ordered rings and Boolean algebras. We present a structure theory for effect monoids that are $omega$-complete, i.e. where every increasing sequence has a supremum. We show that any $omega$-complete effect monoid embeds into the direct sum of a Boolean algebra and the unit interval of a commutative unital C${}^{*}$-algebra. This gives us from first principles a dichotomy between sharp logic, represented by the Boolean algebra part of the effect monoid, and probabilistic logic, represented by the commutative C${}^{*}$-algebra. Some consequences of this characterisation are that the multiplication must always be commutative, and that the unique $omega$-complete effect monoid without zero divisors and more than 2 elements must be the real unit interval. Our results give an algebraic characterisation and motivation for why any physical or logical theory would represent probabilities by real numbers.

Full work available at URL: https://arxiv.org/abs/1912.10040

zbMATH Keywords

abstract probabilitieseffectus theoryeffect monoids

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Complemented lattices, orthocomplemented lattices and posets (06C15)

Cited In (7)

• Title not available (Why is that?)
• A computer scientist’s reconstruction of quantum theory*
• Spectrality in convex sequential effect algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dichotomy between deterministic and probabilistic models in countably additive effectus theory
• Title not available (Why is that?)

Recommendations

• On order-preserving properties of probability metrics 👍 👎
• Ordered probability spaces 👍 👎
• Stochastic Order Relations and Lattices of Probability Measures 👍 👎
• A Theory of Higher Order Probabilities 👍 👎
• Characterizations of stochastic ordering for non-negative random variables 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A characterisation of ordered abstract probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145693)