wikiwand.com

Uniform continuity - Wikiwand

In mathematics, a real function {\displaystyle f} of real numbers is said to be uniformly continuous if there is a positive real number {\displaystyle \delta } such that function values over any function domain interval of the size {\displaystyle \delta } are as close to each other as we want. In other words, for a uniformly continuous real function of real numbers, if we want function value differences to be less than any positive real number {\displaystyle \epsilon }, then there is a positive real number {\displaystyle \delta } such that {\displaystyle |f(x)-f(y)|<\epsilon } for any {\displaystyle x} and {\displaystyle y} in any interval of length {\displaystyle \delta } within the domain of {\displaystyle f}.

Thumb
As the center of the blue window, with real height {\displaystyle 2\varepsilon \in \mathbb {R} _{>0}} and real width {\displaystyle 2\delta \in \mathbb {R} _{>0}}, moves over the graph of {\displaystyle f(x)={\tfrac {1}{x}}} in the direction of {\displaystyle x=0}, there comes a point at which the graph of {\displaystyle f} penetrates the (interior of the) top and/or bottom of that window. This means that {\displaystyle f} ranges over an interval larger than or equal to {\displaystyle \varepsilon } over an {\displaystyle x}-interval smaller than {\displaystyle \delta }. If there existed a window whereof top and/or bottom is never penetrated by the graph of {\displaystyle f} as the window moves along it over its domain, then that window's width would need to be infinitesimally small (nonreal), meaning that {\displaystyle f(x)} is not uniformly continuous. The function {\displaystyle g(x)={\sqrt {x}}}, on the other hand, is uniformly continuous.

The difference between uniform continuity and (ordinary) continuity is that, in uniform continuity there is a globally applicable {\displaystyle \delta } (the size of a function domain interval over which function value differences are less than {\displaystyle \epsilon }) that depends on only {\displaystyle \varepsilon }, while in (ordinary) continuity there is a locally applicable {\displaystyle \delta } that depends on both {\displaystyle \varepsilon } and {\displaystyle x}. So uniform continuity is a stronger continuity condition than continuity; a function that is uniformly continuous is continuous but a function that is continuous is not necessarily uniformly continuous. The concepts of uniform continuity and continuity can be expanded to functions defined between metric spaces.

Continuous functions can fail to be uniformly continuous if they are unbounded on a bounded domain, such as {\displaystyle f(x)={\tfrac {1}{x}}} on {\displaystyle (0,1)}, or if their slopes become unbounded on an infinite domain, such as {\displaystyle f(x)=x^{2}} on the real (number) line. However, any Lipschitz map between metric spaces is uniformly continuous, in particular any isometry (distance-preserving map).

Although continuity can be defined for functions between general topological spaces, defining uniform continuity requires more structure. The concept relies on comparing the sizes of neighbourhoods of distinct points, so it requires a metric space, or more generally a uniform space.

For a function {\displaystyle f:X\to Y} with metric spaces {\displaystyle (X,d_{1})} and {\displaystyle (Y,d_{2})}, the following definitions of uniform continuity and (ordinary) continuity hold.

Definition of uniform continuity

Definition of (ordinary) continuity

In the definitions, the difference between uniform continuity and continuity is that, in uniform continuity there is a globally applicable {\displaystyle \delta } (the size of a neighbourhood in {\displaystyle X} over which values of the metric for function values in {\displaystyle Y} are less than {\displaystyle \varepsilon }) that depends on only {\displaystyle \varepsilon } while in continuity there is a locally applicable {\displaystyle \delta } that depends on the both {\displaystyle \varepsilon } and {\displaystyle x}. Continuity is a local property of a function — that is, a function {\displaystyle f} is continuous, or not, at a particular point {\displaystyle x} of the function domain {\displaystyle X}, and this can be determined by looking at only the values of the function in an arbitrarily small neighbourhood of that point. When we speak of a function being continuous on an interval, we mean that the function is continuous at every point of the interval. In contrast, uniform continuity is a global property of {\displaystyle f}, in the sense that the standard definition of uniform continuity refers to every point of {\displaystyle X}. On the other hand, it is possible to give a definition that is local in terms of the natural extension {\displaystyle f^{*}}(the characteristics of which at nonstandard points are determined by the global properties of {\displaystyle f}), although it is not possible to give a local definition of uniform continuity for an arbitrary hyperreal-valued function, see below.

A mathematical definition that a function {\displaystyle f} is continuous on an interval {\displaystyle I} and a definition that {\displaystyle f} is uniformly continuous on {\displaystyle I} are structurally similar as shown in the following.

Continuity of a function {\displaystyle f:X\to Y} for metric spaces {\displaystyle (X,d_{1})} and {\displaystyle (Y,d_{2})} at every point {\displaystyle x} of an interval {\displaystyle I\subseteq X} (i.e., continuity of {\displaystyle f} on the interval {\displaystyle I}) is expressed by a formula starting with quantifications

{\displaystyle \forall x\in I\;\forall \varepsilon >0\;\exists \delta >0\;\forall y\in I:\,d_{1}(x,y)<\delta \,\Rightarrow \,d_{2}(f(x),f(y))<\varepsilon },

(metrics {\displaystyle d_{1}(x,y)} and {\displaystyle d_{2}(f(x),f(y))} are {\displaystyle |x-y|} and {\displaystyle |f(x)-f(y)|} for {\displaystyle f:\mathbb {R} \to \mathbb {R} } for the set of real numbers {\displaystyle \mathbb {R} }).

For uniform continuity, the order of the first, second, and third quantifications ({\displaystyle \forall x\in I}, {\displaystyle \forall \varepsilon >0}, and {\displaystyle \exists \delta >0}) are rotated:

{\displaystyle \forall \varepsilon >0\;\exists \delta >0\;\forall x\in I\;\forall y\in I:\,d_{1}(x,y)<\delta \,\Rightarrow \,d_{2}(f(x),f(y))<\varepsilon }.

Thus for continuity on the interval, one takes an arbitrary point {\displaystyle x} of the interval, and then there must exist a distance {\displaystyle \delta },

{\displaystyle \cdots \forall x\,\exists \delta \cdots ,}

while for uniform continuity, a single {\displaystyle \delta } must work uniformly for all points {\displaystyle x} of the interval,

{\displaystyle \cdots \exists \delta \,\forall x\cdots .}

Every uniformly continuous function is continuous, but the converse does not hold. Consider for instance the continuous function {\displaystyle f\colon \mathbb {R} \rightarrow \mathbb {R} ,x\mapsto x^{2}} where {\displaystyle \mathbb {R} } is the set of real numbers. Given a positive real number {\displaystyle \varepsilon }, uniform continuity requires the existence of a positive real number {\displaystyle \delta } such that for all {\displaystyle x_{1},x_{2}\in \mathbb {R} } with {\displaystyle |x_{1}-x_{2}|<\delta }, we have {\displaystyle |f(x_{1})-f(x_{2})|<\varepsilon }. But

{\displaystyle f\left(x+\delta \right)-f(x)=2x\cdot \delta +\delta ^{2},}

and as {\displaystyle x} goes to be a higher and higher value, {\displaystyle \delta } needs to be lower and lower to satisfy {\displaystyle |f(x+\beta )-f(x)|<\varepsilon } for positive real numbers {\displaystyle \beta <\delta } and the given {\displaystyle \varepsilon }. This means that there is no specifiable (no matter how small it is) positive real number {\displaystyle \delta } to satisfy the condition for {\displaystyle f} to be uniformly continuous so {\displaystyle f} is not uniformly continuous.

Any absolutely continuous function (over a compact interval) is uniformly continuous. On the other hand, the Cantor function is uniformly continuous but not absolutely continuous.

The image of a totally bounded subset under a uniformly continuous function is totally bounded. However, the image of a bounded subset of an arbitrary metric space under a uniformly continuous function need not be bounded: as a counterexample, consider the identity function from the integers endowed with the discrete metric to the integers endowed with the usual Euclidean metric.

The Heine–Cantor theorem asserts that every continuous function on a compact set is uniformly continuous. In particular, if a function is continuous on a closed bounded interval of the real line, it is uniformly continuous on that interval. The Darboux integrability of continuous functions follows almost immediately from this theorem.

If a real-valued function {\displaystyle f} is continuous on {\displaystyle [0,\infty )} and {\displaystyle \lim _{x\to \infty }f(x)} exists (and is finite), then {\displaystyle f} is uniformly continuous. In particular, every element of {\displaystyle C_{0}(\mathbb {R} )}, the space of continuous functions on {\displaystyle \mathbb {R} } that vanish at infinity, is uniformly continuous. This is a generalization of the Heine-Cantor theorem mentioned above, since {\displaystyle C_{c}(\mathbb {R} )\subset C_{0}(\mathbb {R} )}.

Examples and nonexamples

Examples

Nonexamples

For a uniformly continuous function, for every positive real number {\displaystyle \varepsilon >0} there is a positive real number {\displaystyle \delta >0} such that two function values {\displaystyle f(x)} and {\displaystyle f(y)} have the maximum distance {\displaystyle \varepsilon } whenever {\displaystyle x} and {\displaystyle y} are within the maximum distance {\displaystyle \delta }. Thus at each point {\displaystyle (x,f(x))} of the graph, if we draw a rectangle with a height slightly less than {\displaystyle 2\varepsilon } and width a slightly less than {\displaystyle 2\delta } around that point, then the graph lies completely within the height of the rectangle, i.e., the graph do not pass through the top or the bottom side of the rectangle. For functions that are not uniformly continuous, this isn't possible; for these functions, the graph might lie inside the height of the rectangle at some point on the graph but there is a point on the graph where the graph lies above or below the rectangle. (the graph penetrates the top or bottom side of the rectangle.)

The first published definition of uniform continuity was by Heine in 1870, and in 1872 he published a proof that a continuous function on an open interval need not be uniformly continuous. The proofs are almost verbatim given by Dirichlet in his lectures on definite integrals in 1854. The definition of uniform continuity appears earlier in the work of Bolzano where he also proved that continuous functions on an open interval do not need to be uniformly continuous. In addition he also states that a continuous function on a closed interval is uniformly continuous, but he does not give a complete proof.[1]

Non-standard analysis

In non-standard analysis, a real-valued function {\displaystyle f} of a real variable is microcontinuous at a point {\displaystyle a} precisely if the difference {\displaystyle f^{*}(a+\delta )-f^{*}(a)} is infinitesimal whenever {\displaystyle \delta } is infinitesimal. Thus {\displaystyle f} is continuous on a set {\displaystyle A} in {\displaystyle \mathbb {R} } precisely if {\displaystyle f^{*}} is microcontinuous at every real point {\displaystyle a\in A}. Uniform continuity can be expressed as the condition that (the natural extension of) {\displaystyle f} is microcontinuous not only at real points in {\displaystyle A}, but at all points in its non-standard counterpart (natural extension) {\displaystyle ^{*}A} in {\displaystyle ^{*}\mathbb {R} }. Note that there exist hyperreal-valued functions which meet this criterion but are not uniformly continuous, as well as uniformly continuous hyperreal-valued functions which do not meet this criterion, however, such functions cannot be expressed in the form {\displaystyle f^{*}} for any real-valued function {\displaystyle f}. (see non-standard calculus for more details and examples).

Cauchy continuity

For a function between metric spaces, uniform continuity implies Cauchy continuity (Fitzpatrick 2006). More specifically, let {\displaystyle A} be a subset of {\displaystyle \mathbb {R} ^{n}}. If a function {\displaystyle f:A\to \mathbb {R} ^{n}} is uniformly continuous then for every pair of sequences {\displaystyle x_{n}} and {\displaystyle y_{n}} such that

{\displaystyle \lim _{n\to \infty }|x_{n}-y_{n}|=0}

we have

{\displaystyle \lim _{n\to \infty }|f(x_{n})-f(y_{n})|=0.}

Let {\displaystyle X} be a metric space, {\displaystyle S} a subset of {\displaystyle X}, {\displaystyle R} a complete metric space, and {\displaystyle f:S\rightarrow R} a continuous function. A question to answer: When can {\displaystyle f} be extended to a continuous function on all of {\displaystyle X}?

If {\displaystyle S} is closed in {\displaystyle X}, the answer is given by the Tietze extension theorem. So it is necessary and sufficient to extend {\displaystyle f} to the closure of {\displaystyle S} in {\displaystyle X}: that is, we may assume without loss of generality that {\displaystyle S} is dense in {\displaystyle X}, and this has the further pleasant consequence that if the extension exists, it is unique. A sufficient condition for {\displaystyle f} to extend to a continuous function {\displaystyle f:X\rightarrow R} is that it is Cauchy-continuous, i.e., the image under {\displaystyle f} of a Cauchy sequence remains Cauchy. If {\displaystyle X} is complete (and thus the completion of {\displaystyle S}), then every continuous function from {\displaystyle X} to a metric space {\displaystyle Y} is Cauchy-continuous. Therefore when {\displaystyle X} is complete, {\displaystyle f} extends to a continuous function {\displaystyle f:X\rightarrow R} if and only if {\displaystyle f} is Cauchy-continuous.

It is easy to see that every uniformly continuous function is Cauchy-continuous and thus extends to {\displaystyle X}. The converse does not hold, since the function {\displaystyle f:R\rightarrow R,x\mapsto x^{2}} is, as seen above, not uniformly continuous, but it is continuous and thus Cauchy continuous. In general, for functions defined on unbounded spaces like {\displaystyle R}, uniform continuity is a rather strong condition. It is desirable to have a weaker condition from which to deduce extendability.

For example, suppose {\displaystyle a>1} is a real number. At the precalculus level, the function {\displaystyle f:x\mapsto a^{x}} can be given a precise definition only for rational values of {\displaystyle x} (assuming the existence of qth roots of positive real numbers, an application of the Intermediate Value Theorem). One would like to extend {\displaystyle f} to a function defined on all of {\displaystyle R}. The identity

{\displaystyle f(x+\delta )-f(x)=a^{x}\left(a^{\delta }-1\right)}

shows that {\displaystyle f} is not uniformly continuous on the set {\displaystyle Q} of all rational numbers; however for any bounded interval {\displaystyle I} the restriction of {\displaystyle f} to {\displaystyle Q\cap I} is uniformly continuous, hence Cauchy-continuous, hence {\displaystyle f} extends to a continuous function on {\displaystyle I}. But since this holds for every {\displaystyle I}, there is then a unique extension of {\displaystyle f} to a continuous function on all of {\displaystyle R}.

More generally, a continuous function {\displaystyle f:S\rightarrow R} whose restriction to every bounded subset of {\displaystyle S} is uniformly continuous is extendable to {\displaystyle X}, and the converse holds if {\displaystyle X} is locally compact.

A typical application of the extendability of a uniformly continuous function is the proof of the inverse Fourier transformation formula. We first prove that the formula is true for test functions, there are densely many of them. We then extend the inverse map to the whole space using the fact that linear map is continuous; thus, uniformly continuous.

In the special case of two topological vector spaces {\displaystyle V} and {\displaystyle W}, the notion of uniform continuity of a map {\displaystyle f:V\to W} becomes: for any neighborhood {\displaystyle B} of zero in {\displaystyle W}, there exists a neighborhood {\displaystyle A} of zero in {\displaystyle V} such that {\displaystyle v_{1}-v_{2}\in A} implies {\displaystyle f(v_{1})-f(v_{2})\in B.}

For linear transformations {\displaystyle f:V\to W}, uniform continuity is equivalent to continuity. This fact is frequently used implicitly in functional analysis to extend a linear map off a dense subspace of a Banach space.

Just as the most natural and general setting for continuity is topological spaces, the most natural and general setting for the study of uniform continuity are the uniform spaces. A function {\displaystyle f:X\to Y} between uniform spaces is called uniformly continuous if for every entourage {\displaystyle V} in {\displaystyle Y} there exists an entourage {\displaystyle U} in {\displaystyle X} such that for every {\displaystyle (x_{1},x_{2})} in {\displaystyle U} we have {\displaystyle (f(x_{1}),f(x_{2}))} in {\displaystyle V}.

In this setting, it is also true that uniformly continuous maps transform Cauchy sequences into Cauchy sequences.

Each compact Hausdorff space possesses exactly one uniform structure compatible with the topology. A consequence is a generalization of the Heine-Cantor theorem: each continuous function from a compact Hausdorff space to a uniform space is uniformly continuous.