Uniformly continuous map: Difference between revisions
| Line 9: | Line 9: | ||
Suppose <math>(X,d_X)</math> and <math>(Y,d_Y)</math> are [[metric space]]s (in other words, <math>X</math> and <math>Y</math> are sets and <math>d_X</math> and <math>d_Y</math> are metrics on <math>X</math> and <math>Y</math> respectively). A function <math>f:X \to Y</math> is termed a '''uniformly continuous map''' if the following holds: | Suppose <math>(X,d_X)</math> and <math>(Y,d_Y)</math> are [[metric space]]s (in other words, <math>X</math> and <math>Y</math> are sets and <math>d_X</math> and <math>d_Y</math> are metrics on <math>X</math> and <math>Y</math> respectively). A function <math>f:X \to Y</math> is termed a '''uniformly continuous map''' if the following holds: | ||
<math>\forall \ \varepsilon > 0 \ \exists \delta > 0 : | <math>\forall \ \varepsilon > 0 \ \exists \delta > 0 : d_X(a,b) < \delta \implies d_Y(f(a),f(b)) < \varepsilon</math>. | ||
Revision as of 23:02, 24 November 2008
Definition
Between uniform spaces
Suppose and are uniform spaces (in other words, and are sets and and are uniform structures on and respectively). A function is termed a uniformly continuous map if the following holds: For any (i.e., for every entourage of ) there exists a such that .
Between metric spaces
Suppose and are metric spaces (in other words, and are sets and and are metrics on and respectively). A function is termed a uniformly continuous map if the following holds:
.