Uniform continuous function and distance between sets

Click For Summary
The discussion revolves around proving that if a uniform continuous function f maps two non-empty sets A and B in a metric space such that the distance between A and B is zero (d(A,B)=0), then the distance between their images under f is also zero (d'(f(A),f(B))=0). Participants suggest starting with the definitions of uniform continuity and the distance between sets. They explore the implications of assuming d'(f(A),f(B)) is greater than zero, leading to a contradiction that f cannot be uniformly continuous. Ultimately, the proof hinges on demonstrating that for any ε > 0, there exist points in A and B such that the distance between their images under f is less than ε, confirming that the distance between the images is indeed zero. The conversation emphasizes the importance of formal definitions and logical progression in mathematical proofs.
mahler1
Messages
217
Reaction score
0
Homework Statement .

Let ##f: (X,d) → (Y,d')## a uniform continuous function, and let ##A, B \subseteq X## non-empty sets such that ##d(A,B)=0##. Prove that ##d'(f(A),f(B))=0##

I've been thinking this exercise but I don't have any idea where to or how to start, could someone give me a hint?
 
Physics news on Phys.org
Maybe start by stating the definition of a uniformly continuous function, and the definition of the distance between two sets.
 
  • Like
Likes 1 person
mahler1 said:
Homework Statement .

Let ##f: (X,d) → (Y,d')## a uniform continuous function, and let ##A, B \subseteq X## non-empty sets such that ##d(A,B)=0##. Prove that ##d'(f(A),f(B))=0##

I've been thinking this exercise but I don't have any idea where to or how to start, could someone give me a hint?

You need to show that for all \epsilon > 0 there exist x \in A and y \in B such that d'(f(x),f(y)) < \epsilon.
 
  • Like
Likes 1 person
Ok, I see it. I want to prove that if ##d'(f(A),f(B))≠0## but ##d(A,B)=0## then f is not uniformly continuous.

Assume ##d'(f(A),f(B))≠0## and ##d(A,B)=0##. By hypothesis, ##d(A,B)=0##, which means that ##\forall## ##δ>0##, ##\exists## x, y in A and B respectively : ##d(x,y)<δ##. But the distance between the two images of the sets A and B is not 0, so ##\exists## ##ε>0## such that ##\forall## ##x \in A## and ##\forall## ##y \in B##, ##d'(f(x),f(y))≥ε##. It follows that f is not uniformly continuous.
 
mahler1 said:
Ok, I see it. I want to prove that if ##d'(f(A),f(B))≠0## but ##d(A,B)=0## then f is not uniformly continuous.

Are you sure you want to prove that? I think it's equivalent to the proposition you are asked to prove, but it's not obviously so.

By hypothesis, ##d(A,B)=0##, which means that ##\forall## ##δ>0##, ##\exists## x, y in A and B respectively : ##d(x,y)<δ##.

This is correct.

But the distance between the two images of the sets A and B is not 0, so ##\exists## ##ε>0## such that ##\forall## ##x \in A## and ##\forall## ##y \in B##, ##d'(f(x),f(y))≥ε##.

This is true.

It follows that f is not uniformly continuous.

You have so far that

"There exists \epsilon &gt; 0 such that for all \delta &gt; 0 there exist x \in A \subset X and y \in B \subset X such that d(x,y) &lt; \delta and d&#039;(f(x),f(y)) \geq \epsilon."

That is indeed the negation of the definition of uniform continuity, so you have shown that if d(A,B) = 0 and d&#039;(f(A),f(B)) &gt; 0 then f is not uniformly continuous.

But it's an excessively convoluted and not at all obvious proof of the result you were asked to prove.

There is an easier way. These exercises usually solve themselves if you just write down the formal definitions of the concepts involved and string them together in the right order. The trick is to find the right order.

First let's think about what we want to prove. From the definition of d&#039;(f(A),f(B)) we see that want to prove that the greatest lower bound of \{d&#039;(f(x),f(y)) : x \in A, y \in B\} is zero.

Now zero is trivially a lower bound, because metrics are by definition non-negative. So all we really need to show is that there is no greater lower bound. In other words, we must show that for all \epsilon &gt; 0 there exist x \in A and y \in B such that d&#039;(f(x),f(y)) &lt; \epsilon, so that \epsilon is not a lower bound.

That statement includes the formula "d&#039;(f(x),f(y)) &lt; \epsilon", which suggests that the definition of uniform continuity is a good place to start.
 
As you said, 0 is always a lower bound by definition of distance. So suppose 0 is not the inf {##d'(f(x),f(y))##, with ##f(x) \in A## and ##f(y) \in B##}. Then there is ##β>0## such that ##β≤d(f(x),f(y))## ##\forall## ##f(x) \in f(A)##, ##f(y) \in f(B)##. The function is uniformly continuous, which means that ##\forall## ##ε>0## there is some ##δ_ε## : ##d(x,y)<δ_ε## ##→## ##d'(f(x),f(y))<ε##. Let ##ε=β##, we know that ##dist(A,B)=0##, in particular, for ##δ_β##, ##d(x,y)<δ_β## ##\forall## ##x \in A, y \in B##. But then, ##β≤d'(f(x),f(y))<β## ##\forall## ##f(x) \in f(A), f(y) \in f(B)##, which is absurd. The absurd comes from the assumption that 0 wasn't the greatest lower bound. It follows that 0 is inf{##d'(f(x),f(y))##, with ##f(x) \in A## and ##f(y) \in B##}, and by definition, this is the distance between the sets ##f(A)## and ##f(B)##.

Is this ok? Thanks for your help!
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 40 ·
2
Replies
40
Views
4K
Replies
26
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
1
Views
1K