Integration is vital to many scientific areas. Many powerful mathematical tools are based on integration. Differential equations for instance are the direct consequence of the development of integration.
So what is integration? Integration stems from two different problems. The more immediate problem is to find the inverse transform of the derivative. This concept is known as finding the antiderivative. The other problem deals with areas and how to find them. The bridge between these two different problems is the Fundamental Theorem of Calculus.
What is the "area problem"? We want to find the area of a given region in the plane. It is not hard to see that this problem can be reduced to finding the area of the region bounded above by the graph of a positive function f (x), bounded below by the x-axis, bounded to the left by the vertical line x = a, and to the right by the vertical line x = b.
The answer to this problem came through a very nice idea. Indeed, let us split the region into small subregions which we can approximate by rectangles or other simple geometrical figures (whose areas we know how to compute). This is how it goes: split the interval [a, b] into subintervals, preferably with the same width x,
x0 = a < x1 < x2 < ... < xn = b
with xi + 1 - xi = x = , for i = 0, 1, ... , n - 1.Let be the subregion bounded above by the graph of f (x), bounded below by the x-axis, bounded to the left by x = xi - 1, and to the right by x = xi, for i = 1, ... , n. Clearly we have
Area() = Area() + Area() + ... + Area() .
So we focus on the subregions , for i = 1, ... , n. Since we want to approximate the regions by rectangles, then we only have to worry about the upper boundary of each region (since on the other sides we already have straight lines). Again: We are looking for good approximations of the regions by rectangles.
The easiest way to choose a height for our rectangles is to choose the value of the function at the left (or right) end points of the small intervals [xi - 1, xi].
Let Li be the rectangle defined by the left-end point and Ri be the rectangle defined by the right-end point. Then an approximation to Area() is given by
Area(L1) + Area(L2) + ... + Area(Ln) = xf (x0) + xf (x1) + ... + xf (xn - 1)
which we will call the left-sum denoted LEFT(n), and
Area(R1) + Area(R2) + ... + Area(Rn) = xf (x1) + xf (x2) + ... + xf (xn)
which we will call the right-sum denoted RIGHT(n)Example. Consider the function
f (x) = x2
for x [0, 1]. Let us split the interval into 4 subintervals. We have
x0 = 0 , x1 = , x2 = , x3 = , x4 = 1 .
We have x = and
LEFT(4) = 02 + + + =
and
RIGHT(4) = + + + 12 = .
Note that Area() equals , a result which we will prove in later pages.Indeed if the function f (x) is not too badly behaved, we will show that when n gets larger, the numbers LEFT(n) and RIGHT(n) get closer to Area(), i.e.
Area() = LEFT(n) = RIGHT(n) .
This is the main idea described above. The number Area() is called the definite integral (or more simply the integral) of f (x) from a to b and is denoted by
f (x) dx .
Note that in the expression f (x) dx the variable x may be replaced by any other variable.
Example. Let 0. Then we have
dx = (b - a) .
This is true since the region is simply a rectangle.Example. We have
x dx = (b2 - a2) .
Indeed, the region is simply the union of two regions: one rectangle and one triangle.
The rectangle (depicted in red) is bounded above by x = a and its area is a(b - a). The triangle (in blue) is determined by the points: (a, a), (a, b), and (b, b). Its area is (b - a)2. So we have
xdx = a(b - a) + (b - a)2 = (b2 - a2) .
A precise definition for the definite integral involves partitions and lower as well as upper sums:
Definition. A partition P of the interval [a, b] is a sequence of numbers {xi;i = 0, 1, ... , n} such that
x0 = a < x1 < x2 < ... < xn = b
For a function f (x) defined on [a, b] and a partition P of [a, b], set
mi = inf{f (x); x [xi - 1, xi]} and Mi = sup{f (x); x [xi - 1, xi]}
for i = 1, ... , n, provided that f (x) is bounded on [a, b]. The sum
Lf(P) = m1(x1 - x0) + m2(x2 - x1) + ... + mn(xn - xn - 1)
is called the lower sum for f (x) over the partition P, and
Uf(P) = M1(x1 - x0) + M2(x2 - x1) + ... + Mn(xn - xn - 1)
is called the upper sum for f (x) over the partition P.Theorem. We have
Lf(P) Area() Uf(P)
for any partition P of [a, b]. Moreover if f (x) is continuous on [a, b], except maybe at a finite number of points, and I is a number such that
Lf(P) I Uf(P)
for any partition P of [a, b], then I = Area().This theorem is fundamental. Let us illustrate this with the following example.
Example. Use the above theorem to show
x2dx = (b3 - a3)
where b a 0. Let P = {x0, x1, ... , xn} be a partition of [a, b]. Since f (x) = x2 is increasing on [a, b], then mi = xi - 12 and Mi = xi2. So we have
Uf(P) = x21(x1 - x0) + x22(x2 - x1) + ... + x2n(xn - xn - 1)
and
Lf(P) = x20(x1 - x0) + x21(x2 - x1) + ... + x2n - 1(xn - xn - 1) .
For each i, we have
xi - 12 xi - 12 + xi - 1xi + xi2 xi2
since xi - 1 xi. If we multiply by xi - xi - 1, we get
xi - 12(xi - xi - 1) xi - 12 + xi - 1xi + xi2(xi - xi - 1) xi2(xi - xi - 1) .
But
xi - 12 + xi - 1xi + xi2(xi - xi - 1) = xi3 - xi - 13
which implies
xi - 12(xi - xi - 1) (xi3 - xi - 13) xi2(xi - xi - 1) .
Hence
Lf(P) (b3 - a3) Uf(P)
since
(x13 - x03) + (x23 - x13) + ... + (xn3 - xn - 13) = b3 - a3 .
No comments:
Post a Comment