13 views

Original Title: Maths Probability Expectation and Conditional Expectation lec6/8.pdf

Uploaded by eeshgarg

- probability-for-finance.pdf
- Math6365-fall11-syll
- Probability & Prob. Distributions
- Probability Theory
- BAM-001_Student_Day-12.doc
- 3 - Simulation in Practice and Intro to Probability and Statistics
- Math9 S16 Lec1 Basics
- lecture24 PGF
- Introduction to Probability by Grinstead and Snell
- EC254_Problem_set4.pdf
- Kurt Marti (Auth.)-Stochastic Optimization Methods_ Applications in Engineering and Operations Research-Springer-Verlag Berlin Heidelberg (2015)
- CTF_2
- EMM5622 Lecture w6a
- Engineering Statistics Study Sheet
- Book on Probability Introduction From MIIT
- Principles and Techniques in Combinatorics - Chen Chuan-Chong, Koh Khee-Meng (WS, 1992)
- Pertemuan 1 Pengantar Reliability
- UG Probability Lect 1 2 Slides
- taleb-nassim-silent-risk.pdf
- Tabel As

You are on page 1of 12

In this chapter, we introduce expected value or the mean of a random variable. First we define expectation for discrete random variables and then for general random variable. Finally we introduce the notion of conditional expectations using conditional probabilities.

equal almost surely (in short a.s.) if

are said to be

there exists a partition

where

may be

Proof. Let

. Here

is discrete, we have

Set

Then

Now define

Then

is a partition of

and

Remark 6.0.6 If

range of is at the most countable. Here 'effective' range means those values taken by positive probability. This leads to the name 'discrete' random variable.

Remark 6.0.7 If

that

is a discrete random variable, then one can assume without the loss of generality

Since if

, then set

and

for

Then if

be such that

is a countable partition of

then

, set

Then clearly

Also if

then

. Therefore

expectation of

. Then

denoted by

has range

, then

be a Bernoulli(

Hence

be a Binomial

Hence

be a Poisson (

Hence

be a Geometric (

Hence

means. Then (i) If (ii) For , then .

and

. Hence

be a representation of

. Then

implies

for all

(ii) Let

has a representation

. Now by setting

and

. Therefore

Hence

Definition 6.3. (Simple random variable) A random variable is said to be simple if it is discrete and the

distribution function has only finitely many discontinuities. Theorem 6.0.26Let be random variable in satisfying . such that , then there exists a sequence

. as follows:

Proof. For

Then

Proof. Since

exists. Also since

Therefore

simple and

Let

where

is a partition of

. Fix

, set for

and

Since

Also

Hence

we have

Hence

(6.0.1)

Now let,

in (6.0.1), we get

Since,

is arbitrary, we get

is defined as (6.0.2)

where

Remark 6.0.9

. Then

Proof. By using the simple functions given in the proof of Theorem 6.0.25, we get

(6.0.3)

where

Hence

exists if either or

is said to

where

Note that

Theorem 6.0.28

Let

. Then

Proof. Set

Hence

Then

Similarly, set

Hence

Then

Now

(6.0.4)

and

(6.0.5)

The last equality follows by the arguments from the proof of Theorem 6.0.26. Combining (6.0.4) and (6.0.4), we get

Now as in the proof of Theorem 6.0.26, we complete the proof. We state the following useful properties of expectation. The proof follows by approximation argument using the corresponding properties of simple random variables

(i) If , then .

(ii) For

(iii) Let

. Then

In the context of Riemann integration, one can recall the following convergence theorem. `` If , then is a sequence of continuous functions defined on the such that uniformly in

i.e., to take limit inside the integral, one need uniform convergence of functions. In many situations in it is highly unlikely to get uniform convergence. In fact uniform convergence is not required to take limit inside an integral. This is illustrated in the following couple of theorem. The proof of them are beyond the scope of this course.

random variables such that . Then

Let

[Here

means

.]

(i) (ii) (iii) Then has finite mean.

Definition 6.6. (Higher Order Moments) Let moment of and is called the

is called the

th

called the variance. Now we state the following theorem whose proof is beyond the scope of this course.

and

be a continuous

The above theorem is generally referred as the ``Law of unconscious statistician'' since often users treat the

above as a definition itself. Now we define conditional expectation denoted by E[Y|X] of the random variable Y given the information about the random variable X. If Y is a Bernoulli (p) random variable and X any discrete random variable, then we expect E[Y|X = x] to be P{Y = 1|X = x}, since we know that EY = p = P{Y = 1}. i.e.,

Where

liner and any discrete random variable can be written as a liner combination of Bernoulli random variable we get the following definition.

conditional expectation of

. Then

Example 6.0.41

. Calculate Set

Let

For

Now

Therefore

i.e.,

Now

When X and Y are discrete random variable. E[Y|X] is defined using conditional pmf of Y given X. Hence we define E[Y|X] when X and Y are continuous random variable with joint pdf f in a similar way as follows.

expectation of given

. Then conditional

Remark 6.0.10 One can extend the defination of E[Y|X] when X is any random variable (discrete, continuous or mixed) and Y is a any random variable with finite mean. But it is beyound the scope of this course. Theorem 6.0.33 (i)

respectively. Then if Let be discrete random variables with joint pmf has finite mean, then , marginal pmfs and

be continuous random variables with joint pdf has finite mean, then

, marginal pdfs

and

respectively.

Find

. Note that

and

Also

elsewhere. Therefore

- probability-for-finance.pdfUploaded byMuhammad Khiruzzaman
- Math6365-fall11-syllUploaded byRhealyn Inguito
- Probability & Prob. DistributionsUploaded byJinoy P Mathew
- Probability TheoryUploaded byAshish
- BAM-001_Student_Day-12.docUploaded byМарк Артём Лимот Апалла
- 3 - Simulation in Practice and Intro to Probability and StatisticsUploaded bytwiddleap
- Math9 S16 Lec1 BasicsUploaded byHossamSalah
- lecture24 PGFUploaded bysourav kumar ray
- Introduction to Probability by Grinstead and SnellUploaded byBit Bucket
- EC254_Problem_set4.pdfUploaded byChirag Don Johnson
- Kurt Marti (Auth.)-Stochastic Optimization Methods_ Applications in Engineering and Operations Research-Springer-Verlag Berlin Heidelberg (2015)Uploaded byCESARPINEDA
- CTF_2Uploaded byAnkur Agarwal
- EMM5622 Lecture w6aUploaded byTamil Alagan
- Engineering Statistics Study SheetUploaded byRyan
- Book on Probability Introduction From MIITUploaded bysudeeppandey
- Principles and Techniques in Combinatorics - Chen Chuan-Chong, Koh Khee-Meng (WS, 1992)Uploaded byRoberto Garcia Sanchez
- Pertemuan 1 Pengantar ReliabilityUploaded bypurdianta yo
- UG Probability Lect 1 2 SlidesUploaded byRaidenLuke
- taleb-nassim-silent-risk.pdfUploaded bylordwadder
- Tabel AsUploaded byLeila Rodrigues
- Module VII - Probabilistic AnalysisUploaded byomar c
- stat110.pdfUploaded byPrashant Singh
- Basic Unit of InformatioBasic_Unit_of_InformationnUploaded bypleasure masango
- Little Inference BookUploaded byzaghoom
- 19Economics1.pdfUploaded byRokhod Production
- Maths 4 NotesUploaded byeya
- DistributionUploaded byhppynnlu
- Excel Convert Cdf to PDFUploaded byTasha
- Randomized AlgorithmsUploaded byAsafAhmad
- Basic StatisticsUploaded byViraj Kumar

- FPGA-ArchUploaded bykarthik kumar
- Maths Probability Random vectors, Joint distributions lec5/8.pdfUploaded byeeshgarg
- Maths Probability Random Variables lec2/8.pdfUploaded byeeshgarg
- Maths Probability lec1/8.pdfUploaded byeeshgarg
- Maths Probability Characteristic functions lec7/8.pdfUploaded byeeshgarg
- Maths Conditional Probability and Independence lec3/8.pdfUploaded byeeshgarg
- Maths Probability Distributions lec4/8.pdfUploaded byeeshgarg
- Unix Tutorial.pdfUploaded byeeshgarg
- terms related to VLSI.txtUploaded byeeshgarg
- terms related to VLSI.txtUploaded byeeshgarg
- CADENCE Analog & Mixed Signal Labs.pdfUploaded byeeshgarg
- Maths Probability Limit Theorems lec8/8.pdfUploaded byeeshgarg
- FPGA & IT’S ARCHITECTURE.PPTUploaded byeeshgarg
- PROGRAMMABLE MODULES FPGA, ROM.pdfUploaded byeeshgarg
- NIT Jalandhar M Tech Regulations-2012.pdfUploaded byeeshgarg
- RPSC Objection FormUploaded byeeshgarg
- The 8051 Microcontroller and Embedded Systems Second Edition Muhammad Ali Mazidi Janice Gillispie Mazidi Rolin D. McKinlayUploaded byprax_12
- Operational Amplifier 741 as Wein Bridge Oscillator 1Uploaded byDeepak Sharma
- A Memetic Algorithm (Genetic Algorithm) for VLSI Floorplanning.pptxUploaded byeeshgarg
- static timing Analysis in VLSI circuits.docxUploaded byeeshgarg
- Basic Semiconductor PhysicsUploaded byeeshgarg
- List of bank holidays indiaUploaded byeeshgarg
- Cadence SOC EncounterUploaded byeeshgarg
- BEL Placement Sample Paper 5Uploaded byXXX
- Convolution and CorrelationUploaded byeeshgarg
- antenna effectUploaded byeeshgarg
- DMRC Route MapUploaded byraulkun
- smith chartUploaded byeeshgarg

- 271941657 Machine Learning General ConceptsUploaded byPriyaprasad Panda
- M3L11Uploaded byabimana
- pocpUploaded byArmando_84
- Part of Chapter 2_Biophysics an IntroductionUploaded byJamila Rohmah
- nctm 912 standardsUploaded byapi-262390061
- chapter6-exerciesextraUploaded bynikowawa
- Chapter 10 Classroom PptUploaded byscribd31416
- The Effectiveness of Customized PromotionsUploaded byAyçennur Ytgn
- stat_tables.pdfUploaded byArif Faisal
- Maths T Trial STPM Kuching Sarawak 2008 [Edu.joshuatly.com] [C9D36FD8]Uploaded byShin Azwan
- ch3Harrell Ghosh Bowden cap2Uploaded byHanswen Julca Anaya
- newbold_sbe8_tif_ch05.pdfUploaded byak
- charis - airlines_jeconference.pdfUploaded byJoss Jossie
- R for BioinfoUploaded bysharebee
- Peak to Average Power RatioUploaded byabdul.azeez
- Statics TI 89Uploaded bydavser
- MATH11002 PRAC Modules RecoUploaded byYosef Bayu
- L2 Probabilistic ReasoningUploaded bySahil Kothari
- Statistics S1 Revision Papers with AnswersUploaded byKothakonda Praveen Kumar
- Poisson DistributiondafUploaded byTaqriz Sirhan Al-Ibyar
- ALL.pptxUploaded byMangala Semage
- FRM AIM Statements 2014 -GARPUploaded byranjan7380
- Excel-Exposure-Master-Workbook-7-26-2017.xlsxUploaded bySunder Singh Bisht
- S1-16-ET ZC434-L10Uploaded byAnand Bhaskar
- QRG_ME.pdfUploaded byckvirtualize
- KONTRAK STATISTIK BISNISUploaded byhutomo_netco
- MA1014 Probability and Queueing TheoryUploaded byDivanshuSri
- solution Chapter 4 Mandenhall bookUploaded byUzair Khan
- mtechWCUploaded bysaravkiru
- xsfUploaded bydpkkd