The area under y = x² from 2 to 6, approximated with four rectangles and then computed exactly as a limit of Riemann sums.
The shaded region below is bounded by the curve y=x2, the x-axis, and the vertical lines x=2 and x=6. We want to find its area.
The region under y = x² from x = 2 to x = 6.
There is no area formula for a region with a curved boundary, as there is for a rectangle or a triangle. We approximate the region with rectangles, whose areas we can compute, and then take a limit to make the approximation exact.
Four rectangles, right endpoints
Divide the interval [2,6] into four subintervals of equal width. The width of each subinterval is
Δx=46−2=1.
The four subintervals are [2,3], [3,4], [4,5] and [5,6]. On each subinterval we draw a rectangle whose height is the value of f at the right endpoint: f(3)=9, f(4)=16, f(5)=25 and f(6)=36.
R₄: four rectangles of width 1, with heights f(3), f(4), f(5) and f(6).
The area of each rectangle is height times width. The sum of the four areas is the right Riemann sum with four rectangles, written R4:
R4=f(3)Δx+f(4)Δx+f(5)Δx+f(6)Δx=9+16+25+36=86.
Since f is increasing on [2,6], each rectangle extends above the curve. Thus R4=86 is an overestimate of the area.
Four rectangles, left endpoints
We use the same four subintervals, so again Δx=1. Now the height of each rectangle is the value of f at the left endpoint: f(2)=4, f(3)=9, f(4)=16 and f(5)=25.
L₄: the same four subintervals, with heights f(2), f(3), f(4) and f(5).
L4=f(2)Δx+f(3)Δx+f(4)Δx+f(5)Δx=4+9+16+25=54.
Every rectangle lies below the curve, so L4=54 is an underestimate. Thus the exact area A satisfies
54<A<86.
More rectangles
With four rectangles the approximation is rough. Use the slider to increase the number of rectangles n. The readout shows the Riemann sum, the exact area, and the error. Compare the left and right sums: at n=4 they differ by 32, and both approach the same value as n increases.
Any number of rectangles
The same construction works for any number of rectangles. Take an interval [a,b] and divide it into n subintervals of equal width. We use right endpoints.
R₁₆: sixteen rectangles with right endpoints. The overestimate is smaller.
The width of each rectangle is
Δx=nb−a,
and the right endpoints are
x1=a+Δx,x2=a+2Δx,…,xi=a+iΔx,…,xn=b.
The i-th rectangle has height f(xi) and width Δx. The sum of the n areas is the approximate area,
Rn=f(x1)Δx+f(x2)Δx+⋯+f(xn)Δx=i=1∑nf(xi)Δx,
and the exact area is the limit of this sum as n→∞:
A=n→∞lim[f(x1)Δx+f(x2)Δx+⋯+f(xn)Δx].
It can be proved that this limit always exists when f is continuous. It can also be shown that we get the same value using left endpoints, where x0=a:
We cannot finish this computation yet. The sum has n terms, and n is a variable, so the terms cannot be written out and added. To take the limit we need closed-form formulas for ∑i=1n1, ∑i=1ni and ∑i=1ni2. These formulas come from the sequences and series unit of Algebra 2 or Precalculus.
Summation formulas
The properties let us split a sum term by term and factor out constants. Note that n is a constant with respect to the index i, so any power of n can be factored out of the sum.
Computing the exact area
We split the sum into three sums and factor out the constants:
This is a formula for Rn for any n. As a check, n=4 gives 16+40+30=86, which is R4. Now we take the limit. Since nn+1→1 and n2(n+1)(2n+1)→2 as n→∞,
A=n→∞limRn=16+32+364=3208≈69.33.
The exact area is 3208≈69.33. Note that L4=54<3208<R4=86, as expected.