Chapter 3: Problem 35
If \(E[X \mid Y=y]=c\) for all \(y\), show that \(\operatorname{Cov}(X, Y)=0\).
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 3: Problem 35
If \(E[X \mid Y=y]=c\) for all \(y\), show that \(\operatorname{Cov}(X, Y)=0\).
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
There are three coins in a barrel. These coins, when flipped, will come up heads with respective probabilities \(0.3,0.5,0.7\). A coin is randomly selected from among these three and is then flipped ten times. Let \(N\) be the number of heads obtained on the ten flips. Find (a) \(P(N=0\\}\). (b) \(P\\{N=n\\}, n=0,1, \ldots, 10\) (c) Does \(N\) have a binomial distribution? (d) If you win \(\$ 1\) each time a head appears and you lose \(\$ 1\) each time a tail appears, is this a fair game? Explain.
Let \(X_{1}\) and \(X_{2}\) be independent geometric random variables having the saime parameter \(p\). Guess the value of $$P\left\\{X_{1}=i \mid X_{1}+X_{2}=n\right]$$ Hint: Suppose a coin having probability \(p\) of coming up heads is continually flipped. If the second head occurs on flip number \(n\), what is the conditional probability that the first head was on flip number \(i, i=1, \ldots, n-1 ?\) Verify your guess analytically.
A set of \(n\) dice is thrown. All those that land on six are put aside, and the others are again thrown. This is repeated until all the dice have landed on six. Let \(N\) denote the number of throws needed. (For instance, suppose that \(n=3\) and that on the initial throw exactly two of the dice land on six. Then the other die will be thrown, and if it lands on six, then \(N=2\).) Let \(m_{n}=E[N]\). (a) Derive a recursive formula for \(m_{n}\) and use it to calculate \(m_{i}, i=2,3,4\) and to show that \(m_{5} \approx 13.024\). (b) Let \(X_{i}\) denote the number of dice rolled on the \(i\) th throw. Find \(E\left[\sum_{i=1}^{N} X_{i}\right]\).
Show in the discrete case that if \(X\) and \(Y\) are independent, then $$ E[X \mid Y=y]=E[X] \quad \text { for all } y $$
Let \(X_{l}, i \geqslant 0\) be independent and identically distributed random variables with probability mass function $$p(j)=P\left[X_{i}=j\right\\}, \quad j=1, \ldots, m \quad \sum_{j=1}^{m} P(j)=1$$ Find \(E[N]\), where \(N=\min \left[n>0: X_{n}=X_{0}\right\\}\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.