week 51 theorem for g: r r if x is a discrete random variable then if x is a continuous random...

20
week 5 1 Theorem For g: R R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let Y = g(X) then x X x p x g X g E dx x f x g X g E X

Upload: louise-johns

Post on 22-Dec-2015

213 views

Category:

Documents


1 download

TRANSCRIPT

Page 1: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 1

Theorem

For g: R R

• If X is a discrete random variable then

• If X is a continuous random variable

• Proof:

We proof it for the discrete case. Let Y = g(X) then

x

X xpxgXgE

dxxfxgXgE X

Page 2: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 2

Example to illustrate steps in proof

• Suppose i.e. and the possible values of X are

so the possible values of Y are then,3,2,1: X

2XY 2xxg

9,4,1:Y

Page 3: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 3

Examples

1. Suppose X ~ Uniform(0, 1). Let then,

2. Suppose X ~ Poisson(λ). Let , then

2XY

XeY

Page 4: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 4

Properties of Expectation

For X, Y random variables and constants,

• E(aX + b) = aE(X) + b

Proof: Continuous case

• E(aX + bY) = aE(X) + bE(Y)

Proof to come…

• If X is a non-negative random variable, then E(X) = 0 if and only if X = 0 with probability 1.

• If X is a non-negative random variable, then E(X) ≥ 0

• E(a) = a

Rba ,

Page 5: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 5

Moments • The kth moment of a distribution is E(Xk). We are usually interested in 1st

and 2nd moments (sometimes in 3rd and 4th)

• Some second moments:

1. Suppose X ~ Uniform(0, 1), then

2. Suppose X ~ Geometric(p), then

3

12 XE

1

122

x

xpqxXE

Page 6: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 6

Variance• The expected value of a random variable E(X) is a measure of the “center”

of a distribution.

• The variance is a measure of how closely concentrated to center (µ) the probability is. It is also called 2nd central moment.

• Definition The variance of a random variable X is

• Claim: Proof:

• We can use the above formula for convenience of calculation.

• The standard deviation of a random variable X is denoted by σX ; it is the square root of the variance i.e. .

22 XEXEXEXVar

2222 XEXEXEXVar

XVarX

Page 7: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 7

Properties of Variance

For X, Y random variables and are constants, then

• Var(aX + b) = a2Var(X)

Proof:

• Var(aX + bY) = a2Var(X) + b2Var(Y) + 2abE[(X – E(X ))(Y – E(Y ))]

Proof:

• Var(X) ≥ 0

• Var(X) = 0 if and only if X = E(X) with probability 1

• Var(a) = 0

Page 8: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 8

Examples

1. Suppose X ~ Uniform(0, 1), then and therefore

2. Suppose X ~ Geometric(p), then and therefore

3. Suppose X ~ Bernoulli(p), then and

therefore,

2

1XE

3

12 XE

12

1

2

1

3

12

XVar

p

XE1

2

2 1

p

qXE

2222

111

p

p

p

q

pp

qXVar

pXE pqpXE 222 01

ppppXVar 12

Page 9: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 9

Example

• Suppose X ~ Uniform(2, 4). Let . Find .

• What if X ~ Uniform(-4, 4)?

2XY 9YP

Page 10: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 10

Functions of Random variables

• In some case we would like to find the distribution of Y = h(X) when the distribution of X is known.

• Discrete case

• Examples

1. Let Y = aX + b , a ≠ 0

2. Let

yhx

Y xXPyhXPyXhPyYPyp1

1

by

aXPybaXPyYP

1

2XY

00

00

02

yif

yifXP

yifyXPyXP

yXPyYP

Page 11: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 11

Continuous case – Examples

1. Suppose X ~ Uniform(0, 1). Let , then the cdf of Y can be found as follows

The density of Y is then given by

2. Let X have the exponential distribution with parameter λ. Find the density for

3. Suppose X is a random variable with density

Check if this is a valid density and find the density of .

2XY

1

1

XY

elsewhere

xx

xf X

,0

11,2

1

yFyXPyXPyYPyF XY 2

2XY

Page 12: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 12

Question

• Can we formulate a general rule for densities so that we don’t have to look at cdf?

• Answer: sometimes …

Suppose Y = h(X) then

and

but need h to be monotone on region where density for X is non-zero.

yhXPyXhPyFY1

yhFdy

dxf XX

1

Page 13: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 13

• Check with previous examples:

1. X ~ Uniform(0, 1) and

2. X ~ Exponential(λ). Let

3. X is a random variable with density

and 2XY

2XY

XhX

Y

1

1

elsewhere

xx

xf X

,0

11,2

1

Page 14: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 14

Theorem

• If X is a continuous random variable with density fX(x) and h is strictly increasing and differentiable function form R R then Y = h(X) has density

for .

• Proof:

yhdy

dyhfyf XY

11 Ry

Page 15: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 15

Theorem • If X is a continuous random variable with density fX(x) and h is strictly

decreasing and differentiable function form R R then Y = h(X) has density

for .

• Proof:

yhdy

dyhfyf XY

11 Ry

Page 16: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 16

Summary

• If Y = h(X) and h is monotone then

• Example

X has a density

Let . Compute the density of Y.

yhdy

dyhfyf XY

11

otherwise

xforx

xf X

0

204

3

6XY

Page 17: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 17

Indicator Functions and Random Variables

• Indicator function – definition

Let A be a set of real numbers. The indicator function for A is defined by

• Some properties of indicator functions:

• The support of a discrete random variable X is the set of values of x for which P(X = x) > 0.

• The support of a continuous random variable X with density fX(x) is the set of values of x for which fX(x) > 0.

Axif

AxifAxIxI A 0

1

xIxIxI ABBA

Axfor

AxforxgxIxg A 0

Page 18: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 18

Examples

• A discrete random variable with pmf

can be written as

• A continuous random variable with density function

can be written as

otherwise

xx

xpX

0

3,2,16

xIx

xIx

xpX 3,2,163,2,1

6

otherwise

xexf

x

X0

0

xIexf xX

,0

Page 19: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 19

Important Indicator random variable

• If A is an event then IA is a random variable which is 0 if A does not occur and 1 if it does. IA is an indicator random variable. IA is also called a Bernoulli random variable.

• If we perform a random experiment repeatedly and each time measure the random variable IA, we could get 1, 1, 0, 0, 0, 0, 1, 0, …The average of this list in the long run is E(IA); it gives the proportion with which A occurs. In the long run it is P(A), i.e.

P(A) = E(IA)

• Example: for a Bernoulli random variable X we have pAPAPAPIEXE A 01

Page 20: Week 51 Theorem For g: R  R If X is a discrete random variable then If X is a continuous random variable Proof: We proof it for the discrete case. Let

week 5 20

Use of Indicator random variable

• Suppose X ~ Binomial(n, p). Let Y1,…, Yn be Bernoulli random variables with probability of success p. Then X can be thought of as , then

• Similar trick for Negative Binomial:Suppose X ~ Negative Binomial(r, p). Let X1 be the number of trials until the 1st successX2 be the number of trails between 1st and 2nd success.:Xr be the number of trails between (r - 1)th and rth successThen and we have

n

iiYX

1

n

i

n

ii

n

ii nppYEYEXE

1 11

r

iiXX

1

r

i

r

ii

r

ii p

r

pXEXEXE

1 11

1