1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Proving the completion of a metric space is complete

  1. Jul 26, 2011 #1
    1. The problem statement, all variables and given/known data

    Having a little trouble on number 24 of Chapter 3 in Rudin's Principles of Mathematical Analysis. How do I prove that the completion of a metric space is complete?



    2. Relevant equations

    [itex]X[/itex] is the original metric space, [itex]X^* [/itex] is the completion, or the set of equivalence classes generated by the metric [itex]\bigtriangleup(P,Q) = \lim_{n \to \infty} d(p_n, q_n) [/itex] where [itex]P,Q \in X^* [/itex] and [itex] \{p_n\} \in P[/itex] and [itex]\{q_n\} \in Q. [/itex]


    3. The attempt at a solution

    I guess the thing that's confusing me is thinking about Cauchy sequences of equivalence classes. Every time you compare two new equivalence classes, you compare the limit of two real number sequences I guess. Am I thinking about this correctly?

    My gut instinct is to use Baire's theorem for this. Maybe construct some shrinking neighborhoods and show the infinite intersection is nonempty? If this is a good path to take, I'll have two questions:
    1. How to construct the neighborhoods (maybe let [itex] N_{r_n}p_n[/itex] be the smallest neighborhood containing the previous point, centered at [itex] p_n [/itex])?

    2. How to show these neighborhoods are dense in [itex] X^* [/itex]? How can an equivalence class be a limit or a point of a neighborhood?
     
  2. jcsd
  3. Jul 26, 2011 #2
    Tell me if you think this works:

    Assume [itex]\{P_n\}[/itex] is Cauchy in [itex] X^* .[/itex] Fix [itex] \epsilon > 0 [/itex] and pick [itex] N [/itex] large enough so that [itex] n \ge N [/itex] implies [tex] \bigtriangleup (P_n, P_m) < \epsilon .[/tex] This means that [itex] \lim_{n \to \infty} d(p_n, p_m) < \epsilon [/itex] for [itex] \{p_n\}, \{p_m\}[/itex] in [itex] P_n, P_m [/itex] respectively. Since [itex] \epsilon [/itex] was arbitrary, [itex] \{p_n\}, \{p_m\} [/itex] are equivalent, meaning they're in the same equivalence class. Name this class [itex] P. [/itex] Clearly [tex] \bigtriangleup (P_n, P) = 0 [/tex] since for any [itex] \{p_j\} \in P, \lim d(p_n, p_j) = 0 [/itex] (by 24(b)). So, Cauchy sequences of equivalence classes converge to some specific equivalence class.

    Note: in 24(b) we showed that it if you substitute in different sequences from the same equivalence class, [itex] \bigtriangleup [/itex] stays the same.
     
  4. Jul 29, 2011 #3
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Proving the completion of a metric space is complete
  1. Complete metric space (Replies: 5)

  2. COMPLETE metric space (Replies: 28)

Loading...