Riemann sums, and what 'area under the curve' really means
Building the definite integral from rectangles, and why midpoint sums converge so much faster.
The definite integral is defined as a limit of sums. We chop the interval into pieces, build a rectangle on each, add up their areas, and ask what happens as .
The setup
With a uniform partition of width , a Riemann sum is
S_n = Σ f(x_i*) · h for i = 0 … n-1
where is some sample point inside the -th subinterval. Choosing the left endpoint, right endpoint, or midpoint gives different approximations that all converge to the same integral.
Why midpoint wins
Left and right sums have error that shrinks like . The midpoint and trapezoid rules cancel the leading error term, so they shrink like , dramatically faster.
Don't take my word for it. Open the Riemann sums simulator, switch between methods, and watch the error column as you drag . Midpoint with 12 rectangles often beats left sums with 100.