6.2 Approximating Areas with Riemann Sums
- Syllabus
- 2020
- Topic
- 6.2
- Level
- —
To approximate ∫abf(x)dx, partition [a,b] at a=x0<x1<⋯<xn=b. On each subinterval, multiply its own width Δxi=xi−xi−1 by a height chosen by the stated method, then add. This works for equal or unequal widths.
| Method | Height on [xi−1,xi] | Useful error clue |
|---|---|---|
| Left | f(xi−1) | increasing: under; decreasing: over |
| Right | f(xi) | increasing: over; decreasing: under |
| Midpoint | f((xi−1+xi)/2) | concave up: under; concave down: over |
| Trapezoidal | [f(xi−1)+f(xi)]/2 | concave up: over; concave down: under |
L=\sum_{i=1}^n f(x_{i-1})\Delta x_i,\quad R=\sum_{i=1}^n f(x_i)\Delta x_i,\quad T=\sum_{i=1}^n \frac{f(x_{i-1})+f(x_i)}{2}\Delta x_i
Suppose a table gives x=0,1,3,4 and f(x)=2,4,5,3. The widths are 1,2,1, not all equal. The left sum is 2(1)+4(2)+5(1)=15. The right sum is 4(1)+5(2)+3(1)=17. The trapezoidal sum is 22+4(1)+24+5(2)+25+3(1)=16.
Do not replace every Δxi by (b−a)/n unless the partition is uniform. An error direction also requires the relevant behavior across the interval: monotonicity supports left/right judgments, while concavity supports midpoint/trapezoidal judgments. Without that information, calculate the approximation but do not guess over or under.