How can the transitivity of the sup metric on bounded sequences be proven?

  • Thread starter Thread starter bobby2k
  • Start date Start date
  • Tags Tags
    Metric
bobby2k
Messages
126
Reaction score
2

Homework Statement


A sequence \{x_{n}\} of real numbers is called bounded if there is a number M such that |x_{n}| ≤M for all n. Let X be the set of all bounded sequences, show that
d(\{x_{n}\},\{y_{n}\})=sup \{|x_{n}-y_{n}| :n \in N \} is a metric on X.The only part I am struggling with is the transivity part. As I see it, I have to show that:

sup \{|x_{n}-y_{n}| :n \in N \}≤sup \{|x_{n}-z_{n}| :n \in N \}+sup \{|z_{n}-y_{n}| :n \in N \}Do you guys have any tips on how to show this? The problem is that I can not be sure that I have an n where I get the sup value, and even if I did, this n might be different for the three parts.
 
Last edited:
Physics news on Phys.org
bobby2k said:

Homework Statement


A sequence \{x_{n}\} of real numbers is called bounded if there is a number M such that |x_{n}| ≤M for all n. Let X be the set of all bounded sequences, show that
d(\{x_{n}\},\{y_{n}\})=sup \{|x_{n}-y_{n}| :n \in N \} is a metric on X.


The only part I am struggling with is the transivity part. As I see it, I have to show that:

sup \{|x_{n}-y_{n}| :n \in N \}≤sup \{|x_{n}-z_{n}| :n \in N \}+sup \{|z_{n}-y_{n}| :n \in N \}


Do you guys have any tips on how to show this? The problem is that I can not be sure that I have an n where I get the sup value, and even if I did, this n might be different for the three parts.

Start with ##|x_n-y_n|\le |x_n-z_n|+|z_n-y_n|## and take the sup of both sides. Then compare what that gives with the right side of your expression.
 
LCKurtz said:
Start with ##|x_n-y_n|\le |x_n-z_n|+|z_n-y_n|## and take the sup of both sides. Then compare what that gives with the right side of your expression.

It became a little messy, can I simplify?

##
|x_{n}-y_{n}|≤ |x_{n}-z_{n}|+|z_{n}-y_{n}| \forall n ## (1)
##
|x_{n}-z_{n}| ≤ sup\{|x_{n}-z_{n}| : n \in N \} \forall n ## (2)
##|z_{n}-y_{n}| ≤ sup\{|z_{n}-y_{n}| : n \in N \} \forall n ## (3)So if I put 2 and 3 in 1 I get:
##|x_{n}-y_{n}|≤ sup\{|x_{n}-z_{n}| : n \in N \} + sup\{|z_{n}-y_{n}| : n \in N \} \forall n ## (4)

Hence ##sup\{|x_{n}-z_{n}| : n \in N \} + sup\{|z_{n}-y_{n}| : n \in N \} ## is an upper bound for ##\{|x_{n}-y_{n}| :n\in N\}##. So it must also be bigger than the least upper bound for this set. Hence:
##sup\{|x_{n}-y_{n}| : n \in N \} ≤ sup\{|x_{n}-z_{n}| : n \in N \} +sup\{|z_{n}-y_{n}| : n \in N \} ##

Is this the simplest way do it, or is it a simpler way?
 
Last edited:
bobby2k said:
It became a little messy, can I simplify?

##
|x_{n}-y_{n}|≤ |x_{n}-z_{n}|+|z_{n}-y_{n}| \forall n ## (1)
##
|x_{n}-z_{n}| ≤ sup\{|x_{n}-z_{n}| : n \in N \} \forall n ## (2)
##|z_{n}-y_{n}| ≤ sup\{|z_{n}-y_{n}| : n \in N \} \forall n ## (3)


So if I put 2 and 3 in 1 I get:
##|x_{n}-y_{n}|≤ sup\{|x_{n}-z_{n}| : n \in N \} + sup\{|z_{n}-y_{n}| : n \in N \} \forall n ## (4)

Hence ##sup\{|x_{n}-z_{n}| : n \in N \} + sup\{|z_{n}-y_{n}| : n \in N \} ## is an upper bound for ##\{|x_{n}-y_{n}| :n\in N\}##. So it must also be bigger than the least upper bound for this set. Hence:
##sup\{|x_{n}-y_{n}| : n \in N \} ≤ sup\{|x_{n}-z_{n}| : n \in N \} +sup\{|z_{n}-y_{n}| : n \in N \} ##

Is this the simplest way do it, or is it a simpler way?

There may be slightly nicer ways to write it up but I see nothing wrong with your argument.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top