Home page for accesible maths 1 Integration

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

1.3 Basic properties and estimates

Proposition 1.3.1.

If f:[a,b]→R is a continuous function and λ∈R such that 0≤f⁢(x)≤λ, for all x∈[a,b], i.e., λ is an upper bound for f, then

0≤∫abf⁢(x)⁢d⁡x≤λ⁢(b-a).
Proof.

Let u⁢(f,[a,b],n,⋅) be the upper approximating step function. Since maxx∈[a,b]⁡f⁢(x)≤λ, we have u⁢(f,[a,b],n,x)≤λ⁢𝟏[a,b]⁢(x), for all x∈[a,b] and n∈ℕ, and λ⁢𝟏[a,b] is a step function. Now ∫abf⁢(x)⁢d⁡x≤un(f), for all n∈ℕ, and by Lemma 1.2.8, un(f)≤λ⁢(b-a). The lower bound 0 is proved analogously, which concludes the proof. ∎

This holds also for piecewise continuous f.

Let us now extend Lemmas 1.2.10 and 1.2.9 to continuous functions.

Proposition 1.3.2.

If f,g:[a,b]→R are continuous functions such that f⁢(x)≤g⁢(x), for all x∈[a,b]. Then

∫abf⁢(x)⁢d⁡x≤∫abg⁢(x)⁢d⁡x.
Proof.

W2.1. ∎

This holds also for piecewise continuous f.

Proposition 1.3.3.

If f,g:[a,b]→R are piecewise continuous functions then

∫ab(f⁢(x)+g⁢(x))⁢d⁡x=∫abf⁢(x)⁢d⁡x+∫abg⁢(x)⁢d⁡x.
Proof.

Let us suppose first that f and g are actually continuous. From MATH113 we remember that f+g is continuous again and that the following relation holds: for every compact interval I,

maxx∈I⁡(f+g)⁢(x)≤maxx∈I⁡f⁢(x)+maxx∈I⁡g⁢(x).

This means that

u⁢(f+g,[a,b],n,x)≤u⁢(f,[a,b],n,x)+u⁢(g,[a,b],n,x),x∈[a,b],

which in turn implies

un(f+g)≤un(f)+un(g),n∈ℕ,

owing to Lemma 1.2.8. So

∫ab(f⁢(x)+g⁢(x))=limn→∞⁡un(f+g)≤limn→∞⁡un(f)+limn→∞⁡un(g)=∫abf⁢(x)⁢d⁡x+∫abg⁢(x)⁢d⁡x,

as follows from elementary properties of the limit of sums of convergent sequences, see MATH113.

The analogous procedure for lower approximating step functions yields

ℓ⁢(f+g,[a,b],n,x)≥ℓ⁢(f,[a,b],n,x)+ℓ⁢(g,[a,b],n,x),x∈[a,b],

and

∫ab(f⁢(x)+g⁢(x))=limn→∞⁡ℓn(f+g)≥limn→∞⁡ℓn(f)+limn→∞⁡ℓn(g)=∫abf⁢(x)⁢d⁡x+∫abg⁢(x)⁢d⁡x,

so combining the two inequalities we get

∫ab(f⁢(x)+g⁢(x))=∫abf⁢(x)⁢d⁡x+∫abg⁢(x)⁢d⁡x.

Comment: We say “analogous” when a case is a very simple modification of the previous case, such as a sign switch, or inversion of inequality signs, etc., and every step translates in a straight-forward way to an “analogous” step in the new setting.

Now let us drop our initial assumption of continuity and let f,g be piecewise continuous, so there are ai such that f↾[ai-1,ai) and g↾[ai-1,ai) are continuous, for all i=1,…,n. Notice that the ai are chosen such that they fit both f and g, and so not both f and g need to have a “jump” at each single ai:

Then the previous reasoning applies to each such interval, i.e.,

∫ai-1ai(f⁢(x)+g⁢(x))=∫ai-1aif⁢(x)⁢d⁡x+∫ai-1aig⁢(x)⁢d⁡x,

Comment: It is a common little trick or strategy to first reduce a new situation to an easier or previously treated one and then to prove the statement in that easier situation.

for each i. Summing over i on both sides yields

∫ab(f⁢(x)+g⁢(x))=∫abf⁢(x)⁢d⁡x+∫abg⁢(x)⁢d⁡x.

∎

Key idea of proof.

split into continuous pieces, there apply the theorem for continuous functions

Proposition 1.3.4.

If f:[a,b]→R is a continuous function and a≤c<d≤b. Then f↾[c,d]:[c,d]→R is also continuous and one defines

∫cdf(x)dx:=∫cd(f↾[c,d])(x)dx.

We have

∫abf⁢(x)⁢d⁡x=∫acf⁢(x)⁢d⁡x+∫cdf⁢(x)⁢d⁡x+∫dbf⁢(x)⁢d⁡x.
Proof.

We first notice that

∫cdf⁢(x)⁢d⁡x=∫ab(f⁢𝟏[c,d))⁢(x)⁢d⁡x.

Since f=f⁢𝟏[a,c)+f⁢𝟏[c,d)+f⁢𝟏[d,b], we can apply Proposition 1.3.3 and (*) to obtain

∫abf⁢(x)⁢d⁡x= ∫ab(f⁢𝟏[a,c))⁢(x)⁢d⁡x+∫ab(f⁢𝟏[c,d))⁢(x)⁢d⁡x+∫ab(f⁢𝟏[d,b])⁢(x)⁢d⁡x
= ∫acf⁢(x)⁢d⁡x+∫cdf⁢(x)⁢d⁡x+∫dbf⁢(x)⁢d⁡x.

∎

Again this holds also for piecewise continuous f.

Example 1.3.5.

As an easy application, consider the integral

∫aa+2⁢πsin⁡(x)⁢d⁡x.

We can write

∫aa+2⁢πsin⁡(x)⁢d⁡x=∫aa+πsin⁡(x)⁢d⁡x+∫a+πa+2⁢πsin⁡(x)⁢d⁡x.

Now we know that sin⁡(x+π)=-sin⁡(x), so

∫a+πa+2⁢πsin⁡(x)⁢d⁡x=∫aa+πsin⁡(x+π)⁢d⁡x=∫aa+π-sin⁡(x)⁢d⁡x=-∫aa+πsin⁡(x)⁢d⁡x,

which proves that

∫aa+2⁢πsin⁡(x)⁢d⁡x=∫aa+πsin⁡(x)⁢d⁡x+∫a+πa+2⁢πsin⁡(x)⁢d⁡x=0.

We end the section with a brief definition concerning the case of functions defined on all of ℝ (rather than compact intervals):

Definition 1.3.6.

Given a continuous function

f:ℝ→ℝ,

we define the improper integral of f as

∫-∞∞f⁢(x)⁢d⁡x:=lima→-∞⁡∫a0f⁢(x)⁢d⁡x+limb→∞⁡∫0bf⁢(x)⁢d⁡x

if those limits exist; otherwise ∫-∞∞f⁢(x)⁢d⁡x remains undefined.

This is treated in more detail in other modules, e.g. MATH102 and MATH210.

Remark 1.3.7.

The idea of upper and lower approximating step functions can be applied to a bigger class of functions which need not be (piecewise) continuous functions or step functions, so-called integrable functions. This will be done in MATH210.