How to Find the Infimum and Supremum of a Riemann Sum
At a glance
- 1. Fix the partition
A Riemann sum depends on both the subintervals and the chosen sample points.
- 2. Use interval bounds
For a fixed partition, sum each subinterval’s infimum or supremum, weighted by its width.
- 3. Check what varies
If partitions also vary, the infimum and supremum can differ from those for one fixed partition.
- 4. Compare with the integral
For an integrable function, sums over partitions whose mesh tends to zero converge to the integral.
A Riemann sum depends on two choices: a partition of the interval and a sample point in each subinterval. So the infimum and supremum depend on which choices are allowed to vary. The most common interpretation is to fix a partition and vary the sample points; in that case, the answers are the lower and upper Darboux sums.
Riemann sums for a fixed partition
Let be bounded on , and choose a partition
Write . A tagged Riemann sum for this partition is
where each sample point lies in . Define the infimum and supremum of on the th subinterval by
Since and each width is positive, every tagged sum satisfies
Moreover, the sample points can be chosen independently. They can therefore make the sum as close as desired to either bound. Thus
These are called the lower Darboux sum and upper Darboux sum . The infimum or supremum need not be attained: if does not reach its infimum or supremum on a subinterval, the corresponding bound is approached rather than achieved.
Worked example: on
Use the partition . On the first subinterval, , the infimum is and the supremum is . On the second, , they are and . Each subinterval has width , so
and
Therefore, with this partition fixed and the tags allowed to vary, the infimum of the Riemann sums is and the supremum is . For example, choosing tags at the midpoints gives the sum , but that is only one of the possible sums.
If the partition can also vary
A different interpretation allows all partitions and all choices of tags on . Let and . Every Riemann sum lies between and , because its widths add to . A one-subinterval partition, with tags chosen where is arbitrarily close to its global infimum or supremum, shows that these bounds are sharp:
For on , these overall bounds are and , not and . The distinction is that the latter values came from one particular partition.
How the integral fits in
For a bounded Riemann-integrable function, lower sums can be made arbitrarily close to the integral from below, and upper sums arbitrarily close from above. Equivalently, tagged sums converge to the integral when the partition mesh—the width of its largest subinterval—tends to zero. In the example, refining the partition makes the lower and upper sums approach .
This does not mean the infimum or supremum over every possible tagged sum equals the integral. Coarse partitions are still included in that larger set. The integral describes the common limit of sums on increasingly fine partitions, not generally the bounds over all partitions.
Common mistakes
- Confusing tags with partitions: For a fixed partition, vary the sample points to get the lower and upper Darboux sums. If partitions vary too, the answer may change.
- Calling an infimum a minimum: A function may approach its infimum without attaining it. Use “minimum” or “maximum” only when the extremum is reached.
- Assuming every Riemann sum equals the integral: A finite sum usually does not. Convergence to the integral requires increasingly fine partitions and Riemann integrability.
- Forgetting boundedness: The finite upper and lower Darboux sums described here require to be bounded on the interval.
References
- The Elements of Real Analysis
- Introduction to Real Analysis
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.