Craps principle
From Wikipedia, the free encyclopedia
In probability theory, the craps principle is a theorem about event probabilities under repeated iid trials. Let E1 and E2 denote two mutually exclusive events which might occur on a given trial. Then for each trial, the conditional probability that E1 occurs given that E1 or E2 occur is
The events E1 and E2 need not be collectively exhaustive.
Contents |
[edit] Proof
Since E1 and E2 are mutually exclusive,
Also due to mutual exclusion,
Combining these three yields the desired result.
[edit] Application
If the trials are repetitions of a game between two players, and the events are
Then the craps principle gives the respective conditional probabilities of each player winning a certain repetition, given that someone wins (i.e., given that a draw does not occur). In fact, the result is only affected by the relative marginal probabilities of winning
and
; in particular, the probability of a draw is irrelevant.
[edit] Stopping
If the game is played repeatedly until someone wins, then the conditional probability above turns out to be the probability that the player wins the game.
[edit] Etymology
If the game being played is craps, then this principle can greatly simplify the computation of the probability of winning in a certain scenario. Specifically, if the first roll is a 4, 5, 6, 8, 9, or 10, then the dice are repeatedly re-rolled until one of two events occurs:
Since E1 and E2 are mutually exclusive, the craps principle applies. For example, if the original roll was a 4, then the probability of winning is
This avoids having to sum the infinite series corresponding to all the possible outcomes:
Mathematically, we can express the probability of rolling i ties followed by rolling the point:
The summation becomes an infinite geometric series:
which agrees with the earlier result.
[edit] References
Pitman, Jim (1993). Probability. Berlin: Springer-Verlag. ISBN 0-387-97974-3.
![\operatorname{P}\left[E_1\mid E_1\cup E_2\right]=\frac{\operatorname{P}[E_1]}{\operatorname{P}[E_1]+\operatorname{P}[E_2]}](../../../../math/0/2/a/02a85926a9efe171401264676a22fd4c.png)
![\operatorname{P}[E_1\cup E_2]=\operatorname{P}[E_1]+\operatorname{P}[E_2]](../../../../math/c/4/8/c48b73c18940047194facedf90d70616.png)

![\operatorname{P}[E_1\cap(E_1\cup E_2)]=\operatorname{P}\left[E_1\mid E_1\cup E_2\right]\operatorname{P}\left[E_1\cup E_2\right]](../../../../math/e/0/c/e0c52acf4c25bcb09e5c49742978218f.png)





![\sum_{i=0}^{\infty}\operatorname{P}[\textrm{first\ }i\textrm{\ rolls\ are\ ties,\ }(i+1)^\textrm{th}\textrm{\ roll\ is\ 'the\ point'}]](../../../../math/b/4/c/b4cf978c14f0be80943a52577223b0cb.png)
![\operatorname{P}[\textrm{first\ }i\textrm{\ rolls\ are\ ties,\ }(i+1)^\textrm{th}\textrm{\ roll\ is\ 'the\ point'}]
= (1-\operatorname{P}[E_1]-\operatorname{P}[E_2])^i\operatorname{P}[E_1]](../../../../math/b/4/5/b45186ef4ff07602a3b7217acf3aed58.png)
![\sum_{i=0}^{\infty} (1-\operatorname{P}[E_1]-\operatorname{P}[E_2])^i\operatorname{P}[E_1]
= \operatorname{P}[E_1] \sum_{i=0}^{\infty} (1-\operatorname{P}[E_1]-\operatorname{P}[E_2])^i](../../../../math/0/2/8/0284dbffd1e63e7b51fb147928b01ed4.png)
![= \frac{\operatorname{P}[E_1]}{1-(1-\operatorname{P}[E_1]-\operatorname{P}[E_2])}
= \frac{\operatorname{P}[E_1]}{\operatorname{P}[E_1]+\operatorname{P}[E_2]}](../../../../math/7/7/5/775f653c3a488e114846a0880e082517.png)

