Reading guide · Proof index

Fundamental theorem of calculus

Jiří Lebl, Basic Analysis I–II, version 6.3. Free author edition of this section. Selection and attribution · Notation.

L5.3.1: Integral of an integrable derivative equals the endpoint difference; full stated generality.

Proof.

Let P={x0,x1,…,xn}P = \{ x_0, x_1, \ldots, x_n \} be a partition of [a,b].[a,b]\text{.} For each interval [xi−1,xi],[x_{i-1},x_i]\text{,} use the mean value theorem to find a ci∈(xi−1,xi)c_i \in (x_{i-1},x_i) such that
f(ci)Δxi=F′(ci)(xi−xi−1)=F(xi)−F(xi−1).\begin{equation*} f(c_i) \Delta x_i = F'(c_i) (x_i - x_{i-1}) = F(x_i) - F(x_{i-1}) . \end{equation*}
See Figure 5.5, and note that the area of the iith rectangle is F(xi)−F(xi−1),F(x_{i})-F(x_{i-1})\text{,} and the total area of all three rectangles pictured is F(xi+1)−F(xi−2).F(x_{i+1})-F(x_{i-2})\text{.} The idea is that taking smaller and smaller subintervals, the total area of all these rectangles converges to the integral of f.f\text{.}

A diagram of a graph of a function in dark bold marked as y equals f of x equals F prime of x and three subintervals of the x coordinates. The middle subinterval is labeled as going from x sub quantity i minus 1 to x sub i and is of length Delta x sub i. A point c sub i is marked inside this subinterval and a dashed line goes up vertically until f of c sub i where it hits the graph of f. A shaded rectangle of this height and the subinterval as the base is drawn and labeled with ’area equals f of c sub i times Delta x sub i equals F of x sub i minus F of x sub quantity i minus 1’. The other two subintervals are similar except on the left we replace i with i minus 1 and on the right we replace i with i plus 1.
Figure 5.5. Mean value theorem on subintervals of a partition approximating the area under the curve.

Using the notation from the definition of the integral, mi≤f(ci)≤Mi,m_i \leq f(c_i) \leq M_i\text{,} and multiplying by Δxi\Delta x_i gets
miΔxi≤F(xi)−F(xi−1)≤MiΔxi.\begin{equation*} m_i \Delta x_i \leq F(x_i) - F(x_{i-1}) \leq M_i \Delta x_i . \end{equation*}
We sum over i=1,2,…,ni = 1,2, \ldots, n to get
∑i=1nmiΔxi≤∑i=1n(F(xi)−F(xi−1))≤∑i=1nMiΔxi.\begin{equation*} \sum_{i=1}^n m_i \Delta x_i \leq \sum_{i=1}^n \bigl(F(x_i) - F(x_{i-1}) \bigr) \leq \sum_{i=1}^n M_i \Delta x_i . \end{equation*}
In the middle sum, all the terms except the first and last cancel and we end up with F(xn)−F(x0)=F(b)−F(a).F(x_n)-F(x_0) = F(b)-F(a)\text{.} The sums on the left and on the right are the lower and the upper sums, respectively. So
L(P,f)≤F(b)−F(a)≤U(P,f).\begin{equation*} L(P,f) \leq F(b)-F(a) \leq U(P,f) . \end{equation*}
We take the supremum of L(P,f)L(P,f) over all partitions PP and the left inequality yields
∫ab‾f≤F(b)−F(a).\begin{equation*} \underline{\int_a^b} f \leq F(b)-F(a) . \end{equation*}
Similarly, taking the infimum of U(P,f)U(P,f) over all partitions PP yields
F(b)−F(a)≤∫ab‾f.\begin{equation*} F(b)-F(a) \leq \overline{\int_a^b} f . \end{equation*}
As ff is Riemann integrable, we have
∫abf=∫ab‾f≤F(b)−F(a)≤∫ab‾f=∫abf.\begin{equation*} \int_a^b f = \underline{\int_a^b} f \leq F(b)-F(a) \leq \overline{\int_a^b} f = \int_a^b f . \end{equation*}
The inequalities must be equalities and we are done.

L5.3.3: Primitive is Lipschitz; derivative equals f at every point of continuity, one-sided at endpoints.

Proof.

As ff is bounded, there is an M>0M > 0 such that ∣f(x)∣≤M\babs{f(x)} \leq M for all x∈[a,b].x \in [a,b]\text{.} Suppose x,y∈[a,b]x,y \in [a,b] with x>y.x > y\text{.} Then
∣F(x)−F(y)∣=∣∫axf−∫ayf∣=∣∫yxf∣≤M∣x−y∣.\begin{equation*} \babs{F(x)-F(y)} = \abs{\int_a^x f - \int_a^y f} = \abs{\int_y^x f} \leq M\sabs{x-y} . \end{equation*}
By symmetry, the same also holds if x<y.x < y\text{.} So FF is Lipschitz continuous and hence continuous.
Now suppose ff is continuous at c.c\text{.} Let ϵ>0\epsilon > 0 be given. Let δ>0\delta > 0 be such that for x∈[a,b],x \in [a,b]\text{,} ∣x−c∣<δ\sabs{x-c} < \delta implies ∣f(x)−f(c)∣<ϵ.\babs{f(x)-f(c)} < \epsilon\text{.} In particular, for such x,x\text{,} we have
f(c)−ϵ<f(x)<f(c)+ϵ.\begin{equation*} f(c)-\epsilon < f(x) < f(c) + \epsilon. \end{equation*}
Thus if x>c,x > c\text{,} then
(f(c)−ϵ)(x−c)≤∫cxf≤(f(c)+ϵ)(x−c).\begin{equation*} \bigl(f(c)-\epsilon\bigr) (x-c) \leq \int_c^x f \leq \bigl(f(c) + \epsilon\bigr)(x-c). \end{equation*}
When c>x,c > x\text{,} then the inequalities are reversed. Therefore, assuming x≠c,x \neq c\text{,} we get
f(c)−ϵ≤∫cxfx−c≤f(c)+ϵ.\begin{equation*} f(c)-\epsilon \leq \frac{\int_c^{x} f}{x-c} \leq f(c)+\epsilon . \end{equation*}
As
F(x)−F(c)x−c=∫axf−∫acfx−c=∫cxfx−c,\begin{equation*} \frac{F(x)-F(c)}{x-c} = \frac{\int_a^{x} f - \int_a^{c} f}{x-c} = \frac{\int_c^{x} f}{x-c} , \end{equation*}
we have
∣F(x)−F(c)x−c−f(c)∣≤ϵ.\begin{equation*} \abs{\frac{F(x)-F(c)}{x-c} - f(c)} \leq \epsilon . \end{equation*}
The result follows. It is left to the reader to see why is it OK that we just have a non-strict inequality.

L5.3.5: Oriented one-variable substitution, including noninjective g and endpoint range values.

Proof.

As g,g\text{,} g′,g'\text{,} and ff are continuous, f(g(x)) g′(x)f\bigl(g(x)\bigr)\,g'(x) is a continuous function of [a,b],[a,b]\text{,} therefore it is Riemann integrable. Similarly, ff is integrable on every subinterval of [c,d].[c,d]\text{.}
Define F ⁣:[c,d]→RF \colon [c,d] \to \R by
F(y)≔∫g(a)yf(u) du.\begin{equation*} F(y) \coloneqq \int_{g(a)}^{y} f(u)\,du . \end{equation*}
By the second form of the fundamental theorem of calculus (see Remark 5.3.4 and Exercise 5.3.4), FF is a differentiable function and F′(y)=f(y).F'(y) = f(y)\text{.} Apply the chain rule,
(F∘g)′(x)=F′(g(x))g′(x)=f(g(x))g′(x).\begin{equation*} \bigl( F \circ g \bigr)' (x) = F'\bigl(g(x)\bigr) g'(x) = f\bigl(g(x)\bigr) g'(x) . \end{equation*}
Note that F(g(a))=0F\bigl(g(a)\bigr) = 0 and use the first form of the fundamental theorem to obtain
∫g(a)g(b)f(u) du=F(g(b))=F(g(b))−F(g(a))=∫ab(F∘g)′(x) dx=∫abf(g(x))g′(x) dx.\begin{gathered} \int_{g(a)}^{g(b)} f(u)\,du = F\bigl(g(b)\bigr) = F\bigl(g(b)\bigr)-F\bigl(g(a)\bigr) \\ = \int_a^b \bigl( F \circ g \bigr)' (x) \,dx = \int_a^b f\bigl(g(x)\bigr) g'(x) \,dx . \qedhere \end{gathered}