πŸ“ Mathematics β€” Class XII Β· Probability

Probability

The mathematics of uncertainty β€” from conditional chance to Bayes' reasoning

πŸ“– Chapter 13 ⏱ ~75 min read 🏷 Probability

In this chapter

  1. Introduction
  2. Conditional Probability
  3. Multiplication Theorem on Probability
  4. Independent Events
  5. Bayes' Theorem
  6. Summary
  7. Historical Note

13.1 Introduction

The theory of probability was developed to analyse situations where the outcome of an experiment is uncertain. In Class XI, we studied the axiomatic approach to probability and concepts like sample space, events, and probability of events.

In this chapter, we take this forward and study conditional probability, which asks: what is the probability of an event given that another event has already occurred? This leads to important results like the multiplication theorem, the theorem of total probability, and the celebrated Bayes' theorem.

13.2 Conditional Probability

The conditional probability of an event E, given the occurrence of the event F, is defined as:

Definition of conditional probability P(E|F) = P(E ∩ F) / P(F),    P(F) β‰  0
Conditional probability, multiplication theorem, and total probability theorem
Figure 13.1 β€” Conditional probability (Venn diagram), multiplication theorem, and total probability theorem
Properties

0 ≀ P(E|F) ≀ 1   |   P(E'|F) = 1 βˆ’ P(E|F)
P((E βˆͺ F)|G) = P(E|G) + P(F|G) βˆ’ P((E ∩ F)|G)

Theorem of Total Probability

If {E₁, Eβ‚‚, ..., Eβ‚™} is a partition of the sample space S (meaning the Eα΅’ are pairwise disjoint and their union is S), and each Eα΅’ has nonzero probability, then for any event A associated with S:

Theorem of total probability P(A) = P(E₁)Β·P(A|E₁) + P(Eβ‚‚)Β·P(A|Eβ‚‚) + ... + P(Eβ‚™)Β·P(A|Eβ‚™)
P(A) = Ξ£α΅’ P(Eα΅’) Β· P(A|Eα΅’)

This theorem allows us to compute P(A) by considering all possible "causes" Eα΅’ that could lead to event A, weighting each conditional probability P(A|Eα΅’) by the probability P(Eα΅’) of that cause.

13.3 Multiplication Theorem on Probability

The multiplication theorem provides a way to compute the probability of the intersection of events:

Multiplication theorem P(E ∩ F) = P(E) · P(F|E) = P(F) · P(E|F)

For three events E, F, G:

P(E ∩ F ∩ G) = P(E) · P(F|E) · P(G|E ∩ F)
Intuition

To find the probability that both E and F occur, we can first find the probability that E occurs, and then multiply by the probability that F occurs given that E has already occurred. This is particularly useful for sequential experiments.

13.4 Independent Events

Two events E and F are said to be independent if the occurrence of one does not affect the probability of occurrence of the other. Mathematically:

Independent events P(E ∩ F) = P(E) · P(F)

Equivalent conditions (when P(E) β‰  0, P(F) β‰  0):
P(E|F) = P(E)   and   P(F|E) = P(F)
βŠ₯

Mutually Exclusive vs Independent

Mutually exclusive: E ∩ F = βˆ… (cannot both occur).
Independent: P(E ∩ F) = P(E)·P(F) (occurrence of one doesn't affect the other).
These are very different concepts!

n

Independent vs Pairwise Independent

Events E₁, Eβ‚‚, ..., Eβ‚™ are independent if P(Eᡒ₁ ∩ ... ∩ Eα΅’β‚–) = P(Eᡒ₁)Β·...Β·P(Eα΅’β‚–) for every subset. Pairwise independence is weaker than full independence.

13.5 Bayes' Theorem

Bayes' theorem β€” tree diagram and formula
Figure 13.2 β€” Bayes' theorem: tree diagram showing causes β†’ effects, and the posterior probability formula

If E₁, Eβ‚‚, ..., Eβ‚™ are events which constitute a partition of sample space S (i.e., they are pairwise disjoint and E₁ βˆͺ Eβ‚‚ βˆͺ ... βˆͺ Eβ‚™ = S), and A is any event with nonzero probability, then:

Bayes' Theorem P(Eα΅’|A) = P(Eα΅’) Β· P(A|Eα΅’) / Ξ£β±Ό P(Eβ±Ό) Β· P(A|Eβ±Ό)

= P(Eα΅’) Β· P(A|Eα΅’) / P(A)
How to read Bayes' theorem

Numerator: probability of "cause Eα΅’ AND effect A" β€” the joint probability that Eα΅’ is the cause and A is the observed effect.

Denominator: the total probability of A β€” obtained from the theorem of total probability, serving as a normalising constant.

Result: the posterior probability P(Eα΅’|A) β€” the probability that Eα΅’ is the cause, given that we have observed effect A.

Applications of Bayes' Theorem

βˆ‘ Summary

πŸ“œ Historical Note

The great Dutch scientist Christiaan Huygens (1629–1695), became acquainted with the correspondence between Pascal and Fermat and published the first book on probability, De Ratiociniis in Ludo Aleae, containing solutions of many interesting problems on probability in games of chance.

The next great work on probability theory is by Jacob Bernoulli (1654–1705), in the form of a great book, Ars Conjectandi, published posthumously in 1713. To him is due the discovery of one of the most important probability distributions β€” the Binomial distribution.

The next remarkable work on probability lies in 1933. A. N. Kolmogorov (1903–1987) is credited with the axiomatic theory of probability. His book, Foundations of Probability, published in 1933, introduces probability as a set function and is considered a classic.

Ch 12 β€” Linear Programming Back to Index