Question
Let $X_{0}=0$ and for $j \geq 0$ let $X_{j+1}$ be chosen uniformly over the real interval $\left[X_{j}, 1\right]$. Show that, for $k \geq 0$, the sequence$$Y_{k}=2^{k}\left(1-X_{k}\right)$$is a martingale.
Step 1
A sequence of random variables \( Y_k \) is a martingale with respect to a filtration \( \mathcal{F}_k \) if for all \( k \geq 0 \), the following conditions hold: Show more…
Show all steps
Your feedback will help us improve your experience
Manik Pulyani and 65 other educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let $X_{1}, \ldots, X_{n}$ be a random sample from a uniform $(a, b)$ distribution. Let $Y_{1}=\min X_{i}$ and let $Y_{2}=\max X_{i} .$ Show that $\left(Y_{1}, Y_{2}\right)^{\prime}$ converges in probability to the vector $(a, b)^{\prime}$.
Consistency and Limiting Distributions
Extensions to Multivariate Distributions
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD