23.11.2014 Views

Slides Chapter 1. Measure Theory and Probability

Slides Chapter 1. Measure Theory and Probability

Slides Chapter 1. Measure Theory and Probability

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>1.</strong>5. OTHER DEFINITIONS OF PROBABILITY<br />

<strong>1.</strong>5 Other definitions of probability<br />

WhenΩisfinite,sayΩ = {a 1 ,...,a k },manytimestheelementary<br />

events are equiprobable, that is, P({a 1 }) = ··· = P({a k }) = 1/k.<br />

Then, for A ⊂ Ω, say A = {a i1 ,...,a im }, then<br />

m∑<br />

P(A) = P({a ij }) = m k .<br />

j=1<br />

This is the definition of probability given by Laplace, which is<br />

useful only for experiments with a finite number of possible results<br />

<strong>and</strong> whose results are, a priori, equally frequent.<br />

Definition <strong>1.</strong>22 (Laplace rule of probability)<br />

The Laplace probability of an event A ⊆ Ω is the proportion of<br />

results favorable to A; that is, if k is the number of possible results<br />

or cardinal of Ω <strong>and</strong> k(A) is the number of results contained in A<br />

or cardinal of A, then<br />

P(A) = k(A)<br />

k .<br />

In order to apply the Laplace rule, we need to learn to count.<br />

The counting techniques are comprised in the area of Combinatorial<br />

Analysis.<br />

The following examples show intuitively the frequentist definition<br />

of probability.<br />

Example <strong>1.</strong>15 (Frequentist definition of probability)<br />

The following tables report the relative frequencies of the results<br />

of the experiments described in Example <strong>1.</strong>8, when each of these<br />

experiments are repeated n times.<br />

(a) Tossing a coin n times. The table shows that both frequencies<br />

of “head” <strong>and</strong> “tail” converge to 0.5.<br />

ISABEL MOLINA 19

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!