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

Suppose that X and Y are both Bernoulli random variables. Show that X and Y are independent if and only if Cov(X, Y) = 0.

Short Answer

Expert verified

It is clear from the calculation that the X and Y are independent Variables.

Step by step solution

01

Given information

X and Y are both Bernoulli random variables.

02

Solution

First we need to calculate the Cov(X,Y)=E(XY)E(X)E(Y)

Suppose X and Y are independent

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

={0×0×P(X=0,Y=0)}+{1×1×P(X=1,Y=1)}

[{0×P(X=0)}+{1×P(X=1)}][{0×P(Y=0)}+{1×P(Y=1)}]

=P(X=1,Y=1)P(X=0)P(Y=1)

=P(X=0)P(Y=1)P(X=0)P(Y=1)

=0

Therefore X and Y are independent

03

Solution 

Now let as consider,

Cov(X,Y)=0

E(XY)=E(X)E(Y)

P(X=1,Y=1)=P(X=0)P(Y=1)

So, X and Y are independent.

04

Final answer

It is clear that the X and Y are independent Variables.

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

There are two misshapen coins in a box; their probabilities for landing on heads when they are flipped are, respectively, .4and .7. One of the coins is to be randomly chosen and flipped 10 times. Given that two of the first three flips landed on heads, what is the conditional expected number of heads in the 10 flips?

The best quadratic predictor ofYwith respect to Xis a + bX+cX2, where a, b, and c are chosen to minimize E[(Y(a+bX+cX2))2]. Determine a, b, and c.

Let X be the length of the initial run in a random ordering of n ones and m zeros. That is, if the first k values are the same (either all ones or all zeros), then X Ú k. Find E[X].

A die is rolled twice. Let X equal the sum of the outcomes, and let Y equal the first outcome minus the second.

ComputeCov(X,Y).

Two envelopes, each containing a check, are placed in front of you. You are to choose one of the envelopes, open it, and see the amount of the check. At this point, either you can accept that amount or you can exchange it for the check in the unopened envelope. What should you do? Is it possible to devise a strategy that does better than just accepting the first envelope? Let Aand B, A<B, denote the (unknown) amounts of the checks and note that the strategy that randomly selects an envelope and always accepts its check has an expected return of (A+B)/2. Consider the following strategy: Let F(·)be any strictly increasing (that is, continuous) distribution function. Choose an envelope randomly and open it. If the discovered check has the value x, then accept it with probability F(x)and exchange it with probability 1F(x).

(a) Show that if you employ the latter strategy, then your expected return is greater than (A+B)/2. Hint: Condition on whether the first envelope has the value Aor B. Now consider the strategy that fixes a value x and then accepts the first check if its value is greater than x and exchanges it otherwise. (b) Show that for any x, the expected return under thex-strategy is always at least (A+B)/2and that it is strictly larger than (A+B)/2if xlies between Aand B.

(c) Let X be a continuous random variable on the whole line, and consider the following strategy: Generate the value ofX, and if X=x, then employ the x-strategy of part (b). Show that the expected return under this strategy is greater than (A+B)/2.

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