Statistics 1 - Lecture Notes Chapter 1
|
|
- Shauna Small
- 5 years ago
- Views:
Transcription
1 Statistics 1 - Lecture Notes Chapter 1 Caio Ibsen Graduate School of Economics - Getulio Vargas Foundation April 28, 2009 We want to establish a formal mathematic theory to work with results of experiments that can change randomly. For example, imagine the experiment of rolling a dice, there are six possible outputs, {1, 2, 3, 4, 5, 6}. But we can think in another event, for instance, an event can be the even numbers. Moreover, we want to know what the chances are for some event to occur, that is, the probabilities of each possible result of an experiment(what is exactly a possible result? And a probability?). How we model this kind of situations is the goal of this chapter. 1 Basic Model Let Ω be a space of outputs of an experiment, called sample space, in the example above Ω {1, 2, 3, 4, 5, 6}. We call the elements of Ω as the simple or elementary events. When we are discussing about the possible results of an experiment, in general, we are interested in more results than the elements of Ω, like the result of the dice being even or odd. Let us define what we will considerer as a possible result of an experiment. Definition 1.1. Let Ω be a nonempty set of elementary results of an experiment, we define as a field (or an algebra) of events of Ω the set A of subsets of Ω such that i - Ω A; ii - if A A then A c A; and iii - for any finite family {A n } of elements of A we have n A n A. It is interesting to note the reasons of this definition. Intuitively, A represents the set of all events that we can identify at the end of the experiment. Thus, the first property tell us that we always know when Ω happens, the second is if we can tell when an event A occurs then we can tell when this event does not occur. The last property tells us that if we can identify when an event A occurs and when an event B occurs, defining the event D as the A or B, we also need to be able to identify when the event D occurs. 1
2 Exercise 1.1. Show that the property (iii) of the definition of a field can be exchanged for: for any finite family {A n } of elements of A we have n A n A. Solution 1.1. We need to prove that both sentences are equivalent. First assume that for any finite family {A n } of elements of A we have n A n A. By item ii, we know that for any finite family {A n } of elements of A, {A c n} is a finite family of elements of A, thus, n A c n A ii ( n A c n) c A. But ( n A c n) c n A n then we have the result. On the other hand, assuming that for any finite family {A n } of elements of A we have n A n A the result follows likewise. Example 1.1. For the discussed example of a dice we have Ω {1, 2, 3, 4, 5, 6} and a field for this Ω can be {, Ω}. We call this kind of field a trivial field of events. It is the most simple field of any set Ω. The largest possible algebra is the set of all subsets of Ω, denoted by P(Ω). Exercise 1.2. Prove that for any nonempty set Ω, we have that P(Ω) is an algebra of events of Ω. Solution 1.2. Let us see the three properties: i - Ω Ω Ω P(Ω); ii - A Ω A c Ω A c P(Ω); and iii - {A n } P (Ω) A n Ω n n A n Ω n A n P(Ω). Then we can conclude that P (Ω) is an algebra of events. Without loss of generality 1 we can apply a more useful class of events called σ field. The advantage of this definition is that it allows you to work with the limits of unions and intersections, which will be very useful for the discussion about convergence of random variables. Definition 1.2. Let Σ be a field of a nonempty set Ω. We say that Σ is a σ field of events of Ω if iii - for any countable family {A n } of elements of Σ we have n A n Σ. A pair (Ω, Σ) with a nonempty set Ω and a σ field Σ is called a measurable space, and an arbitrary element of Σ is called a Σ measurable set(or simply a measurable set if Σ is implicit in the context.). Exercise 1.3. Prove that iii implies iii. Moreover, show that, with Ω [0, 1], the family A defined as the set of all finite unions of intervals belonging to [0, 1] is a field of Ω but it is not a σ field. 1 See Billingsley, P Probability and Measure for a more detailed discussion on fields extension. 2
3 Solution 1.3. To see that iii implies iii is only necessary define, for all finite family {A n } N n1, the infinite family {A n } n1 with A n for all n N + 1,..., then N n1a n n1a n Σ. For the second part it is easy to see the three properties of an algebra. To see that A is not a σ field note that for all n N the set ( 1 1 2, 1 1 ) n 2 n+1 belongs to A. But the infinite union does not since each element is nonempty and the sets are disjoint. Given a nonempty set Ω and a nonempty family of subsets of Ω, C, we define as the σ algebra generated by C, σ(c), the smallest σ field that contains all elements of C. An equivalent definition is that σ(c) is the intersection of all σ fields containing C. Exercise 1.4. Let {Σ λ } λ Λ be a family of σ fields of a nonempty set Ω. Where Λ is any nonempty family of indices. Show that Σ λ Λ Σ λ is a σ field of Ω. Solution 1.4. Let us see the three properties of a σ field: i - Ω Σ λ λ Ω λ Λ Σ λ ; ii - A λ Λ Σ λ A Σ λ λ A c Σ λ λ A c λ Λ Σ λ ; and iii - {A n } λ Λ Σ λ {A n } Σ λ λ n A n Σ λ λ n A n λ Λ Σ λ. Exercise 1.5. Prove that for any nonempty set Ω, we have that P(Ω) is an σ algebra of events of Ω. Conclude that σ(c), as defined above, is well defined. Solution 1.5. The first part is exactly the same prove of exercise1.2. To see that σ(c) is well defined note that we can write σ(c) as Σ S Σ where S is the set of all σ fields containing C 2. As we see in the exercise, this intersection is a sigma field. Therefore, σ(c) is well defined. Considering Ω the real numbers. We call Borel σ field, and denote B, the smallest σ field that contains all intervals in R. The elements of B are called Borel sets. Exercise 1.6. Let (Ω, Σ) be a measurable space. Prove that for any nonempty set S Σ, we have that Σ S {A Σ; A S} is a σ field of S. Solution 1.6. Let us see the three properties of a sigma field: i - S Σ and S S then S Σ S ; ii - A Σ S A Σ A c Σ A c S Σ A c S Σ S ; and 2 That is nonempty by the first part of exercise. 3
4 iii - {A n } Σ S ({A n } Σ) (A n S n) ( n A n Σ) ( n A n S) n A n Σ S. Thus, we have the proof. The last object necessary to have a closed mathematical model to an experiment is the probability of an event. This definition is given below. Definition 1.3. A probability on (Ω, Σ) is a function P : Σ R + such that i - P (Ω) 1; and ii - for any countable family {A n } of disjoints elements of Σ we have P ( n A n ) n P (A n). The triple (Ω, Σ, P ) is called a probability space. All the theory developed in these notes will be based on a probability space. Example 1.2. Imagine an experiment of heads and tails with a fair coin. We can model this experiment such as Ω {H, T }, Σ {, Ω, {H}, {T }} and the probability P is such that P ( ) 0, P (Ω) 1 and P (H) P (T ) 1/2. In the proposition below we give some useful properties that come from the definition of probability. It is interesting for the reader to know the basic results of set operations to understand the following properties. If you are not certain about this knowledge, it is advisable to take a look at a basic book of theory of sets before continuing. Proposition 1.1. Let (Ω, Σ, P ) be a probability space. Then we have the following properties. 1. P ( ) 0; 2. P (A) 1 A Σ; 3. P (A c ) 1 P (A) A Σ; 4. P (B A) P (B) P (B A c ) A, B Σ; 5. P (A B) P (A) + P (B) P (A B) A, B Σ; and 6. A, B Σ A B P (A) P (B). Exercise 1.7. Prove proposition 1.1. Solution 1.7. See Barry James. Proposition 1.2. Let (Ω, Σ, P ) be a probability space and {C i } i a partition of Ω such that {C i } i Σ. Then A Σ we have P (A) i P (A C i). In addition, for any countable family of sets {A i } in Σ, we have that P ( i A i ) i P (A i). 4
5 Proof: To see the first result it is only necessary to note that, since A Σ and {C i } i Σ, we have that A C i Σ i. Moreover, {A C i } is a countable family of disjoint sets, then P (A) P (A Ω) P (A ( i C i )) P ( i (A C i )) i P (A C i). For the last result define B i A i ( j<i A j ) c Σ. Note that B i A i i and i B i i A i. By definition, the family {B i } is countable and disjoint, thus P ( i B i ) i P (B i) i P (A i), where the last inequality comes from B i A i i, and we have the wanted result. Exercise 1.8. Let (Ω, Σ, P ) be a probability space and {A n } a family of elements of Σ such that A n+1 A n and n A n A, or A n A n+1 and n A n A. Prove that in both cases lim P (A n ) P (A). Solution 1.8. See Barry James. 2 Conditional Probability and Independence Definition 2.1. Let (Ω, Σ, P ) be a probability space and B an element of Σ with P (B) 0. For all A Σ the conditional probability of A given B is P (A B) P (A B). (1) P (B) For the case of P (B) 0 we will define P (A B) P (A) A Σ. Intuitively, the conditional probability of a set A given another nonempty set B is the relative measure of A in B, that is, the conditional probability is the probability of the intersection but we need to ponderate by the probability of the set that we are conditioning on. Exercise 2.1. In a talking show, the guest needs to chose one door among three, A, B and C, in one of the doors there is an award. After the guest chooses the door A, the host opens the door B and the award is not there. What is the probability of the award being in door A? And in door C? Solution 2.1. First not that P (A) P (B) P (C) 1/3. Moreover, P (OB CA) P (OB A CA) + P (OB C CA) P (A)P (OB A CA) + P (C)P (OB C CA) Where CI, OI represent the guest chose the door I and the host open the door I. Then, P (A OB CA) P (A OB CA) P (OB CA) P (A)P (CA A)P (OB A CA) P (OB CA)P (CA) ( ) ( )
6 Analogously, P (C OB CA) P (C OB CA) P (OB CA) P (C)P (CA C)P (OB C CA) P (OB CA)P (CA) ( ) ( ) Proposition 2.1. Let (Ω, Σ, P ) be a probability space and {A n+1 } any finite family of measurable sets. Then P (A 1... A n+1 ) P (A 1 )P (A 2 A 1 )P (A 3 A 1 A 2 )... P (A n+1 A 1... A n ). Proof: Let us prove by induction. 1 - For n 1 we have by definition that P (A 2 A 1 ) P (A 1 A 2 )/P (A 1 ) then, multiplying both sides by P (A 1 ), we have that P (A 1 A 2 ) P (A 1 )P (A 2 A 1 ). 2 - Assume that the sentence is true for n k, using the previous result applied to A 1... A k+1 and A k+2 we have that P (A 1... A k+1 A k+2 ) P (A 1... A k+1 )P (A k+2 A 1... A k+1 ). But by induction hypothesis P (A 1... A k+1 ) P (A 1 )P (A 2 A 1 )P (A 3 A 1 A 2 )... P (A k+1 A 1... A k ), thus P (A 1... A k+1 A k+2 ) P (A 1 )P (A 2 A 1 )P (A 3 A1 A 2 )... P (A k+1 A 1... A k )P (A k+2 A 1... A k+1 ) and the sentence is true for k The sentence is true for n 1 and if it is true for n k then it is true for n k + 1. Therefore, by induction, it is true for all natural numbers. And we have the proof. The following theorem is known as the Bayes Rule. The Bayesian method of estimation comes from this theorem and works with the idea of a priori distributions. That is, imagine that you have beliefs about the probabilities of some events {A n } that form a partition of Ω. The question is how you change your beliefs after the realization of some event B. This is the answer that Bayes Rule gives us. Theorem 2.1. Let (Ω, Σ, P ) be a probability space and {A n } Σ be a countable partition of Ω. Then, for all measurable set B and all i we have P (A i B) P (B A i)p (A i ) n P (B A n)p (A n ). (2) Proof: By definition P (A i B) P (A i B)/P (B), using the previous proposition, we know that P (A i B) P (B A i )P (A i ) then it is only necessary to prove that P (B) n P (B A n)p (A n ). Note that the family {B A n } is a countable family of disjoint events and B n (B A n ), hence, P (B) n P (B A n). Again, using the previous exercise, P (B A n ) P (B A n )P (A n ). Therefore, we have that P (A i B) P (B A i )P (A i )/ n P (B A n)p (A n ). 6
7 Exercise 2.2. In a factory of cellphones you know that five percent of the cellphones have a problem in the screen and three percent of them the sound does not work. Moreover, you know that in half of the cellphones with a problem in the screen, the sound does not work. If you take one which the sound does not work, what is the probability that the screen has a problem? Solution 2.2. Define V P, SP as the events of screen problem and sound problem respectively. Then, and P (V P ) 5/100, P (SP ) 3/100, P (SP V P ) 1/2 P (SP V P c ) P (SP V P c ) P (V P c ) 5/100 3/ /100 Using the Bayes Rule P (SP ) P (SP V P ) 1 P (V P ) 7/200 95/ P (SP ) P (SP V P )P (V P ) 1 P (V P ) P (SP V P )P (V P ) P (V P SP ) P (SP V P )P (V P ) + P (SP V P c )P (V P c ) (1/2)(5/100) (1/2)(5/100) + (7/190)(95/100) 5/200 12/ Now we will introduce the concept of independent events. We need to formally define the idea that two events are independent when the occurrence of one does not add any information about the chances of the other occurring. Definition 2.2. Let (Ω, Σ, P ) be a probability space and A, B Σ two events. We say that the events A, B are independent if we have P (A B) P (A)P (B). Note that for two sets, A, B Σ, with positive probability, this definition implies that P (A B) P (A) and P (B A) P (B). The concept of independence is that information about one event does not tell us anything about the chances of the other. When we are working with many events, this idea changes a little. To assert that these events are independent, it is necessary that subsets of combined events do not give any piece information about the others. The following definition formalize this idea. Definition 2.3. Let (Ω, Σ, P ) be a probability space and {A i } i I Σ a finite family of events. We say that these events are independent if for all set of indices J I we have ( ) P A j P (A j ). j J j J 7
8 Example 2.1. Consider a fair dice. Then the probability space is (Ω, Σ, P ) with Ω {1, 2, 3, 4, 5, 6}, Σ P(Ω) and P is the probability constructed using that P (ω) 1/6 for all ω Ω. Defining the events A 1 {1, 2, 3, 4} and A 2 A 3 {4, 5, 6} we have that But the events are not independent, since P (A 1 )P (A 2 )P (A 3 ) 1 6 P (A 1 A 2 A 3 ). P (A 1 A 2 ) P (A 1)P (A 2 ) and P (A 2 A 3 ) P (A 2)P (A 3 ). Exercise 2.3. Consider a probability space (Ω, Σ, P ) and two events A, B Σ. Mark true or false for the following items. When the answer is true, make a proof, and when it is false, give a counter example: 1 - ( ) If A, B are independent then A c, B c are independent events. 2 - ( ) If A B then A, B are independent. 3 - ( ) P (A B) 1 P (A c )P (B c ) when A, B are independent. 4 - ( ) Let σ(a) and σ(b) be the sigma fields generated by A and B respectively. Then C, D Σ are independent for all C σ(a) and D σ(b). 8
Lecture 9: Conditional Probability and Independence
EE5110: Probability Foundations July-November 2015 Lecture 9: Conditional Probability and Independence Lecturer: Dr. Krishna Jagannathan Scribe: Vishakh Hegde 9.1 Conditional Probability Definition 9.1
More informationProperties of Probability
Econ 325 Notes on Probability 1 By Hiro Kasahara Properties of Probability In statistics, we consider random experiments, experiments for which the outcome is random, i.e., cannot be predicted with certainty.
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 3 9/10/2008 CONDITIONING AND INDEPENDENCE
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 3 9/10/2008 CONDITIONING AND INDEPENDENCE Most of the material in this lecture is covered in [Bertsekas & Tsitsiklis] Sections 1.3-1.5
More informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationthe time it takes until a radioactive substance undergoes a decay
1 Probabilities 1.1 Experiments with randomness Wewillusethetermexperimentinaverygeneralwaytorefertosomeprocess that produces a random outcome. Examples: (Ask class for some first) Here are some discrete
More informationDeep Learning for Computer Vision
Deep Learning for Computer Vision Lecture 3: Probability, Bayes Theorem, and Bayes Classification Peter Belhumeur Computer Science Columbia University Probability Should you play this game? Game: A fair
More informationConditional Probability
Conditional Probability When we obtain additional information about a probability experiment, we want to use the additional information to reassess the probabilities of events given the new information.
More informationStatistical Theory 1
Statistical Theory 1 Set Theory and Probability Paolo Bautista September 12, 2017 Set Theory We start by defining terms in Set Theory which will be used in the following sections. Definition 1 A set is
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 Introduction One of the key properties of coin flips is independence: if you flip a fair coin ten times and get ten
More informationP (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).
Lectures 7-8 jacques@ucsdedu 41 Conditional Probability Let (Ω, F, P ) be a probability space Suppose that we have prior information which leads us to conclude that an event A F occurs Based on this information,
More informationLECTURE 1. 1 Introduction. 1.1 Sample spaces and events
LECTURE 1 1 Introduction The first part of our adventure is a highly selective review of probability theory, focusing especially on things that are most useful in statistics. 1.1 Sample spaces and events
More informationECE353: Probability and Random Processes. Lecture 2 - Set Theory
ECE353: Probability and Random Processes Lecture 2 - Set Theory Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu January 10, 2018 Set
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10 Introduction to Basic Discrete Probability In the last note we considered the probabilistic experiment where we flipped
More informationMath 3338: Probability (Fall 2006)
Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/8 2.2 Axioms, Interpretations, and Properties of Probability Probability
More informationChapter 2. Conditional Probability and Independence. 2.1 Conditional Probability
Chapter 2 Conditional Probability and Independence 2.1 Conditional Probability Example: Two dice are tossed. What is the probability that the sum is 8? This is an easy exercise: we have a sample space
More informationLecture 1: Probability Fundamentals
Lecture 1: Probability Fundamentals IB Paper 7: Probability and Statistics Carl Edward Rasmussen Department of Engineering, University of Cambridge January 22nd, 2008 Rasmussen (CUED) Lecture 1: Probability
More informationOrigins of Probability Theory
1 16.584: INTRODUCTION Theory and Tools of Probability required to analyze and design systems subject to uncertain outcomes/unpredictability/randomness. Such systems more generally referred to as Experiments.
More informationWeek 12-13: Discrete Probability
Week 12-13: Discrete Probability November 21, 2018 1 Probability Space There are many problems about chances or possibilities, called probability in mathematics. When we roll two dice there are possible
More informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More informationProbability (Devore Chapter Two)
Probability (Devore Chapter Two) 1016-345-01: Probability and Statistics for Engineers Fall 2012 Contents 0 Administrata 2 0.1 Outline....................................... 3 1 Axiomatic Probability 3
More informationProbability: Part 1 Naima Hammoud
Probability: Part 1 Naima ammoud Feb 7, 2017 Motivation ossing a coin Rolling a die Outcomes: eads or ails Outcomes: 1, 2, 3, 4, 5 or 6 Defining Probability If I toss a coin, there is a 50% chance I will
More informationChapter 2. Conditional Probability and Independence. 2.1 Conditional Probability
Chapter 2 Conditional Probability and Independence 2.1 Conditional Probability Probability assigns a likelihood to results of experiments that have not yet been conducted. Suppose that the experiment has
More informationP (E) = P (A 1 )P (A 2 )... P (A n ).
Lecture 9: Conditional probability II: breaking complex events into smaller events, methods to solve probability problems, Bayes rule, law of total probability, Bayes theorem Discrete Structures II (Summer
More informationMeasure and integration
Chapter 5 Measure and integration In calculus you have learned how to calculate the size of different kinds of sets: the length of a curve, the area of a region or a surface, the volume or mass of a solid.
More informationProbability Theory Review
Cogsci 118A: Natural Computation I Lecture 2 (01/07/10) Lecturer: Angela Yu Probability Theory Review Scribe: Joseph Schilz Lecture Summary 1. Set theory: terms and operators In this section, we provide
More informationCompatible probability measures
Coin tossing space Think of a coin toss as a random choice from the two element set {0,1}. Thus the set {0,1} n represents the set of possible outcomes of n coin tosses, and Ω := {0,1} N, consisting of
More informationA PECULIAR COIN-TOSSING MODEL
A PECULIAR COIN-TOSSING MODEL EDWARD J. GREEN 1. Coin tossing according to de Finetti A coin is drawn at random from a finite set of coins. Each coin generates an i.i.d. sequence of outcomes (heads or
More information2. AXIOMATIC PROBABILITY
IA Probability Lent Term 2. AXIOMATIC PROBABILITY 2. The axioms The formulation for classical probability in which all outcomes or points in the sample space are equally likely is too restrictive to develop
More informationModule 1. Probability
Module 1 Probability 1. Introduction In our daily life we come across many processes whose nature cannot be predicted in advance. Such processes are referred to as random processes. The only way to derive
More informationPreliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com
1 School of Oriental and African Studies September 2015 Department of Economics Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com Gujarati D. Basic Econometrics, Appendix
More informationProbability Theory. Introduction to Probability Theory. Principles of Counting Examples. Principles of Counting. Probability spaces.
Probability Theory To start out the course, we need to know something about statistics and probability Introduction to Probability Theory L645 Advanced NLP Autumn 2009 This is only an introduction; for
More informationBasics of probability
Chapter 4 Basics of probability 4.1 The probability axioms Probabilities are defined over collections of sets. These collections have to have some structure to them. Definition 4.1 ( -field). A collection
More informationPROBABILITY THEORY 1. Basics
PROILITY THEORY. asics Probability theory deals with the study of random phenomena, which under repeated experiments yield different outcomes that have certain underlying patterns about them. The notion
More informationMathematical Foundations of Computer Science Lecture Outline October 18, 2018
Mathematical Foundations of Computer Science Lecture Outline October 18, 2018 The Total Probability Theorem. Consider events E and F. Consider a sample point ω E. Observe that ω belongs to either F or
More informationPROBABILITY VITTORIA SILVESTRI
PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8 4. Properties of Probability measures Preface These lecture notes are for the course
More informationLecture 1: An introduction to probability theory
Econ 514: Probability and Statistics Lecture 1: An introduction to probability theory Random Experiments Random experiment: Experiment/phenomenon/action/mechanism with outcome that is not (fully) predictable.
More informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
More information18.175: Lecture 2 Extension theorems, random variables, distributions
18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing
More informationSample Spaces, Random Variables
Sample Spaces, Random Variables Moulinath Banerjee University of Michigan August 3, 22 Probabilities In talking about probabilities, the fundamental object is Ω, the sample space. (elements) in Ω are denoted
More informationProbability COMP 245 STATISTICS. Dr N A Heard. 1 Sample Spaces and Events Sample Spaces Events Combinations of Events...
Probability COMP 245 STATISTICS Dr N A Heard Contents Sample Spaces and Events. Sample Spaces........................................2 Events........................................... 2.3 Combinations
More informationStatistical Inference
Statistical Inference Lecture 1: Probability Theory MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 11, 2018 Outline Introduction Set Theory Basics of Probability Theory
More informationJUSTIN HARTMANN. F n Σ.
BROWNIAN MOTION JUSTIN HARTMANN Abstract. This paper begins to explore a rigorous introduction to probability theory using ideas from algebra, measure theory, and other areas. We start with a basic explanation
More informationIntroduction to Probability. Ariel Yadin. Lecture 1. We begin with an example [this is known as Bertrand s paradox]. *** Nov.
Introduction to Probability Ariel Yadin Lecture 1 1. Example: Bertrand s Paradox We begin with an example [this is known as Bertrand s paradox]. *** Nov. 1 *** Question 1.1. Consider a circle of radius
More informationUniversity of Regina. Lecture Notes. Michael Kozdron
University of Regina Statistics 851 Probability Lecture Notes Winter 2008 Michael Kozdron kozdron@stat.math.uregina.ca http://stat.math.uregina.ca/ kozdron References [1] Jean Jacod and Philip Protter.
More informationSTAT 7032 Probability Spring Wlodek Bryc
STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,
More informationProbability Theory and Applications
Probability Theory and Applications Videos of the topics covered in this manual are available at the following links: Lesson 4 Probability I http://faculty.citadel.edu/silver/ba205/online course/lesson
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More informationAbstract Measure Theory
2 Abstract Measure Theory Lebesgue measure is one of the premier examples of a measure on R d, but it is not the only measure and certainly not the only important measure on R d. Further, R d is not the
More informationRecap. The study of randomness and uncertainty Chances, odds, likelihood, expected, probably, on average,... PROBABILITY INFERENTIAL STATISTICS
Recap. Probability (section 1.1) The study of randomness and uncertainty Chances, odds, likelihood, expected, probably, on average,... PROBABILITY Population Sample INFERENTIAL STATISTICS Today. Formulation
More informationMAT2377. Ali Karimnezhad. Version September 9, Ali Karimnezhad
MAT2377 Ali Karimnezhad Version September 9, 2015 Ali Karimnezhad Comments These slides cover material from Chapter 1. In class, I may use a blackboard. I recommend reading these slides before you come
More informationConstruction of a general measure structure
Chapter 4 Construction of a general measure structure We turn to the development of general measure theory. The ingredients are a set describing the universe of points, a class of measurable subsets along
More informationChapter 3 : Conditional Probability and Independence
STAT/MATH 394 A - PROBABILITY I UW Autumn Quarter 2016 Néhémy Lim Chapter 3 : Conditional Probability and Independence 1 Conditional Probabilities How should we modify the probability of an event when
More informationChapter 1: Introduction to Probability Theory
ECE5: Stochastic Signals and Systems Fall 8 Lecture - September 6, 8 Prof. Salim El Rouayheb Scribe: Peiwen Tian, Lu Liu, Ghadir Ayache Chapter : Introduction to Probability Theory Axioms of Probability
More informationChapter 2 Classical Probability Theories
Chapter 2 Classical Probability Theories In principle, those who are not interested in mathematical foundations of probability theory might jump directly to Part II. One should just know that, besides
More informationEcon 325: Introduction to Empirical Economics
Econ 325: Introduction to Empirical Economics Lecture 2 Probability Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall Ch. 3-1 3.1 Definition Random Experiment a process leading to an uncertain
More informationRandomized Algorithms. Andreas Klappenecker
Randomized Algorithms Andreas Klappenecker Randomized Algorithms A randomized algorithm is an algorithm that makes random choices during its execution. A randomized algorithm uses values generated by a
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationTopic 5 Basics of Probability
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
More informationRS Chapter 1 Random Variables 6/5/2017. Chapter 1. Probability Theory: Introduction
Chapter 1 Probability Theory: Introduction Basic Probability General In a probability space (Ω, Σ, P), the set Ω is the set of all possible outcomes of a probability experiment. Mathematically, Ω is just
More information1 Review of Probability
Review of Probability Denition : Probability Space The probability space, also called the sample space, is a set which contains ALL the possible outcomes We usually label this with a Ω or an S (Ω is the
More information1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).
CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 8 Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According to clinical trials,
More informationLecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability
Lecture Notes 1 Basic Probability Set Theory Elements of Probability Conditional probability Sequential Calculation of Probability Total Probability and Bayes Rule Independence Counting EE 178/278A: Basic
More information1.1. MEASURES AND INTEGRALS
CHAPTER 1: MEASURE THEORY In this chapter we define the notion of measure µ on a space, construct integrals on this space, and establish their basic properties under limits. The measure µ(e) will be defined
More informationIntermediate Math Circles November 8, 2017 Probability II
Intersection of Events and Independence Consider two groups of pairs of events Intermediate Math Circles November 8, 017 Probability II Group 1 (Dependent Events) A = {a sales associate has training} B
More informationBASICS OF PROBABILITY CHAPTER-1 CS6015-LINEAR ALGEBRA AND RANDOM PROCESSES
BASICS OF PROBABILITY CHAPTER-1 CS6015-LINEAR ALGEBRA AND RANDOM PROCESSES COMMON TERMS RELATED TO PROBABILITY Probability is the measure of the likelihood that an event will occur Probability values are
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 2017 Nadia S. Larsen. 17 November 2017.
Product measures, Tonelli s and Fubini s theorems For use in MAT4410, autumn 017 Nadia S. Larsen 17 November 017. 1. Construction of the product measure The purpose of these notes is to prove the main
More informationElementary Discrete Probability
Elementary Discrete Probability MATH 472 Financial Mathematics J Robert Buchanan 2018 Objectives In this lesson we will learn: the terminology of elementary probability, elementary rules of probability,
More informationRandom Experiments; Probability Spaces; Random Variables; Independence
Department of Mathematics Ma 3/103 KC Border Introduction to Probability and Statistics Winter 2017 Lecture 2: Random Experiments; Probability Spaces; Random Variables; Independence Relevant textbook passages:
More informationCS 246 Review of Proof Techniques and Probability 01/14/19
Note: This document has been adapted from a similar review session for CS224W (Autumn 2018). It was originally compiled by Jessica Su, with minor edits by Jayadev Bhaskaran. 1 Proof techniques Here we
More informationHW1 Solutions. October 5, (20 pts.) Random variables, sample space and events Consider the random experiment of ipping a coin 4 times.
HW1 Solutions October 5, 2016 1. (20 pts.) Random variables, sample space and events Consider the random experiment of ipping a coin 4 times. 1. (2 pts.) Dene the appropriate random variables. Answer:
More informationSample Space: Specify all possible outcomes from an experiment. Event: Specify a particular outcome or combination of outcomes.
Chapter 2 Introduction to Probability 2.1 Probability Model Probability concerns about the chance of observing certain outcome resulting from an experiment. However, since chance is an abstraction of something
More informationProbability. Lecture Notes. Adolfo J. Rumbos
Probability Lecture Notes Adolfo J. Rumbos October 20, 204 2 Contents Introduction 5. An example from statistical inference................ 5 2 Probability Spaces 9 2. Sample Spaces and σ fields.....................
More informationWith Question/Answer Animations. Chapter 7
With Question/Answer Animations Chapter 7 Chapter Summary Introduction to Discrete Probability Probability Theory Bayes Theorem Section 7.1 Section Summary Finite Probability Probabilities of Complements
More information4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio
4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio Wrong is right. Thelonious Monk 4.1 Three Definitions of
More informationMATH 3C: MIDTERM 1 REVIEW. 1. Counting
MATH 3C: MIDTERM REVIEW JOE HUGHES. Counting. Imagine that a sports betting pool is run in the following way: there are 20 teams, 2 weeks, and each week you pick a team to win. However, you can t pick
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationLecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete
More information1 Proof techniques. CS 224W Linear Algebra, Probability, and Proof Techniques
1 Proof techniques Here we will learn to prove universal mathematical statements, like the square of any odd number is odd. It s easy enough to show that this is true in specific cases for example, 3 2
More informationCS411 Notes 3 Induction and Recursion
CS411 Notes 3 Induction and Recursion A. Demers 5 Feb 2001 These notes present inductive techniques for defining sets and subsets, for defining functions over sets, and for proving that a property holds
More informationProbability theory basics
Probability theory basics Michael Franke Basics of probability theory: axiomatic definition, interpretation, joint distributions, marginalization, conditional probability & Bayes rule. Random variables:
More informationMATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6
MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION Extra Reading Material for Level 4 and Level 6 Part A: Construction of Lebesgue Measure The first part the extra material consists of the construction
More informationSolutions to Homework Assignment 2
Solutions to Homework Assignment Real Analysis I February, 03 Notes: (a) Be aware that there maybe some typos in the solutions. If you find any, please let me know. (b) As is usual in proofs, most problems
More informationLecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events
Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events Discrete Structures II (Summer 2018) Rutgers University Instructor: Abhishek
More informationLecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics?
Lecture 1 (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 (2.1 --- 2.6). Chapter 1 1. What is Statistics? 2. Two definitions. (1). Population (2). Sample 3. The objective of statistics.
More informationINDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR. NPTEL National Programme on Technology Enhanced Learning. Probability Methods in Civil Engineering
INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR NPTEL National Programme on Technology Enhanced Learning Probability Methods in Civil Engineering Prof. Rajib Maity Department of Civil Engineering IIT Kharagpur
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationWhy study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables
ECE 6010 Lecture 1 Introduction; Review of Random Variables Readings from G&S: Chapter 1. Section 2.1, Section 2.3, Section 2.4, Section 3.1, Section 3.2, Section 3.5, Section 4.1, Section 4.2, Section
More informationBasic Measure and Integration Theory. Michael L. Carroll
Basic Measure and Integration Theory Michael L. Carroll Sep 22, 2002 Measure Theory: Introduction What is measure theory? Why bother to learn measure theory? 1 What is measure theory? Measure theory is
More information7.1 What is it and why should we care?
Chapter 7 Probability In this section, we go over some simple concepts from probability theory. We integrate these with ideas from formal language theory in the next chapter. 7.1 What is it and why should
More informationProbability Theory. Probability and Statistics for Data Science CSE594 - Spring 2016
Probability Theory Probability and Statistics for Data Science CSE594 - Spring 2016 What is Probability? 2 What is Probability? Examples outcome of flipping a coin (seminal example) amount of snowfall
More informationCONVERGENCE OF RANDOM SERIES AND MARTINGALES
CONVERGENCE OF RANDOM SERIES AND MARTINGALES WESLEY LEE Abstract. This paper is an introduction to probability from a measuretheoretic standpoint. After covering probability spaces, it delves into the
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationDynamic Programming Lecture #4
Dynamic Programming Lecture #4 Outline: Probability Review Probability space Conditional probability Total probability Bayes rule Independent events Conditional independence Mutual independence Probability
More informationUniversity of Sheffield. School of Mathematics & and Statistics. Measure and Probability MAS350/451/6352
University of Sheffield School of Mathematics & and Statistics Measure and Probability MAS350/451/6352 Spring 2018 Chapter 1 Measure Spaces and Measure 1.1 What is Measure? Measure theory is the abstract
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationJoint, Conditional, & Marginal Probabilities
Joint, Conditional, & Marginal Probabilities The three axioms for probability don t discuss how to create probabilities for combined events such as P [A B] or for the likelihood of an event A given that
More informationProbability and distributions. Francesco Corona
Probability Probability and distributions Francesco Corona Department of Computer Science Federal University of Ceará, Fortaleza Probability Many kinds of studies can be characterised as (repeated) experiments
More informationCIS 2033 Lecture 5, Fall
CIS 2033 Lecture 5, Fall 2016 1 Instructor: David Dobor September 13, 2016 1 Supplemental reading from Dekking s textbook: Chapter2, 3. We mentioned at the beginning of this class that calculus was a prerequisite
More informationLecture 3: Probability Measures - 2
Lecture 3: Probability Measures - 2 1. Continuation of measures 1.1 Problem of continuation of a probability measure 1.2 Outer measure 1.3 Lebesgue outer measure 1.4 Lebesgue continuation of an elementary
More informationMath-Stat-491-Fall2014-Notes-I
Math-Stat-491-Fall2014-Notes-I Hariharan Narayanan October 2, 2014 1 Introduction This writeup is intended to supplement material in the prescribed texts: Introduction to Probability Models, 10th Edition,
More information