Definition 11.1. Let f:A⟶Rf: A \longrightarrow \mathbb{R} be a function. We say that ff is uniformly continuous if for all ϵ>0\epsilon > 0, there exists a δ>0\delta > 0 such that for all x,y∈Ax, y \in A,

if ∣x−y∣<δ, then ∣f(x)−f(y)∣<ϵ.\text{if } |x - y| < \delta, \text{ then } |f(x) - f(y)| < \epsilon.

By Definition 9.25

Theorem 11.2. If ff is uniformly continuous, then ff is continuous.

Exercise 11.3. Determine with proof whether the following functions ff are uniformly continuous on the given intervals AA:

f(x)=x2 on A=R,f(x)=x2 on A=(−2,2),f(x)=1x on A=(0,+∞),f(x)=1x on A=[1,+∞),f(x)=x on A=[0,+∞),f(x)=x on A=[1,+∞).\begin{aligned} f(x) &= x^2 \text{ on } A = \mathbb{R}, \\ f(x) &= x^2 \text{ on } A = (-2,2), \\ f(x) &= \frac{1}{x} \text{ on } A = (0, +\infty), \\ f(x) &= \frac{1}{x} \text{ on } A = [1, +\infty), \\ f(x) &= \sqrt{x} \text{ on } A = [0, +\infty), \\ f(x) &= \sqrt{x} \text{ on } A = [1, +\infty). \end{aligned}

导数有最大值

Exercise 11.4. Let p:R→Rp: \mathbb{R} \to \mathbb{R} be a polynomial with real coefficients. Show that pp is uniformly continuous on R\mathbb{R} if and only if deg⁡(p)≤1\deg(p) \leq 1.

Exercise 11.5. Let ff and gg be uniformly continuous on A⊂RA \subset \mathbb{R}. Show that:

  1. The function f+gf + g is uniformly continuous on AA.
  2. For any constant c∈Rc \in \mathbb{R}, the function c⋅fc \cdot f is uniformly continuous on AA.

We will now prove that continuous functions with compact domain are automatically uniformly continuous. To this end, first consider:

Lemma 11.6. Let f:A⟶Rf: A \longrightarrow \mathbb{R} be continuous. Fix ϵ>0\epsilon > 0. By the definition of continuity, for each p∈Ap \in A there exists δ(p)>0\delta(p) > 0 such that for all x∈Ax \in A,

if ∣x−p∣<δ(p), then ∣f(x)−f(p)∣<ϵ2.\text{if } |x - p| < \delta(p), \text{ then } |f(x) - f(p)| < \frac{\epsilon}{2}.

For each p∈Ap \in A, define U(p)={x∈R∣∣x−p∣<12δ(p)}U(p) = \{ x \in \mathbb{R} \mid |x - p| < \frac{1}{2}\delta(p) \}. Then the collection {U(p)∣p∈A}\{U(p) \mid p \in A\} is an open cover of AA.

Theorem 11.7. Suppose that X⊂RX \subset \mathbb{R} is compact and f:X⟶Rf: X \longrightarrow \mathbb{R} is continuous. Then ff is uniformly continuous.

By Theorem 4.22, XX is bounded and closed
By Collary 5.13, if XX is bounded and closed, then f(X)f(X) has first point and last point.

Corollary 11.8. Suppose that f:[a,b]⟶Rf: [a,b] \longrightarrow \mathbb{R} is continuous. Then ff is uniformly continuous.

By Theorem 4.29. The set [a,b][a,b] is compact.

Definition 11.9. We say that a function f:A→Rf: A \to \mathbb{R} is bounded if f(A)f(A) is a bounded subset of R\mathbb{R}.

Theorem 11.10. Suppose that X⊂RX \subset \mathbb{R} is compact and f:X⟶Rf: X \longrightarrow \mathbb{R} is continuous. Then ff is bounded.

Exercise 11.11. Show that if ff and gg are bounded on AA and uniformly continuous on AA, then fgfg is uniformly continuous on AA.

We are now ready to turn to integration.

Definition 11.12. A partition of the interval [a,b][a,b] is a finite set of points in [a,b][a,b] that includes aa and bb:

a=t0<t1<⋯<tn−1<tn=b.a = t_0 < t_1 < \dots < t_{n-1} < t_n = b.

If PP and QQ are partitions of the interval [a,b][a,b] and P⊂QP \subset Q, we refer to QQ as a refinement of PP.

We usually write partitions as ordered lists P={t0,t1,…,tn}P = \{t_0, t_1, \ldots, t_n\} with ti−1<tit_{i-1} < t_i for each i=1,…,ni = 1, \ldots, n.

Definition 11.13. Suppose that f:[a,b]⟶Rf: [a,b] \longrightarrow \mathbb{R} is bounded and that P={t0,t1,…,tn}P = \{t_0, t_1, \ldots, t_n\} is a partition of [a,b][a,b]. Define:

mi=inf⁡{f(x)∣ti−1<x<ti},Mi=sup⁡{f(x)∣ti−1<x<ti}.m_i = \inf \{ f(x) \mid t_{i-1} < x < t_i \}, \qquad M_i = \sup \{ f(x) \mid t_{i-1} < x < t_i \}.

The lower sum of ff for the partition PP is the number:

L(f,P)=∑i=1nmi(ti−ti−1).L(f,P) = \sum_{i=1}^{n} m_i (t_i - t_{i-1}).

The upper sum of ff for the partition PP is the number:

U(f,P)=∑i=1nMi(ti−ti−1).U(f,P) = \sum_{i=1}^{n} M_i (t_i - t_{i-1}).

Notice that it is always the case that L(f,P)≤U(f,P)L(f,P) \leq U(f,P).

Lemma 11.14. Suppose that PP and QQ are partitions of [a,b][a,b] and that QQ is a refinement of PP. Then:

L(f,P)≤L(f,Q)andU(f,P)≥U(f,Q).L(f,P) \leq L(f,Q) \quad \text{and} \quad U(f,P) \geq U(f,Q).

Theorem 11.15. Let P1P_1 and P2P_2 be partitions of [a,b][a,b] and suppose that f:[a,b]⟶Rf: [a,b] \longrightarrow \mathbb{R} is bounded. Then:

L(f,P1)≤U(f,P2).L(f,P_1) \leq U(f,P_2).

Definition 11.16. Let f:[a,b]→Rf: [a,b] \to \mathbb{R} be bounded. We define

L(f)=sup⁡{L(f,P)∣P a partition of [a,b]},U(f)=inf⁡{U(f,P)∣P a partition of [a,b]},L(f) = \sup \{ L(f,P) \mid P \text{ a partition of } [a,b] \}, \qquad U(f) = \inf \{ U(f,P) \mid P \text{ a partition of } [a,b] \},

to be, respectively, the lower integral and upper integral of ff from aa to bb.

Exercise 11.17. Why do L(f)L(f) and U(f)U(f) exist? Find a function ff for which L(f)=U(f)L(f) = U(f). Find a function ff for which L(f)≠U(f)L(f) \neq U(f). Is there a relationship between L(f)L(f) and U(f)U(f) in general?

Definition 11.18. Let f:[a,b]⟶Rf: [a,b] \longrightarrow \mathbb{R} be bounded. We say that ff is integrable on [a,b][a,b] if L(f)=U(f)L(f) = U(f). In this case, the common value L(f)=U(f)L(f) = U(f) is called the integral of ff from aa to bb and we write it as:

∫abf.\int_a^b f.

When we want to display the variable of integration, we write the integral as follows, including the symbol dxdx to indicate the variable of integration:

∫abf(x) dx.\int_a^b f(x) \, dx.

For example, if f(x)=x2f(x) = x^2, we would write ∫abx2 dx\int_a^b x^2 \, dx but not ∫abx2\int_a^b x^2.

Theorem 11.19. Let f:[a,b]⟶Rf: [a,b] \longrightarrow \mathbb{R} be bounded. Then ff is integrable if and only if for every ϵ>0\epsilon > 0 there exists a partition PP of [a,b][a,b] such that:

U(f,P)−L(f,P)<ϵ.U(f,P) - L(f,P) < \epsilon.

Theorem 11.20. If f:[a,b]⟶Rf: [a,b] \longrightarrow \mathbb{R} is continuous, then ff is integrable.
(Hint: Use theorem 11.19 and uniform continuity.)

Exercise 11.21. Fix c∈Rc \in \mathbb{R} and let f:[a,b]→Rf: [a,b] \to \mathbb{R} be defined by f(x)=cf(x) = c for each x∈[a,b]x \in [a,b]. Show that ff is integrable on [a,b][a,b] and that ∫abf=c(b−a)\int_a^b f = c(b - a).

Exercise 11.22. Define f:[0,b]→Rf: [0,b] \to \mathbb{R} by the formula f(x)=xf(x) = x. Show that ff is integrable on [0,b][0,b] and that ∫0bf=b22\int_0^b f = \frac{b^2}{2}.

Exercise 11.23. Show that the converse of theorem 11.20 is false in general.

Exercise 11.24. Let f:[0,1]→Rf: [0,1] \to \mathbb{R} be defined by

f(x)={1,x∈Q,0,x∉Q.f(x) = \begin{cases} 1, & x \in \mathbb{Q}, \\ 0, & x \notin \mathbb{Q}. \end{cases}

Show that ff is not integrable on [0,1][0,1]. Compute the upper and lower integrals of ff on [0,1][0,1].

Theorem 11.25. Let a<b<ca < b < c. A function f:[a,c]⟶Rf: [a,c] \longrightarrow \mathbb{R} is integrable on [a,c][a,c] if and only if ff is integrable on [a,b][a,b] and [b,c][b,c]. When ff is integrable on [a,c][a,c], we have

∫acf=∫abf+∫bcf.\int_a^c f = \int_a^b f + \int_b^c f.

If b<ab < a, we define

∫abf=−∫baf,\int_a^b f = -\int_b^a f,

whenever the latter integral exists. With this notational convention, it follows that the equation

∫acf=∫abf+∫bcf\int_a^c f = \int_a^b f + \int_b^c f

always holds, regardless of the ordering of aa, bb and cc, whenever ff is integrable on the largest of the three intervals.

Theorem 11.26. Suppose that ff and gg are integrable functions on [a,b][a,b] and that c∈Rc \in \mathbb{R} is a constant. Then:

∫ab(f+g)=∫abf+∫abg,∫abc⋅f=c∫abf.\int_a^b (f + g) = \int_a^b f + \int_a^b g, \qquad \int_a^b c \cdot f = c \int_a^b f.

Theorem 11.27. Suppose that ff is integrable on [a,b][a,b] and that there exist numbers mm and MM such that:

m≤f(x)≤Mfor all x∈[a,b].m \leq f(x) \leq M \quad \text{for all } x \in [a,b].

Then:

m(b−a)≤∫abf≤M(b−a).m(b - a) \leq \int_a^b f \leq M(b - a).

Theorem 11.28. Suppose that ff is integrable on [a,b][a,b]. Define F:[a,b]⟶RF: [a,b] \longrightarrow \mathbb{R} by

F(x)=∫axf.F(x) = \int_a^x f.

Then FF is continuous.