5.4 Consequences of the fundamental theorem

The first two theorems of this section constitute the basic “techniques of integration” taught in a calculus course.However, the careful formulations of these standard methods of evaluating integrals have some subtle points, i.e., some hypotheses.Calculus students are rarely told about these details.

Integration by parts formula

Let $f$ and $g$ be integrable functions on $[a,b],$ and as usual let $F$ and $G$ denote the functions defined by

Then

Or, recalling that $f=F^{\text{'}}$ and $g=G^{\text{'}},$

Integration by substitution

Let $f$ be a continuous function on $[a,b],$ and suppose $g$ is a continuous, one-to-one function from $[c,d]$ onto $[a,b]$ such that $g$ is continuously differentiable on $(c,d),$ and such that $a=g\left(c\right)$ and $b=g\left(d\right).$ Assume finally that $g^{\text{'}}$ is integrable on $[c,d].$ Then

It follows from our assumptions that the function $f\left(g\left(s\right)\right)g^{\text{'}}\left(s\right)$ is continuous on $(a,b)$ and integrable on $[c,d].$ It also follows from our assumptions that $g$ maps the open interval $(c,d)$ onto the open interval $(a,b).$ As usual, let $F$ denote the function on $[a,b]$ defined by $F\left(x\right)={\int }_a^{x}f\left(t\right)dt.$ Then, by part (2) of the Fundamental Theorem, $F$ is differentiable on $(a,b),$ and $F^{\text{'}}=f.$ Then, by the chain rule, $F\circ g$ is continuous and differentiable on $(c,d)$ and

So, by part (3) of the Fundamental Theorem, we have that

which finishes the proof.

We revisit now the Remainder Theorem of Taylor, which we first presented in [link] . The point is that there is another form of this theorem, the integral form,and this version is more powerful in some instances than the original one, e.g., in the general Binomial Theorem below.

Integral form of taylor's remainder theorem

Let $c$ be a real number, and let $f$ have $n+1$ derivatives on $(c-r,c+r),$ and suppose that $f^{(n+1)}\in I\left([c-r,c+r]\right).$ Then for each $c<x<c+r,$

where $T_f^n$ denotes the $n$ th Taylor polynomial for $f.$

Similarly, for $c-r<x<c,$

REMARK We return now to the general Binomial Theorem, first studied in [link] . The proof given there used the derivative form of Taylor's remainder Theorem,but we were only able to prove the Binomial Theorem for $\left|t\right|<1/2.$ The theorem below uses the integral form of Taylor's Remainder Theorem in its proof, and it gives the full binomial theorem, i.e., for all $t$ for which $\left|t\right|<1.$

General binomial theorem

Let $\alpha =a+bi$ be a fixed complex number. Then

for all $t\in (-1,1).$

For clarity, we repeat some of the proof of [link] . Given a general $\alpha =a+bi,$ consider the function $g:(-1,1)\to C$ defined by $g\left(t\right)={(1+t)}^{\alpha }.$ Observe that the $n$ th derivative of $g$ is given by

Then $g\in C^{\infty }\left((-1,1)\right).$

For each nonnegative integer $k$ define

and set $h\left(t\right)={\sum }_{k=0}^{\infty }{a}_k{t}^k.$ The radius of convergence for the power series function $h$ is 1, as was shown in [link] . We wish to show that $g\left(t\right)=h\left(t\right)$ for all $-1<t<1.$ That is, we wish to show that $g$ is a Taylor series function around 0. It will suffice to show that the sequence $\left\{S_n\right\}$ of partial sums of the power series function $h$ converges to the function $g.$ We note also that the $n$ th partial sum is just the $n$ th Taylor polynomial $T_g^n$ for $g.$

Now, fix a $t$ strictly between 0 and $1.$ The argument for $t$ 's between $-1$ and 0 is completely analogous.. Choose an $ϵ>0$ for which $\beta =(1+ϵ)t<1.$ We let $C_{ϵ}$ be a numbers such that $|\left(\genfrac{}{}{0pt}{}{\alpha }{n}\right)|\le C_{ϵ}{(1+ϵ)}^n$ for all nonnegative integers $n.$ See [link] . We will also need the following estimate, which can beeasily deduced as a calculus exercise (See part (d) of [link] .). For all $s$ between 0 and $t,$ we have $(t-s)/(1+s)\le t.$ Note also that, for any $s\in (0,t),$ we have ${|(1+s)}^{\alpha }{|=(1+s)}^a,$ and this is trapped between 1 and ${(1+t)}^a.$ Hence, there exists a number $M_t$ such that ${|(1+s)}^{\alpha -1}|\le M_t$ for all $s\in (-0,t).$ We will need this estimate in the calculation that follows.

Then, by the integral form of Taylor's Remainder Theorem, we have:

which tends to 0 as $n$ goes to $\infty ,$ because $\beta <1.$ This completes the proof for $0<t<1.$