You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
@@ -46,27 +47,28 @@ The following operations on events are fundamental:
46
47
- $\bigcap_{i=1}^{\infty} A_i$: all $A_i$
47
48
- $\bigcup_{i=1}^{\infty} A_i$: at least one $A_i$
48
49
49
-
:::{prf:example} Set Operations on Events
50
-
:label: ex-set-operations
51
-
52
-
If $A = \{3, 5, 6\}$ and $B = \{1, 3\}$, then:
53
-
- $A \cup B = \{1, 3, 5, 6\}$
54
-
- $A \cap B = \{3\}$
55
-
- $A^c = \{1, 2, 4\}$
56
-
:::
57
50
58
-
:::{note}
59
-
**Remarks:**
51
+
#### Remarks
60
52
61
53
1. If $A \cap B = \emptyset$, we say that $A$ and $B$ are **disjoint**. We often write $A \dot{\cup} B$ to indicate a union of two disjoint events $A, B$.
62
54
63
55
2. When $A \subseteq B$, event $A$ is said to **imply** event $B$. We then have $A \cap B = A$ and $A \cup B = B$.
64
56
65
57
3. Note that we have $A \cup A^c = \Omega$ and $A \cap A^c = \emptyset$.
Given two events $A$ and $B$, use a Venn diagram to represent:
83
86
@@ -88,6 +91,7 @@ c) $A$ or $B$, but not both
88
91
89
92
:::{exercise} Coin and Die Sample Space
90
93
:label: ex-coin-die
94
+
:class: dropdown
91
95
92
96
A coin and a die are tossed together.
93
97
@@ -100,11 +104,11 @@ b) Specify the following events:
100
104
101
105
### Probability measure
102
106
103
-
Consider a random experiment with sample space $\Omega$. Recall that we write $\mathcal{A}$ for the set of all possible events $E$. A probability on $\Omega$ is a function which assigns to every event $E \in \mathcal{A}$ a real number $P(E)$ and satisfies the following properties known as the **Axioms of Kolmogorov**:
104
-
105
-
:::{prf:definition} Probability Measure
107
+
:::{prf:definition} Probability Measure - Axioms of Kolmogorov
106
108
:label: def-probability-measure
107
109
110
+
Consider a random experiment with sample space $\Omega$. Recall that we write $\mathcal{A}$ for the set of all possible events $E$. A probability on $\Omega$ is a function which assigns to every event $E \in \mathcal{A}$ a real number $P(E)$ and satisfies the following properties known as the **Axioms of Kolmogorov**:
111
+
108
112
A **probability measure** on $\Omega$ is a function $P : \mathcal{A} \to \mathbb{R}$ satisfying the following axioms:
109
113
110
114
**A1)** $0 \leq P(E) \leq 1$ for all events $E \in \mathcal{A}$
@@ -121,8 +125,7 @@ We refer to $P(E)$ as the **probability** of the event $E \in \mathcal{A}$.
121
125
Events $E \in \mathcal{A}$ with $P(E) = 0$ are called **almost impossible**, events $E \in \mathcal{A}$ with $P(E) = 1$ are called **almost certain**.
122
126
:::
123
127
124
-
:::{note}
125
-
**Remarks:**
128
+
#### Remarks
126
129
127
130
1.**(Summation rule)** If in Axiom A3) we choose a finite sequence of disjoint events, say $E_1, E_2$ and $E_3$, we can simply set $E_i = \emptyset$ for all $i \geq 4$ to obtain
128
131
$$
@@ -135,10 +138,10 @@ Events $E \in \mathcal{A}$ with $P(E) = 0$ are called **almost impossible**, eve
135
138
P(A) = \frac{k}{n} = \frac{\text{number of good outcomes}}{\text{total number of possible outcomes}} = \frac{|A|}{|\Omega|}
136
139
$$
137
140
We refer to such a $P$ as the **uniform probability measure** on the sample space $\Omega$.
138
-
:::
139
141
140
142
:::{prf:example} Fair Die Probabilities
141
143
:label: ex-fair-die
144
+
:class: dropdown
142
145
143
146
In the die tossing example, if all six numbers are equally likely, we have
144
147
$$
@@ -167,12 +170,61 @@ Let $A, B \subseteq \Omega$ be events and $P$ a probability measure on $\Omega$.
167
170
168
171
:::{exercise} Prove Basic Properties
169
172
:label: ex-prove-properties
173
+
:class: dropdown
174
+
175
+
Prove of [](#prop-probability-properties):
176
+
177
+
**a) $P(\varnothing)=0$**
178
+
179
+
For a probability measure $P$ on $\Omega$, $P(\varnothing) = 0.$
180
+
181
+
The sets $\Omega$ and $\varnothing$ are disjoint and $\Omega = \Omega \cup \varnothing.$
182
+
183
+
By A3 applied to these two sets, $P(\Omega) = P(\Omega \cup \varnothing)
184
+
= P(\Omega) + P(\varnothing).$
185
+
186
+
Subtracting $P(\Omega)$ from both sides gives $0 = P(\varnothing)$
187
+
188
+
**b) $P(A^c) = 1 - P(A)$**
189
+
190
+
For every event $A \subseteq \Omega$, $P(A^{c}) = 1 - P(A).$
191
+
192
+
The sets $A$ and $A^{c}$ are disjoint and their union is the whole sample space: $\Omega = A \cup A^{c}, \qquad A \cap A^{c} = \varnothing.$
193
+
194
+
Using A3 for these two disjoint sets, $P(\Omega) = P(A \cup A^{c}) = P(A) + P(A^{c})$
195
+
196
+
By A2, $P(\Omega) = 1$, so $1 = P(A) + P(A^{c}) \quad\Rightarrow\quad P(A^{c}) = 1 - P(A)$
197
+
198
+
**c) $P(A\setminus B) = P(A) - P(A\cap B)$**
199
+
For all events $A,B \subseteq \Omega$, $P(A \setminus B) = P(A) - P(A \cap B).$
200
+
201
+
Inside $A$, split into two disjoint parts: $A = (A \setminus B) \cup (A \cap B)$, and $(A \setminus B) \cap (A \cap B) = \varnothing$.
202
+
203
+
Applying A3 to these two disjoint sets, $P(A) = P(A \setminus B) + P(A \cap B)$
For all events $A,B \subseteq \Omega$, $P(A \cup B) = P(A) + P(B) - P(A \cap B)$
210
+
211
+
Decompose the union into disjoint parts: $A \cup B = (A \setminus B) \cup B$, with $(A \setminus B) \cap B = \varnothing$.
212
+
213
+
By A3, $P(A \cup B) = P(A \setminus B) + P(B)$. Using the result from (c), $P(A \setminus B) = P(A) - P(A \cap B)$ so $P(A \cup B) = \bigl(P(A) - P(A \cap B)\bigr) + P(B) = P(A) + P(B) - P(A \cap B)$.
214
+
215
+
**e) If $A\subseteq B$ then $P(A)\le P(B)$**
216
+
If $A,B \subseteq \Omega$ with $A \subseteq B$, then $P(A) \le P(B)$
217
+
218
+
If $A \subseteq B$, then $B$ can be written as the disjoint union $B = A \cup (B \setminus A)$, with $A \cap (B \setminus A) = \varnothing$.
219
+
220
+
By A3, $P(B) = P(A) + P(B \setminus A)$.
170
221
171
-
Prove [](#prop-probability-properties).
222
+
By A1, $P(B \setminus A) \ge 0$, so $P(B) \ge P(A)$, which is equivalent to $P(A) \le P(B)$.
172
223
:::
173
224
174
225
:::{prf:example} Two Fair Coins
175
226
:label: ex-two-coins
227
+
:class: dropdown
176
228
177
229
Suppose that we toss two fair coins, so that each of the four outcomes in the sample space
178
230
$$
@@ -196,12 +248,14 @@ $$
196
248
197
249
:::{exercise} Unfair Die
198
250
:label: ex-unfair-die
251
+
:class: dropdown
199
252
200
253
Construct a sample space $\Omega$ and probability measure $P$ to model an unfair die in which faces $1-5$ are equally likely, but face 6 has probability $\frac{1}{3}$. Using this model, compute the probability that a toss results in a face showing an even number of dots.
201
254
:::
202
255
203
256
:::{prf:example} Probability Measure Construction
204
257
:label: ex-probability-construction
258
+
:class: dropdown
205
259
206
260
The foregoing exercise follows a typical modeling schema: First, select a suitable sample space $\Omega$, second, define $P(A)$ for all events $A$. For example if $\Omega$ is finite and all outcomes are equally likely we usually take $P(A) = \frac{|A|}{|\Omega|}$. If it is not the case that all outcomes are equally likely, then $P(A)$ would be given by some other formula.
207
261
@@ -217,6 +271,7 @@ This is a well defined probability measure on $\Omega$. Analogously, one can con
217
271
218
272
:::{prf:example} Two Dice Conditional Probability
219
273
:label: ex-two-dice-conditional
274
+
:class: dropdown
220
275
221
276
We toss two fair dice. Each of the 36 possible outcomes in $\Omega$ is equally likely to occur and hence has probability $\frac{1}{36}$. Now suppose that we observe that the first die is a four. Then given this information, what is the probability that the sum of the two dice equals six?
222
277
@@ -245,6 +300,7 @@ Note that $P(\cdot|F)$ is itself a probability measure in the first argument, ca
245
300
246
301
:::{prf:example} Family with Two Children
247
302
:label: ex-two-children
303
+
:class: dropdown
248
304
249
305
A family has two children. What is the conditional probability that both are boys given that at least one of them is a boy?
250
306
@@ -258,6 +314,7 @@ $$
258
314
259
315
:::{prf:example} Drawing Balls from an Urn
260
316
:label: ex-urn-balls
317
+
:class: dropdown
261
318
262
319
Suppose an urn contains seven black and five white balls. We draw two balls from the urn without replacement. Assuming that each ball in the urn is equally likely to be drawn, what is the probability that both drawn balls are black?
263
320
@@ -271,6 +328,7 @@ In the preceding display, we have used that $P(E \cap F) = P(F) P(E|F)$. This ru
271
328
272
329
:::{exercise} Multiplication Rule for Three Events
273
330
:label: ex-multiplication-three
331
+
:class: dropdown
274
332
275
333
Show that for any three events $A, B, C \subseteq \Omega$ such that $P(A \cap B) > 0$ we have
276
334
$$
@@ -304,6 +362,7 @@ $$
304
362
305
363
:::{prf:example} Genetic Anomaly and Stomach Cancer
306
364
:label: ex-stomach-cancer
365
+
:class: dropdown
307
366
308
367
It is suspected that stomach cancer develops with probability $p$ if some specific genetic anomaly is given. In absence of this anomaly stomach cancer develops with probability $q < p$.
309
368
@@ -338,6 +397,7 @@ $$
338
397
339
398
:::{prf:example} Bayes' Rule Application
340
399
:label: ex-bayes-stomach-cancer
400
+
:class: dropdown
341
401
342
402
In the context of [](#ex-stomach-cancer), calculate the probability that a person with stomach cancer shows the genetic anomaly.
343
403
@@ -349,6 +409,7 @@ $$
349
409
350
410
:::{exercise} Overloaded Cell System
351
411
:label: ex-overloaded-cell
412
+
:class: dropdown
352
413
353
414
The probability that a cell in a wireless system is overloaded is $\frac{1}{3}$. Given that it is overloaded, the probability of a blocked call is 0.3. Given that it is not overloaded, the probability of a blocked call is 0.1. Find the conditional probability that the system is overloaded given that your call is blocked.
354
415
@@ -357,6 +418,7 @@ The probability that a cell in a wireless system is overloaded is $\frac{1}{3}$.
357
418
358
419
:::{exercise} Autopilot Failure
359
420
:label: ex-autopilot
421
+
:class: dropdown
360
422
361
423
A certain aircraft's autopilot has conditional probability $\frac{1}{3}$ of failure given that it employs a faulty microprocessor chip. The autopilot has conditional probability $\frac{1}{10}$ of failure given that it employs a nonfaulty chip. According to the chip manufacturer, the probability that a customer receives a faulty chip is $\frac{1}{4}$. Given that an autopilot failure has occurred, find the conditional probability that a faulty chip was used.
362
424
@@ -369,6 +431,7 @@ $$
369
431
370
432
:::{exercise} Internet Packet Routing
371
433
:label: ex-packet-routing
434
+
:class: dropdown
372
435
373
436
Due to an Internet configuration error, packets sent from Zurich to Lausanne are routed through Bellinzona with probability 3/4. Given that the packet is routed through Bellinzona, suppose it has conditional probability 1/3 of being dropped. Given that a packet is not routed through Bellinzona, suppose it has conditional probability 1/4 of being dropped.
374
437
@@ -378,6 +441,7 @@ b) Can you find the conditional probability that a packet is routed through Bell
378
441
379
442
:::{prf:example} The Monty Hall Problem
380
443
:label: ex-monty-hall
444
+
:class: dropdown
381
445
382
446
In a game show, a contestant is told the rules as follows: There are three doors, labelled 1, 2, 3. A single prize is hidden behind one of them. You get to select one door. Initially your chosen door will not be opened. Instead, the gameshow host will open one of the two other doors, and he will do so in such a way as not to reveal the prize.
0 commit comments