1. Chapter 1 Fundamentals of Applied Probability by Al Drake

2. Experiment Any non-deterministic process. For example: Model of an Experiment A simplified description of an experiment. For example: - the number on the top face

3. Sample Space All possible outcomes of an experiment. “The precise statement of an appropriate sample space, resulting from the detailed description of a model of an experiment, will do much to resolve common difficulties [when solving problems]. In this book we shall literally live in sample space.” (pg.6)

4. Visualizing the Sample Space (1) (2) (3)(4)(5) (6) sample points (S1, S2, etc.) universe (U)

5. Different ways of listing experimental outcomes: (1) (2) (3)(4)(5) (6) (divisible by 2) (odd) (even) (divisible by 3) (5)

6. Sample Space All possible outcomes of an experiment. Sample points must be: - finest grain no 2 distinguishable outcomes share a point - mutually exclusive no outcome maps to more than 1 point - collectively exhaustive all possible outcomes map to some point O1 O2 S1 S2 O1 ?? O1

7. Different ways of listing experimental outcomes: (1) (2) (3)(4)(5) (6) (divisible by 2) (odd) (even) (divisible by 3) (5)

8. Event Defined on a sample space. A grouping of 1 or more sample points. (1) (2) (3) (4) (5) (6) {even} {< 3} {5} Warning: This is subtly unintuitive.

9. Event Space A set of 1 or more events that covers all outcomes of an experiment.

10. Different ways of defining events: (1) (2) (3) (4) (5) (6) (1) (2) (3) (4) (5) (6) (1) (2) (3) (4) (5) (6) {even} {odd} {2} {4}{6} {1} {3}{5} {divisible by 2} {divisible by 3}

11. Sample Event Space A set of 1 or more events that covers all outcomes of an experiment. Event points must be: - mutually exclusive no outcome maps to more than 1 event - collectively exhaustive all possible outcomes map to some event

12. Different ways of defining events: (1) (2) (3) (4) (5) (6) (1) (2) (3) (4) (5) (6) (1) (2) (3) (4) (5) (6) {even} {odd} {2} {4}{6} {1} {3}{5} {divisible by 2} {divisible by 3}

13. Operations on events A = {< 3} (1) (2) (3) (4) (5) (6) A’ complement

14. Operations on events A = {< 3} (1) (2) (3) (4) (5) (6) AB intersection B = {odd}

15. Operations on events A = {< 3} (1) (2) (3) (4) (5) (6) A + B union B = {odd} Venn Diagram – picture of events in the universal set

16. Axioms

17. Theorems A (1) (2) (3) (4) (5) (6) B AB

18. Proving a Theorem: CD = DC Start with axiom 1: A+B = B+A Warning: A + B is not addition, AB is not multiplication A + B = A + B + C does not mean C = φ AB C

19. How do you establish the sample space? SequentialCoordinate System

20. How do you establish the sample space?

21. Probability A number assigned to an event which represents the relative likelihood that event will occur when the experiment is performed. For event A, its probability is P(A)

22. Axioms of Probability

23. Theorems Warning: There are 2 types of + operator here

24. Conditional Probability

25. A B shift to conditional probability space B A A B 0.1 0.4 0 0.3 0.1 P(A|B) ?

26. Sequential sample spaces revisited

27. Independence Two events A and B, defined on a sample space, are independent if knowledge as to whether the experimental outcome had attribute A would not affect our measure of the likelihood that the experimental outcome also had attribute B. Formally: P(A|B) = P(A)  P(AB) = P(A)*P(B) NOTE: A may be φ

28. Mutual Independence For example, if you have 5 events defined, any subset of these events has the property: P(A 1 A 2 A 5 ) = P(A 1 )P(A 2 )P(A 5 )

29. Mutual Independence Pair-wise independence doesn’t mean mutual independence. If we know: P(A1 A2) = P(A1)P(A2) P(A1 A3) = P(A1)P(A3) P(A2 A3) = P(A1)P(A3) This does not imply mutual independence: P(A 1 A 2 A 3 ) = P(A 1 )P(A 2 )P(A 3 )

30. Conditional Independence

31. Bayes Theorem If a set of events A1, A2, A3… form an event space:

32. Permutations, Combinations

33. Bonus Problem 123 3 1