A left Riemann sum overestimate or underestimate question depends mainly on whether the function is increasing or decreasing on the interval being approximated. Worth adding: if the function is increasing, a left Riemann sum usually underestimates the definite integral. If the function is decreasing, a left Riemann sum usually overestimates it. When the function changes direction, the result can be mixed, so you need to examine each part of the interval carefully.
Introduction
A left Riemann sum is a method for estimating the area under a curve by using rectangles. Each rectangle’s height is determined by the function value at the left endpoint of a subinterval. This method is one of the first tools students learn in calculus because it connects geometry, functions, and definite integrals in a visual way.
The key question is simple: does the left Riemann sum give an answer that is too high or too low? The answer depends on the behavior of the function. So naturally, if the curve rises from left to right, the left endpoint is lower than most points in the rectangle’s interval, so the rectangle misses some area. If the curve falls from left to right, the left endpoint is higher than most points in the interval, so the rectangle includes extra area.
In short:
- Increasing function: left Riemann sum tends to underestimate
- Decreasing function: left Riemann sum tends to overestimate
- Constant function: left Riemann sum gives the exact value
- Function that changes direction: the sum may overestimate in some parts and underestimate in others
What Is a Left Riemann Sum?
A left Riemann sum approximates the definite integral of a function by dividing the interval into smaller subintervals and using the left endpoint of each subinterval to determine rectangle height The details matter here..
For a function ( f(x) ) on the interval ([a,b]), divide the interval into ( n ) equal subintervals. The width of each rectangle is:
[ \Delta x = \frac{b-a}{n} ]
The left endpoints are:
[ x_0, x_1, x_2, \dots, x_{n-1} ]
The left Riemann sum is:
[ L_n = \sum_{i=1}^{n} f(x_{i-1})\Delta x
To decide whether a left Riemann sum will be an over‑ or underestimate, the first step is to check the sign of the derivative on each subinterval. If (f'(x)>0) throughout ([a,b]), the function is strictly increasing and every left‑hand rectangle falls short of the true area; the sum is an underestimate. Conversely, if (f'(x)<0) everywhere, the function is decreasing and each rectangle sticks out above the curve, giving an overestimate. When (f'(x)=0) on an interval the function is constant there, and the contribution of those rectangles is exact And that's really what it comes down to. But it adds up..
When the derivative changes sign, the interval must be split at the points where (f'(x)=0) (the critical points). On each resulting subpiece the function is monotone, so the simple rule can be applied piecewise. The total error is then the algebraic sum of the errors on the pieces; overestimates on some parts may cancel underestimates on others, which is why a naïve glance at the whole interval can be misleading Simple, but easy to overlook..
Bounding the error
For a continuously differentiable function, the error of a left Riemann sum can be bounded using the Mean Value Theorem. On a subinterval ([x_{i-1},x_i]) there exists a point (c_i) such that
[ f(x_i)-f(x_{i-1}) = f'(c_i)\Delta x . ]
The difference between the true area under (f) on that subinterval and the left‑hand rectangle is
[ \int_{x_{i-1}}^{x_i} f(x),dx - f(x_{i-1})\Delta x = \int_{x_{i-1}}^{x_i} \bigl[f(x)-f(x_{i-1})\bigr]dx = \int_{x_{i-1}}^{x_i} f'(c_i)(x-x_{i-1})dx = \frac{f'(c_i)}{2},(\Delta x)^2 . ]
Taking absolute values and using (M=\max_{[a,b]}|f'(x)|) gives the global bound
[ \bigl| \int_a^b f(x),dx - L_n \bigr| \le \frac{M(b-a)}{2},\Delta x = \frac{M(b-a)^2}{2n}. ]
Thus the error shrinks linearly with the number of subintervals; doubling (n) halves the worst‑case error Most people skip this — try not to..
Worked examples
Increasing function.
Take (f(x)=x^2) on ([0,2]). Here (f'(x)=2x\ge0), so the left sum underestimates. With (n=4), (\Delta x=0.5) and left endpoints (0,0.5,1,1.5) Easy to understand, harder to ignore. Which is the point..
[ L_4 = (0^2+0.5^2+1^2+1.5^2)\times0.In practice, 5 = (0+0. 25+1+2.25)\times0.5 = 3.5\times0.5 = 1.75 .
The exact integral is (\int_0^2 x^2dx = \frac{8}{3}\approx2.667); indeed (L_4) is lower Less friction, more output..
Decreasing function.
Consider (f(x)=e^{-x}) on ([0,1]). Since (f'(x)=-e^{-x}<0), the left sum overestimates. With (n=5), (\Delta x=0.2) and left endpoints (0,0.2,0.4,0.6,0.8) Turns out it matters..
[ L_5 = \bigl(e^{0}+e^{-0.4}+e^{-0.2}+e^{-0.2 \approx 3.6}+e^{-0.Now, 819+0. 549+0.670+0.Which means 2 =0. 2 \approx (1+0.487\times0.But 449)\times0. Think about it: 8}\bigr)\times0. 697 .
To see how the boundbehaves in practice, evaluate the true area for the decreasing example.
[ \int_{0}^{1} e^{-x},dx = \bigl[-e^{-x}\bigr]_{0}^{1}=1-\frac{1}{e}\approx 0.6321 . ]
The left‑hand sum obtained with five subintervals was (L_{5}\approx0.And 697); the absolute error is therefore about (0. 065).
[ \frac{M(b-a)^{2}}{2n}= \frac{1\cdot 1^{2}}{2\cdot5}=0.10 . ]
The actual error lies well within this limit, confirming the usefulness of the bound.
A function with a sign change
Consider (f(x)=\sin x) on ([0,3\pi]). Its derivative (f'(x)=\cos x) changes sign at the points (x=\pi/2,;3\pi/2,;5\pi/2). Splitting the interval at these critical points yields three monotone pieces:
- ([0,\pi/2]) – increasing,
- ([\pi/2,3\pi/2]) – decreasing,
- ([3\pi/2,5\pi/2]) – increasing,
- ([5\pi/2,3\pi]) – decreasing.
Applying the left‑hand rule separately on each piece and then adding the contributions gives a sum that is more accurate than using a single (n) over the whole interval, because the over‑ and under‑estimates on opposite pieces partially cancel.
Practical implication
The error estimate (\displaystyle |E| \le \frac{M(b-a)^{2}}{2n}) tells us that refining the mesh (increasing (n)) is the most reliable way to reduce the discrepancy. Day to day, in situations where the derivative is cheap to evaluate, a modest increase in (n) often yields a dramatically smaller error. Conversely, if the derivative is large or highly variable, the bound becomes loose and adaptive strategies—such as subdividing only where (|f'|) is big—may be more efficient.
Conclusion
The left‑hand Riemann sum provides a simple yet powerful tool for approximating definite integrals. Now, when the integrand is monotone on a subinterval, the sum either underestimates or overestimates the true area depending on the sign of the derivative, and the magnitude of the error is governed by the size of the derivative and the width of the subintervals. By splitting the domain at points where the derivative vanishes, the method can be applied piecewise, allowing the errors on individual pieces to partially offset one another. The analytical bound derived from the Mean Value Theorem quantifies the worst‑case deviation and shows that halving the subinterval width halves the maximal error, underscoring the linear convergence of the technique as the mesh is refined. These insights make the left‑hand sum a reliable building block for more sophisticated numerical integration schemes Worth keeping that in mind. Still holds up..
Comparing left- and right-hand sums
For the same function (f(x) = e^x) on ([0,1]), the right-hand sum with five subintervals is
[ R_{5} = \frac{1}{5}\left(e^{0.Day to day, 8} + e^{1. 0}\right) \approx 0.Day to day, 6} + e^{0. 4} + e^{0.Practically speaking, 2} + e^{0. 897 Most people skip this — try not to..
The exact value is (e - 1 \approx 1.Day to day, 718), so the right-hand error is about (0. 821), which is larger than the left-hand error. This asymmetry occurs because (f) is increasing: the left-hand sum consistently underestimates by sampling the lower endpoint, while the right-hand sum overestimates by sampling the upper endpoint. For monotone functions, the average of the two, (\frac{L_n + R_n}{2}), yields the trapezoidal rule, which has a much smaller error proportional to (1/n^2) instead of (1/n).
A computational perspective
In algorithmic terms, the left-hand rule is straightforward to implement:
function left Riemann sum(f, a, b, n):
h = (b - a) / n
sum = 0
for i from 0 to n-1:
sum += f(a + i * h)
return h * sum
The loop executes (n) function evaluations, making the method computationally inexpensive. That said, its simplicity comes at the cost of accuracy for a given (n). For high-precision work, methods like Simpson’s rule or Gaussian quadrature are preferred, but the left-hand sum remains valuable for pedagogical purposes and in settings where speed outweighs precision Easy to understand, harder to ignore. Which is the point..
Not the most exciting part, but easily the most useful.
Conclusion
The left-hand Riemann sum is a foundational technique in numerical integration, offering a transparent way to approximate definite integrals using basic geometric reasoning. By partitioning the domain at critical points where the derivative changes sign, the method’s accuracy can be enhanced through error cancellation. Its error is analytically bounded and directly tied to the function’s derivative, providing a clear path for improvement through mesh refinement. While its linear convergence rate makes it less efficient than higher-order methods, its simplicity and low computational cost ensure its continued relevance in both teaching and practical applications. Understanding its behavior and limitations is essential for appreciating the design principles behind more advanced numerical techniques.
Easier said than done, but still worth knowing.
