Summary
This lesson turns the idea of the preceding lesson into a definition: the area under a curve is the only number that lies between the sums from below and the sums from above. For a bounded function on a closed interval it defines partitions, their refinement and their norm, and the lower and upper sums, built with the infimum and the supremum of the function on each subinterval. It proves that adding points does not make the lower sum go down or the upper sum go up, and that every lower sum is less than or equal to every upper sum; by the completeness axiom, the supremum of the lower sums and the infimum of the upper ones exist, and they are the lower integral and the upper integral. If they coincide, the function is integrable and that number is its integral. It proves Riemann’s integrability criterion, also with sequences of partitions, and computes from the definition the integrals of a constant, of and of . It shows that every area meeting the requirements of the preceding lesson is the integral, and with it defines the area under a graph. Finally, it defines Riemann sums, with an intermediate point in each subinterval, and their limit as the norm tends to zero, and proves Darboux’s theorem: a function is integrable if and only if its Riemann sums have a limit, and that limit is the integral; in particular, the sums with equal subintervals tend to the integral.
Learning objectives
- Define partitions, lower and upper sums, and the lower and upper integrals of a bounded function, and prove the refinement lemma and its consequences.
- Define the integrable function and its integral, and prove Riemann’s integrability criterion, also in its form with sequences of partitions.
- Define Riemann sums and their limit as the norm tends to zero, and prove Darboux’s theorem, which makes the two definitions of the integral equivalent.
- Compute integrals from the definition, choosing convenient partitions and intermediate points, and read the area under a graph as an integral.
Partitions and lower and upper sums
The lesson on the area problem enclosed several areas between sums of rectangles and ended with three pending tasks: to admit arbitrary divisions of the interval, to admit functions that are not monotonic, with the infimum and the supremum of the function on each subinterval as heights, and to know when the sums from below and from above come as close as desired. This lesson accomplishes the first two and gives the criterion for the third; the lesson on integrable functions will decide which functions meet it.
Let . A partition of is a finite set with . The intervals , with from to , are its subintervals; is the length of subinterval , and the norm of is the largest of those lengths:
If and are partitions of and , we say that is a refinement of . The partition with is called uniform, with subintervals; its norm is .
Two partitions and of always have a common refinement, their union , which is a finite set containing and whose points, in increasing order, form a partition. Each subinterval of a refinement of is contained in a subinterval of , and therefore refining does not increase the norm. The lengths of the subintervals always add up to : by the telescoping sum theorem, from the lesson on summations, progressions and induction, .
Let be a function bounded on , that is, such that there exist numbers and with for every in , and let be a partition of . For each , let and be the infimum and the supremum of the values with . The lower sum and the upper sum of associated with are:
The numbers and exist by the completeness axiom, from the lesson on number systems: the set of values of on subinterval is nonempty and bounded above by , and it has a supremum; the set of the opposites of those values is bounded above by , and the opposite of its supremum is the greatest lower bound of the values, their infimum. Since is a lower bound and the greatest one, ; likewise, ; and . Multiplying by and adding, with the theorem on the properties of summation, from the lesson on summations:
If takes no negative values, is the area of rectangles contained in the region under the graph, and that of rectangles covering it. If is increasing on , the value is a lower bound of the values on subinterval and is one of them, so it is their infimum; likewise, , and with the uniform partition the sums are the and of the preceding lesson.
Let be a function bounded on , and let and be partitions of with . Then:
When a subinterval is divided, the infimum on each piece is not less than the infimum on the whole subinterval, and the supremum is not greater. The figure shows, for a function that is not monotonic, what the lower sum gains and what the upper sum loses when a point is added, and a refinement with more points.
Proof
Suppose first that has only one point more than , a point with . The other subintervals are common. Let and be the infima of on and on . The number is a lower bound of the values of on subinterval , and therefore of the values on each piece; since the infimum is the greatest lower bound, and .
Likewise, if and are the suprema on the two pieces, is an upper bound of the values on each of them, and , . The middle inequality is that of the sums of one and the same partition.
If has points more than , they are added one at a time: , each partition with one point more than the one before it. By induction on , with the first two moves at each addition, the inequalities combine.
Let be a function bounded on . For every pair of partitions and of , . The two partitions may be unrelated to each other, but their union refines both.
Proof
The union is a refinement of and of ; the refinement lemma, applied twice, gives the inequalities.
Loading the content…
Completed
Sign in to save your progress