Bayes's theorem (also known as Bayes's rule) is a result in probability theory, which relates the conditional and marginal probability distributions of random variables. In some interpretations of probability, Bayes's theorem tells how to update or revise beliefs in light of new evidence: a posteriori.

The probability of an event A conditional on another event B is generally different from the probability of B conditional on A. However, there is a definite relationship between the two, and Bayes's theorem is the statement of that relationship.

As a formal theorem, Bayes's theorem is valid in all interpretations of probability. However, frequentist and Bayesian interpretations disagree about the kinds of things to which probabilities should be assigned in applications: frequentists assigned probabilities to random events according to their frequencies of occurrence or to subsets of populations as proportions of the whole; Bayesians assign probabilities to propositions that are uncertain. A consequence is that Bayesians have more frequent occasion to use Bayes's theorem. The articles on Bayesian probability and frequentist probability discuss these debates at greater length.

Statement of Bayes's theorem

---

Bayes's theorem relates the conditional and marginal probabilities of stochastic events A and B:

$\backslash Pr(A|B)\; =\; \backslash frac\{\backslash Pr(B\; |\; A)\backslash ,\; \backslash Pr(A)\}\{\backslash Pr(B)\}\; \backslash propto\; L(A\; |\; B)\backslash ,\; \backslash Pr(A)\; \backslash !$

where L(A|B) is a likelihood of A given fixed B.

Each term in Bayes's theorem has a conventional name:

• Pr(A) is the prior probability or marginal probability of A. It is "prior" in the sense that it does not take into account any information about B.
• Pr(A|B) is the conditional probability of A, given B. It is also called the posterior probability because it is derived from or depends upon the specified value of B.
• Pr(B|A) is the conditional probability of B given A.
• Pr(B) is the prior or marginal probability of B, and acts as a normalizing constant.

With this terminology, the theorem may be paraphrased as

$\backslash mbox\{posterior\}\; =\; \backslash frac\{\backslash mbox\{likelihood\}\; \backslash times\; \backslash mbox\{prior\}\}\; \{\backslash mbox\{normalizing\; constant\}\}$

In words: the posterior probability is proportional to the prior probability times the likelihood.

In addition, the ratio Pr(B|A)/Pr(B) is sometimes called the standardised likelihood, so the theorem may also be paraphrased as

$\backslash mbox\{posterior\}\; =\; \{\backslash mbox\{standardised\; likelihood\}\; \backslash times\; \backslash mbox\{prior\}\; \}.\backslash ,$

Derivation from conditional probabilities

---

To derive the theorem, we start from the definition of conditional probability. The probability of event A given event B is

$\backslash Pr(A|B)=\backslash frac\{\backslash Pr(A\; \backslash cap\; B)\}\{\backslash Pr(B)\}.$

Likewise, the probability of event B given event A is

$\backslash Pr(B|A)\; =\; \backslash frac\{\backslash Pr(A\; \backslash cap\; B)\}\{\backslash Pr(A)\}.\; \backslash !$

Rearranging and combining these two equations, we find

$\backslash Pr(A|B)\backslash ,\; \backslash Pr(B)\; =\; \backslash Pr(A\; \backslash cap\; B)\; =\; \backslash Pr(B|A)\backslash ,\; \backslash Pr(A).\; \backslash !$

Dividing both sides by Pr(B), providing that it is non-zero, we obtain Bayes's theorem:

$\backslash Pr(A|B)\; =\; \backslash frac\{\backslash Pr(B|A)\backslash ,\backslash Pr(A)\}\{\backslash Pr(B)\}.\; \backslash !$

Alternative forms of Bayes's theorem

---

Bayes's theorem is often embellished by noting that

$\backslash Pr(B)\; =\; \backslash Pr(A\backslash cap\; B)\; +\; \backslash Pr(A^C\backslash cap\; B)\; =\; \backslash Pr(B|A)\; \backslash Pr(A)\; +\; \backslash Pr(B|A^C)\; \backslash Pr(A^C)\backslash ,$

where A^C is the complementary event of A (often called "not A"). So the theorem can be restated as

$\backslash Pr(A|B)\; =\; \backslash frac\{\backslash Pr(B\; |\; A)\backslash ,\; \backslash Pr(A)\}\{\backslash Pr(B|A)\backslash Pr(A)\; +\; \backslash Pr(B|A^C)\backslash Pr(A^C)\}.\; ,\; \backslash !$

More generally, where {A_i} forms a partition of the event space,

$\backslash Pr(A\_i|B)\; =\; \backslash frac\{\backslash Pr(B\; |\; A\_i)\backslash ,\; \backslash Pr(A\_i)\}\{\backslash sum\_j\; \backslash Pr(B|A\_j)\backslash ,\backslash Pr(A\_j)\}\; ,\; \backslash !$

for any A_i in the partition.

Bayes's theorem in terms of odds and likelihood ratio

Bayes's theorem can also be written neatly in terms of a likelihood ratio Λ and odds O as

$O(A|B)=O(A)\; \backslash cdot\; \backslash Lambda\; (A|B)$

where

$O(A|B)=\backslash frac\{\backslash Pr(A|B)\}\{\backslash Pr(A^C|B)\}\; \backslash !$

are the odds of A given B,

$O(A)=\backslash frac\{\backslash Pr(A)\}\{\backslash Pr(A^C)\}\; \backslash !$

are the odds of A by itself, and

$\backslash Lambda\; (A|B)\; =\; \backslash frac\{L(A|B)\}\{L(A^C|B)\}\; =\; \backslash frac\{\backslash Pr(B|A)\}\{\backslash Pr(B|A^C)\}\; \backslash !$

is the likelihood ratio.

See also the law of total probability.

Bayes' theorem for probability densities

There is also a version of Bayes's theorem for continuous distributions. It is somewhat harder to derive, since probability densities, strictly speaking, are not probabilities, so Bayes's theorem has to be established by a limit process; see Papoulis (citation below), Section 7.3 for an elementary derivation. Bayes's theorem for probability densities is formally similar to the theorem for probabilities:

$f(x|y)\; =\; \backslash frac\{f(x,y)\}\{f(y)\}\; =\; \backslash frac\{f(y|x)\backslash ,f(x)\}\{f(y)\}\; \backslash !$

and there is an analogous statement of the law of total probability:

$f(x|y)\; =\; \backslash frac\{f(y|x)\backslash ,f(x)\}\{\backslash int\_\{-\backslash infty\}^\{\backslash infty\}\; f(y|x)\backslash ,f(x)\backslash ,dx\}.$

\!

As in the discrete case, the terms have standard names. f(x, y) is the joint distribution of X and Y, f(x|y) is the posterior distribution of X given Y=y, f(y|x) = L(x|y) is (as a function of x) the likelihood function of X given Y=y, and f(x) and f(y) are the marginal distributions of X and Y respectively, with f(x) being the prior distribution of X.

Here we have indulged in a conventional abuse of notation, using f for each one of these terms, although each one is really a different function; the functions are distinguished by the names of their arguments.

Extensions of Bayes's theorem

Theorems analogous to Bayes's theorem hold in problems with more than two variables. For example:

$\backslash Pr(A|B,C)\; =\; \backslash frac\{\backslash Pr(A)\; \backslash ,\; \backslash Pr(B|A)\; \backslash ,\; \backslash Pr(C|A,B)\}\{\backslash Pr(B)\; \backslash ,\; \backslash Pr(C|B)\}\; \backslash !$

This can be derived in several steps from Bayes's theorem and the definition of conditional probability:

$\backslash Pr(A|B,C)\; =\; \backslash frac\{\backslash Pr(A,B,C)\}\{\backslash Pr(B,C)\}\; =\; \backslash frac\{\backslash Pr(A,B,C)\}\{\backslash Pr(B)\; \backslash ,\; \backslash Pr(C|B)\}\; =$

$=\; \backslash frac\{\backslash Pr(C|A,B)\; \backslash ,\; \backslash Pr(A,B)\}\{\backslash Pr(B)\; \backslash ,\; \backslash Pr(C|B)\}\; =\; \backslash frac\{\backslash Pr(A)\; \backslash ,\; \backslash Pr(B|A)\; \backslash ,\; \backslash Pr(C|A,B)\}\{\backslash Pr(B)\; \backslash ,\; \backslash Pr(C|B)\}\; .$

A general strategy is to work with a decomposition of the joint probability, and to marginalize (integrate) over the variables that are not of interest. Depending on the form of the decomposition, it may be possible to prove that some integrals must be 1, and thus they fall out of the decomposition; exploiting this property can reduce the computations very substantially. A Bayesian network, for example, specifies a factorization of a joint distribution of several variables in which the conditional probability of any one variable given the remaining ones takes a particularly simple form (see Markov blanket).

Examples

---

Example #1: False positives in a medical test

Suppose that a test for a particular disease has a very high success rate:

• if a tested patient has the disease, the test accurately reports this, a 'positive', 99% of the time (or, with probability 0.99), and
• if a tested patient does not have the disease, the test accurately reports that, a 'negative', 95% of the time (i.e. with probability 0.95).

Suppose also, however, that only 0.1% of the population have that disease (i.e. with probability 0.001). We now have all the information required to use Bayes's theorem to calculate the probability that, given the test was positive, that it is a false positive. This problem is discussed at greater length in Bayesian inference.

Let D be the event that the patient has the disease, and T be the event that the test returns a positive result. Then, using the second alternative form of Bayes's theorem (above), the probability of a true positive is

$$

P(T) = P(T|D)\,P(D) + P(T|D^C)\,P(D^C) \! P(T) is the probability that a given person tests positive. This depends on the two populations: those with the disease (and correctly test positive 0.99 x 0.001) and those without the disease (and incorrectly test positive 0.05 x 0.999).

$$

P(D|T) = \frac{P(T|D)\,P(D)}{P(T|D)\,P(D) + P(T|D^C)\,P(D^C)} \!

$$

P(D|T) = \frac{0.99\times 0.001}{0.99 \times 0.001 + 0.05\times 0.999} = 11/566 \approx 0.019, \!

and hence the probability that a positive result is a false positive is about (1 − 0.019) = 0.981.

Despite the apparent high accuracy of the test, the incidence of the disease is so low (one in a thousand) that the vast majority of patients who test positive (98 in a hundred) do not have the disease. It should be noted that this is quite common in screening tests. It is more important to have a very low false negative rate than a high true positive rate.

Example #2: Conditional probabilities

Suppose there are two bowls full of cookies. Bowl #1 has 10 chocolate chip cookies and 30 plain cookies, while bowl #2 has 20 of each. Fred picks a bowl at random, and then picks a cookie at random. We may assume there is no reason to believe Fred treats one bowl differently from another, likewise for the cookies. The cookie turns out to be a plain one. How probable is it that Fred picked it out of bowl #1?

Intuitively, it seems clear that the answer should be more than a half, since there are more plain cookies in bowl #1. The precise answer is given by Bayes's theorem. But first, we can clarify the situation by rephrasing the question to "what’s the probability that Fred picked bowl #1, given that he has a plain cookie?” Thus, to relate to our previous explanation, the event A is that Fred picked bowl #1, and the event B is that Fred picked a plain cookie. To compute Pr(A|B), we first need to know:

• Pr(A), or the probability that Fred picked bowl #1 regardless of any other information. Since Fred is treating both bowls equally, it is 0.5.
• Pr(B), or the probability of getting a plain cookie regardless of any information on the bowls. In other words, this is the probability of getting a plain cookie from each of the bowls. It is computed as the sum of the probability of getting a plain cookie from a bowl multiplied by the probability of selecting this bowl. We know from the problem statement that the probability of getting a plain cookie from bowl #1 is 0.75, and the probability of getting one from bowl #2 is 0.5, and since Fred is treating both bowls equally the probability of selecting any one of them is 0.5. Thus, the probability of getting a plain cookie overall is 0.75×0.5 + 0.5×0.5 = 0.625.
• Pr(B|A), or the probability of getting a plain cookie given that Fred has selected bowl #1. From the problem statement, we know this is 0.75, since 30 out of 40 cookies in bowl #1 are plain.

Given all this information, we can compute the probability of Fred having selected bowl #1 given that he got a plain cookie, as such:

$\backslash Pr(A|B)\; =\; \backslash frac\{\backslash Pr(B\; |\; A)\; \backslash Pr(A)\}\{\backslash Pr(B)\}\; =\; \backslash frac\{0.75\; \backslash times\; 0.5\}\{0.625\}\; =\; 0.6$

As we expected, it is more than half.

Tables of occurrences and relative frequencies

It is often helpful when calculating conditional probabilities to create a simple table containing the number of occurrences of each outcome, or the relative frequencies of each outcome, for each of the independent variables. The tables below illustrate the use of this method for the cookies.

Number of cookies in each bowl by type of cookie		Relative frequency of cookies in each bowl by type of cookie

	Bowl #1	Bowl #2	Totals
Chocolate Chip	10	20	30
Plain	30	20	50
Total	40	40	80

	Bowl #1	Bowl #2	Totals
Chocolate Chip	0.125	0.250	0.375
Plain	0.375	0.250	0.625
Total	0.500	0.500	1.000

The table on the right is derived from the table on the left by dividing each entry by the total number of cookies under consideration, or 80 cookies.

Example #3: Bayesian inference

Applications of Bayes's theorem often assume the philosophy underlying Bayesian probability that uncertainty and degrees of belief can be measured as probabilities. One such example follows. For additional worked out examples, including simpler examples, please see the article on the examples of Bayesian inference.

We describe the marginal probability distribution of a variable A as the prior probability distribution or simply the prior. The conditional distribution of A given the "data" B is the posterior probability distribution or just the posterior.

Suppose we wish to know about the proportion r of voters in a large population who will vote "yes" in a referendum. Let n be the number of voters in a random sample (chosen with replacement, so that we have statistical independence) and let m be the number of voters in that random sample who will vote "yes". Suppose that we observe n = 10 voters and m = 7 say they will vote yes. From Bayes's theorem we can calculate the probability distribution function for r using

$f(r\; |\; n=10,\; m=7)\; =$

\frac {f(m=7 | r, n=10) \, f(r)} {\int_0^1 f(m=7|r, n=10) \, f(r) \, dr}. \!

From this we see that from the prior probability density function f(r) and the likelihood function L(r) = f(m = 7|r, n = 10), we can compute the posterior probability density function f(r|n = 10, m = 7).

The prior probability density function f(r) summarizes what we know about the distribution of r in the absence of any observation. We provisionally assume in this case that the prior distribution of r is uniform over the interval 1. That is, f(r) = 1. If some additional background information is found, we should modify the prior accordingly. However before we have any observations, all outcomes are equally likely.

Under the assumption of random sampling, choosing voters is just like choosing balls from an urn. The likelihood function L(r) = P(m = 7|r, n = 10,) for such a problem is just the probability of 7 successes in 10 trials for a binomial distribution.

$\backslash Pr(\; m=7\; |\; r,\; n=10)\; =\; \{10\; \backslash choose\; 7\}\; \backslash ,\; r^7\; \backslash ,\; (1-r)^3.$

As with the prior, the likelihood is open to revision -- more complex assumptions will yield more complex likelihood functions. Maintaining the current assumptions, we compute the normalizing factor,

$\backslash int\_0^1\; \backslash Pr(\; m=7|r,\; n=10)\; \backslash ,\; f(r)\; \backslash ,\; dr\; =\; \backslash int\_0^1\; \{10\; \backslash choose\; 7\}\; \backslash ,\; r^7\; \backslash ,\; (1-r)^3\; \backslash ,\; 1\; \backslash ,\; dr\; =\; \{10\; \backslash choose\; 7\}\; \backslash ,\; \backslash frac\{1\}\{1320\}\; \backslash !$

and the posterior distribution for r is then

$f(r\; |\; n=10,\; m=7)\; =$

\frac = 1320 \, r^7 \, (1-r)^3

for r between 0 and 1, inclusive.

One may be interested in the probability that more than half the voters will vote "yes". The prior probability that more than half the voters will vote "yes" is 1/2, by the symmetry of the uniform distribution. In comparison, the posterior probability that more than half the voters will vote "yes", i.e., the conditional probability given the outcome of the opinion poll – that seven of the 10 voters questioned will vote "yes" – is

$1320\backslash int\_\{1/2\}^1\; r^7(1-r)^3\backslash ,dr\; \backslash approx\; 0.887,\; \backslash !$

which is about an "89% chance".

Historical remarks

---

Bayes's theorem is named after the Reverend Thomas Bayes (1702–1761), who studied how to compute a distribution for the parameter of a binomial distribution (to use modern terminology). His friend, Richard Price, edited and presented the work in 1763, after Bayes' death, as An Essay towards solving a Problem in the Doctrine of Chances. Pierre-Simon Laplace replicated and extended these results in an essay of 1774, apparently unaware of Bayes' work.

One of Bayes's results (Proposition 5) gives a simple description of conditional probability, and shows that it can be expressed independently of the order in which things occur:

If there be two subsequent events, the probability of the second b/N and the probability of both together P/N, and it being first discovered that the second event has also happened, the probability I am right the conditional probability of the first event being true given that the second has also happened is P/b.

Note that the expression says nothing about the order in which the events occurred; it measures correlation, not causation. His preliminary results, in particular Propositions 3, 4, and 5, imply the result now called Bayes's Theorem (as described above), but it does not appear that Bayes himself emphasized or focused on that result.

Bayes's main result (Proposition 9 in the essay) is the following: assuming a uniform distribution for the prior distribution of the binomial parameter p, the probability that p is between two values a and b is

$$

\frac {\int_a^b {n+m \choose m} p^m (1-p)^n\,dp} {\int_0^1 {n+m \choose m} p^m (1-p)^n\,dp} \!

where m is the number of observed successes and n the number of observed failures.

What is "Bayesian" about Proposition 9 is that Bayes presented it as a probability for the parameter p. So, one can compute probability for an experimental outcome, but also for the parameter which governs it, and the same algebra is used to make inferences of either kind.

Bayes states his question in a way that might make the idea of assigning a probability distribution to a parameter palatable to a frequentist. He supposes that a billiard ball is thrown at random onto a billiard table, and that the probabilities p and q are the probabilities that subsequent billiard balls will fall above or below the first ball.

See also

---

• Bayesian inference
• Monty Hall problem
• Occam's razor
• Prosecutor's fallacy
• Raven paradox
• Revising opinions in statistics
• Empirical Bayes method
• Bayesian spam filtering

References

---

Versions of the essay

• Thomas Bayes (1763), "An Essay towards solving a Problem in the Doctrine of Chances. By the late Rev. Mr. Bayes, F. R. S. communicated by Mr. Price, in a letter to John Canton, A. M. F. R. S.", Philosophical Transactions, Giving Some Account of the Present Undertakings, Studies and Labours of the Ingenious in Many Considerable Parts of the World 53:370–418.
• Thomas Bayes (1763/1958) "Studies in the History of Probability and Statistics: IX. Thomas Bayes's Essay Towards Solving a Problem in the Doctrine of Chances", Biometrika 45:296–315. (Bayes's essay in modernized notation)
• Thomas Bayes "An essay towards solving a Problem in the Doctrine of Chances". (Bayes's essay in the original notation)

Commentaries

• G. A. Barnard (1958) "Studies in the History of Probability and Statistics: IX. Thomas Bayes's Essay Towards Solving a Problem in the Doctrine of Chances", Biometrika 45:293–295. (biographical remarks)
• Daniel Covarrubias. "An Essay Towards Solving a Problem in the Doctrine of Chances". (an outline and exposition of Bayes's essay)
• Stephen M. Stigler (1982). "Thomas Bayes's Bayesian Inference," Journal of the Royal Statistical Society, Series A, 145:250–258. (Stigler argues for a revised interpretation of the essay; recommended)
• Isaac Todhunter (1865). A History of the Mathematical Theory of Probability from the time of Pascal to that of Laplace, Macmillan. Reprinted 1949, 1956 by Chelsea and 2001 by Thoemmes.

Additional material

• Pierre-Simon Laplace (1774). "Mémoire sur la Probabilité des Causes par les Événements", Savants Étranges 6:621–656; also Œuvres 8:27–65.
• Pierre-Simon Laplace (1774/1986). "Memoir on the Probability of the Causes of Events", Statistical Science 1(3):364–378.
• Stephen M. Stigler (1986). "Laplace's 1774 memoir on inverse probability", Statistical Science 1(3):359–378.
• Stephen M. Stigler (1983). "Who Discovered Bayes's Theorem?" The American Statistician 37(4):290–296.
• Jeff Miller et al. Earliest Known Uses of Some of the Words of Mathematics (B). (very informative; recommended)
• Athanasios Papoulis (1984). Probability, Random Variables, and Stochastic Processes, second edition. New York: McGraw-Hill.
• James Joyce (2003). "Bayes's Theorem", Stanford Encyclopedia of Philosophy.
• The on-line textbook: Information Theory, Inference, and Learning Algorithms, by David J.C. MacKay provides an up to date overview of the use of Bayes's theorem in information theory and machine learning.
• Stanford Encyclopedia of Philosophy: Bayes's Theorem provides a comprehensive introduction to Bayes's theorem.

Probability theory | Mathematical theorems

مبرهنة بايز | Bayestheorem | Teorema de Bayes | Théorème de Bayes | Teorema di Bayes | Theorema van Bayes | ベイズの定理 | Twierdzenie Bayesa | Teorema lui Bayes | Теорема Байеса | Téoréma Bayes | Định lý Bayes | 贝叶斯定理