Math 2.0

statement theorem

Bayes' theorem

Statement

Let (Ω,F,P)(\Omega, \mathcal{F}, P) be a probability space and let A,B∈FA, B \in \mathcal{F} with P(A)>0P(A) > 0 and P(B)>0P(B) > 0. Then P(A∣B)=P(B∣A) P(A)P(B).P(A \mid B) = \frac{P(B \mid A) \, P(A)}{P(B)}.

Remarks

Let A1,A2,…A_1, A_2, \dots be a finite or countable partition of Ω\Omega into events of positive probability. With the law of total probability, P(Aj∣B)=P(B∣Aj) P(Aj)∑iP(B∣Ai) P(Ai)P(A_j \mid B) = \dfrac{P(B \mid A_j) \, P(A_j)}{\sum_i P(B \mid A_i) \, P(A_i)}. In Bayesian language, P(A)P(A) is the prior probability, P(B∣A)P(B \mid A) is the likelihood and P(A∣B)P(A \mid B) is the posterior probability. The proof: both P(A∣B) P(B)P(A \mid B) \, P(B) and P(B∣A) P(A)P(B \mid A) \, P(A) are equal to P(A∩B)P(A \cap B).

History

The theorem is named after Thomas Bayes. Pierre-Simon Laplace found it independently and developed it further.

Explanations

L1 human

Bayes' theorem turns "the chance of the evidence given the cause" into "the chance of the cause given the evidence". A medical test tells you how often sick people test positive. Bayes' theorem tells you how likely a person with a positive test is to be sick.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

5 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Bayes'_theorem, Statement of theorem