Loading [MathJax]/jax/element/mml/optable/MathOperators.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

5.5: Antiderivatives (Primitives, Integrals)

( \newcommand{\kernel}{\mathrm{null}\,}\)

Given f:E1E, we often have to find a function F such that F=f on I, or at least on IQ. We also require F to be relatively continuous and finite on I. This process is called antidifferentiation or integration.

Definition 1

We call F:E1E a primitive, or antiderivative, or an indefinite integral, of f on I iff

(i) F is relatively continuous and finite on I, and

(ii) F is differentiable, with F=f, on IQ at least.

We then write

F=f, or F(x)=f(x)dx, on I.

(The latter is classical notation.)

If such an F exists (which is not always the case), we shall say that f exists on I, or that f has a primitive (or antiderivative) on I, or that f is primitively integrable (briefly integrable) on I.

If F=f on a set BI, we say that f is exact on B and call F an exact primitive on B. Thus if Q=,f is exact on all of I.

Note 1. Clearly, if F=f, then also (F+c)=f for a finite constant c. Thus the notation F=f is rather incomplete; it means that F is one of many primitives. We now show that all of them have the form F+c (or
f+c).

Theorem 5.5.1

If F and G are primitive to f on I, then GF is constant on I.

Proof

By assumption, F and G are relatively continuous and finite on I; hence so is GF. Also, F=f on IQ and G=f on IP.(Q and P are countable, but possibly QP.)

Hence both F and G equal f on IS, where S=PQ, and S is countable itself by Theorem 2 of Chapter 1, §9.

Thus by Corollary 3 in §4, F=G on IS implies GF=c (constant) on each [x,y]I; hence GF=c (or G=F+c) on I.

Definition 2

If F=f on I and if a,bI (where ab or ba), we define

baf=baf(x)dx=F(b)F(a), also written F(x)|ba.

This expression is called the definite integral of f from a to b.

The definite integral of f from a to b is independent of the particular choice of the primitive F for f, and thus unambiguous, for if G is another primitive, Theorem 1 yields G=F+c, so

G(b)G(a)=F(b)+c[F(a)+c]=F(b)F(a),

and it does not matter whether we take F or G.

Note that baf(x)dx, or baf, is a constant in the range space E (a vector if f is vector valued). The "x" in baf(x)dx is a "dummy variable" only, and it may be replaced by any other letter. Thus

baf(x)dx=baf(y)dy=F(b)F(a).

On the other hand, the indefinite integral is a function: F:E1E.

Note 2. We may, however, vary a or b (or both) in (1). Thus, keeping a fixed and varying b, we can define a function

G(t)=taf=F(t)F(a),tI.

Then G=F=f on I, and G(a)=F(a)F(a)=0. Thus if f exists on I,f has a (unique) primitive G on I such that G(a)=0. (It is unique by Theorem 1. Why?)

Examples

(a) Let

f(x)=1x and F(x)=ln|x|, with F(0)=f(0)=0.

Then F=f and F=f on (,0) and on (0,+) but not on E1, since F is discontinuous at 0, contrary to Definition 1. We compute

21f=ln2ln1=ln2.

(b) On E1, let

f(x)=|x|x and F(x)=|x|, with f(0)=1.

Here F is continuous and F=f on E1{0}. Thus F=f on E1, exact on E1{0}. Here I=E1,Q={0}.

We compute

22f=F(2)F(2)=22=0

(even though f never vanishes on E1).

Basic properties of integrals follow from those of derivatives. Thus we have the following.

Corollary 5.5.1 (linearity)

If f and g exist on I, so does (pf+qg) for any scalars p,q (in the scalar field of E). Moreover, for any a,bI, we obtain

(i) ba(pf+qg)=pbaf+qbag;

(ii) ba(f±g)=baf±bag; and

(iii) bapf=pbaf.

Proof

By assumption, there are F and G such that

F=f on IQ and G=g on IP.

Thus, setting S=PQ and H=pF+qG, we have

H=pF+qG=pf+qg on IS,

with P,Q, and S countable. Also, H=pF+qG is relatively continuous and finite on I, as are F and G.

Thus by definition, H=(pf+qg) exists on I, and by (1),

ba(pf+qg)=H(b)H(a)=pF(b)+qG(b)pF(a)qG(a)=pbaf+qbag,

proving (i*).

With p=1 and q=±1, we obtain (ii*).

Taking q=0, we get (iii*).

Corollary 5.5.2

If both f and |f| exist on I=[a,b], then

|baf|ba|f|.

Proof

As before, let

F=f and G=|f| on IS(S=QP, all countable),

where F and G are relatively continuous and finite on I and G=|f| is real. Also, |F|=|f|=G on IS. Thus by Theorem 1 of §4,

|F(b)F(a)|G(b)G(a)=ba|f|.

Corollary 5.5.3

If f exists on I=[a,b], exact on IQ, then

|baf|M(ba)

for some real

MsuptIQ|f(t)|.

This is simply Corollary 1 of §4, when applied to a primitive, F=f

Corollary 5.5.4

If F=f on I and f=g on IQ, then F is also a primitive of g, and

baf=bag for a,bI.

(Thus we may arbitrarily redefine f on a countable Q.)

Proof

Let F=f on IP. Then F=g on I(PQ). The rest is clear.

Corollary 5.5.5 (integration by parts)

Let f and g be real or complex (or let f be scalar valued and g vector valued), both relatively continuous on I and differentiable on IQ. Then if fg exists on I, so does fg, and we have

bafg=f(b)g(b)f(a)g(a)bafg for any a,bI.

Proof

By assumption, fg is relatively continuous and finite on I, and

(fg)=fg+fg on IQ.

Thus, setting H=fg, we have H=(fg+fg) on I. Hence by Corollary 1 if fg exists on I, so does ((fg+fg)fg)=fg, and

bafg+bafg=ba(fg+fg)=H(b)H(a)=f(b)g(b)f(a)g(a).

Thus (2) follows.

The proof of the next three corollaries is left to the reader.

Corollary 5.5.6 (additivity of the integral)

If f exists on I then, for a,b,cI, we have

(i) baf=caf+bcf;

(ii) aaf=0; and

(iii) abf=baf.

Corollary 5.5.7 (componentwise integration)

A function f:E1En(Cn) is integrable on I iff all its components (f1,f2,,fn) are, and then by Theorem 5 in §1)

baf=(baf1,,bafn)=nk=1ekbafk for any a,bI.

Hence if f is complex,

baf=bafre+ibafim

(see Chapter 4, §3, Note 5).

Examples (continued)

(c) Define f:E1E3 by

f(x)=(acosx,asinx,2cx),a,cE1.

Verify that

π0f(x)dx=(asinx,acosx,cx2)|π0=(0,2a,cπ2)=2aj+cπ2k.

(d) π0eixdx=π0(cosx+isinx)dx=(sinxicosx)|π0=2i.

Corollary 5.5.8

If f=0 on IQ, then f exists on I, and

|baf|=ba|f|=0 for a,bI.

Theorem 5.5.2 (change of variables)

Suppose g:E1E1 (real) is differentiable on I, while f:E1E has a primitive on g[I], exact on g[IQ].

Then

f(g(x))g(x)dx(i.e.,(fg)g)

exists on I, and for any a,bI, we have

baf(g(x))g(x)dx=qpf(y)dy, where p=g(a) and q=g(b).

Thus, using classical notation, we may substitute y=g(x), provided that we
also substitute dy=g(x)dx and change the bounds of integrals (3). Here we treat the expressions dy and g(x)dx purely formally, without assigning them any separate meaning outside the context of the integrals.

Proof

Let F=f on g[I], and F=f on g[IQ]. Then the composite function H=Fg is relatively continuous and finite on I. (Why?) By Theorem 3 of §1,

H(x)=F(g(x))g(x) for xIQ;

i.e.,

H=(Fg)g on IQ.

Thus H=(fg)g exists on I, and

ba(fg)g=H(b)H(a)=F(g(b))F(g(a))=F(q)F(p)=qpf.

Note 3. The theorem does not require that g be one to one on I, but if it is, then one can drop the assumption that f is exact on g[IQ]. (See Problem 4.)

Examples (continued)

(e) Find π/20sin2xcosxdx.

Here f(y)=y2,y=g(x)=sinx,dy=cosxdx,F(y)=y3/3,a=0, b=π/2,p=sin0=0, and q=sin(π/2)=1, so (3) yields

π/20sin2xcosxdx=10y2dy=y33|10=130=13.

For real functions, we obtain some inferences dealing with inequalities.

Theorem 5.5.3

If f,g:E1E1 are integrable on I=[a,b], then we have the following:

(i) f0 on IQ implies baf0.

(i') f0 on IQ implies baf0.

(ii) fg on IQ implies

bafbag (dominance law).

(iii) If f0 on IQ and acdb, then

bafdcf (monotonicity law).

(iv) If baf=0, and f0 on IQ, then f=0 on some IP,P countable.

Proof

By Corollary 4, we may redefine f on Q so that our assumptions in (i)-(iv) hold on all of I. Thus we write "I" for "IQ."

By assumption, F=f and G=g exist on I. Here F and G are relatively continuous and finite on I=[a,b], with F=f and IP, for another countable set P (this P cannot be omitted). Now consider the cases (i)-(iv). (P is fixed henceforth.)

(i) Let f0 on I; i.e., F=f0 on IP. Then by Theorem 2 in §4, F on I=[a,b]. Hence F(a)F(b), and so

baf=F(b)F(a)0.

One proves (i') similarly.

(ii) If fg0, then by (i),

ba(fg)=bafbag0,

so bafbag, as claimed.

(iii) Let f0 on I and acdb. Then by (i),

caf0 and bdf0.

Thus by Corollary 6,

baf=caf+dcf+bdfdcf,

as asserted.

(iv) Seeking a contradiction, suppose baf=0,f0 on I, yet f(p)>0 for some pIP (P as above), so F(p)=f(p)>0.

Now if ap<b, Lemma 1 of §2 yields F(c)>F(p) for some c(p,b]. Then by (iii),

bafcpf=F(c)F(p)>0,

contrary to baf=0; similarly in case a<pb.

Note 4. Hence

ba|f|=0 implies f=0 on [a,b]P

(P countable), even for vector-valued functions (for |f| is always real, and so Theorem 3 applies).

However, baf=0 does not suffice, even for real functions (unless f is signconstant). For example,

2π0sinxdx=0, yet sinx

See also Example (b).

Corollary \PageIndex{9} (first law of the mean)

If f is real and \int f exists on [a, b], exact on (a, b), then

\int_{a}^{b} f=f(q)(b-a) \text { for some } q \in(a, b).

Proof

Apply Corollary 3 in §2 to the function F=\int f. \quad \square

Caution: Corollary 9 may fail if \int f is inexact at some p \in(a, b). (Exactness on [a, b]-Q does not suffice, as it does not in Corollary 3 of §2, used here.) Thus in Example (b) above, \int_{-2}^{2} f=0. Yet for no q is f(q)(2+2)=0, since f(q)=\pm 1. The reason is that \int f is inexact just at 0, an interior point of [-2,2].


This page titled 5.5: Antiderivatives (Primitives, Integrals) is shared under a CC BY 3.0 license and was authored, remixed, and/or curated by Elias Zakon (The Trilla Group (support by Saylor Foundation)) via source content that was edited to the style and standards of the LibreTexts platform.

Support Center

How can we help?