Riemann Sums as Structured Finite Summations

You have a curve, you want the area under it, and you have a calculator that can add numbers but not integrate. The answer is the Riemann sum, which turns that area problem into a structured finite summation of rectangle areas. Each rectangle has a width and a height, the height is the function's value at a sample point inside that rectangle, and summing those widths times heights gives a number that approximates the definite integral. One concrete example shows exactly how function samples and widths become that finite sum, then names when the method fails.

The core structure is Σ_{k=1}^{n} f(x_k*) Δx. The Greek capital sigma (Σ) tells you to add, k is the index that counts each subinterval, n is the number of subintervals, Δx is the width of each subinterval, and x_k* is the sample point inside the k-th subinterval. The sum of these products approximates the integral ∫_a^b f(x) dx. The approximation improves as n increases, but the sum itself remains a finite summation, a polynomial in n when f is a polynomial, not an infinite series.

Use the page-specific fact sheet values: approximate ∫_0^2 x^2 dx with n = 4 subintervals and right endpoints. Δx = (2 − 0)/4 = 0.5. The sample points are x_k* = a + kΔx = 0 + k(0.5), so x_1* = 0.5, x_2* = 1.0, x_3* = 1.5, x_4* = 2.0. The structured summation is Σ_{k=1}^{4} f(x_k*) Δx = Σ_{k=1}^{4} (x_k*)^2 × 0.5.

Compute Term by Term

k=1: f(0.5) = (0.5)^2 = 0.25, times Δx = 0.125. k=2: f(1.0) = 1, times 0.5 = 0.5. k=3: f(1.5) = 2.25, times 0.5 = 1.125. k=4: f(2.0) = 4, times 0.5 = 2. Sum = 0.125 + 0.5 + 1.125 + 2 = 3.75. That finite sum, 3.75, is the Riemann sum approximation of the integral.

Exact Integral for Comparison

The exact value of ∫_0^2 x^2 dx is [x^3/3]_0^2 = 8/3 ≈ 2.6667. The Riemann sum of 3.75 overestimates because x^2 is increasing on [0,2]; right endpoints produce rectangles taller than the curve on each subinterval. The error is 3.75 − 2.6667 = 1.0833, about 40.6% of the true value, a poor approximation for n=4.

To reproduce the calculation for any function, interval, and n, follow these steps. First, compute Δx = (b − a)/n. Second, determine the sample points based on your chosen rule, left endpoints use x_k* = a + (k−1)Δx, right endpoints use x_k* = a + kΔx, midpoints use x_k* = a + (k−0.5)Δx. Third, evaluate f at each x_k*. Fourth, multiply each f(x_k*) by Δx. Fifth, sum all products using the Σ notation.

For the example with n=4, right endpoints, and f(x)=x^2 on [0,2], the calculation yields 3.75. Try n=8: Δx = 0.25, sample points 0.25, 0.5, 0.75, 1.0, 1.25, 1.5, 1.75, 2.0. The sum is (0.0625+0.25+0.5625+1+1.5625+2.25+3.0625+4)×0.25 = 12.75×0.25 = 3.1875. The error drops to 0.5208, about 19.5% of the true value. As n increases, the approximation converges toward 2.6667.

When you need to verify a manual calculation for a problem with many subintervals, use a riemann sum calculator on your TI-84 Plus CE. Press MATH, select 0:Σ(, enter the expression f(x_k*) Δx as a function of k, set the index bounds from 1 to n, and read the result. The calculator's Σ( template runs the structured finite summation automatically, but the list length limit of 999 terms applies if you use the sum(/seq( method instead.

The question, how do function samples and widths become a finite sum that approximates an integral, is answered by the sigma notation itself. Each sample point x_k* is the function input, f(x_k*) is the output (the rectangle height), and Δx is the rectangle width. The product f(x_k*) Δx is the area of one rectangle. Summing those areas over all k from 1 to n gives a finite sum that approximates the integral. The integral is the limit of that sum as n → ∞ and Δx → 0, but the Riemann sum itself is always a structured finite summation of n terms.

Why It Is a Structured Summation

The structure comes from the index k, the bounds 1 and n, and the fixed pattern of the sample points. Unlike an arbitrary list of numbers, the terms in a Riemann sum follow a rule: each term is a specific function evaluation times a constant Δx. That structure makes the sum predictable and allows closed-form evaluation when f is a polynomial. For f(x)=x^2, the sum Σ (a + kΔx)^2 Δx expands into a combination of Σk, Σk^2, and Σk^3, each of which has a known closed form like n(n+1)(2n+1)/6 for Σk^2.

Relation to Numerical Integration

The numerical integration method of Riemann sums is the simplest of several approximation techniques. It directly uses the definition of the definite integral. The supporting terms, function, samples, widths, sum, approximates, integral, all describe the components. The Riemann sum is a finite summation that produces a single number, which is an approximation, not the exact area. The exact integral requires taking a limit.