Lecture 8: Probability

Similar documents
Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14

ELEG 3143 Probability & Stochastic Process Ch. 1 Probability

1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).

Probability: Sets, Sample Spaces, Events

Lecture notes for probability. Math 124

Fundamentals of Probability CE 311S

STAT 430/510 Probability

Module 1. Probability

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

7.1 What is it and why should we care?

God doesn t play dice. - Albert Einstein

Axioms of Probability

Probabilistic models

Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006

Notes Week 2 Chapter 3 Probability WEEK 2 page 1

Week 2. Section Texas A& M University. Department of Mathematics Texas A& M University, College Station 22 January-24 January 2019

CMPSCI 240: Reasoning about Uncertainty

Statistical Theory 1

The enumeration of all possible outcomes of an experiment is called the sample space, denoted S. E.g.: S={head, tail}

Origins of Probability Theory

HW2 Solutions, for MATH441, STAT461, STAT561, due September 9th

STT When trying to evaluate the likelihood of random events we are using following wording.

Probabilistic models

Statistical Inference

MA : Introductory Probability

Lecture 3. Probability and elements of combinatorics

2. AXIOMATIC PROBABILITY

Some Basic Concepts of Probability and Information Theory: Pt. 1

I - Probability. What is Probability? the chance of an event occuring. 1classical probability. 2empirical probability. 3subjective probability

What is the probability of getting a heads when flipping a coin

CIVL Why are we studying probability and statistics? Learning Objectives. Basic Laws and Axioms of Probability

Axioms of Probability. Set Theory. M. Bremer. Math Spring 2018

Compound Events. The event E = E c (the complement of E) is the event consisting of those outcomes which are not in E.

Lecture 1 : The Mathematical Theory of Probability

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics?

Chapter 6: Probability The Study of Randomness

Math 1313 Experiments, Events and Sample Spaces

Conditional Probability

(6, 1), (5, 2), (4, 3), (3, 4), (2, 5), (1, 6)

STAT Chapter 3: Probability

Probability Notes (A) , Fall 2010

Introduction to Probability. Ariel Yadin. Lecture 1. We begin with an example [this is known as Bertrand s paradox]. *** Nov.

Lecture 4: Probability and Discrete Random Variables

CIVL Probability vs. Statistics. Why are we studying probability and statistics? Basic Laws and Axioms of Probability

Lecture 1. ABC of Probability

PROBABILITY THEORY 1. Basics

Econ 325: Introduction to Empirical Economics

3.2 Probability Rules

CIVL 7012/8012. Basic Laws and Axioms of Probability

Probability and distributions. Francesco Corona

Review Basic Probability Concept

Formalizing Probability. Choosing the Sample Space. Probability Measures

ORF 245 Fundamentals of Statistics Chapter 5 Probability

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

CHAPTER 1 SETS AND EVENTS

Information Science 2

HW MATH425/525 Lecture Notes 1

Recap of Basic Probability Theory

Introduction to Probability

Dynamic Programming Lecture #4

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability

Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya

tossing a coin selecting a card from a deck measuring the commuting time on a particular morning

Chance, too, which seems to rush along with slack reins, is bridled and governed by law (Boethius, ).

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability

Notes for Math 324, Part 12

9/6. Grades. Exam. Card Game. Homework/quizzes: 15% (two lowest scores dropped) Midterms: 25% each Final Exam: 35%

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch

Recap of Basic Probability Theory

Probability (Devore Chapter Two)

MS-A0504 First course in probability and statistics

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B).

BASICS OF PROBABILITY CHAPTER-1 CS6015-LINEAR ALGEBRA AND RANDOM PROCESSES

Introduction and basic definitions

Chapter 5 : Probability. Exercise Sheet. SHilal. 1 P a g e

1. Discrete Distributions

Properties of Probability

If S = {O 1, O 2,, O n }, where O i is the i th elementary outcome, and p i is the probability of the i th elementary outcome, then

Recap. The study of randomness and uncertainty Chances, odds, likelihood, expected, probably, on average,... PROBABILITY INFERENTIAL STATISTICS

2 Chapter 2: Conditional Probability

Chapter 1: Introduction to Probability Theory

4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio

Chapter 2 PROBABILITY SAMPLE SPACE

Probability- describes the pattern of chance outcomes

1 INFO Sep 05

4/17/2012. NE ( ) # of ways an event can happen NS ( ) # of events in the sample space

= 2 5 Note how we need to be somewhat careful with how we define the total number of outcomes in b) and d). We will return to this later.

Venn Diagrams; Probability Laws. Notes. Set Operations and Relations. Venn Diagram 2.1. Venn Diagrams; Probability Laws. Notes

Deep Learning for Computer Vision

Randomized Algorithms

1 Preliminaries Sample Space and Events Interpretation of Probability... 13

Notes. Combinatorics. Combinatorics II. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006

Probability deals with modeling of random phenomena (phenomena or experiments whose outcomes may vary)

4. Probability of an event A for equally likely outcomes:

k P (X = k)

ECE353: Probability and Random Processes. Lecture 2 - Set Theory

Set theory background for probability

Lectures Conditional Probability and Independence

University of California, Berkeley, Statistics 134: Concepts of Probability. Michael Lugo, Spring Exam 1

Introduction to Probability Theory

Transcription:

Lecture 8: Probability The idea of probability is well-known The flipping of a balanced coin can produce one of two outcomes: T (tail) and H (head) and the symmetry between the two outcomes means, of course, that the probability of each is 2 Briefly, P (T ) = P (H) = 2 We cannot predict apriory (ie, beforehand) the result of a specific experiment, but for a long series of coin tossing we can formulate a non-trivial deterministic law Let t(n) denote the number of times T results in n flips of a coin, and v T (n) = t(n) be n the corresponding frequency (which is random and different for different sequences of flips!), then we can expect, that lim v T (n) = P (T ) = n 2 This is an experimental fact, rather than a theoretical statement Similar experiments in biology (the sex of a human child) were repeated throughout history many billions of times and gave the same result: P (boy) = P (girl) = 2 The main object of study in probability theory is the random experiment, which preserves all main features of coin tossing Random experiments We will discuss three important ideas associated with probability Randomness The result (for given and fixed external conditions) cannot be predicted in advance The set of all possible outcomes must be known The sample space S of an experiment is the set of all possible elementary (irreducible) results of the experiment Suppose for simplicity that S contains a finite number N of outcomes, which can be enumerated as {s, s 2,, s N } = S Every experiment produces one (and only one) outcome s i, i =, 2, N Example A classic experiment is dice tossing ( elementary outcomes, the possible numbers on the upper face) The event that the number on the upper face is even is not elementary because it contains 3 elementary outcomes: 2,4, and

2 Reproducibility The experiment can be repeated under fixed conditions an infinite number of times, at least in principle Games (coins, dice, cards, roulette) are classic examples The question about probability of the existence of life on Mars or somewhere else in the Universe cannot be the subject of probability theory or statistics, because such an experiment is not reproducible 3 Symmetry All outcomes S i, i =, 2,, N must be equally likely, meaning that in a very long series of experiments P = lim n v i (n) = lim t i(n) n = N In other words, each outcome occurs just as often as the other outcomes Here, just as in the earlier case of coin flipping, t i represents the number of times outcome S i occurs during the first n trials of the experiment and v i (n) = t i(n) is the corresponding frequency Usually, the equal likelihood n of the outcomes is a consequence of some sort of symmetry of the random experiment The set S = {S, S 2, S N } (the sample space with corresponding equal probabilities P i =, i =, 2, N ) is known as the classical or combinatorial N probabilistic space The table { } S S S = 2 S N N N N gives a complete description of the statistical experiment Example 2 Dice tossing: S Pi = { 2 3 4 5 } (because of symmetry!) An event is a collection of outcomes; that is, a subset of the sample space Every event A can be described by a finite subset of S (the same notation A) Logical language: statements A, B, Geometrical language: subsets A, B, By the definition P (A) = A = A N = N In other words, to find the probability of an event, count the number of outcomes belonging to the event and add up their individual probabilities In the equally likely sample spaces we are discussing here, the probability is just divided by the 2 S i A

number N of elements of the sample space The notation S i A means that S i belongs to the subset A or, in logical terms, it means that the outcome S i implies statement (event) A This is the classical definition of probability Example 3 Experiment: selection of one card from the full deck of 54 playing cards Such a deck consists of two jokers together with 3 denominations {A, 2, 3, 4, 5,, 7, 8, 9, 0, J, Q, K} in each of four suits,,, Again we assume that each outcome is equally likely: P i =, i =, 2,, 54 54 To find the probability of the event that the card selected is a heart, write P ( ) = S i 54 = 3 54 A B U A B S Algebra of events Using the given system of events one can construct new events using logical (set theory) operations Two equivalent languages are admissible, the second one is already known Logic Set theory A the statement A is a subset of S Certain event, T Full sample space, S Impossible event, F empty set, Not A, A complementary set A, containing all points of S outside A A but not B, A \ B A \ B, all points of A outside of B Or A or B, A B Union of A and B, notation A B Both A and B, A B Intersection A B, or A B, points common to both A and B B implies A, B A A B, inclusion A and B are not both true A B = 3

The notion of probability is very similar to the notions of mass, weight, area, etc Sometimes in applications, instead of using the term probability of event A you will see the phrase statistical weight of A The following properties of probabilities are provable, and sometimes the first three are taken as axioms P (S) =, P ( ) = 0 2 P (A) = P (A), or P (A) + P (A) = (every elementary event is either in A, or in A, but not in both) 3 If AB = (non intersecting, mutually exclusive events), then P (A B) = P (A) + P (B), additive property similar to additivity of area, volume, etc 3a Moreover, if A, A 2,, A n satisfy A i A j = for all i, j =, 2,, n, i j then n P ( n i=a i ) = P (a i ) The hypothesis A i A j = 4 If A B then P (A) P (B) i= i, j =, 2,, n is called pairwise disjointness 5 P (A B) = P (A) + P (B) P (AB) (for intersecting A,B) The formula is simple: if we take the sum of probabilities of all the elementary events from A and from B, then we ll get all the S i from A B, but the S i belonging to the intersection get double counted P (A \ B) = P (A) P (AB) (See the Venn diagram for A \ B) The proofs of all these formulas are straightforward: P (A) = A, but A = A or P (A B) = P ( A ) = A B = A A + B AB = A = P (A) (we used the addition principle) 4

= A + B AB = P (A) + P (B) P (AB) Using formula 5, ie the addition principle for probabilities, and standard facts of set theory, one can prove more general formulas For instance, P (A B C) = P ((A B) C) = P (A B) + P (C) P ((A B)C) = P (A) + P (B) P (AB) + P (C) P (AC BC) = P (A) + P (B) + P (C) P (AB) [P (AC) + P (BC) P (ABC)] = P (A) + P (B) + P (C) P (AB) P (AC) P (BC) + P (ABC) using the addition principle, distributivity and associativity of the set operations, and the formula AC BC = ABC Example 4 So-called DeMere paradox The experiment consists of tossing two identical dice There are two possibilities for the sample space S, one consisting of 3 ordered pairs and the other with 2 unordered pairs I (ordered pairs) II (unordered pairs) (, )(, 2)(, 3)(, 4)(, 5)(, ) (, ) (2, )(2, 2)(2, 3)(2, 4)(2, 5)(2, ) (2, )(2, 2) (3, )(3, 2)(3, 3)(3, 4)(3, 5)(3, ) (3, )(3, 2)(3, 3) (, )(, 2)(, 3)(, 4)(, 5)(, ) (, ) (, 2) (, ) N = 3 N = + 2 + + = 2 Now suppose A is the set of doublets, A = {(, ), (2, 2), (3, 3), (4, 4), (5, 5), (, )} Clearly N(A) = In the first case P I (A) = 3 II(A) = 2 7 There are no theoretical reasons to prefer one of these possibilities over the other But experimental data shows that the ordered pairs model is correct! This general idea works in many cases: even for coins, dice and some other objects that look identical We can always consider them as distinguishable, and usually that is the best perspective Example 5 (Birthdays, due to Euler) What is the probability, that in a class with 25 students, two of them have a common birthday? The answer is surprising: 05 (ie 5%) Solution Let s consider the following experiment Randomly choose a class among all classes of such size We can interview students (say, in alphabetical order) to get information about their birthdays (bd) The corresponding sequence: 5

(bd, bd 2,, bd 25 ) is an elementary outcome of the experiment According to the product rule the total number of outcomes is very large: = N = 35 } 35 {{ 35} = 35 25 25 times For simplicity, we suppose that every year has 35 days Let A 25 denote the event that two students in the class have a common birthday Then P (A 25 ) = P (A 25 ) and A 25 is the event that all 25 students have different birthdays It is easy to see that A 25 = N(A) = } 35 3434 {{} = P25 35 492 0 3 25 factors We count this set by noting that the first student has 35 possible birthdays, the second has 34 opportunities, because his birthday is distinct from the first one, etc As a result ( 35 34 34 P (A 25 ) = 35 35 35 = ) ( 24 ) 35 35 Direct calculation gives P (A 25 ) 44, ie P (A 25 ) = P (A 25 ) 44 = 5 (5%) Now suppose the class has r students P ( ) ( A r = 35 P (A r ) = P ( A r ) ) ( r 35 One can use instead of direct calculations the following approximation Recall that e ln x = x and ln ab = ln a + ln b Since the derivative of ln x at x = is, it follows that ln( ξ) = ξ, for small ξ As a result, P ( ) ( A r = ) ( r ) 35 35 )

= e ln()+ln( 35)+ +ln( r 35 ) e 0 35 2 (r ) 35 35 = e +2+ +(r ) 35 = e r(r ) 2 35 (using the formula + 2 + + n = n(n + ) ) 2 If r = 23 then P (A 23 ) = P ( A 23 ) 050 If r = 30 then P (A30 ) 030, P (A 30 ) 070 If r = 40 then P (A 40 ) 00, P (A 40 ) 090 7