ACM 217 Handout: Completeness of Lp the Following

ACM 217 Handout: Completeness of Lp the Following

ACM 217 Handout: Completeness of Lp The following statements should have been part of section 1.5 in the lecture notes; unfortunately, I forgot to include them. p Definition 1. A sequence {Xn} of random variables in L , p ≥ 1 is called a Cauchy p sequence (in L ) if supm,n≥N kXm − Xnkp → 0 as N → ∞. p p Proposition 2 (Completeness of L ). Let Xn be a Cauchy sequence in L . Then there p p exists a random variable X∞ ∈ L such that Xn → X∞ in L . When is such a result useful? All our previous convergence theorems, such as the dominated convergence theorem etc., assume that we already know that our sequence converges to a particular random variable Xn → X in some sense; they tell us how to convert between the various modes of convergence. However, we are often just given a sequence Xn, and we still need to establish that Xn converges to something. Proving that Xn is a Cauchy sequence is one way to show that the sequence converges, without knowing in advance what it converges to. We will encounter another way to show that a sequence converges in the next chapter (the martingale convergence theorem). Remark 3. As you know from your calculus course, Rn also has the property that any Cauchy sequence converges: if supm,n≥N |xm − xn| → 0 as N → ∞ for some n n sequence {xn} ⊂ R , then there is some x∞ ∈ R such that xn → x∞. In fact, many (but not all) metric spaces have this property, so it is not shocking that it is true also for Lp. A metric space in which every Cauchy sequence converges is called complete. Proof of proposition 2. We need to do two things: first, we need to identify a candidate X∞. p Once we have constructed such an X∞, we need to show that Xn → X∞ in L . −N Let M(N) % ∞ be a subsequence such that supm,n≥M(N) kXn −Xmkp ≤ 2 for all N. As −N k·k1 ≤ k·kp (recall that we assume p ≥ 1), this implies supm,n≥M(N) E(|Xn −Xm|) ≤ 2 , −N and in particular E(|XM(N+1) − XM(N)|) ≤ 2 . Hence ∞ ! ∞ X X E |XM(n+1) − XM(n)| = E |XM(n+1) − XM(n)| < ∞, n=1 n=1 where we have used the monotone convergence theorem to exchange the summation and the Pn expectation. But then the series XM(n) = XM(1) + k=2(XM(k) −XM(k−1)) is a.s. absolutely convergent, so XM(n) converges a.s. to some random variable X∞. Moreover, p p p −kp (|XM(k) − X∞| ) = lim inf |XM(k) − Xn| ≤ lim inf (|XM(k) − Xn| ) ≤ 2 E E n→∞ n→∞ E p p using Fatou’s lemma, so we conclude that XM(k) → X∞ in L , and in particular X∞ ∈ L p p p itself (the latter follows as evidently XM(k) − X∞ ∈ L , XM(k) ∈ L by assumption, and L p is linear, so X∞ = XM(k) − (XM(k) − X∞) ∈ L ). p It remains to show that Xn → X∞ in L (i.e., not necessarily for the subsequence M(n)). To this end, note that kXn − X∞kp ≤ kXn − XM(n)kp + kXM(n) − X∞kp; that the second term converges to zero we have already seen, while that the first term converges to zero follows directly from the fact that Xn is a Cauchy sequence. Thus we are done..

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    1 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us