Lecture 2: Random Variables and Expectation
|
|
- Abigail Dennis
- 5 years ago
- Views:
Transcription
1 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 (and only one) y Y. Notation: f : X Y, y = f(x) 1
2 Definition of random variable Let (Ω, A, P ) and be a probability space. A random variable X is a function X : Ω R such that for all B B with B the Borel σ-algebra E = {ω X(ω) B} A. The set E is also denoted as E = X 1 (B). This does not mean that X 1 exists, i.e. that X is a 1-1 function! See figure 2
3 A random variable X is a function that is in addition Borel measurable. Why we need this will be discussed later. Measurability is a more general concept. Because random variables are always functions to R we need only Borel measurability, because for R we always take the Borel σ-algebra. Often the function X can take the values and, i.e. X is a function the the extended real line R with the extended Borel σ-field B that contains all sets in B and the two points,. Why random variables? Often outcomes of a random experiment are complicated. Random variable summarizes (aspects of) an outcome in a single number. 3
4 Example: Three tosses of a single coin. Outcome space Ω = {HHH, HHT, HT H, T HH, HT T, T HT, T T H, T T T } Define X number of H in 3 tosses X(ω) = 3 if ω = HHH = 2 if ω = HHT,HTH,THH = 1 if ω = THT,TTH,HTT = 0 if ω = TTT For some random experiment we can define many random variables, e.g. in this example Y number of T before first H. 4
5 Measurability To establish measurability we use a generating class argument, because it is often easier to establish measurability on such a class. If E is a generating class for B, e.g. the intervals (, x] or (x, ), then we need only to show that X 1 (E) A for all E E. Proof: Define C = {B B X 1 (B) A}. We show that this is a σ-field. (i) C. (ii) Note X 1 (B c ) = X 1 (B) c, because by definition ω X 1 (B) c iff X(ω) / B iff X(ω) B c. Hence X 1 (B c ) A. (iii) Note X 1 ( i=1 B i) = i=1 X 1 (B i ), because ω X 1 ( i=1 B i) iff X(ω) i=1 B i. Hence, X 1 ( i=1 B i) A. Because C is a σ-field and E C, we have B = σ(e) C. Hence X 1 (B) A for all B B, so that X is Borel measurable. 5
6 Applications Let Ω = R, i.e. X : R R. If X is a continuous function, then X is Borel measurable, because if E is an open set (the open sets in R are a generating class), then X 1 (E) is also open and hence in B. Let X n, n = 1, 2,... be a sequence of random variables, then X sup = sup n X n and X inf = inf n X n are also random variables, i.e. they are Borel measurable functions. Note that X sup (ω) may be equal to for some ω (and X inf (ω) equal to ), i.e. they are B measurable. To see this note that (x, ) is a generating class for B, and that {ω X sup (ω) > x} = n {ω X n (ω) > x} The last union is clearly in A. For X inf take the generating sets (, x). If lim X n = X exists (may be ± ), then this is a random variable. To see this note that lim inf X n (ω) = sup n inf m n X m (ω) and lim sup X n (ω) = inf n sup m n X m (ω). From the previous result these are Borel measurable functions. We have lim inf X n(ω) X(ω) = lim X n (ω) lim sup X n (ω) Hence if the limit exists, it is equal to the liminf and limsup which are Borel measurable. 6
7 Let X and Y be random variables, then Z = X + Y is Borel measurable. Note that A = {ω Z(ω) > z} = x {ω X(ω) = x} {ω Y (ω) > z x} which involve an uncountable union. Because the countable set of rational numbers is a dense subset of R, for all ω with X(ω) > z Y (ω) there is a rational number r such that X(ω) > r > z Y (ω). Hence A = r {ω X(ω) > r} {ω Y (ω) > z r} which is a countable union. 7
8 We denote all Borel measurable functions X : Ω R by M and the subset of Borel measurable nonnegative functions by M +. A special class of nonnegative Borel measurable functions are the simple functions that can be written as n X(ω) = α i I Ai (ω) i with I A the indicator function of the event A and A i A, i = 1,..., n a partition of Ω and α i 0, i = 1,..., n constants. Each function in M + can be approximated by and increasing sequence of simple functions. Theorem 1 For each X in M +, the sequence of simple functions 4n X n (ω) = 2 n I (ω) X i 2 n is such that 0 X 1 (ω) X 2 (ω)... X n (ω) and X n (ω) X(ω) for all ω Ω. Proof: If X(ω) 2 n, then X n (ω) = 2 n If k2 n X(ω) < (k + 1)2 n for some k = 0, 1,..., 4 n 1, then X n (ω) = k2 n. See the figure for a graph and the claim follows. i=1 8
9 Expectation and integration Random experiment: Toss a coin twice Ω = {HH, HT, T H, T T } and these outcomes are equally likely Random variable: X is number of H in two tosses X takes values 0 (TT), 1 (TH,HT), and 2 (HH). You receive the uncertain return $X How much do you want to pay for this gamble if you are risk neutral? 9
10 Most people make the following computation: Consider a large number of repetitions of the random experiment. The relative frequency of values of X is 1/4 (X = 0), 1/2 (X = 1), 1/4 (X = 2). On average (over the repetitions) X is = 1 You are willing to pay $1 for the gamble. Call this the expected value of X, denoted by E(X). Direct computation Note that X is a nonnegative simple function for the partition A 1 = {T T }, A 2 = {HT, T H}, A 3 = {HH} and X(ω) = 0.I A1 (ω) + 1.I A2 (ω) + 2.I A3 (ω). E(X) = 0.P (A 1 ) + 1.P (A 2 ) + 2.P (A 3 ) = 1. In general if X(ω) = n i α ii Ai (ω) is a simple function, the expected value of X is n E(X) = α i P (A i ) i=1 Note that this is a weighted average of the values of X, the weights being the probabilities of these values. This suggests the notation E(X) = X(ω)dP (ω) = Ω XdP 10
11 How do you compute E(X) for a general random variable X? We use Theorem 1: Let X be a nonnegative random variable defined on the probability space (Ω, A, P ). By Theorem 1 there is an increasing sequence of simple functions X n that has limit X. This is why we need that X is Borel measurable to be able to define E(X). Define for simple functions X S E(X) = XdP = sup{e(x S ) X X S } X S Properties of E(X) (i) E(I A ) = P (A) for A A. (ii) E(0) = 0 with 0 the null function that assigns 0 to all ω Ω. 11
12 (iii) For α, β 0 and nonnegative Borel measurable functions X, Y E(αX + βy ) = αe(x) + βe(y ) This is the linearity of the expectation. Proof: Note that if X S, Y S are simple functions then so is Z S = X S + Y S. Also E(Z S ) = E(X S ) + E(Y S ). E(X)+E(Y ) = sup X S {E(X S ) X X S }+sup Y S {E(Y S ) Y Y S } = = sup X S,Y S {E(X S ) + E(Y S ) X X S, Y Y S } sup X S,Y S {E(X S + Y S ) X + Y X S + Y S } = = sup Z S {E(Z S ) X + Y Z S } = E(X + Y ) Next we prove E(X +Y ) E(X)+E(Y ). Let Z S be a simple function with Z S X+Y and let ε > 0. We construct simple functions X S X and Y S Y such that (1 ε)z S X S + Y S. We do the construction for Z S = I A. The general case is analogous. Take ε = 1 m and denote l j = j m. Define ( ) m X S (ω) = I A (ω) I X 1 (ω) + l j 1 I lj 1 X<l j (ω) Y S (ω) = I A (ω) j=1 m (1 l j )I lj 1 X<l j (ω) j=1 Obviously X S X. Now X(ω) + Y (ω) 1 for all ω Ω. Hence for l j 1 X < l j, we have Y > 12
13 1 l j = Y S. This holds for all j and hence Y S Y. Finally, because 1 l j + l j 1 = 1 ε, we have X S (ω) + Y S (ω) = m = I A (ω)i X 1 (ω)+(1 ε)i A (ω) I lj 1 X<l j (ω) (1 ε)i A (ω) Hence for all Z S X + Y j=1 E(X) + E(Y ) E(X S ) + E(Y S ) (1 ε)e(z S ) and if we take the sup over all Z S X + Y, we find E(X) + E(Y ) (1 ε)e(x + Y ). Because ε > 0 is arbitrary, this is still true if ε 0. From the definition it follows directly that for all α 0, E(αX) = αe(x). (iv) If X(ω) Y (ω) for all ω Ω, then E(X) E(Y ). Proof: E(X) = E(Y ) E(Y X) E(X) 13
14 (v) If X n X is an increasing sequence of nonnegative Borel measurable functions, then E(X n ) E(X). This is the monotone convergence property. Proof: Let X S = m i=1 α ii Ai be a simple function with X X S. Define the simple functions m X ns (ω) = (1 ε)α i I Ai (ω)i Xn (1 ε)α i (ω) i=1 Then X ns X n and E(X n ) E(X ns ) = (1 ε) m α i P (A i {ω X n (ω) (1 ε)α i }) i=1 Because X n X α i for ω A i, A i {ω X n (ω) (1 ε)α i } A i and hence P (A i {ω X n (ω) (1 ε)α i }) P (A i ). Hence for all X S X lim E(X n) (1 ε)e(x S ) Take the sup over all X S X and let ε 0 to obtain Because X n X, also lim E(X n) E(X) lim E(X n) E(X) 14
15 Extension to all random variables Until now E(X) only defined for nonnegative random variables. For arbitrary random variable X we can always write X(ω) = X + (ω) X (ω) with X + (ω) = max{x(ω), 0} and X (ω) = min{x(ω), 0}. Note X +, X are nonnegative. We define E(X) = E(X + ) E(X ) = Ω X + dp Ω X dp This is well-defined unless E(X + ) = E(X ) =. To avoid this we can require E(X + ) <, E(X ) < or E( X ) <. A random variable X with E( X ) < is called integrable. Application: Jensen s inequality. A function f : R R is convex if for all 0 < λ < 1, f(λx 1 + (1 λ)x 2 ) λf(x 1 ) + (1 λ)f(x 2 ). If f is convex E = {x f(x) t} is a convex subset of R and hence an interval. Hence, f is Borel measurable. Proof: x 1, x 2 E, then f(λx 1 + (1 λ)x 2 ) λf(x 1 ) + (1 λ)f(x 2 ) t. For all x, x 0, f(x) f(x 0 ) + α(x x 0 ) with α a constant that may depend on x 0. 15
16 Note f(x) f(x 0 ) + α(x x 0 ) f(x 0 ) α ( x + x 0 ) Hence E(f(X) ) < if X is integrable and E(f(X) is well-defined. Take x 0 = E(X) to obtain E(f(X)) f(e(x))+α(e(x) E(X)) = f(e(x)) 16
17 Lebesgue integrals The expectation of X is the integral of X w.r.t. to the probability measure P. The same definition applies if P is replaced by a measure µ, i.e. if the condition that µ(ω) = 1 is dropped and replaced by µ( ) = 0 (the other conditions remain). Special case is Lebesgue measure, defined by m([a, b]) = b a. This is the length of the interval. It implies m((a, b)) = b a (because the Lebesgue measure of a point is 0) and because the open intervals are a generating class the definition can be uniquely extended to all sets in the Borel field B. The integral of Borel measurable f : R R w.r.t. Lebesgue measure is denoted by f(x)dx. The notation is the same as the (improper) Riemann integral of f. If f is integrable, i.e. if the Lebesgue integral f(x) dx <, then the Lebesgue integral is equal to the Riemann integral if the latter exists. If f(x) dx =, the improper Riemann integral lim t t t f(x)dx may exist, while the Lebesgue integral is not defined. Except for this special case you can compute Lebesgue integrals with all the calculus tricks. The theory of Lebesgue integration is easier than that of Riemann integration, in particular if order or integration and limit or integration and differentiation has to be interchanged. 17
18 Integration and limits Often we have a sequence of random variables X n, n = 1, 2,... and we need to know lim E(X n ) = lim Xn dp. Can we interchange limit and integral? We want to take the derivative w.r.t. of E(f(X, t)) = inf f(x, t)dp. Can we interchange differentiation and integration? What can go wrong: Consider the probability space [0, 1], B[0, 1], P ) with B[0, 1] the σ-field obtained by the intersections of the sets in B with [0, 1] and P ((a, b)) = b a. Define the sequence X n (ω) = n 2 I (0, 1 n ) (ω). X n (ω) 0 for all 0 ω 1, but E(X n ) = n. lim E(X n ) = 0 = E(lim X n ) Theorem 2 (Fatou s Lemma) Let X n be a sequence of nonnegative random variables (need not converge), then E(lim inf X n) lim inf E(X n) Proof: Remember lim inf X n = lim inf m n X m. Define Y n = inf m n X m. We have for all n, Y n X n. Moreover, Y n is an increasing sequence of nonnegative random variables, by monotone convergence E(lim inf X n ) = lim E(Y n ). Finally, because E(X n ) E(Y n ), we have lim E(Y n ) lim inf E(X n ). 18
19 Theorem 3 (Dominated convergence) Let X n be a sequence of integrable random variables and let the limit lim X n (ω) = X(ω) exist for all ω Ω. If there is a nonnegative integrable random variable Y such that X n (ω) Y (ω) for all ω Ω and all n, then X is integrable and lim E(X n ) = E(X). Proof: X Y and hence X is integrable. Consider the sequences Y +X n and Y X n that are both nonnegative and integrable. By Fatou s lemma E(Y +X) = E(lim inf (Y +X n)) E(Y )+lim inf E(X n) E(Y X) = E(lim inf (Y X n)) E(Y ) lim sup E(X n ) because lim inf X n = lim sup X n. Cancel E(Y ) to obtain lim sup E(X n ) E(X) lim inf E(X n) 19
20 Application: Let f(x, t) be an integrable random variable for δ < t < δ with δ > 0, let f(x, t) be differentiable in t on that interval and for all x. Consider the partial derivative with respect to t and assume for all x and δ < t < δ f(x, t) t with M(X) an integrable random variable. Hence by the mean value theorem f(x, t) f(x, 0) t f(x, t(x)) t M(x) with t(x) = λ(x)t for some 0 λ(x) 1. Define the sequence of random variables f(x, t n ) f(x, 0) t n with t n 0. We have ( ) f(x, lim E tn ) f(x, 0) t n = lim E(f(X, t n )) E(f(X, 0)) t n By dominated convergence we can interchange the limit and the expectation (integration), so that ( ) E f(x, t) = E(f(X, t)) t t 20
21 Sets of measure 0 In integrals/expactations sets E A with P (E) = 0 can be neglected. Theorem 4 If the random variables X and Y are such that E = {ω X(ω) Y (ω)} with P (E) = 0, then E(X) = E(Y ). Proof: If n is sufficiently large then X(ω) Y (ω) + n.i X Y (ω). Because the sequence on the rhs is increasing, we have by monotone convergence ( E(X) E lim (Y + n.i X Y ) Interchange X and Y to obtain, E(Y ) E(X). ) = lim E(Y +n.i X Y )) = E(Y ) 21
Probability: 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 informationI. 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 informationElementary Probability. Exam Number 38119
Elementary Probability Exam Number 38119 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
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 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 information4th Preparation Sheet - Solutions
Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space
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 informationLecture 3: Expected Value. These integrals are taken over all of Ω. If we wish to integrate over a measurable subset A Ω, we will write
Lecture 3: Expected Value 1.) Definitions. If X 0 is a random variable on (Ω, F, P), then we define its expected value to be EX = XdP. Notice that this quantity may be. For general X, we say that EX exists
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 information36-752: Lecture 1. We will use measures to say how large sets are. First, we have to decide which sets we will measure.
0 0 0 -: Lecture How is this course different from your earlier probability courses? There are some problems that simply can t be handled with finite-dimensional sample spaces and random variables that
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 informationLectures 22-23: Conditional Expectations
Lectures 22-23: Conditional Expectations 1.) Definitions Let X be an integrable random variable defined on a probability space (Ω, F 0, P ) and let F be a sub-σ-algebra of F 0. Then the conditional expectation
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 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 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 information1 Stat 605. Homework I. Due Feb. 1, 2011
The first part is homework which you need to turn in. The second part is exercises that will not be graded, but you need to turn it in together with the take-home final exam. 1 Stat 605. Homework I. Due
More informationLecture Notes for MA 623 Stochastic Processes. Ionut Florescu. Stevens Institute of Technology address:
Lecture Notes for MA 623 Stochastic Processes Ionut Florescu Stevens Institute of Technology E-mail address: ifloresc@stevens.edu 2000 Mathematics Subject Classification. 60Gxx Stochastic Processes Abstract.
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 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 informationRandom experiments may consist of stages that are performed. Example: Roll a die two times. Consider the events E 1 = 1 or 2 on first roll
Econ 514: Probability and Statistics Lecture 4: Independence Stochastic independence Random experiments may consist of stages that are performed independently. Example: Roll a die two times. Consider the
More informationMartingale Theory and Applications
Martingale Theory and Applications Dr Nic Freeman June 4, 2015 Contents 1 Conditional Expectation 2 1.1 Probability spaces and σ-fields............................ 2 1.2 Random Variables...................................
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 informationFundamental Inequalities, Convergence and the Optional Stopping Theorem for Continuous-Time Martingales
Fundamental Inequalities, Convergence and the Optional Stopping Theorem for Continuous-Time Martingales Prakash Balachandran Department of Mathematics Duke University April 2, 2008 1 Review of Discrete-Time
More informationMath 5051 Measure Theory and Functional Analysis I Homework Assignment 3
Math 551 Measure Theory and Functional Analysis I Homework Assignment 3 Prof. Wickerhauser Due Monday, October 12th, 215 Please do Exercises 3*, 4, 5, 6, 8*, 11*, 17, 2, 21, 22, 27*. Exercises marked with
More informationSummary of Real Analysis by Royden
Summary of Real Analysis by Royden Dan Hathaway May 2010 This document is a summary of the theorems and definitions and theorems from Part 1 of the book Real Analysis by Royden. In some areas, such as
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 informationRandom Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R
In probabilistic models, a random variable is a variable whose possible values are numerical outcomes of a random phenomenon. As a function or a map, it maps from an element (or an outcome) of a sample
More informationMODULE 2 RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES DISTRIBUTION FUNCTION AND ITS PROPERTIES
MODULE 2 RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES 7-11 Topics 2.1 RANDOM VARIABLE 2.2 INDUCED PROBABILITY MEASURE 2.3 DISTRIBUTION FUNCTION AND ITS PROPERTIES 2.4 TYPES OF RANDOM VARIABLES: DISCRETE,
More informationLecture 3: Random variables, distributions, and transformations
Lecture 3: Random variables, distributions, and transformations Definition 1.4.1. A random variable X is a function from S into a subset of R such that for any Borel set B R {X B} = {ω S : X(ω) B} is an
More informationABSTRACT EXPECTATION
ABSTRACT EXPECTATION Abstract. In undergraduate courses, expectation is sometimes defined twice, once for discrete random variables and again for continuous random variables. Here, we will give a definition
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 informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationCLASSICAL PROBABILITY MODES OF CONVERGENCE AND INEQUALITIES
CLASSICAL PROBABILITY 2008 2. MODES OF CONVERGENCE AND INEQUALITIES JOHN MORIARTY In many interesting and important situations, the object of interest is influenced by many random factors. If we can construct
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More information4 Expectation & the Lebesgue Theorems
STA 7: Probability & Measure Theory Robert L. Wolpert 4 Expectation & the Lebesgue Theorems Let X and {X n : n N} be random variables on the same probability space (Ω,F,P). If X n (ω) X(ω) for each ω Ω,
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 informationIf Y and Y 0 satisfy (1-2), then Y = Y 0 a.s.
20 6. CONDITIONAL EXPECTATION Having discussed at length the limit theory for sums of independent random variables we will now move on to deal with dependent random variables. An important tool in this
More informationLebesgue Integration on R n
Lebesgue Integration on R n The treatment here is based loosely on that of Jones, Lebesgue Integration on Euclidean Space We give an overview from the perspective of a user of the theory Riemann integration
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 information2 Lebesgue integration
2 Lebesgue integration 1. Let (, A, µ) be a measure space. We will always assume that µ is complete, otherwise we first take its completion. The example to have in mind is the Lebesgue measure on R n,
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 informationMATH 5616H INTRODUCTION TO ANALYSIS II SAMPLE FINAL EXAM: SOLUTIONS
MATH 5616H INTRODUCTION TO ANALYSIS II SAMPLE FINAL EXAM: SOLUTIONS You may not use notes, books, etc. Only the exam paper, a pencil or pen may be kept on your desk during the test. Calculators are not
More information4 Expectation & the Lebesgue Theorems
STA 205: Probability & Measure Theory Robert L. Wolpert 4 Expectation & the Lebesgue Theorems Let X and {X n : n N} be random variables on a probability space (Ω,F,P). If X n (ω) X(ω) for each ω Ω, does
More informationStat 643 Review of Probability Results (Cressie)
Stat 643 Review of Probability Results (Cressie) Probability Space: ( HTT,, ) H is the set of outcomes T is a 5-algebra; subsets of H T is a probability measure mapping from T onto [0,] Measurable Space:
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationvan Rooij, Schikhof: A Second Course on Real Functions
vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.
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 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 informationSolutions to Tutorial 1 (Week 2)
THE UNIVERSITY OF SYDNEY SCHOOL OF MATHEMATICS AND STATISTICS Solutions to Tutorial 1 (Week 2 MATH3969: Measure Theory and Fourier Analysis (Advanced Semester 2, 2017 Web Page: http://sydney.edu.au/science/maths/u/ug/sm/math3969/
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 informationMeasure Theory, Probability, and Martingales
Trinity University Digital Commons @ Trinity Math Honors Theses Mathematics Department 4-20-2011 Measure Theory, Probability, and Martingales Xin Ma Trinity University, xma@trinity.edu Follow this and
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 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 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 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 informationChapter 1: Probability Theory Lecture 1: Measure space, measurable function, and integration
Chapter 1: Probability Theory Lecture 1: Measure space, measurable function, and integration Random experiment: uncertainty in outcomes Ω: sample space: a set containing all possible outcomes Definition
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
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 informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationEconomics 574 Appendix to 13 Ways
University of Illinois Spring 2017 Department of Economics Roger Koenker Economics 574 ppendix to 13 Ways This ppendix provides an overview of some of the background that is left undeveloped in 13 Ways
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 informationProbability and Measure. November 27, 2017
Probability and Measure November 27, 2017 1 CONTENTS 2 Contents 1 Measure Theory 4 1.1 History................................ 4 1.2 Lebesgue Measure.......................... 5 1.3 Measurable Functions........................
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
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 informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationHomework 1 due on Monday September 8, 2008
Homework 1 due on Monday September 8, 2008 Chapter 1, Problems 4, 5, 7. Also solve the following problems (A) Let E be the collection of intervals in = (, ) of type (r, ) where r is an arbitrary rational
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 informationProbability and Random Processes
Probability and Random Processes Lecture 4 General integration theory Mikael Skoglund, Probability and random processes 1/15 Measurable xtended Real-valued Functions R = the extended real numbers; a subset
More informationA D VA N C E D P R O B A B I L - I T Y
A N D R E W T U L L O C H A D VA N C E D P R O B A B I L - I T Y T R I N I T Y C O L L E G E T H E U N I V E R S I T Y O F C A M B R I D G E Contents 1 Conditional Expectation 5 1.1 Discrete Case 6 1.2
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 information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationMATH5011 Real Analysis I. Exercise 1 Suggested Solution
MATH5011 Real Analysis I Exercise 1 Suggested Solution Notations in the notes are used. (1) Show that every open set in R can be written as a countable union of mutually disjoint open intervals. Hint:
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 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 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 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 informationNotes 13 : Conditioning
Notes 13 : Conditioning Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Sections 0, 4.8, 9, 10], [Dur10, Section 5.1, 5.2], [KT75, Section 6.1]. 1 Conditioning 1.1 Review
More informationMTH 404: Measure and Integration
MTH 404: Measure and Integration Semester 2, 2012-2013 Dr. Prahlad Vaidyanathan Contents I. Introduction....................................... 3 1. Motivation................................... 3 2. The
More informationLebesgue measure and integration
Chapter 4 Lebesgue measure and integration If you look back at what you have learned in your earlier mathematics courses, you will definitely recall a lot about area and volume from the simple formulas
More informationG1CMIN Measure and Integration
G1CMIN Measure and Integration 2003-4 Prof. J.K. Langley May 13, 2004 1 Introduction Books: W. Rudin, Real and Complex Analysis ; H.L. Royden, Real Analysis (QA331). Lecturer: Prof. J.K. Langley (jkl@maths,
More informationExercise 1. Let f be a nonnegative measurable function. Show that. where ϕ is taken over all simple functions with ϕ f. k 1.
Real Variables, Fall 2014 Problem set 3 Solution suggestions xercise 1. Let f be a nonnegative measurable function. Show that f = sup ϕ, where ϕ is taken over all simple functions with ϕ f. For each n
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 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 informationIowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 EXERCISES FROM CHAPTER 1 Homework #1 Solutions The following version of the
More informationSolution. 1 Solution of Homework 7. Sangchul Lee. March 22, Problem 1.1
Solution Sangchul Lee March, 018 1 Solution of Homework 7 Problem 1.1 For a given k N, Consider two sequences (a n ) and (b n,k ) in R. Suppose that a n b n,k for all n,k N Show that limsup a n B k :=
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 informationREAL VARIABLES: PROBLEM SET 1. = x limsup E k
REAL VARIABLES: PROBLEM SET 1 BEN ELDER 1. Problem 1.1a First let s prove that limsup E k consists of those points which belong to infinitely many E k. From equation 1.1: limsup E k = E k For limsup E
More informationProbability Theory II. Spring 2016 Peter Orbanz
Probability Theory II Spring 2016 Peter Orbanz Contents Chapter 1. Martingales 1 1.1. Martingales indexed by partially ordered sets 1 1.2. Martingales from adapted processes 4 1.3. Stopping times and
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 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 informationAnnalee Gomm Math 714: Assignment #2
Annalee Gomm Math 714: Assignment #2 3.32. Verify that if A M, λ(a = 0, and B A, then B M and λ(b = 0. Suppose that A M with λ(a = 0, and let B be any subset of A. By the nonnegativity and monotonicity
More informationLEBESGUE MEASURE AND L2 SPACE. Contents 1. Measure Spaces 1 2. Lebesgue Integration 2 3. L 2 Space 4 Acknowledgments 9 References 9
LBSGU MASUR AND L2 SPAC. ANNI WANG Abstract. This paper begins with an introduction to measure spaces and the Lebesgue theory of measure and integration. Several important theorems regarding the Lebesgue
More informationSTA 711: Probability & Measure Theory Robert L. Wolpert
STA 711: Probability & Measure Theory Robert L. Wolpert 6 Independence 6.1 Independent Events A collection of events {A i } F in a probability space (Ω,F,P) is called independent if P[ i I A i ] = P[A
More information1 Probability space and random variables
1 Probability space and random variables As graduate level, we inevitably need to study probability based on measure theory. It obscures some intuitions in probability, but it also supplements our intuition,
More informationLecture 11: Random Variables
EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 11: Random Variables Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan, Gopal, Arjun B, Debayani The study of random
More informationThe Subdifferential of Convex Deviation Measures and Risk Functions
The Subdifferential of Convex Deviation Measures and Risk Functions Nicole Lorenz Gert Wanka In this paper we give subdifferential formulas of some convex deviation measures using their conjugate functions
More information(A n + B n + 1) A n + B n
344 Problem Hints and Solutions Solution for Problem 2.10. To calculate E(M n+1 F n ), first note that M n+1 is equal to (A n +1)/(A n +B n +1) with probability M n = A n /(A n +B n ) and M n+1 equals
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 informationMeasure Theoretic Probability. P.J.C. Spreij
Measure Theoretic Probability P.J.C. Spreij this version: September 16, 2009 Contents 1 σ-algebras and measures 1 1.1 σ-algebras............................... 1 1.2 Measures...............................
More information