Extending a uniformly continuous function

Click For Summary
SUMMARY

The discussion centers on extending a uniformly continuous function f: A → Y to a function g: Cl(A) → Y, where (X, dx) and (Y, dy) are metric spaces and Y is complete. The participants utilize Theorem 30.1 from Munkres to establish that if x is in Cl(A), a sequence (xn) in A converging to x leads to the definition g(x) = lim f(xn). They confirm that g is well-defined, g(x) = f(x) for x in A, and that g is uniformly continuous, leveraging the properties of uniform continuity and completeness of Y.

PREREQUISITES
  • Understanding of metric spaces and their properties
  • Familiarity with uniformly continuous functions
  • Knowledge of Cauchy sequences and their convergence
  • Experience with Theorem 30.1 from Munkres
NEXT STEPS
  • Study the implications of uniform continuity in metric spaces
  • Explore the applications of Theorem 30.1 in various contexts
  • Learn about the properties of complete metric spaces
  • Investigate the relationship between Cauchy sequences and uniform continuity
USEFUL FOR

Mathematicians, particularly those studying analysis, metric spaces, and functional analysis, will benefit from this discussion, as it provides insights into extending functions and understanding uniform continuity.

  • #31
So, g is uniform continuous if

\forall \epsilon >0: \exists \delta: \forall x,y: d(x,y)<\delta~\Rightarrow d(f(x),f(y))<\epsilon

So, g is not uniform continuous if there exists an \epsilon >0 such that

\forall \delta: \exists x,y: d(x,y)<\delta~\text{and}~d(f(x),f(y))\geq \epsilon

Now, take \delta=1/n, then

\exists x_n,y_n: d(x_n,y_n)<1/n~\text{and}~d(f(x),f(y))\geq \epsilon

This gives us the desired sequences (x_n) and (y_n) such that d(x_n,y_n)-->0 and d(f(x_n),f(y_n)) does not converge to 0.
 
Physics news on Phys.org
  • #32
OK, if I got this right, for every ε we can find a δ and a pair of elements xn, yn such that dx(xn, yn) < δ implies dy(g(xn), g(yn)) >= ε. If we to this for every 1/n, where n is a positive integer, we arrive at a pair of sequences (xn) and (yn) whose distances converge to 0, but whose fodtances of images don't converge to 0, right?

Sorry, but sometimes I still have problems with formulating negations out of inequalities, I'm ashamed to admit.
 
  • #33
radou said:
OK, if I got this right, for every ε we can find a δ and a pair of elements xn, yn such that dx(xn, yn) < δ implies dy(g(xn), g(yn)) >= ε.

No, that is not correct. To negate a statement you need to change "forall" to "exists" and vice versa. Furthermore, the negation of "p=> q" is "p AND (NOT q)"

So, the negation is: "There exists en epsilon such that forall delta, there exists xn and yn such that dx(xn, yn) < δ and dy(g(xn), g(yn)) >= ε.

If we to this for every 1/n, where n is a positive integer, we arrive at a pair of sequences (xn) and (yn) whose distances converge to 0, but whose distances of images don't converge to 0, right?

This remains true.
 
  • #34
OK, I think I got it now. Thanks a lot. This was indeed an instructive and rigorous exercise!
 
  • #35
Good! To be honest, this was not a very easy exercise...
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 40 ·
2
Replies
40
Views
5K
  • · Replies 27 ·
Replies
27
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
1
Views
6K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
26
Views
2K