Topic 5 Basics of Probability

Similar documents
CMPSCI 240: Reasoning about Uncertainty

Lecture notes for probability. Math 124

Statistical Inference

AMS7: WEEK 2. CLASS 2

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

Problems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman.

Axioms of Probability

Independence Solutions STAT-UB.0103 Statistics for Business Control and Regression Models

CS 441 Discrete Mathematics for CS Lecture 19. Probabilities. CS 441 Discrete mathematics for CS. Probabilities

MA : Introductory Probability

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

ECE 302: Chapter 02 Probability Model

Chapter 2. Probability. Math 371. University of Hawai i at Mānoa. Summer 2011

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

ECE 340 Probabilistic Methods in Engineering M/W 3-4:15. Lecture 2: Random Experiments. Prof. Vince Calhoun

Lecture 1 : The Mathematical Theory of Probability

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

Independence. P(A) = P(B) = 3 6 = 1 2, and P(C) = 4 6 = 2 3.

Recitation 2: Probability

Probability Theory Review

Probability Theory and Applications

STAT:5100 (22S:193) Statistical Inference I

F71SM STATISTICAL METHODS

HW1 Solutions. October 5, (20 pts.) Random variables, sample space and events Consider the random experiment of ipping a coin 4 times.

Lecture 1. ABC of Probability

Statistical Theory 1

Important Concepts Read Chapter 2. Experiments. Phenomena. Probability Models. Unpredictable in detail. Examples

PROBABILITY THEORY. Prof. S. J. Soni. Assistant Professor Computer Engg. Department SPCE, Visnagar

Conditional Probability & Independence. Conditional Probabilities

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

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

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

Probability and distributions. Francesco Corona

Discrete Probability. Mark Huiskes, LIACS Probability and Statistics, Mark Huiskes, LIACS, Lecture 2

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

6.2 Introduction to Probability. The Deal. Possible outcomes: STAT1010 Intro to probability. Definitions. Terms: What are the chances of?

Probability: Terminology and Examples Class 2, Jeremy Orloff and Jonathan Bloom

Sample Space: Specify all possible outcomes from an experiment. Event: Specify a particular outcome or combination of outcomes.

Probability: Axioms, Properties, Interpretations

Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya

Introduction to Probability

Deep Learning for Computer Vision

Probability and Independence Terri Bittner, Ph.D.


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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 3 9/10/2008 CONDITIONING AND INDEPENDENCE

k P (X = k)

Origins of Probability Theory

Mathematics. ( : Focus on free Education) (Chapter 16) (Probability) (Class XI) Exercise 16.2

Lecture 9: Conditional Probability and Independence

Topic -2. Probability. Larson & Farber, Elementary Statistics: Picturing the World, 3e 1

Dynamic Programming Lecture #4

MATH MW Elementary Probability Course Notes Part I: Models and Counting

Lecture 6 - Random Variables and Parameterized Sample Spaces

UNIT 5 ~ Probability: What Are the Chances? 1

14 - PROBABILITY Page 1 ( Answers at the end of all questions )

PROBABILITY THEORY 1. Basics

CMPSCI 240: Reasoning Under Uncertainty

2. AXIOMATIC PROBABILITY

Topic 4 Probability. Terminology. Sample Space and Event

Lecture Slides. Elementary Statistics Eleventh Edition. by Mario F. Triola. and the Triola Statistics Series 4.1-1

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

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).

(a) Fill in the missing probabilities in the table. (b) Calculate P(F G). (c) Calculate P(E c ). (d) Is this a uniform sample space?

Module 1. Probability

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

Ch 14 Randomness and Probability

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

Chapter 7 Wednesday, May 26th

02 Background Minimum background on probability. Random process

STAT 430/510 Probability

RS Chapter 1 Random Variables 6/5/2017. Chapter 1. Probability Theory: Introduction

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

Probability- describes the pattern of chance outcomes

the time it takes until a radioactive substance undergoes a decay

Lecture Slides. Elementary Statistics Tenth Edition. by Mario F. Triola. and the Triola Statistics Series. Slide 1

Topic 2 Probability. Basic probability Conditional probability and independence Bayes rule Basic reliability

Statistics for Engineers

DISCRETE RANDOM VARIABLES: PMF s & CDF s [DEVORE 3.2]

A Event has occurred

STA111 - Lecture 1 Welcome to STA111! 1 What is the difference between Probability and Statistics?

Independence. CS 109 Lecture 5 April 6th, 2016

Chapter 6: Probability The Study of Randomness

Year 10 Mathematics Probability Practice Test 1

Probability: Part 1 Naima Hammoud

Chapter. Probability

Chapter 3 : Conditional Probability and Independence

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

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

Mutually Exclusive Events

Determining Probabilities. Product Rule for Ordered Pairs/k-Tuples:

Introduction Probability. Math 141. Introduction to Probability and Statistics. Albyn Jones

Conditional Probability 2 Solutions COR1-GB.1305 Statistics and Data Analysis

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

Unit 7 Probability M2 13.1,2,4, 5,6

Chapter 2: Probability Part 1

Probability Year 10. Terminology

Basic Probability. Introduction

Introduction and Preliminaries

Events A and B are said to be independent if the occurrence of A does not affect the probability of B.

Transcription:

Topic 5 Basics of Probability Equally Likely Outcomes and the Axioms of Probability 1 / 13

Outline Equally Likely Outcomes Axioms of Probability Consequences of the Axioms 2 / 13

Introduction A probability model has two essential pieces of its description. Ω, the sample space, the set of possible outcomes. An event is a collection of outcomes. We can define an event by explicitly giving its outcomes, A = {ω 1, ω 2,, ω n } or with a description A = {ω; ω has property P}. In either case, A is subset of the sample space, A Ω. P, the probability assigns a number to each event. Thus, a probability is a function. The domain is the collection of all events. The range is a number. We will see soon which numbers we will accept as probabilities of events. 3 / 13

Equally Likely Outcomes If Ω is a finite sample space, then if each outcome is equally likely, we define the probability of A as the fraction of outcomes that are in A. This leads to the formula P(A) = #(A) #(Ω). Exercise. Find the probabilities under equal likely outcomes. (a) Toss a coin. P{heads} = #(A) #(Ω) =. (b) Toss a coin three times. (c) Roll two dice. P{toss at least two heads in a row} = #(A) #(Ω) = P{sum is 9} = #(A) #(Ω) = 4 / 13

Equally Likely Outcomes Because we always have 0 #(A) #(Ω), we always have This gives us 2 of the three axioms. P(A) 0, P(Ω) = 1 (1&2) Toss a coin 4 times. #(Ω) = 16 A = {exactly 3 heads} ={HHHT, HHTH, HTHH, THHH} #(A) = 4 P(A) = 4/16 = 1/4 B = {exactly 4 heads} = {HHHH} #(B) = 1 P(B) = 1/16 Now let s define the set C = {at least three heads}. If you are asked the supply the probability of C, your intuition is likely to give you an immediate answer. P(C) = 5/16. 5 / 13

Axioms of Probability The events A and B have no outcomes in common. We say that the two events are disjoint or mutually exclusive and write A B =. In this situation, we have an addition principle #(A B) = #(A) + #(B). Divide by #(Ω), then we obtain the following identity: #(A B) #(Ω) = #(A) #(Ω) + #(B) #(Ω). If A B =, then Using this property, we see that or P(A B) = P(A) + P(B). (3) P{at least 3 heads} = P{exactly 3 heads} + P{exactly 4 heads} = 4 16 + 1 16 = 5 16. Any function P that accepts events as its domain, returns numbers as its range and satisfies Axioms 1, 2, and 3 as defined in (1), (2), and (3) can be called a probability. 6 / 13

Axioms of Probability By iterating the procedure in Axiom 3, we can also state that if the events, A 1, A 2,, A n, are mutually exclusive, then P(A 1 A 2 A n ) = P(A 1 ) + P(A 2 ) + + P(A n ). (3 ) This is a sufficient definition for a probability if the sample space Ω is finite. Consider a rare event - a lightning strike at a given location, winning the lottery, finding a planet with life - and look for this event repeatedly, we can write A j = {the first occurrence appears on the j-th observation}. Then, each of the A j are mutually exclusive and {event occurs eventually} = A 1 A 2 A n = A j = {ω; ω A j for some j}. j=1 7 / 13

We would like to say that Axioms of Probability P{event occurs eventually} = P(A 1 ) + P(A 2 ) + + P(A n ) + n = P(A j ) = P(A j ). j=1 lim n This would call for an extension of Axiom 3 to an infinite number of mutually exclusive events. This is the general version of Axiom 3 we use when we want to use calculus: For mutually exclusive events, {A j ; j 1}, then P = P(A j ) (3 ) j=1 A j j=1 j=1 Thus, statements (1), (2), and (3 ) give us the complete axioms of probability. 8 / 13

Consequences of the Axioms Complement Rule. Because A and its complement A c = {ω; ω / A} are mutually exclusive, P(A) + P(A c ) = P(A A c ) = P(Ω) = 1 or P(A c ) = 1 P(A). For example, if we toss a biased coin. We may want to say that P{heads} = p where p is not necessarily equal to 1/2. By necessity, P{tails} = 1 p. Toss a fair coin 4 times. P{fewer than 3 heads} = 1 P{at least 3 heads} = 1 5 16 = 11 16. 9 / 13

Consequences of the Axioms Difference Rule. Let B \ A denote the outcomes in B but not in A. If A B, then P(B \ A) = P(B) P(A). B A A Monotonicity Rule. If A B, then P(B \ A) 0 and P(A) P(B). We already know that for any event A, P(A) 0. Figure: Monotonicity Rule By the monotonicity rule, P(A) P(Ω) = 1. The range of a probability is a subset of [0, 1]. 10 / 13

Consequences of the Axioms Inclusion-Exclusion Rule. For any two events A and B, P(A B) = P(A) + P(B) P(A B). Bonferroni Inequality. For any two events A and B, B A A B P(A B) P(A) + P(B). Figure: Inclusion-Exclusion Rule 11 / 13

Consequences of the Axioms Continuity Property. If events satisfy B 1 B 2 and B = i=1 B i Then, P(B i ) is increasing. In addition, B 1 B 2 B3 C 1 C 2 C 3 P(B) = lim i P(B i ). Similarly, use the symbol to denote contains. If events satisfy C 1 C 2 and C = i=1 C i Figure: Continuity Property. (left) B i increasing to an event B. (right) C i decreasing to an event C. Then P(C i ) is decreasing and P(C) = lim i P(C i ). 12 / 13

Consequences of the Axioms Exercise. The statement of a : b odds for an event A indicates that P(A) P(A c ) = a b. Show that P(A) = a a + b. So, for example, 1 : 2 odds means P(A) = 1/3 and 5 : 3 odds means P(A) = 5/8. 13 / 13