Integration has its theoretical basis in the idea of finding areas of regions in the plane. That is, to find, for example, the area bounded by the graphs
Using the highest point on each piece (the right-edge of each region gives the height as f(x) , where x is at the right edge), we get:
We'll try it again: now, let's approximate this area using 20 rectangles. The picture is (using the highest points, the circumscribed rectangles):
How do we do this calculation?
The reality is that, for most curves, it doesn't matter whether you use the right edge, or the left, or anywhere in between. You also don't have to take the subintervals to all be the same length, just so they get smaller, to get a better and better approximation of the real area.
We will be spending quite a bit of time dealing with integration as a summation process, and it will get awkward writing down all these sums. We need a better notation. In addition, we need some specific formulas for certain sums, which you may not have seen before. Look through this topic now:
Summation notation and special formulas
Let's look at the process in general, for a function f(x) over an interval [a,b] . Choose any old set of points {x0,x1,... ,xn} to chop the interval [a,b] up into subintervals. Set a = x0 and set b = xn so that we refer to them all the same way. For each of those subintervals, find a point
Then, the ``area under the curve'' is approximated by the sum
The reason the ``area under the curve'' is in quotation marks is that we will still use the idea of this limit of sums, even if the function is negative somewhere, and so the ``area under the curve'' doesn't quite make sense. However, if you count the areas of those regions where f(x) < 0 as negative area, it does give the ``area under the curve'' as this limit of sums.
Definition 1 A partition P of an interval [a,b] is a decomposition of the interval into smaller pieces, as above, a = x0,x1,¼,xn = b . We usually just refer to the numbers x0,¼,xn as the partition P of [a,b] .
The mesh ||P|| of a partition P is the length of the longest section (or subinterval) of the partition, ||P||: = max{x1-x0,x2-x1,¼,xn-xn-1} .
Now comes the formal definition of an integral.
Definition 2 f is some function, defined for x Î [a,b] (you actually can leave out ``a few'' points without causing any problems). For each number d > 0 , choose a partition P = x0,¼,xn of mesh ||P||, and choose (randomly) points xi* Î [xi-1,xi] . The Riemann sum of the function f corresponding to that partition and set of sampling numbers is the sum:
Integration involves a limit of sums. But, the limit is ``sloppy'' in this case in that so many things are not determined: the subintervals themselves, the point you pick in each subinterval, the number of subintervals. Still, rather remarkably, ``most'' functions are integrable in this sense, even ones that are not continuous.
Example 1 If
Hint: Use the formulas for the sum of the first n cubes in the review section, and, as before, presume that the limit exists, so that you can use uniform subintervals and circumscribed rectangles.
Answer:
Proposition 1 Rules
Theorem 1 If f is continuous on [a,b] , then
Use the rules and theorems above to sove the following exercises.
Exercise 2 Find
Hint: Split the integral up into easier pieces, and evaluate the integral of each piece by high-school geometry.
Exercise 3 Show that
Example 4 Show that
Copyright 2000 David L. Johnson