Mathematics · Glossary

What is Limits, continuity?

Also known as: continuous · Lipschitz

Definition 4.5 University Mathematics — Year 2 · Chapter 4 — Topology of Metric Spaces

xnxx_n \to x in XX when d(xn,x)0d(x_n, x) \to 0. A map f ⁣:XYf \colon X \to Y between metric spaces is continuous at aa when

ε>0, δ>0,dX(x,a)δ    dY(f(x),f(a))ε;\forall \varepsilon > 0,\ \exists\delta > 0,\quad d_X(x, a) \leq \delta \implies d_Y\bigl(f(x), f(a)\bigr) \leq \varepsilon ;

equivalently (same proof as on R\R), f(xn)f(a)f(x_n) \to f(a) for every sequence xnax_n \to a. ff is Lipschitz with constant kk when dY(f(x),f(y))kdX(x,y)d_Y(f(x), f(y)) \leq k\, d_X(x, y) always — then uniformly continuous, hence continuous.

Examples

Example 4.2

R\R with xy\abs{x - y}; Rn\R^n with any of

d1(x,y)=ixiyi,d2(x,y)=(i(xiyi)2)1/2,d(x,y)=maxixiyi;d_1(x,y) = \sum_i \abs{x_i - y_i}, \quad d_2(x,y) = \Bigl(\sum_i (x_i - y_i)^2\Bigr)^{1/2}, \quad d_\infty(x,y) = \max_i \abs{x_i - y_i};

the set C([a,b])C(\intcc{a}{b}) of continuous functions with the sup distance d(f,g)=sup[a,b]fgd_\infty(f, g) = \sup_{\intcc{a}{b}} \abs{f - g} (finite: fgf - g is bounded); any set with the discrete distance (d(x,y)=1d(x,y) = 1 for xyx \neq y). Distances coming from norms are the subject of Chapter 5.

Example 4.10 (Open and closed sets recognized by continuity)

The global characterization (Theorem 4.6) is the everyday tool for topological bookkeeping. In R2\R^2: the set {(x,y):x2+y2<1, y>x3}\{(x, y) : x^2 + y^2 < 1,\ y > x^3\} is open — it is g1((,1))h1((0,+))g^{-1}(\intoo{-\infty}{1}) \cap h^{-1}(\intoo{0}{+\infty}) for the continuous g(x,y)=x2+y2g(x,y) = x^2 + y^2 and h(x,y)=yx3h(x, y) = y - x^3, an intersection of two open preimages. In (C([0,1]),d)\bigl(C(\intcc01), d_\infty\bigr): the set of functions with f(0)=f(1)f(0) = f(1) and 01f=0\int_0^1 f = 0 is closed — the preimage of {(0,0)}\{(0,0)\} under the continuous map f(f(0)f(1), 01f)f \mapsto \bigl(f(0) - f(1),\ \int_0^1 f\bigr) into R2\R^2 (each coordinate is 11-Lipschitz, as in Exercise 4.3). The method never draws a picture: exhibit a continuous map, read the set as a preimage, quote the theorem.

Example 4.11 (A closed set defined by infinitely many conditions)

In (C([0,1]),d)\bigl(C(\intcc01), d_\infty\bigr), the set

L={f:f(x)f(y)xy for all x,y}L = \{f : \abs{f(x) - f(y)} \leq \abs{x - y} \ \text{for all } x, y\}

of 11-Lipschitz functions is closed, although it is cut out by uncountably many conditions: for each fixed pair (x,y)(x, y), the map ff(x)f(y)xyf \mapsto \abs{f(x) - f(y)} - \abs{x - y} is continuous (evaluations are 11-Lipschitz), so each single condition defines a closed set, and LL is the intersection of this family — an arbitrary intersection of closed sets is closed. The same template certifies closedness for monotone functions, convex functions, functions bounded by a fixed gg: uniform limits inherit every property expressible as a family of closed pointwise constraints. What uniform limits do not automatically inherit — differentiability, for one — is exactly what Chapter 10 must labour for.

Read in context →