Probability Axioms
In the stochastic truth table below, you can change the probabilities assigned to each row. Recall that the sum of the numbers assigned to each row must be 1 and each number must be greater than or equal to 0. The probabilities of the formulas are updated when the stochastic truth table changes. When you hover over a formula with your mouse, the rows of the truth table where that formula is true is highlighted. As you change the probabilities assigned to each row, answer the following questions:
- What is the minimum and maximum value of a probability assigned to a formula?
- What is the relationship between and the sum ?
- What is the relationship between and ?
- What is the relationship between and (and between and )?
Returning to the first two questions asked above:
What is the minimum and maximum value of a probability assigned to a formula? In any stochastic truth table, the probabilities assigned to a formula must be greater than or equal to 0 and less than or equal to 1. This means that in any stochastic truth table, for any formula , if is a tautology (so, is true in every row), then .
What is the relationship between and the sum ? Note that and are mutually exclusive: There is no row of the truth table that makes both formulas true. That is, is true in rows 3 and 4, while is true in row 1. Since the disjunction of these two formulas is true in rows 1, 3, and 4, in any stochastic truth table, .
These two observations motivate the following three core principles of probability, which are known as the Kolmogorov Axioms (for a further discussion, see Section 1 of Interpretations of Probability, Stanford Encyclopedia of Philosophy by Alan Hajek).
Given any stochastic truth table, the following is true:
- For all , .
- For all , if is a tautology, then .
- For all and , if and are mutually exclusive, then .
Since and are contradictory and hence mutually exclusive, the Kolmogorov axiom 3 implies that
Furthermore, since is a tautology, Kolmogorov axiom 3 implies that . Putting these two equations together, we have . This justifies the following:
Given any stochastic truth table, for all formulas ,
Another important property is that equivalent formulas are always assigned the same probability. If and a tautologically equivalent (that is, in every row of the truth table and have the same truth vale), then the probabilities assigned to must be the same as the probability assigned to . For instance, since is equivalent to , they must have the same probability. These two observations are gathered below:
Given any stochastic truth table, for all formulas and ,
- if and are tautologically equivalent (i.e., is a tautology), then ; and
- .
Using the observations above, we can derive the following further properties of probability.
Given any stochastic truth table, the following are true:
- For all formulas , if is a contradiction, then .
- For all formulas and , .
- For all formulas and ,
if is a tautology, then . - For all formulas and ,
Principles of Conditional Probability
As in the example above, in the stochastic truth table below, you can change the probabilities assigned to each row. The conditional probabilities of the formulas are updated when the stochastic truth table changes. As you change the probabilities assigned to each row, answer the following questions:
- What is the relationship between , and ?
- Can you find a stochastic truth table such that ?
0.5000 0.5000 0.5000 0.5000 0.5000
The following observation follows from the definition of conditional probability:
Given any stochastic truth table, the following are true:
- For all formulas and ,
. - For all formulas , and ,
.
The next observation follows from the following two facts:
- ; and
-
Given any stochastic truth table, for all formulas and ,
.
Practice Questions
True or False: For any formulas and , for any stochastic truth table,
True or False: For any formulas and , in any stochastic truth table, if , then .
True or False: For any formulas and , in any stochastic truth table, if is a tautology, then .
- Suppose that , , find .
- Suppose that , , , find .
- Suppose that , , , find .