Equal strips are convenient, but nothing about area requires them. A surveyor measuring a field along a river might take readings closer together where the bank bends and farther apart where it runs straight. Allowing uneven pieces and any sample point in each piece gives the general sums that the definite integral is built from.
Key terms
Partition
Definition A partition of a closed interval with is a finite set of points
It splits into the subintervals with widths , and these widths add up to .
In plain words A partition is a list of cut points that starts at , ends at and goes strictly upward. The pieces need not have the same width.
Example The set is a partition of into four subintervals with widths , , and , which add to .
Mesh of a partition
Definition The mesh, also called the norm, of a partition is the width of its widest subinterval,
In plain words The mesh measures how coarse the partition is. A small mesh guarantees that every piece is thin, which a large number of pieces alone does not.
Example For the widths are , so . For the partition of into equal parts the mesh is . The partition has three pieces of which two are tiny, yet its mesh is .
Tagged partitions and arbitrary sample points
Definition A tagged partition of is a partition together with a choice of sample points, or tags, with
Each tag may be any point of its subinterval, endpoints included. Left endpoints , right endpoints and midpoints are common choices, but none is required.
In plain words In every piece you pick one point where you will read the height of the function. You are free to pick it anywhere in that piece.
Example On the midpoints are the tags . Choosing instead is also allowed, since is an endpoint of both the second and third pieces.
Riemann sum
Definition Let be defined on and let be a partition with tags . The Riemann sum of for this tagged partition is
No sign condition on is needed. Terms where are negative.
In plain words Multiply each sampled height by the width of its piece and add. When is nonnegative this is the total area of a row of rectangles, and when dips below the axis those rectangles count negatively.
Example Take on with and midpoint tags.
| Piece | Width | Tag | Product | |
|---|---|---|---|---|
The Riemann sum is . The exact area under on is , so even this coarse sum is close.
Lower and upper Darboux sums
Definition Let be bounded on and let be a partition. On each subinterval put
The lower and upper Darboux sums are
For every choice of tags, , so every Riemann sum for lies between and . When is continuous, and are the minimum and maximum of on the piece.
In plain words The lower sum uses the lowest height on each piece and the upper sum the highest. Together they bracket every Riemann sum you could build on that partition.
Example For on , is increasing, so and .
The midpoint sum sits between them, as it must.
Refinement
Definition A partition of is a refinement of if . For bounded ,
Consequently, for any two partitions and , , which follows by comparing both with the common refinement .
In plain words Adding cut points can only raise the lower sum and lower the upper sum. Every lower sum is below every upper sum, no matter which partitions they come from.
Example Add the point to the partition above, so . For ,
The lower sum rose from and the upper sum fell from .
Why the choice of sample points stops mattering
Definition Suppose is bounded on and there is a sequence of partitions with and both sums tending to a number . Then the Riemann sums on tend to as well, however the tags are chosen, and the choice may change from one to the next. The reason is that each such sum lies between and , so the squeeze theorem applies.
In plain words Once the lower and upper sums squeeze together, any sum you build in between is squeezed too. Left, right, midpoint or a random point all give the same limit.
Example Let on with equal pieces. The lower sum uses left endpoints and the upper sum right endpoints,
Both tend to , so every Riemann sum on these partitions, with tags placed anywhere, tends to .
Check yourself
- Find the mesh of the partition of .
Show the answer
The widths are , so the mesh is .
- For on with the partition , compute the Riemann sum with right endpoint tags and with left endpoint tags.
Show the answer
Right endpoints give . Left endpoints give . Since is increasing these are the upper and lower Darboux sums.
- For a bounded and a partition , can a Riemann sum on ever be larger than ?
Show the answer
No. Each tag satisfies , and multiplying by and adding gives a Riemann sum at most .