Chapter VII · Additional theorems in the differential and integral calculus
Definite integrals and areas
Upper and lower sums squeeze a single number between them when is continuous; that number is the area under the graph, and the definite integral.
Why this matters
In §148 Hardy proved that the area under a curve has derivative , and used this to compute areas. But that argument assumed that a curved region has an area at all. Rectangles and polygons have areas by elementary geometry; nothing so far tells us what the area of a region bounded by a curve even means. §161 fills this gap: it defines the area as the common limit of two families of rectangle sums and proves that the limit exists whenever is continuous. §162 then names the result the definite integral. Everything later in the book that rests on an integral (the logarithm in Chapter IX, the measure of angles in the next lesson, the remainder in Taylor’s theorem) rests on this construction.
The idea
Cut the interval into pieces. On each piece, build two rectangles: a short one whose height is the least value of on the piece, and a tall one whose height is the greatest value. The short rectangles fit inside the region under the curve; the tall ones cover it. So whatever the area is, it must lie between the total of the short rectangles, the lower sum , and the total of the tall ones, the upper sum .
If the area is to be a well-defined number, the gap between the two must close as the pieces get finer. The widget lets you test this, one division point at a time.
Try this. Click anywhere in the upper plot to add a division point there, or use the buttons. Watch and after each new point. Then press “New partition” and build a quite different partition: compare its sums with the ones you made before.
- y = f(x)
- lower sum s: height m_v, the least value on the piece
- upper sum S: height M_v, the greatest value
- division points (click the plot to add one)
- lower sums s
- upper sums S
- the area (what both close in on)
- a new partition was started
What to notice
A new point never lowers and never raises : on a smaller piece the least value can only be larger and the greatest value only smaller. In the lower plot, every blue dot (a lower sum) stays below every ochre dot (an upper sum), even across different partitions. And the gap is controlled by the largest oscillation on a single piece, which shrinks once every piece is short.
Three facts are visible in the experiment, and they are exactly the three steps of Hardy’s proof.
- Refining helps. Adding points can only raise and lower .
- Lower never beats upper. Any lower sum is at most any upper sum, even for two unrelated partitions. The trick is to compare both with the partition that uses all the points of both.
- Continuity closes the gap. For a continuous function, the oscillation on a short enough piece is as small as we please, uniformly along the interval; so is small once every piece is short.
Steps 1 and 2 hold for any bounded function. Only step 3 uses continuity, and without it the gap may never close (see the third exercise).
Precise statements
Hardy writes for the closed interval, which we write .
A partition of is a finite set of points . Write for the length of the -th piece , and let and be the lower and upper bounds of on that piece. The lower sum and upper sum of the partition are
If and are the bounds of on the whole of , then for every partition. So the set of all lower sums has a least upper bound, which we call , and the set of all upper sums has a greatest lower bound, .
If a partition is refined by adding further points, its lower sum does not decrease and its upper sum does not increase.
If is the lower sum of one partition and the upper sum of another, then . Consequently .
If is continuous on , then . More precisely, for every there is a such that
for every partition all of whose pieces are shorter than . Thus and tend to the common value as the pieces shrink, and the same is true of every sum , where is the value of at any point of the -th piece.
For continuous , the common value is the area under the graph between and , and is written
The numbers and are the lower and upper limits of the integral, is the integrand, and the range of integration.
The sums with arbitrary sample points are what are now called Riemann sums; the theorem says that the definite integral is their limit as the longest piece tends to . Notice also that is a number: it depends on , and the function , but not on . The letter is a dummy, and is the same number.
The indefinite integral
Now let the upper limit vary. §162 observes that the two kinds of integral are one idea seen from two sides.
If is continuous on an interval containing , then has derivative . In particular is continuous, and if is any function with then .
Hardy proved in §148, assuming the area existed; now the assumption is a theorem, so the proof stands. (We give it again, from the properties of the integral, in General properties of the definite integral.) The last sentence follows because has zero derivative, hence is constant (§126).
Try this. Drag along the axis and watch the shaded area under (top) become the height of the graph below. Move to the left of .
- f(t)
- counts +
- counts −
- F(x)
- x (drag)
What to notice
The lower graph is a function defined only by an area: nothing else tells us what it is. Its slope at is the height above. For the area is counted negatively, because the integral runs from down to . This function is , and this is the proof that it exists.
Hardy draws exactly this conclusion: since is continuous for , the function exists, which justifies the logarithm that §131 had to take for granted. Chapter IX builds the whole theory of and on it.
Proofs
Adding several points is the same as adding them one at a time, so it is enough to add one point inside one piece . Only that piece’s term changes.
The old term
Before the new point, this piece contributes to , where is the least value of on the whole piece.
The two new terms
After it, the piece is replaced by and , with lower bounds and . Each is a lower bound over a smaller set, so and .
Compare
. So does not decrease. The same argument with upper bounds, which can only fall on a smaller set, shows that does not increase.
Two arbitrary partitions cannot be compared directly, because their pieces do not line up. So compare each of them with their common refinement: the partition whose points are all the points of both.
Form the common refinement
Let have sums and have sums . Let consist of every point of and every point of , with sums .
Apply the lemma twice
refines , so . It also refines , so .
Within one partition, lower is below upper
On every piece , so . Chaining, .
Pass to the bounds:
Suppose . By the definitions of upper and lower bounds there is a lower sum and an upper sum , and then , contradicting what we have just proved. (The two sums need not come from the same partition, which is why we needed the general statement.)
Make small by making every oscillation small, which continuity allows once the pieces are short. Then split into three non-negative parts, one of which is the fixed number ; a fixed non-negative number smaller than every is .
Uniform control of oscillation
Let . Because is continuous on the closed interval , there is a such that varies by less than on every subinterval shorter than (§107, Theorem II: continuity on a closed interval is uniform). So if every , then for every . (Hardy’s here is our mesh bound; his are the piece lengths.)
The gap is small
For such a partition, .
Split the gap
. Each bracket is : because is a lower bound of the upper sums, by the previous theorem, and because is an upper bound of the lower sums. So each is less than .
Conclude
does not depend on , and it is less than every positive ; so . The other two brackets give and whenever all pieces are shorter than .
Riemann sums with any sample points
On each piece , so , and is trapped in the interval , which contains and has length less than . Hence .
Worked examples and exercises
Divide into equal pieces and compute the lower and upper sums of exactly. Show that both tend to and that .
Hint
Hint
Solution
The pieces are for , each of length , with and . Hence
Dividing out, and , and both tend to . Finally : the two sums differ only by the last tall rectangle against the first short one, .
Let be increasing on and divide into equal pieces. Show that , and draw the picture that makes this obvious.
Hint
Solution
With for every ,
because the sum telescopes. In the picture (Hardy’s Fig. 45), the strips by which the tall rectangles exceed the short ones can be slid sideways into a single column of width and height . This proves the existence of the integral of a monotone function directly, even a discontinuous one.
Let when is rational and when is irrational, on . Find every lower sum and every upper sum. What are and ? Which step of the existence proof fails?
Hint
Solution
On every piece, however short, takes both values and , so and . Hence and for every partition, and . Steps 1 and 2 of the proof (refinement, and ) still hold, as they must. What fails is the first step of the existence proof: the oscillation on every piece is , however short the pieces are, because is continuous nowhere. Such a function has no area in the sense of §161.
Using the partition , show that . Then use the partition into four equal pieces to improve both bounds.
Hint
Solution
On and the greatest values of are and , and the least are and . So
The integral lies between them, and strictly, because is not constant on any piece. With the points the values are , and
The integral is . By the monotone exercise, , and indeed.
Show that for on , the Riemann sum that uses the midpoint of each piece equals for every partition, equal or not. Why does this not contradict the fact that ?
Hint
Solution
Each term is , so the sum telescopes to . There is no contradiction: always lies between and , and here it happens to land exactly on the limit, because the error of a midpoint rectangle is zero for a straight line (the triangle cut off on one side equals the one added on the other).
Check yourself
You add one division point to a partition. What can happen to the lower sum and the upper sum ?
On a smaller piece the least value of can only be larger and the greatest value only smaller, so the inner rectangles grow and the outer ones shrink. The number of rectangles is irrelevant. They can stay the same (for instance when is constant on the piece being split), but they never move the wrong way.
If and are any two partitions of (not necessarily related), the lower sum of is at most the upper sum of .
True, for every bounded function, continuous or not. The proof compares both with the common refinement : .
For on divided into equal pieces, what is ?
For an increasing function with equal pieces, . Directly: and .
If is continuous on and some partition has , then is constant on .
True. is a sum of non-negative terms with every , so it is only if on every piece, that is, is constant on each piece. Neighbouring pieces share an endpoint, so the constants agree.
On which of these does the number depend?
The integral is a single number (). The is a dummy: is the same. It is defined as a limit, so it does not depend on any one partition, and any two antiderivatives differ by a constant, which cancels in .
Hardy’s language
But nothing which we know so far provides us with a direct definition of the area of a figure bounded by curved lines.
Summary
- The lower sum (short rectangles) and upper sum (tall rectangles) bracket any reasonable notion of the area.
- Refining a partition raises and lowers ; through the common refinement, every lower sum is at most every upper sum, so .
- For continuous , uniform continuity makes once the pieces are short, so : this number is the area, , and every Riemann sum tends to it.
- has derivative ; this justifies §148 and proves that exists.