Lecture 26 - Uniform Continuity

The idea of uniform continuity is like a stronger, built on definition of Continuity. Because we think of continuous functions as "preserving the real line", this is a much stronger condition.

The question we'll first answer today, is given some f:A→R where f is continuous on A, then what sort of properties are preserved? For example, if A is closed, open, compact, or connected, is the same true for f(A)={f(x):x∈A}.

We could also ask this for things like Cauchy Sequences; namely if (xn) is Cauchy, then is f(xn) also Cauchy?

Continuity itself won't answer these questions. For example, consider A=R (then A is both open and closed). Then if we define f:A→R where f(x)=11+x2:

---
title: 
xLabel: 
yLabel: 
bounds: [-2,2,0,2]
disableZoom: false
grid: true
---
f(x) = 1/(1+x^2)

What is the range f(A)? Here it is f(A)=(0,1] which is neither open nor closed.

This gives us the following theorem:

Theorem

The continuous image of a compact set is also compact.

Proof

Let f:K→R be such that f is continuous for all c∈K, and K is compact.

To show that f(K) is compact, we'll take an arbitrary sequence in the set and show that it converges to a point in the set (see Closed iff Convergent Cauchy Sequences). Let (yn)⊆f(K) be such an arbitrary sequence. Since yn∈f(K) then ∃xn∈K where f(xn)=yn. Since K is compact, then ∃(xnk)⊆K (a subsequence) such that xnk→x where x∈K. Note that f(x)∈f(K) automatically

But then since f is continuous at x∈K, then any sequence converging to x like xnk (like it does here) implies that f(xnk)→f(x) (so then we get the right immediately). But since yn=f(xnk)=ynk then ynk→f(x)∈f(K) as desired.

It is bounded trivially. Thus f(K) must be compact.

☐

See Extreme Value Theorem for an immediate use of the theorem.

See Compactness Is Preserved By Continuity which this corollary comes from.

Extreme Value Theorem

If f is continuous on a closed interval then f attains an absolute maximum and an absolute minimum in that interval.

Proof

Let a<b∈R. Take f:[a,b]→R to be continuous. By the Heine-Borel Theorem (Compact Equivalences) then our [a,b] is compact. Therefore, by Compactness Is Preserved By Continuity then f([a,b]) is compact. Compact gives that f([a,b]) must be bounded, so then we can define m:=inff([a,b]) and M:=supf([a,b]) both exist.

f([a,b]) are both closed (by being compact), so then our m,M∈f([a,b]). So then ∃x1,x2∈[a,b] where f(x1)=m and f(x2)=M as desired (since these points x1,x2) are our minimum/maximum points.

☐

Back to Uniform Continuity

Before jumping into the definition of uniform continuity, let's look at some examples.

First let A=(0,1). Let f,g:A→R where f(x)=x2 and g(x)=1x. Both functions f and g, by the Algebraic Continuity Theorem, are continuous for each c∈A=(0,1).

Now let's consider ε−δ proofs of this (even though we've shown they are continuous). Let c∈A=(0,1). To show continuity we'll want to let ε>0. What δ do we need to pick such that the ε challenge can be satisfied? In these cases:

|f(x)−f(c)|=|x2−c2|=|x+c||x−c|<2|x−c|(|x+c|<|1+c|=2)

Then to use this we'd need 2|x−c|<2δ=ε implies δ=ε2.

|g(x)−g(c)|=|1x−1c|=|x−cxc|=|x−c|xc

We'd like to get to <|x−c|k where k doesn't depend on x. Since x approaches c, it suggests that x is within c2 of c. Then if we suppose |x−c|<δ<c2 then x>c2. So then 1x<2c thus we have:

<|x−c|c22=ε

Thus we want δ<c2 and δ<c22ε so then we want δ=min{c2,c22ε}.

What's important here is that δ for f was independent of c, meanwhile δ for g was dependent on c (for all cases). The idea is having the independence is some stronger form of continuity. Uniform continuity.

Thus we can get into the definition:

uniform continuity

Let f:A→R is uniformly continuous on A if ∀ε>0 ∃δ>0 such that x,y∈A has:
|x−y|<δ⇒|f(x)−f(y)|<ε

In contrast, Continuity itself is continuous at a point y specifically. Having to consider the y may imply that δ depends on that y. Here, we don't care about specific points it is continuous at.

Theorem

A continuous function on a compact set is uniformly continuous.

The idea here is that in our example in Lecture 26 - Uniform Continuity#Back to Uniform Continuity the function f would be still continuous if A=[0,1] instead (same definition of f, just include the endpoints on the interval). In contrast, g couldn't get that same extension.

Proof

Let f:K→R be continuous, with K being compact.

To show f is uniformly continuous, follow the definition. Let ε>0. Since f is continuous, then δ>0 where ∀x∈K then picking ∀x′∈K has 0<|x−x′|<δ→|f(x)−f(x′)|<ε2.

The problem here is that δ may change with each x, so first notice that if I consider the following collection (we denote the δ we choose for each x as δ(x)):
{Vδ(x)2(x)|x∈K}
This is an Open Cover of K. By the Heine-Borel Theorem (Compact Equivalences) then there is a finite subcover ∃x1,x2,…,xn such that:
K⊆Vδ(x)2(x1)∪⋯∪Vδ(xn)2(xn)
Now choose δ=min{δ(x1)2,…,δ(xn)2}. Let x,y∈K where |x−y|<δ. Consider x∈K then by our construction then ∃xk such that x∈Vδ(xk)2(xk). Therefore, using the given for being continuous then:
⇒|x−xk|<δ(xk)2<δ(xk)⇒|f(x)−f(xk)|<ε2

Now notice:
|y−xk|≤|y−x|+|x−xk|<δ+δ(xk)2≤δ(xk)2+δ(xk)2=δ(xk)⇒|f(y)−f(xk)|<ε2 Def’n Continuity
Now using that we got |f(x)−f(xk)|<ε2 then:
|f(x)−f(y)|≤|f(x)−f(xk)|+|f(xk)−f(y)|<ε2+ε2=ε

☐