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
Click For Summary

Homework Help Overview

The discussion revolves around proving the transitivity of the sup metric on bounded sequences, specifically focusing on the metric defined as d({x_n},{y_n}) = sup{|x_n - y_n| : n ∈ N}. Participants are examining the necessary inequalities to establish this property.

Discussion Character

  • Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to show that sup{|x_n - y_n| : n ∈ N} ≤ sup{|x_n - z_n| : n ∈ N} + sup{|z_n - y_n| : n ∈ N}. They express uncertainty about the existence of an n that achieves the supremum for each part.
  • Some participants suggest starting with the triangle inequality |x_n - y_n| ≤ |x_n - z_n| + |z_n - y_n| and taking the supremum of both sides to compare with the right side of the expression.
  • Others question whether there is a simpler way to present the argument, while acknowledging the validity of the reasoning provided.

Discussion Status

The discussion is actively exploring the proof of transitivity, with participants providing insights and suggestions on how to approach the problem. There is recognition of the complexity involved, and while some participants seek simplification, no consensus on a definitive method has been reached.

Contextual Notes

Participants are working within the constraints of a homework assignment, which may limit the information they can share or the methods they can employ. The discussion reflects a focus on understanding the properties of metrics in the context of bounded sequences.

bobby2k
Messages
126
Reaction score
2

Homework Statement


A sequence [itex]\{x_{n}\}[/itex] of real numbers is called bounded if there is a number M such that |[itex]x_{n}[/itex]| ≤M for all n. Let X be the set of all bounded sequences, show that
[itex]d(\{x_{n}\},\{y_{n}\})=sup \{|x_{n}-y_{n}| :n \in N \}[/itex] 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:

[itex]sup \{|x_{n}-y_{n}| :n \in N \}≤sup \{|x_{n}-z_{n}| :n \in N \}+sup \{|z_{n}-y_{n}| :n \in N \}[/itex]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 [itex]\{x_{n}\}[/itex] of real numbers is called bounded if there is a number M such that |[itex]x_{n}[/itex]| ≤M for all n. Let X be the set of all bounded sequences, show that
[itex]d(\{x_{n}\},\{y_{n}\})=sup \{|x_{n}-y_{n}| :n \in N \}[/itex] 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:

[itex]sup \{|x_{n}-y_{n}| :n \in N \}≤sup \{|x_{n}-z_{n}| :n \in N \}+sup \{|z_{n}-y_{n}| :n \in N \}[/itex]


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.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
Replies
7
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
8
Views
3K
Replies
11
Views
2K