Lower Sum — Definition, Formula & Example
A lower sum is an estimate of the area under a curve in which every rectangle's height is the smallest value the function takes on its subinterval. Each rectangle fits under the graph, so the total is never more than the true area.
Let be bounded on , and let be a partition with . The lower sum of with respect to is , where is the infimum (greatest lower bound) of on and . For any two partitions, every lower sum is less than or equal to every upper sum.
Key Formula
Where:
- = the lower sum of for the partition
- = the smallest value of on the th subinterval, or its greatest lower bound if never reaches a minimum there
- = the width of the th subinterval,
- = the number of subintervals in the partition
Worked Example
Problem: Find the lower sum for on using 3 subintervals of equal width. Compare it with the left-endpoint sum and the exact area.
Step 1: Find the width and the partition.
Step 2: decreases on , so its smallest value on each subinterval is at the right endpoint.
Step 3: Multiply each minimum by the width and add.
Step 4: Compare. For a decreasing function the left endpoints give the largest values, so the left-endpoint sum is the upper sum here.
Answer: The lower sum is , which is at most the exact area . The left-endpoint sum, , is not a lower sum here: for a decreasing function it is the upper sum.
Why It Matters
Lower and upper sums trap the definite integral between them. When you refine the partition, lower sums never decrease and upper sums never increase. A bounded function is integrable exactly when the least upper bound of all lower sums equals the greatest lower bound of all upper sums. This squeeze argument is how many college real analysis courses define the integral, and AP Calculus free-response questions ask you to decide whether a Riemann sum overestimates or underestimates.
Common Mistakes
Mistake: Treating every left Riemann sum as a lower sum.
Correction: Left endpoints are guaranteed to give the minimum when the function is increasing (or non-decreasing); in general you must check where the smallest value on each subinterval occurs. For a decreasing function, the minimum on each subinterval is at the right endpoint. If the function turns around inside a subinterval, check the critical points as well as the endpoints.
