+- MKLab (https://mklab.gr)
+-- Forum: [INDEX] (https://mklab.gr/forumdisplay.php?fid=1)
+--- Forum: MATHEMATICS (https://mklab.gr/forumdisplay.php?fid=3)
+---- Forum: ARTICLES (https://mklab.gr/forumdisplay.php?fid=13)
+----- Forum: PROBABILITY AND STATISTICS (https://mklab.gr/forumdisplay.php?fid=151)
+----- Thread: Cox's theorem (/showthread.php?tid=2164)
Cox's theorem - mklabgr - 09-25-2026
Cox’s theorem, developed by physicist Richard T. Cox, attempts to derive the mathematical laws of probability from general principles governing plausible reasoning under uncertainty. Instead of starting with probability axioms, Cox asks what numerical system should represent how plausible a proposition is, given some information. The central idea is that if plausibility is represented consistently, is comparable on a numerical scale, and behaves sensibly when logical propositions are combined, then the resulting system is essentially probability theory. This gives probability a logical or Bayesian interpretation, where probabilities quantify degrees of belief in propositions rather than merely long-run frequencies.
Cox represents the plausibility of a proposition $A$ given information $X$ by $A\mid X$. For two propositions $A$ and $B$, he assumes that the plausibility of their conjunction can be determined from the plausibilities of its components. This produces a functional equation such as $AB\mid X=g(A\mid X,B\mid AX)$. Consistency with the associativity of logical conjunction forces $g$ to have an associative structure. Under the relevant monotonicity assumptions, a suitable transformation $w$ converts this operation into multiplication: $w(AB\mid X)=w(A\mid X)w(B\mid AX)$. Thus, an abstract system of plausible reasoning begins to acquire the familiar mathematical structure of conditional probability.
The treatment of negation supplies the second major ingredient. Cox assumes that the plausibility of $\neg A$ is determined by the plausibility of $A$, through a function $f$: $w(\neg A\mid X)=f(w(A\mid X))$. Because applying negation twice returns the original proposition, $f$ must satisfy $f(f(x))=x$. Combining the requirements for conjunction and negation ultimately gives a probability-like representation. In particular, there exists a positive number $m$ such that $w^m$ satisfies $w^m(A\mid B)+w^m(\neg A\mid B)=1$ and $w^m(AB\mid C)=w^m(A\mid C)w^m(B\mid AC)$. Defining $P=w^m$ produces the familiar probability rules.
The theorem is important because it provides one mathematical justification for Bayesian probability as a logic of uncertain reasoning. However, it is not an unconditional proof that probability is the only possible framework for uncertainty. The conclusion depends on Cox's assumptions, and later authors have questioned or modified some of them. In particular, Halpern identified counterexamples under weakened assumptions, while other researchers have proposed alternative formulations or additional assumptions. Another important technical point is that Cox's derivation gives finite additivity, whereas the standard measure-theoretic formulation of probability uses the stronger property of countable additivity.
Key takeaways
- Main idea: consistent numerical reasoning about uncertain propositions leads to the mathematical structure of probability.
- Starting point: assign a real-valued plausibility to propositions rather than assuming probability axioms from the beginning.
- Conjunction: consistency leads to a multiplicative rule, ultimately giving
$P(A\cap B\mid C)=P(A\mid C)P(B\mid A\cap C)$.
- Negation: the complement rule becomes
$P(\neg A\mid B)=1-P(A\mid B)$.
- Logical structure: associativity of conjunction and the behavior of negation generate functional equations whose solutions have probability-like form.
- Bayesian interpretation: probability can be viewed as an extension of ordinary logic to situations involving uncertainty.
- Important limitation: Cox's result depends on mathematical assumptions about how plausibility behaves; it does not establish that every conceivable theory of uncertainty must be ordinary probability.
- Measure-theoretic distinction: Cox's basic derivation yields finite additivity, while Kolmogorov's standard framework requires countable additivity.
- Mathematical interest: the theorem is closely connected with functional equations, associativity, monotonicity, Boolean logic, and probability theory.
- Historical significance: Cox's original work appeared in 1946, with a more extensive treatment published in 1961.
ARTICLE / PDF