Elementary Probability. Exam Number 38119
|
|
- Griffin Pope
- 5 years ago
- Views:
Transcription
1 Elementary Probability Exam Number 38119
2 2 1. Introduction Consider any experiment whose result is unknown, for example throwing a coin, the daily number of customers in a supermarket or the duration of a phone call in a service office. Each of these experiments has a more or less wide variety of possible results. The set of all these results is called result space and denoted Ω. In the examples above we have Ω 1 = {head, number}, Ω 2 = N and Ω 3 = (0, ). We cannot forecast for certain, which result the experiment will have, but we can tell something about the probability of certain results ω Ω. Often we are not interested in single results but in subsets A Ω containing several results. We denote the set containing all interesting events A Ω as A. The A are called events. Definition 1.1. A set A P (Ω) is called σ-algebra over Ω if (1) Ω A, (2) A c A for all A A and (3) A n A for all (A n ) A N. For E P (Ω) let A (E) the smallest σ-algebra containing E, that is A (E) = A. {A A is σ-algebra and A E} In Theorem 1.5 we will see that it is not always possible to choose A = P (Ω). For countable Ω we will usually choose A = P (Ω), but for uncountable Ω R 1 we need the Borel σ-algebra B 1 = A ( (a, b] a, b R 1) or some sub-σ-algebra of it. For Ω R n we have the n dimensional Borel σ- algebra B n = A ({ n i=1b i B i B}). On A we can now define a probability distribution P. We want P to be realistic ; therefore we require some basic properties for it. Definition 1.2. A function P : A [0, 1] is called probability distribution or probability measure for A if (1) P (Ω) = 1 and (2) P ( A ) n = P (A n) for all pairwise disjoint (A n ) A N. Definition 1.3. The triplet (Ω, A, P) where A is a σ-algebra over Ω and P is a probability distribution for A is called probability space. We will show some basic properties of probability distributions in the following Lemma 1.4. Let A, B A and (A n ) A N. Then we have (1) P (A c ) = 1 P (A), (2) P (A B) = P (A) + P (B) P (A B),
3 3 (3) P (A) P (B) if A B, (4) P (A \ B) = P (B) P (A) if A B and (5) P (lim A n ) = lim P (A n ) if (A n ) is isotonic or antitonic. Proof. The properties (1) (4) follow from the definition of a probability distribution. To show (5) we assume first that (A n ) is isotonic. Define A 0 = and B n = A n \ A n 1 for n N. Then the B n are pairwise disjoint and we have B n. Therefore we have ( ( ) P lim A n = P lim k i=1 A n = ) ( ) A n = P B n = P (A n \ A n 1 ) = lim k n=1 P (B n ) = n=1 (P (A n ) P (A n 1 )) = lim P (A k ). Now let (A n ) be antitonic. Then (A c n) is isotonic and we have ( ) ( ) ( ) P lim A n = P A n = 1 P A c n = 1 lim P (A c n) = lim P (1 A c n) = lim P (A n ). Theorem 1.5. There exists no function P : P ([0, 1]) [0, 1] such that (1) P ([a, b]) = b a for 0 a b 1, (2) P is translation invariant, that is P (A + x) = P (A) for all A P ([0, 1]), x [0, 1] such that A + x P ([0, 1]) and (3) P ( A ) n = P (A n) for all pairwise disjoint (A n ) P ([0, 1]) N. Proof. Suppose this function P does exist. Consider the relation on [1/3, 2/3] with x y x y Q. We have x x for all x [0, 1] as x x = 0 Q. Therefore is reflexive. The relation is symmetric as y x = (x y) Q whenever x y Q. It is also transitive as from x y Q and y z Q follows x z = (x y) + (y z) Q. Hence is an equivalence relation. According to Zorn s Lemma there exists a set A P ([0, 1]) containing exactly one element of each equivalence class. Let the sequence (q n ) count through the rational numbers in the interval [ 1/3, 1/3] and let A n = A + q n
4 4 for all n N. We now show that the A n are pairwise disjoint. Let a A k A l for some k, l N. This means that both a q k and a q l. Since is transitive, we also have q k q l and therefore A k = A l. Let x [2/5, 3/5]. Then can we find some a A such that x a. Hence we find some m N such that x a = q m. It follows that x A + q m. Therefore we have [2/5, 3/5] A n [0, 1]. It follows ( ) 1 P A n = P (A n ) = P (A), which means P (A) = 0. This leads to the contradiction ( ) 1/5 P A n = Examples for Probability Spaces In this section we will examine some examples for probability spaces. First we will look at discrete probability distributions, that is Ω is countable. In this case we can define p ω = P (ω) = P ({ω}) for all ω Ω; it is called density, in this special case of a countable result space we call it discrete density function. The p ω are sufficient to describe a distribution, since for every A A we have P (A) = ω A p ω. The most simple distribution for finite Ω and A = P (Ω) is given by P (A) = A / Ω for all A A. The fact that P is a distribution follows directly from the definition. It is called Laplace distribution. Let p [0, 1], Ω = {1,..., n}, A = P (Ω) and p i = ( n i) p i (1 p) n i for 1 i n. As n p i = (p + (1 p)) n = 1, i=0 we have that (p i ) i Ω is a density. Therefore (Ω, A, P) is a probability space where P is the corresponding distribution. This distribution is called binomial distribution and denoted b (n, p). For p (0, 1], Ω = N and A = P (Ω) we can define a density by p i = p (1 p) i 1 for i N since p i = p (1 p) i = 1. 1 p i=1 i=1
5 The corresponding distribution is called geometrical distribution and denoted geo (p). Let a be a positive real number, Ω = N 0, A = P (Ω) and p i = e a a i /i! for i N 0. We have n n p i = e 1 a i i! = 1. i=0 i=0 Therefore the p i form a density. The corresponding distribution is called Poisson distribution and denoted P oi (a). Now we will give some examples for continuous distributions. In this case we have Ω = R 1 and A = B 1. Given a Riemann-integrable function f : R 1 R 1 with f (x) dx = 1 we define P (A) = f (x) dx, which is therefore A a distribution. The function f is called its density or probability density function. A useful tool to describe continuous densities is the characteristic function { 1 A : Ω R 1 1 ω A, ω 0 ω A for some A A. The function f = 1 [a,b] / (b a), where a < b, defines a continuous density since f (x) dx = 1 b 1 dx = 1. b a Its corresponding distribution is called uniform distribution and denoted U [a, b]. Let the function f be defined as f (x) = λe λx 1 [0, ) (x) for some positive real λ. Since f (x) dx = λ 0 a e λx dx = 1, we have a density. Its corresponding distribution is called exponential distribution and denoted exp (λ). The normal distribution is denoted N (µ, σ 2 ) and has the density f (x) = ( ) 1 2πσ e (x µ) 2 /2σ 2. For f (x) dx = 1 see [Sch]. More examples for probability distributions can be found in [Sch] and in appendix A. Both discrete and continuous distributions are special cases of a more general case. A basic knowledge of measure theory, which can be found in [Bau], is needed to define the general probability distribution. Definition 2.1. Let Ω be an arbitrary set with a σ-algebra A. Let µ be a measure on A. A nonnegative µ-integrable function f with f dµ = 1 is called µ-density 5
6 6 of the probability measure P with P (A) = A f dµ. (2.1) The Theorem of Radon-Nikodym (see [Bau]) yields for continuous distributions f = d P /dλ 1, where λ 1 is the one-dimensional Lebesgue measure, and for discrete distributions f = d P /dµ, where µ is the counting measure on Ω. Inserting this into (2.1) gives us P (A) = d P = 1 A d P. A 3. Random Variables and Random Vectors In an experiment the complete result is very often not important or not interesting. For example, when throwing n coins we might not necessarily be interested in the sequence of heads and numbers ω = (ω 1,... ω n ) but in the number of heads X (ω) = {ω i ω i is head} or in the average of throwing a head X (ω) = X (ω) /n. Definition 3.1. Let (Ω 1, A 1, P) be a probability space and A 2 a σ-algebra over the set Ω 2. A function X : Ω 1 Ω 2 is called random variable if X 1 (A) A 1 for all A A 2. If X is a random variable we write X : (Ω 1, A 1 ) (Ω 2, A 2 ). If Ω 2 R n with n 2, then X is also called random vector. For A A 2 we define P X (A) = P ( X 1 (A) ) = P (X A) = P ({ω Ω 1 X (ω) A}). Lemma 3.2. The function P X is a probability distribution on A 2. This gives us the new probability space ( Ω 2, A 2, P X). Proof. We have P X (Ω 2 ) = P (X 1 (Ω 2 )) = P (Ω 1 ) = 1, which is the first condition of a probability distribution. Let (A n ) A N 2 pairwise disjoint. Then we have ( ) ( ( )) ( ) P X A n = P X 1 A n = P X 1 (A n ) = P X (A n ). P ( X 1 (A n ) ) = If P X is b (n, p) distributed we can also write X b (n, p). We use the same notation for the other distributions introduced in Section 2 and appendix A.
7 4. Independence Definition 4.1. Let (Ω, A, P) be a probability space. The events A 1,..., A n are called independent if P (A i1 A ik ) = P (A i1 ) P (A ik ) for all 1 i 1 <... < i k n. The sequence (A n ) A N is called independent if A 1,..., A n is independent for all n. With this definition we can formulate and prove the following Theorem 4.2 (Borel-Cantelli). Let (Ω, A, P) be a probability space and (A n ) A N. If n=1 P (A n) < then P (lim sup A n ) = 0. If (A n ) is independent and n=1 P (A n) = then P (lim sup A n ) = 1. Proof. Consider ( ) lim P A n lim Lemma 1.4 yields ( ) ( P lim sup A n = P k=1 P (A n ) = 0. A n ) = lim P ( ) A n = 0. To prove the second statement consider (A c n), which is independent, as (A n ) is independent as well. From this follows ( ) ( ) P lim sup A n = 1 P lim inf Ac n = ( ) 1 lim P A c n = 1 lim (1 P (A n )) = 1. To see the last equality let p n = P (A n ) for n N. If p n = 1 for infinitely many n this equality is trivial. So let p n < 1 for all n k for some k N. Therefore, as log x x 1 for positive x, we have ( ) ( ) (1 p n ) = exp log (1 p n ) exp p n = 0, as p n =. Consider, for example, throwing a coin infinitely often. Then Ω = {0, 1} N. We want to know the probability to throw infinitely often a 1. Let A n = 7
8 8 {ω Ω ω i = 1}, which are independent. Therefore we have P (lim sup A n ) = 1, as n=1 A n = 1 n=1 =. 2 Similarly to the independence of events we can define the independence of random variables (X n ). Such a sequence is called independent if the events (Xn 1 (A n )) are independent for every series (A n ) with A n X n (A). In [Sch] it is proved that if the above statement holds for events A n from intersection stable generators of the X n (A) then (X n ) is still independent. Therefore we have the following easy to check criteria for independence for discrete and continuous distributions. The sequence (X n ) of discrete random variables is independent iff ( ) P X n = x n = P (X n = x n ) for all x n. The sequence (X n ) of continuous random variables is independent iff ( ) P X n x n = P (X n x n ) for all x n. 5. Expected Value and Variance Often it is of high interest to know the mean expected value of a random variable, for example when calculation the fair price for a game or forecasting prices on the stock market. In this article we will only examine the expected value of random variables X : (Ω, A) (R 1, B 1 ), although it is possible to define the expected value also for complex random variables and random vectors. Definition 5.1. If the expression EX = exists it is called the expected value of X. X d P = id d P X R 1 For discrete random variables follows immediately EX = n=1 x n P (X = x n ) and for continuous random variables, EX = R 1 xf (x) dx. The following example demonstrates that the expected value must not necessarily exist. Consider a series of an infinitely often thrown coin. If the coin shows 1 in the n th throw we get 2 n. The game ends with the first 0 being thrown. Let (X n ) be independent identically b ( 1, 1 2) distributed on {0, 1} N. For ω Ω let Y (ω) be the first position at which a 0 is thrown. Hence we have P (Y = n) = 1/2 n. Let X denote the amount of money we win, that is X =
9 2 Y 1. The expected amount of money to win from this game would therefore be EX = (2 n 1) P (X = 2 n 1) = (2 n 1) P (Y = n) = n=0 n=0 (2 n 1) 1 2 = (1 12 ) =. n n n=0 We say for an statement A to be P-almost sure and denote this by [P] if there exists a set N A such that P (N) = 0 and A is true for all ω N c. With this notation we have the following Lemma 5.2. If EX and EY exist then (1) E (αx + βy ) = αex + βey for all α, β R 1, (2) Eα = α for all α R 1, (3) EX EY if X Y [P] and (4) EX = EY if X = Y [P]. These properties follow directly from the general properties of the measure integral, which can be found in [Bau] and are basically the same as for sums and Riemann integrals. Another value of interest is how much a random variable is expected to differ from its expected value. Definition 5.3. If V ar X = E (X EX) 2 exists it is called the variance of X. We call V ar X the standard deviation of X. Some examples for the expected value and the variance are in the tables in appendix A. 6. Conclusion In this article we have been introduced to probability theory with almost no references to measure theory. Measure and integration theory provides the key to understand probability theory. The first two chapters of [Bau] give a very good introduction into this topic. Further studies of probability theory could include taking a closer look at the expected value and the variance, proving the Chebyshev inequality P ( X a ε) V ar X ε 2 and exmining the convergence properties of sequences of random variables. In [Sch] we can find a wide variety of topics about probability theory such as conditional probabilities, densities of random vectors, sums of random variables, characteristic functions, the Central Limit Theorem, the Laws of Large Numbers, stochastic processes and martingals. It provides the knowledge to go deeper into n=0 9
10 10 special topics like simulated annealing and genetic algorithms, which are a very good alternative in approaching np complete problems like travelling salesman and find approximately optimal solutions, or stochastic differential equations and Itô integrals, which can be used to forecast prices on the stock market. Appendix A. Overview of Some Probability Distributions A.1. Discrete Distributions. binomial distribution Notation X b (n, p) Density p i = ( n i) p i (1 p) n i for 1 i n Expected Value EX = np Variance V ar X = np (1 p) geometrical distribution Notation X geo (p) Density p i = p (1 p) i 1 for i N Expected Value EX = 1 p Variance V ar X = 1 p p 2 Poisson distribution Notation X P oi (a) Density p i = e a ai i! Expected Value EX = a for i N 0 Variance V ar X = a negative binomial distribution Notation X b (n, p) Density p i = ( n+i 1) i p n (1 p) i for i N 0 Expected Value EX = n(1 p) p Variance V ar X = n(1 p) p 2 A.2. Continuous Distributions. uniform distribution Notation X U [a, b] Density f (x) = 1 b a 1 [a,b] (x) Expected Value EX = a+b 2 Variance V ar X = (b a)2 12 exponential distribution Notation X exp (λ) Density f (x) = λe λx 1 [0, ) (x) Expected Value EX = 1 λ Variance V ar X = 1 λ 2 normal distribution Notation X N ( µ, σ 2) Density f (x) = 1 e (x µ)2 /2σ 2 2πσ Expected Value EX = µ Variance V ar X = σ 2 Chi-squared distribution Notation X χ 2 1 Density f (x) = 1 e x/2 1 2πx (0, ) (x) Expected Value EX = 1 Variance V ar X = 3 References [Bau] H. Bauer, Maß- und Integrationstheorie (degruyter 1992) [Sch] N. Schmitz, Vorlesungen über Wahrscheinlichkeitstheorie (Teubner 1996)
I. ANALYSIS; PROBABILITY
ma414l1.tex Lecture 1. 12.1.2012 I. NLYSIS; PROBBILITY 1. Lebesgue Measure and Integral We recall Lebesgue measure (M411 Probability and Measure) λ: defined on intervals (a, b] by λ((a, b]) := b a (so
More informationLecture 2: Random Variables and Expectation
Econ 514: Probability and Statistics Lecture 2: Random Variables and Expectation Definition of function: Given sets X and Y, a function f with domain X and image Y is a rule that assigns to every x X one
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 informationProbability Theory. Richard F. Bass
Probability Theory Richard F. Bass ii c Copyright 2014 Richard F. Bass Contents 1 Basic notions 1 1.1 A few definitions from measure theory............. 1 1.2 Definitions............................. 2
More informationCourse: ESO-209 Home Work: 1 Instructor: Debasis Kundu
Home Work: 1 1. Describe the sample space when a coin is tossed (a) once, (b) three times, (c) n times, (d) an infinite number of times. 2. A coin is tossed until for the first time the same result appear
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 information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
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 informationRandom Process Lecture 1. Fundamentals of Probability
Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus
More informationProbability and Random Processes
Probability and Random Processes Lecture 7 Conditional probability and expectation Decomposition of measures Mikael Skoglund, Probability and random processes 1/13 Conditional Probability A probability
More informationThree hours THE UNIVERSITY OF MANCHESTER. 24th January
Three hours MATH41011 THE UNIVERSITY OF MANCHESTER FOURIER ANALYSIS AND LEBESGUE INTEGRATION 24th January 2013 9.45 12.45 Answer ALL SIX questions in Section A (25 marks in total). Answer THREE of the
More informationNotes 1 : Measure-theoretic foundations I
Notes 1 : Measure-theoretic foundations I Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Section 1.0-1.8, 2.1-2.3, 3.1-3.11], [Fel68, Sections 7.2, 8.1, 9.6], [Dur10,
More information1: PROBABILITY REVIEW
1: PROBABILITY REVIEW Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 1: Probability Review 1 / 56 Outline We will review the following
More informationChapter 1. Sets and probability. 1.3 Probability space
Random processes - Chapter 1. Sets and probability 1 Random processes Chapter 1. Sets and probability 1.3 Probability space 1.3 Probability space Random processes - Chapter 1. Sets and probability 2 Probability
More informationLecture 1: Review on Probability and Statistics
STAT 516: Stochastic Modeling of Scientific Data Autumn 2018 Instructor: Yen-Chi Chen Lecture 1: Review on Probability and Statistics These notes are partially based on those of Mathias Drton. 1.1 Motivating
More informationStat 451: Solutions to Assignment #1
Stat 451: Solutions to Assignment #1 2.1) By definition, 2 Ω is the set of all subsets of Ω. Therefore, to show that 2 Ω is a σ-algebra we must show that the conditions of the definition σ-algebra are
More informationProbability: Handout
Probability: Handout Klaus Pötzelberger Vienna University of Economics and Business Institute for Statistics and Mathematics E-mail: Klaus.Poetzelberger@wu.ac.at Contents 1 Axioms of Probability 3 1.1
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More informationTheorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1
Chapter 2 Probability measures 1. Existence Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension to the generated σ-field Proof of Theorem 2.1. Let F 0 be
More informationNorthwestern University Department of Electrical Engineering and Computer Science
Northwestern University Department of Electrical Engineering and Computer Science EECS 454: Modeling and Analysis of Communication Networks Spring 2008 Probability Review As discussed in Lecture 1, probability
More information7 The Radon-Nikodym-Theorem
32 CHPTER II. MESURE ND INTEGRL 7 The Radon-Nikodym-Theorem Given: a measure space (Ω,, µ). Put Z + = Z + (Ω, ). Definition 1. For f (quasi-)µ-integrable and, the integral of f over is (Note: 1 f f.) Theorem
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 informationLebesgue Integration: A non-rigorous introduction. What is wrong with Riemann integration?
Lebesgue Integration: A non-rigorous introduction What is wrong with Riemann integration? xample. Let f(x) = { 0 for x Q 1 for x / Q. The upper integral is 1, while the lower integral is 0. Yet, the function
More informationLecture 21: Expectation of CRVs, Fatou s Lemma and DCT Integration of Continuous Random Variables
EE50: Probability Foundations for Electrical Engineers July-November 205 Lecture 2: Expectation of CRVs, Fatou s Lemma and DCT Lecturer: Krishna Jagannathan Scribe: Jainam Doshi In the present lecture,
More informationDS-GA 1002 Lecture notes 2 Fall Random variables
DS-GA 12 Lecture notes 2 Fall 216 1 Introduction Random variables Random variables are a fundamental tool in probabilistic modeling. They allow us to model numerical quantities that are uncertain: the
More informationLebesgue Measure. Dung Le 1
Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its
More informationP. Billingsley, Probability and Measure, Wiley, New York, P. Gänssler, W. Stute, Wahrscheinlichkeitstheorie, Springer, Berlin, 1977.
Probability Theory Klaus Ritter TU Kaiserslautern, WS 2017/18 Literature In particular, H. Bauer, Probability Theory, de Gruyter, Berlin, 1996. P. Billingsley, Probability and Measure, Wiley, New York,
More informationNotes on Measure, Probability and Stochastic Processes. João Lopes Dias
Notes on Measure, Probability and Stochastic Processes João Lopes Dias Departamento de Matemática, ISEG, Universidade de Lisboa, Rua do Quelhas 6, 1200-781 Lisboa, Portugal E-mail address: jldias@iseg.ulisboa.pt
More informationLecture 6 Basic Probability
Lecture 6: Basic Probability 1 of 17 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 6 Basic Probability Probability spaces A mathematical setup behind a probabilistic
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 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 informationAdmin and Lecture 1: Recap of Measure Theory
Admin and Lecture 1: Recap of Measure Theory David Aldous January 16, 2018 I don t use bcourses: Read web page (search Aldous 205B) Web page rather unorganized some topics done by Nike in 205A will post
More informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationII - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define
1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1
More informationHILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define
HILBERT SPACES AND THE RADON-NIKODYM THEOREM STEVEN P. LALLEY 1. DEFINITIONS Definition 1. A real inner product space is a real vector space V together with a symmetric, bilinear, positive-definite mapping,
More information1. Probability Measure and Integration Theory in a Nutshell
1. Probability Measure and Integration Theory in a Nutshell 1.1. Measurable Space and Measurable Functions Definition 1.1. A measurable space is a tuple (Ω, F) where Ω is a set and F a σ-algebra on Ω,
More information02. Measure and integral. 1. Borel-measurable functions and pointwise limits
(October 3, 2017) 02. Measure and integral Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2017-18/02 measure and integral.pdf]
More information18.175: Lecture 3 Integration
18.175: Lecture 3 Scott Sheffield MIT Outline Outline Recall definitions Probability space is triple (Ω, F, P) where Ω is sample space, F is set of events (the σ-algebra) and P : F [0, 1] is the probability
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
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 informationAdvanced Probability
Advanced Probability Perla Sousi October 10, 2011 Contents 1 Conditional expectation 1 1.1 Discrete case.................................. 3 1.2 Existence and uniqueness............................ 3 1
More information17. Convergence of Random Variables
7. Convergence of Random Variables In elementary mathematics courses (such as Calculus) one speaks of the convergence of functions: f n : R R, then lim f n = f if lim f n (x) = f(x) for all x in R. This
More information1.1 Review of Probability Theory
1.1 Review of Probability Theory Angela Peace Biomathemtics II MATH 5355 Spring 2017 Lecture notes follow: Allen, Linda JS. An introduction to stochastic processes with applications to biology. CRC Press,
More information1 Sequences of events and their limits
O.H. Probability II (MATH 2647 M15 1 Sequences of events and their limits 1.1 Monotone sequences of events Sequences of events arise naturally when a probabilistic experiment is repeated many times. For
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 informationIEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008
IEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008 Justify your answers; show your work. 1. A sequence of Events. (10 points) Let {B n : n 1} be a sequence of events in
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationLecture 5: Expectation
Lecture 5: Expectation 1. Expectations for random variables 1.1 Expectations for simple random variables 1.2 Expectations for bounded random variables 1.3 Expectations for general random variables 1.4
More informationBrownian Motion and Conditional Probability
Math 561: Theory of Probability (Spring 2018) Week 10 Brownian Motion and Conditional Probability 10.1 Standard Brownian Motion (SBM) Brownian motion is a stochastic process with both practical and theoretical
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More information1 Measurable Functions
36-752 Advanced Probability Overview Spring 2018 2. Measurable Functions, Random Variables, and Integration Instructor: Alessandro Rinaldo Associated reading: Sec 1.5 of Ash and Doléans-Dade; Sec 1.3 and
More informationChapter 2: Random Variables
ECE54: Stochastic Signals and Systems Fall 28 Lecture 2 - September 3, 28 Dr. Salim El Rouayheb Scribe: Peiwen Tian, Lu Liu, Ghadir Ayache Chapter 2: Random Variables Example. Tossing a fair coin twice:
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 information2 Measure Theory. 2.1 Measures
2 Measure Theory 2.1 Measures A lot of this exposition is motivated by Folland s wonderful text, Real Analysis: Modern Techniques and Their Applications. Perhaps the most ubiquitous measure in our lives
More informationMeasure and Integration: Concepts, Examples and Exercises. INDER K. RANA Indian Institute of Technology Bombay India
Measure and Integration: Concepts, Examples and Exercises INDER K. RANA Indian Institute of Technology Bombay India Department of Mathematics, Indian Institute of Technology, Bombay, Powai, Mumbai 400076,
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 informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationThe main results about probability measures are the following two facts:
Chapter 2 Probability measures The main results about probability measures are the following two facts: Theorem 2.1 (extension). If P is a (continuous) probability measure on a field F 0 then it has a
More informationRandom Models. Tusheng Zhang. February 14, 2013
Random Models Tusheng Zhang February 14, 013 1 Introduction In this module, we will introduce some random models which have many real life applications. The course consists of four parts. 1. A brief review
More informationX 1 ((, a]) = {ω Ω : X(ω) a} F, which leads us to the following definition:
nna Janicka Probability Calculus 08/09 Lecture 4. Real-valued Random Variables We already know how to describe the results of a random experiment in terms of a formal mathematical construction, i.e. the
More information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
More informationPart II Probability and Measure
Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationExercise 1. Show that the Radon-Nikodym theorem for a finite measure implies the theorem for a σ-finite measure.
Real Variables, Fall 2014 Problem set 8 Solution suggestions xercise 1. Show that the Radon-Nikodym theorem for a finite measure implies the theorem for a σ-finite measure. nswer: ssume that the Radon-Nikodym
More informationChapter 5. Means and Variances
1 Chapter 5 Means and Variances Our discussion of probability has taken us from a simple classical view of counting successes relative to total outcomes and has brought us to the idea of a probability
More informationLebesgue-Radon-Nikodym Theorem
Lebesgue-Radon-Nikodym Theorem Matt Rosenzweig 1 Lebesgue-Radon-Nikodym Theorem In what follows, (, A) will denote a measurable space. We begin with a review of signed measures. 1.1 Signed Measures Definition
More informationChapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ =
Chapter 6. Integration 1. Integrals of Nonnegative Functions Let (, S, µ) be a measure space. We denote by L + the set of all measurable functions from to [0, ]. Let φ be a simple function in L +. Suppose
More informationMath 493 Final Exam December 01
Math 493 Final Exam December 01 NAME: ID NUMBER: Return your blue book to my office or the Math Department office by Noon on Tuesday 11 th. On all parts after the first show enough work in your exam booklet
More informationTheory of probability and mathematical statistics
Theory of probability and mathematical statistics Tomáš Mrkvička Bibliography [1] J. [2] J. Andďż l: Matematickďż statistika, SNTL/ALFA, Praha 1978 Andďż l: Statistickďż metody, Matfyzpress, Praha 1998
More informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 9 September 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014.
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
More informationChapter 8. General Countably Additive Set Functions. 8.1 Hahn Decomposition Theorem
Chapter 8 General Countably dditive Set Functions In Theorem 5.2.2 the reader saw that if f : X R is integrable on the measure space (X,, µ) then we can define a countably additive set function ν on by
More informationLecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable
Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed
More informationLecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable
Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed
More informationPCMI Introduction to Random Matrix Theory Handout # REVIEW OF PROBABILITY THEORY. Chapter 1 - Events and Their Probabilities
PCMI 207 - Introduction to Random Matrix Theory Handout #2 06.27.207 REVIEW OF PROBABILITY THEORY Chapter - Events and Their Probabilities.. Events as Sets Definition (σ-field). A collection F of subsets
More informationChapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries
Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.
More information1 Presessional Probability
1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional
More informationMath 5051 Measure Theory and Functional Analysis I Homework Assignment 2
Math 551 Measure Theory and Functional nalysis I Homework ssignment 2 Prof. Wickerhauser Due Friday, September 25th, 215 Please do Exercises 1, 4*, 7, 9*, 11, 12, 13, 16, 21*, 26, 28, 31, 32, 33, 36, 37.
More informationIntroduction to Stochastic Processes
Stat251/551 (Spring 2017) Stochastic Processes Lecture: 1 Introduction to Stochastic Processes Lecturer: Sahand Negahban Scribe: Sahand Negahban 1 Organization Issues We will use canvas as the course webpage.
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 informationLecture 4: Probability and Discrete Random Variables
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 4: Probability and Discrete Random Variables Wednesday, January 21, 2009 Lecturer: Atri Rudra Scribe: Anonymous 1
More informationBasics of Stochastic Analysis
Basics of Stochastic Analysis c Timo Seppäläinen This version November 16, 214 Department of Mathematics, University of Wisconsin Madison, Madison, Wisconsin 5376 E-mail address: seppalai@math.wisc.edu
More informationMATH 418: Lectures on Conditional Expectation
MATH 418: Lectures on Conditional Expectation Instructor: r. Ed Perkins, Notes taken by Adrian She Conditional expectation is one of the most useful tools of probability. The Radon-Nikodym theorem enables
More informationAlmost Sure Convergence of a Sequence of Random Variables
Almost Sure Convergence of a Sequence of Random Variables (...for people who haven t had measure theory.) 1 Preliminaries 1.1 The Measure of a Set (Informal) Consider the set A IR 2 as depicted below.
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 informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationChapter 4. The dominated convergence theorem and applications
Chapter 4. The dominated convergence theorem and applications The Monotone Covergence theorem is one of a number of key theorems alllowing one to exchange limits and [Lebesgue] integrals (or derivatives
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 information+ 2x sin x. f(b i ) f(a i ) < ɛ. i=1. i=1
Appendix To understand weak derivatives and distributional derivatives in the simplest context of functions of a single variable, we describe without proof some results from real analysis (see [7] and
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 information1 Probability theory. 2 Random variables and probability theory.
Probability theory Here we summarize some of the probability theory we need. If this is totally unfamiliar to you, you should look at one of the sources given in the readings. In essence, for the major
More informationPart II: Markov Processes. Prakash Panangaden McGill University
Part II: Markov Processes Prakash Panangaden McGill University 1 How do we define random processes on continuous state spaces? How do we define conditional probabilities on continuous state spaces? How
More informationProbability Theory and Statistics. Peter Jochumzen
Probability Theory and Statistics Peter Jochumzen April 18, 2016 Contents 1 Probability Theory And Statistics 3 1.1 Experiment, Outcome and Event................................ 3 1.2 Probability............................................
More information12 Expectations. Expectations 103
Expectations 103 12 Expectations At rst, for motivation purposes, the expectation of a r.v. will be introduced for the discrete case as the weighted mean value on the basis of the series value of an absolutely
More informationIEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 2
IEOR 316: Introduction to Operations Research: Stochastic Models Professor Whitt SOLUTIONS to Homework Assignment 2 More Probability Review: In the Ross textbook, Introduction to Probability Models, read
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 informationFiltrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition
Filtrations, Markov Processes and Martingales Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition David pplebaum Probability and Statistics Department,
More informationSTAT 516 Midterm Exam 2 Friday, March 7, 2008
STAT 516 Midterm Exam 2 Friday, March 7, 2008 Name Purdue student ID (10 digits) 1. The testing booklet contains 8 questions. 2. Permitted Texas Instruments calculators: BA-35 BA II Plus BA II Plus Professional
More informationSTAT 712 MATHEMATICAL STATISTICS I
STAT 72 MATHEMATICAL STATISTICS I Fall 207 Lecture Notes Joshua M. Tebbs Department of Statistics University of South Carolina c by Joshua M. Tebbs TABLE OF CONTENTS Contents Probability Theory. Set Theory......................................2
More informationExercises Measure Theoretic Probability
Exercises Measure Theoretic Probability 2002-2003 Week 1 1. Prove the folloing statements. (a) The intersection of an arbitrary family of d-systems is again a d- system. (b) The intersection of an arbitrary
More information