Continuity of Metric Spaces: Does the Distance Between Points Remain Consistent?

  • Thread starter Thread starter MaxManus
  • Start date Start date
  • Tags Tags
    Continuous Metric
Click For Summary

Homework Help Overview

The discussion revolves around a problem in metric spaces, specifically focusing on the convergence of a sequence in relation to distance metrics. The original poster attempts to demonstrate that the distance between a point and a converging sequence approaches the distance between that point and the limit of the sequence.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants explore the use of the triangle inequality and the properties of absolute values in their reasoning. Questions arise regarding the correct application of these concepts to establish the desired inequalities.

Discussion Status

There is ongoing exploration of the necessary inequalities to prove the convergence of distances. Some participants provide guidance on the steps needed to show the required relationships, while others question the validity of certain approaches and examples.

Contextual Notes

Participants discuss the implications of absolute value inequalities and provide counterexamples to clarify misunderstandings. The conversation reflects a mix of attempts to solidify understanding and check assumptions about the properties of metric spaces.

MaxManus
Messages
268
Reaction score
1

Homework Statement



Let (X,d) be a metric space and let [tex]{x_n}[/tex] be a sequence in X converging to a. Show that d(b,[tex]x_n[/tex]) ->d(b,a)

Homework Equations





The Attempt at a Solution



For every eps > 0 there is an N such that d(x_n,a) < eps for all n>= N

But where do I go from here? triangel inequality?

[tex]d(b,a) <= d(b,x_N) + d(x_N, a) <= d(b,x_N) + \epsilon[/tex]
 
Last edited:
Physics news on Phys.org


Yes, the triangle inequality should be a good next step. But keep in mind what you need to show: you need to prove that

[tex]|d(b,x_n)-d(b,a)|\leq \varepsilon[/tex]

for sufficiently large n.
 


Thanks, is this correct?

[tex]|d(b,x_n),a) - d(b,a)| <= |d(b,a) + d(a,x_n) -d(b,a) | = |d(a,x_n)| <= \epsilon[/tex]

for n >= N
 


MaxManus said:
Thanks, is this correct?

[tex]|d(b,x_n),a) - d(b,a)| <= |d(b,a) + d(a,x_n) -d(b,a) | = |d(a,x_n)| <= \epsilon[/tex]

for n >= N

No, you can't work with inequalities in absolute values. Here's a counterexample:
Let d(b,xn)=0, d(b,a)=100, d(a,xn)=2, then

[tex]|d(b,x_n)-d(b,a)|=|-100|=100[/tex]

and

[tex]|d(a,x_n)|=2[/tex]

and it is certainly not true that 100<2...
 


Thanks again
What about:
[tex]d(b,x_n),a) - d(b,a) <= d(b,a) + d(a,x_n) -d(b,a) = d(a,x_n) <= \epsilon[/tex]

so:[tex]|d(b,x_n)-d(b,a)|\leq \varepsilon[/tex]
 


That's already good, but it's not enough. In fact, proving that

[tex]|d(b,x_n)-d(b,a)|<\varepsilon[/tex]

is equivalent to showing that

[tex]-\varepsilon<d(b,x_n)-d(b,a)<\varepsilon[/tex]

You've already shown the last inequality. But you still need to show that

[tex]-\varepsilon<d(b,x_n)-d(b,a)[/tex]
 


Thanks
Think I got it
Have to show that
[tex]\epsilon > d(b,a) - d(b,x_n)[/tex]
[tex]d(b,a)- d(b,x_n) < d(a,x_n) + d(x_n,b) - d(b,x_n) = \epsilon[/tex]
 


Yes, that should be correct! Congratulations!
 


Great
Thanks again for all the help
 
Last edited:

Similar threads

  • · Replies 15 ·
Replies
15
Views
3K
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K