Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Prove that if E[YX=x]=E[Y]for all x, then Xand Yare uncorrelated; give a counterexample to show that the converse is not true.

Hint: Prove and use the fact that E[XY]=E[XE[YX]].

Short Answer

Expert verified

We prove that,E[YX=x]=E[Y]for allx

Step by step solution

01

Given information

Given in the question that, we have to prove thatE[YX=x]=E[Y]for allx

02

Explanation

Let's find the covariance between Xand Y. We have that

Cov(X,Y)=E(XY)E(X)E(Y)

Since we have that E(YX=x)=E(Y)for all xes, we have that

E(YX)=E(Y)

Which implies

Hence

Cov(X,Y)=0

03

Disapprove the converse

Now, let's disapprove the converse. Consider random variable X~N(0,1)and define Y=X2. We have that

Cov(X,Y)=CovX,X2=EX3E(X)EX2

Observe that X3is symmetric around zero, so EX3=0. Finally, we see that Cov(X,Y)=0. But, we have that

E(YX)=EX2X=X2

which is not obviously equal to constant E(Y)=EX2.

04

Final answer

We prove that, E[YX=x]=E[Y]for all x

And from the above example we prove thatE(Y)=EX2

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

A coin having probability p of landing on heads is flipped n times. Compute the expected number of runs of heads of size 1 , of size 2 , and of size k,1kn.

A deck of n cards numbered 1 through n is thoroughly shuffled so that all possible n! orderings can be assumed to be equally likely. Suppose you are to make n guesses sequentially, where the ith one is a guess of the card in position i. Let N denote the number of correct guesses.

(a) If you are not given any information about your earlier guesses, show that for any strategy, E[N]=1.

(b) Suppose that after each guess you are shown the card that was in the position in question. What do you think is the best strategy? Show that under this strategy

E[N]=1n+1n1++11n1xdx=logn

(c) Supposethatyouaretoldaftereachguesswhetheryou are right or wrong. In this case, it can be shown that the strategy that maximizes E[N] is one that keeps on guessing the same card until you are told you are correct and then changes to a new card. For this strategy, show that

E[N]=1+12!+13!++1n!e1

Hint: For all parts, express N as the sum of indicator (that is, Bernoulli) random variables.

LetX have moment generating function M(t), and defineΨ(t)=logM(t). Show thatΨ''(t)t=0=Var(X).

A group of 20 people consisting of 10 men and 10 women is randomly arranged into 10 pairs of 2 each. Compute the expectation and variance of the number of pairs that consist of a man and a woman. Now suppose the 20 people consist of 10 married couples. Compute the mean and variance of the number of married couples that are paired together.

An urn contains 30balls, of which10are red and 8 are blue. From this urn, 12 balls are randomly withdrawn. Let X denote the number of red and Y the number of blue balls that are withdrawn. Find Cov(X, Y)

(a) by defining appropriate indicator (that is, Bernoulli) random variables

Xi,Yjsuch that X=i=110Xi,Y=j=18Yj

(b) by conditioning (on either X or Y) to determineE[XY]

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free