# Riemann sum

Four of the Riemann summation methods for approximating the area under curves. Right and left methods make the approximation using the right and left endpoints of each subinterval, respectively. Maximum and minimum methods make the approximation using the largest and smallest endpoint values of each subinterval, respectively. The values of the sums converge as the subintervals halve from top-left to bottom-right.

In mathematics, a Riemann sum is a certain kind of approximation of an integral by a finite sum. It is named after nineteenth century German mathematician Bernhard Riemann. One very common application is approximating the area of functions or lines on a graph, but also the length of curves and other approximations.

The sum is calculated by dividing the region up into shapes (rectangles, trapezoids, parabolas, or cubics) that together form a region that is similar to the region being measured, then calculating the area for each of these shapes, and finally adding all of these small areas together. This approach can be used to find a numerical approximation for a definite integral even if the fundamental theorem of calculus does not make it easy to find a closed-form solution.

Because the region filled by the small shapes is usually not exactly the same shape as the region being measured, the Riemann sum will differ from the area being measured. This error can be reduced by dividing up the region more finely, using smaller and smaller shapes. As the shapes get smaller and smaller, the sum approaches the Riemann integral.

## Definition

Let ${\displaystyle f:[a,b]\rightarrow \mathbb {R} }$ be a function defined on a closed interval ${\displaystyle [a,b]}$ of the real numbers, ${\displaystyle \mathbb {R} }$, and

${\displaystyle P=\left\{[x_{0},x_{1}],[x_{1},x_{2}],\dots ,[x_{n-1},x_{n}]\right\}}$⁠,

be a partition of I, where

${\displaystyle a=x_{0}.

A Riemann sum ${\displaystyle S}$ of f over I with partition P is defined as

${\displaystyle S=\sum _{i=1}^{n}f(x_{i}^{*})\,\Delta x_{i}}$

where ${\displaystyle \Delta x_{i}=x_{i}-x_{i-1}}$ and an ${\displaystyle x_{i}^{*}\in [x_{i-1},x_{i}]}$.[1] Notice the use of "an" instead of "the" in the previous sentence. Another way of thinking about this asterisk is that you are choosing some random point in this slice, and it does not matter which one; as the difference or width of the slices approaches zero, the only point we can pick is the point our rectangle slice is at. This is due to the fact that the choice of ${\displaystyle x_{i}^{*}}$ in the interval ${\displaystyle [x_{i-1},x_{i}]}$ is arbitrary, so for any given function f defined on an interval I and a fixed partition P, one might produce different Riemann sums depending on which ${\displaystyle x_{i}^{*}}$ is chosen, as long as ${\displaystyle x_{i-1}\leq x_{i}^{*}\leq x_{i}}$ holds true.

## Some specific types of Riemann sums

Specific choices of ${\displaystyle x_{i}^{*}}$ give us different types of Riemann sums:

• If ${\displaystyle x_{i}^{*}=x_{i-1}}$ for all i, then S is called a left rule[2][3] or left Riemann sum.
• If ${\displaystyle x_{i}^{*}=x_{i}}$ for all i, then S is called a right rule[2][3] or right Riemann sum.
• If ${\displaystyle x_{i}^{*}=(x_{i}+x_{i-1})/2}$ for all i, then S is called the midpoint rule[2][3] or middle Riemann sum.
• If ${\displaystyle f(x_{i}^{*})=\sup f([x_{i-1},x_{i}])}$ (that is, the supremum of f over ${\displaystyle [x_{i-1},x_{i}]}$), then S is defined to be an upper Riemann sum or upper Darboux sum.
• If ${\displaystyle f(x_{i}^{*})=\inf f([x_{i-1},x_{i}])}$ (that is, the infimum of f over ${\displaystyle [x_{i-1},x_{i}]}$), then S is defined to be an lower Riemann sum or lower Darboux sum.

All these methods are among the most basic ways to accomplish numerical integration. Loosely speaking, a function is Riemann integrable if all Riemann sums converge as the partition "gets finer and finer".

While not technically a Riemann sum, the average of the left and right Riemann sum is the trapezoidal sum and is one of the simplest of a very general way of approximating integrals using weighted averages. This is followed in complexity by Simpson's rule and Newton–Cotes formulas.

Any Riemann sum on a given partition (that is, for any choice of ${\displaystyle x_{i}^{*}}$ between ${\displaystyle x_{i-1}}$ and ${\displaystyle x_{i}}$) is contained between the lower and upper Darboux sums. This forms the basis of the Darboux integral, which is ultimately equivalent to the Riemann integral.

## Methods

The four methods of Riemann summation are usually best approached with partitions of equal size. The interval [a, b] is therefore divided into n subintervals, each of length

${\displaystyle \Delta x={\frac {b-a}{n}}.}$

The points in the partition will then be

${\displaystyle a,a+\Delta x,a+2\,\Delta x,\ldots ,a+(n-2)\,\Delta x,a+(n-1)\,\Delta x,b.}$

### Left Riemann sum

Left Riemann sum of x3 over [0,2] using 4 subdivisions

For the left Riemann sum, approximating the function by its value at the left-end point gives multiple rectangles with base Δx and height f(a + iΔx). Doing this for i = 0, 1, ..., n − 1, and adding up the resulting areas gives

${\displaystyle \Delta x\left[f(a)+f(a+\Delta x)+f(a+2\,\Delta x)+\cdots +f(b-\Delta x)\right].}$

The left Riemann sum amounts to an overestimation if f is monotonically decreasing on this interval, and an underestimation if it is monotonically increasing.

### Right Riemann sum

Right Riemann sum of x3 over [0,2] using 4 subdivisions

f is here approximated by the value at the right endpoint. This gives multiple rectangles with base Δx and height f(a + i Δx). Doing this for i = 1, ..., n, and adding up the resulting areas produces

${\displaystyle \Delta x\left[f(a+\Delta x)+f(a+2\,\Delta x)+\cdots +f(b)\right].}$

The right Riemann sum amounts to an underestimation if f is monotonically decreasing, and an overestimation if it is monotonically increasing. The error of this formula will be

${\displaystyle \left\vert \int _{a}^{b}f(x)\,dx-A_{\mathrm {right} }\right\vert \leq {\frac {M_{1}(b-a)^{2}}{2n}}}$,

where ${\displaystyle M_{1}}$ is the maximum value of the absolute value of ${\displaystyle f^{\prime }(x)}$ on the interval.

### Midpoint rule

Midpoint Riemann sum of x3 over [0,2] using 4 subdivisions

Approximating f at the midpoint of intervals gives f(a + Δx/2) for the first interval, for the next one f(a + 3Δx/2), and so on until f(b − Δx/2). Summing up the areas gives

${\displaystyle \Delta x\left[f(a+{\tfrac {\Delta x}{2}})+f(a+{\tfrac {3\,\Delta x}{2}})+\cdots +f(b-{\tfrac {\Delta x}{2}})\right]}$.

The error of this formula will be

${\displaystyle \left\vert \int _{a}^{b}f(x)\,dx-A_{\mathrm {mid} }\right\vert \leq {\frac {M_{2}(b-a)^{3}}{24n^{2}}}}$,

where ${\displaystyle M_{2}}$ is the maximum value of the absolute value of ${\displaystyle f^{\prime \prime }(x)}$ on the interval.

### Trapezoidal rule

Trapezoidal Riemann sum of x3 over [0,2] using 4 subdivisions

In this case, the values of the function f on an interval are approximated by the average of the values at the left and right endpoints. In the same manner as above, a simple calculation using the area formula

${\displaystyle A={\tfrac {1}{2}}h(b_{1}+b_{2})}$

for a trapezium with parallel sides b1, b2 and height h produces

${\displaystyle {\tfrac {1}{2}}\,\Delta x\left[f(a)+2f(a+\Delta x)+2f(a+2\,\Delta x)+2f(a+3\,\Delta x)+\cdots +f(b)\right].}$

The error of this formula will be

${\displaystyle \left\vert \int _{a}^{b}f(x)\,dx-A_{\mathrm {trap} }\right\vert \leq {\frac {M_{2}(b-a)^{3}}{12n^{2}}},}$

where ${\displaystyle M_{2}}$ is the maximum value of the absolute value of ${\displaystyle f^{\prime \prime }(x)}$.

The approximation obtained with the trapezoid rule for a function is the same as the average of the left hand and right hand sums of that function.

## Connection with integration

For a one-dimensional Riemann sum over domain ${\displaystyle [a,b]}$, as the maximum size of a partition element shrinks to zero (that is the limit of the norm of the partition goes to zero), some functions will have all Riemann sums converge to the same value. This limiting value, if it exists, is defined as the definite Riemann integral of the function over the domain,

${\displaystyle \int _{a}^{b}\!f(x)\,dx=\lim _{\|\Delta x\|\rightarrow 0}\sum _{i=1}^{n}f(x_{i}^{*})\,\Delta x_{i}.}$

For a finite-sized domain, if the maximum size of a partition element shrinks to zero, this implies the number of partition elements goes to infinity. For finite partitions, Riemann sums are always approximations to the limiting value and this approximation gets better as the partition gets finer. The following animations help demonstrate how increasing the number of partitions (while lowering the maximum partition element size) better approximates the "area" under the curve:

Since the red function here is assumed to be a smooth function, all three Riemann sums will converge to the same value as the number of partitions goes to infinity.

## Example

Comparison of right hand sums of the function y = x2 from 0 to 2 with the integral of it from 0 to 2.
A visual representation of the area under the curve y = x2 for the interval from 0 to 2. Using antiderivatives this area is exactly 8/3.
Approximating the area under ${\displaystyle y=x^{2}}$ from 0 to 2 using right-rule sums. Notice that because the function is monotonically increasing, right-hand sums will always overestimate the area contributed by each term in the sum (and do so maximally).
The value of the Riemann sum under the curve y = x2 from 0 to 2. As the number of rectangles increases, it approaches the exact area of 8/3.

Taking an example, the area under the curve of y = x2 between 0 and 2 can be procedurally computed using Riemann's method.

The interval [0, 2] is firstly divided into n subintervals, each of which is given a width of ${\displaystyle {\tfrac {2}{n}}}$; these are the widths of the Riemann rectangles (hereafter "boxes"). Because the right Riemann sum is to be used, the sequence of x coordinates for the boxes will be ${\displaystyle x_{1},x_{2},\ldots ,x_{n}}$. Therefore, the sequence of the heights of the boxes will be ${\displaystyle x_{1}^{2},x_{2}^{2},\ldots ,x_{n}^{2}}$. It is an important fact that ${\displaystyle x_{i}={\tfrac {2i}{n}}}$, and ${\displaystyle x_{n}=2}$.

The area of each box will be ${\displaystyle {\tfrac {2}{n}}\times x_{i}^{2}}$ and therefore the nth right Riemann sum will be:

{\displaystyle {\begin{aligned}S&={\frac {2}{n}}\times \left({\frac {2}{n}}\right)^{2}+\cdots +{\frac {2}{n}}\times \left({\frac {2i}{n}}\right)^{2}+\cdots +{\frac {2}{n}}\times \left({\frac {2n}{n}}\right)^{2}\\&={\frac {8}{n^{3}}}\left(1+\cdots +i^{2}+\cdots +n^{2}\right)\\&={\frac {8}{n^{3}}}\left({\frac {n(n+1)(2n+1)}{6}}\right)\\&={\frac {8}{n^{3}}}\left({\frac {2n^{3}+3n^{2}+n}{6}}\right)\\&={\frac {8}{3}}+{\frac {4}{n}}+{\frac {4}{3n^{2}}}\end{aligned}}}

If the limit is viewed as n → ∞, it can be concluded that the approximation approaches the actual value of the area under the curve as the number of boxes increases. Hence:

${\displaystyle \lim _{n\to \infty }S=\lim _{n\to \infty }\left({\frac {8}{3}}+{\frac {4}{n}}+{\frac {4}{3n^{2}}}\right)={\frac {8}{3}}}$

This method agrees with the definite integral as calculated in more mechanical ways:

${\displaystyle \int _{0}^{2}x^{2}\,dx={\frac {8}{3}}}$

Because the function is continuous and monotonically increasing on the interval, a right Riemann sum overestimates the integral by the largest amount (while a left Riemann sum would underestimate the integral by the largest amount). This fact, which is intuitively clear from the diagrams, shows how the nature of the function determines how accurate the integral is estimated. While simple, right and left Riemann sums are often less accurate than more advanced techniques of estimating an integral such as the Trapezoidal rule or Simpson's rule.

The example function has an easy-to-find anti-derivative so estimating the integral by Riemann sums is mostly an academic exercise; however it must be remembered that not all functions have anti-derivatives so estimating their integrals by summation is practically important.

## Higher dimensions

The basic idea behind a Riemann sum is to "break-up" the domain via a partition into pieces, multiply the "size" of each piece by some value the function takes on that piece, and sum all these products. This can be generalized to allow Riemann sums for functions over domains of more than one dimension.

While intuitively, the process of partitioning the domain is easy to grasp, the technical details of how the domain may be partitioned get much more complicated than the one dimensional case and involves aspects of the geometrical shape of the domain.[4]

### Two dimensions

In two dimensions, the domain, ${\displaystyle A}$ may be divided into a number of cells, ${\displaystyle A_{i}}$ such that ${\displaystyle A=\cup _{i}A_{i}}$. In two dimensions, each cell then can be interpreted as having an "area" denoted by ${\displaystyle \Delta A_{i}}$.[5] The Riemann sum is

${\displaystyle S=\sum _{i=1}^{n}f(x_{i}^{*},y_{i}^{*})\,\Delta A_{i},}$

where ${\displaystyle (x_{i}^{*},y_{i}^{*})\in A_{i}}$.

### Three dimensions

In three dimensions, it is customary to use the letter ${\displaystyle V}$ for the domain, such that ${\displaystyle V=\cup _{i}V_{i}}$ under the partition and ${\displaystyle \Delta V_{i}}$ is the "volume" of the cell indexed by ${\displaystyle i}$. The three-dimensional Riemann sum may then be written as[6]

${\displaystyle S=\sum _{i=1}^{n}f(x_{i}^{*},y_{i}^{*},z_{i}^{*})\,\Delta V_{i}}$

with ${\displaystyle (x_{i}^{*},y_{i}^{*},z_{i}^{*})\in V_{i}}$.

### Arbitrary number of dimensions

Higher dimensional Riemann sums follow a similar as from one to two to three dimensions. For an arbitrary dimension, n, a Riemann sum can be written as

${\displaystyle S=\sum _{i}f(P_{i}^{*})\,\Delta V_{i}}$

where ${\displaystyle P_{i}^{*}\in V_{i}}$, that is, it's a point in the n-dimensional cell ${\displaystyle V_{i}}$ with n-dimensional volume ${\displaystyle \Delta V_{i}}$.

### Generalization

In high generality, Riemann sums can be written

${\displaystyle S=\sum _{i}f(P_{i}^{*})\mu (V_{i})}$

where ${\displaystyle P_{i}^{*}}$ stands for any arbitrary point contained in the partition element ${\displaystyle V_{i}}$ and ${\displaystyle \mu }$ is a measure on the underlying set. Roughly speaking, a measure is a function that gives a "size" of a set, in this case the size of the set ${\displaystyle V_{i}}$; in one dimension, this can often be interpreted as the length of the interval, in two dimensions, an area, in three dimensions, a volume, and so on.