5.1: Approximating Areas
 Last updated
 Save as PDF
 Page ID
 20667
 Contributed by OpenStax
 Mathematics at OpenStax CNX
Archimedes was fascinated with calculating the areas of various shapes—in other words, the amount of space enclosed by the shape. He used a process that has come to be known as the method of exhaustion, which used smaller and smaller shapes, the areas of which could be calculated exactly, to fill an irregular region and thereby obtain closer and closer approximations to the total area. In this process, an area bounded by curves is filled with rectangles, triangles, and shapes with exact area formulas. These areas are then summed to approximate the area of the curved region.
In this section, we develop techniques to approximate the area between a curve, defined by a function \(f(x),\) and the xaxis on a closed interval \([a,b].\) Like Archimedes, we first approximate the area under the curve using shapes of known area (namely, rectangles). By using smaller and smaller rectangles, we get closer and closer approximations to the area. (Next section: Taking a limit allows us to calculate the exact area under the curve.)
Let’s start by introducing some notation to make the calculations easier. We then consider the case when \(f(x)\) is continuous and nonnegative. Later in the chapter, we relax some of these restrictions and develop techniques that apply in more general cases.
Sigma (Summation) Notation
As mentioned, we will use shapes of known area to approximate the area of an irregular region bounded by curves. This process often requires adding up long strings of numbers. To make it easier to write down these lengthy sums, we look at some new notation here, called sigma notation (also known as summation notation). The Greek capital letter \(Σ\), sigma, is used to express long sums of values in a compact form. For example, if we want to add all the integers from 1 to 20 without sigma notation, we have to write
\[1+2+3+4+5+6+7+8+9+10+11+12+13+14+15+16+17+18+19+20. \nonumber \]
We could probably skip writing a couple of terms and write
\[1+2+3+4+⋯+19+20, \nonumber\]
which is better, but still cumbersome. With sigma notation, we write this sum as
\[\sum_{i=1}^{20}i \nonumber\]
which is much more compact. Typically, sigma notation is presented in the form
\[\sum_{i=1}^{n}a_i \nonumber\]
where \(a_i\) describes the terms to be added, and the i is called the \(index\). Each term is evaluated, then we sum all the values, beginning with the value when \(i=1\) and ending with the value when \(i=n.\) For example, an expression like
\[ \sum_{i=2}^{7}s_i \label{ex1}\]
is interpreted as \(s_2+s_3+s_4+s_5+s_6+s_7 \nonumber\).
Note that the index is used only to keep track of the terms to be added; it does not factor into the calculation of the sum itself. The index is therefore called a dummy variable. We can use any letter we like for the index. Typically, mathematicians use \(i\), \(j\), \(k\), \(m\), and \(n\) for indices. For example, the sum in Expression \ref{ex1} can be rewritten as
\[ \sum_{n=2}^{7}s_n \nonumber \]
Let’s try a couple of examples of using sigma notation.
Example \(\PageIndex{1}\): Using Sigma Notation
 Write in sigma notation and evaluate the sum of terms \(3^i\) for \(i=1,2,3,4,5.\)
 Write the sum in sigma notation:
\[1+\dfrac{1}{4}+\dfrac{1}{9}+\dfrac{1}{16}+\dfrac{1}{25}. \nonumber\]
Solution
 Write \[\sum_{i=1}^{5}3^i=3+3^2+3^3+3^4+3^5=363. \nonumber\]
 The denominator of each term is a perfect square. Using sigma notation, this sum can be written as \(\displaystyle \sum_{i=1}^5\dfrac{1}{i^2}\).
Exercise \(\PageIndex{1}\)
Write in sigma notation and evaluate the sum of terms \(2^i\) for \(i=3,4,5,6.\)
 Hint

Use the solving steps in Example \(\PageIndex{1}\)as a guide.
 Answer

\(\displaystyle \sum_{i=3}^{6}2^i=2^3+2^4+2^5+2^6=120\)
The properties associated with the summation process are given in the following rule.
Rule: Properties of Sigma Notation
Let \(a_1,a_2,…,a_n\) and \(b_1,b_2,…,b_n\) represent two sequences of terms and let c be a constant. The following properties hold for all positive integers n and for integers m, with \(1≤m≤n.\)
 \(\displaystyle \sum_{i=1}^nc=nc\)
 \(\displaystyle \sum_{i=1}^nca_i=c\sum_{i=1}^na_i\)
 \(\displaystyle \sum_{i=1}^n(a_i+b_i)=\sum_{i=1}^na_i+\sum_{i=1}^nb_i\)
 \(\displaystyle \sum_{i=1}^n(a_i−b_i)=\sum_{i=1}^na_i−\sum_{i=1}^nb_i\)
 \(\displaystyle \sum_{i=1}^na_i=\sum_{i=1}^ma_i+\sum_{i=m+1}^na_i\)
Proof
We prove properties 2. and 3. here, and leave proof of the other properties to the exercises below.
2. We have
\(\displaystyle \sum_{i=1}^nca_i=ca_1+ca_2+ca_3+⋯+ca_n=c(a_1+a_2+a_3+⋯+a_n)=c\sum_{i=1}^na_i\).
3. We have
\[ \begin{align*} \sum_{i=1}^{n}(a_i+b_i)&=(a_1+b_1)+(a_2+b_2)+(a_3+b_3)+⋯+(a_n+b_n) \\ &=(a_1+a_2+a_3+⋯+a_n)+(b_1+b_2+b_3+⋯+b_n) \\ & =\sum_{i=1}^na_i+\sum_{i=1}^nb_i. \end {align*}\]
□
A few more formulas for frequently found functions simplify the summation process further. These are shown in the next rule, for sums and powers of integers, and we use them in the next set of examples.
Rule: Sums and Powers of Integers
1. The sum of n integers is given by
\[\sum_{i=1}^ni=1+2+⋯+n=\dfrac{n(n+1)}{2}.\]
2. The sum of consecutive integers squared is given by
\[\sum_{i=1}^ni^2=1^2+2^2+⋯+n^2=\dfrac{n(n+1)(2n+1)}{6}.\]
3. The sum of consecutive integers cubed is given by
\[\sum_{i=1}^ni^3=1^3+2^3+⋯+n^3=\dfrac{n^2(n+1)^2}{4}. \label{cube}\]
Example \(\PageIndex{2}\): Evaluation Using Sigma Notation
Write using sigma notation and evaluate:
 The sum of the terms \((i−3)^2\) for \(i=1,2,…,200.\)
 The sum of the terms \((i^3−i^2)\) for \(i=1,2,3,4,5,6\)
Solution
a. Multiplying out \((i−3)^2\), we can break the expression into three terms.
\[\begin{align*} \sum_{i=1}^{200}(i−3)^2 &=\sum_{i=1}^{200}(i^2−6i+9) \\[5pt] &= \sum_{i=1}^{200}i^2−\sum_{i=1}^{200}6i+\sum_{i=1}^{200}9 \\[5pt] &=\sum_{i=1}^{200}i^2−6 \sum_{i=1}^{200}i+\sum_{i=1}^{200}9 \\[5pt] &=\dfrac{200(200+1)(400+1)}{6}−6\left[\dfrac{200(200+1)}{2}\right]+9(200) \\[5pt] &=2,686,700−120,600+1800 \\[5pt] &=2,567,900 \end{align*}\]
b. Use sigma notation property iv. and the rules for the sum of squared terms and the sum of cubed terms.
\[\begin{align*} \displaystyle \sum_{i=1}^{6}(i^3−i^2) &=\sum_{i=1}^6i^3−\sum_{i=1}^6i^2 \\[5pt] &=\dfrac{6^2(6+1)^2}{4}−\dfrac{6(6+1)(2(6)+1)}{6} \\[5pt]&=\dfrac{1764}{4}−\dfrac{546}{6} \\[5pt] &=350 \end{align*}\]
Exercise \(\PageIndex{2}\)
Find the sum of the values of \(4+3i\) for \(i=1,2,…,100.\)
 Hint

Use the properties of sigma notation to solve the problem.
 Answer

15,550
Example \(\PageIndex{3}\): Finding the Sum of the Function Values
Find the sum of the values of \(f(x)=x^3\) over the integers \(1,2,3,…,10.\)
Solution
Using the the rule for sum of consecutive integers cubed (Equation \ref{cube}), we have
\[\sum_{i=0}^{10}i^3=\dfrac{(10)^2(10+1)^2}{4}=\dfrac{100(121)}{4}=3025 \nonumber \]
Exercise \(\PageIndex{3}\)
Evaluate the sum indicated by the notation \(\displaystyle \sum_{k=1}^{20}(2k+1)\).
 Hint

Use the rule on sum and powers of integers.
 Answer

440
Approximating Area
Now that we have the necessary notation, we return to the problem at hand: approximating the area under a curve. Let \(f(x)\) be a continuous, nonnegative function defined on the closed interval \([a,b]\). We want to approximate the area A bounded by \(f(x)\) above, the xaxis below, the line \(x=a\) on the left, and the line \(x=b\) on the right (Figure \(\PageIndex{1}\)).
Figure \(\PageIndex{1}\): An area (shaded region) bounded by the curve \(f(x)\) at top, the xaxis at bottom, the line \(x=a\) to the left, and the line \(x=b\) at right.
How do we approximate the area under this curve? The approach is a geometric one. By dividing a region into many small shapes that have known area formulas, we can sum these areas and obtain a reasonable estimate of the true area. We begin by dividing the interval \([a,b]\) into n subintervals of equal width, \(\dfrac{b−a}{n}\). We do this by selecting equally spaced points \(x_0,x_1,x_2,…,x_n\) with \(x_0=a,x_n=b,\) and
\[x_i−x_{i−1}=\dfrac{b−a}{n}\]
for \(i=1,2,3,…,n\).
We denote the width of each subinterval with the notation Δx, so \(Δx=\frac{b−a}{n}\) and
\[x_i=x_0+iΔx\]
for \(i=1,2,3,…,n\). This notion of dividing an interval \([a,b]\) into subintervals by selecting points from within the interval is used quite often in approximating the area under a curve, so let’s define some relevant terminology.
Definition: Partitions
A set of points \(P={xi}\) for \(i=0,1,2,…,n\) with \(a=x_0<x_1<x_2<⋯<x_n=b\), which divides the interval \([a,b]\) into subintervals of the form \([x_0,x_1],[x_1,x_2],…,[x_{n−1},x_n]\) is called a partition of \([a,b]\). If the subintervals all have the same width, the set of points forms a regular partition of the interval [a,b].
We can use this regular partition as the basis of a method for estimating the area under the curve. We next examine two methods: the leftendpoint approximation and the rightendpoint approximation.
Rule: LeftEndpoint Approximation
On each subinterval \([x_{i−1},x_i]\) (for \(i=1,2,3,…,n\)), construct a rectangle with width \(Δx\) and height equal to \(f(x_{i−1})\), which is the function value at the left endpoint of the subinterval. Then the area of this rectangle is \(f(x_{i−1})Δx\). Adding the areas of all these rectangles, we get an approximate value for A (Figure \(\PageIndex{2}\)). We use the notation Ln to denote that this is a leftendpoint approximation of \(A\) using \(n\) subintervals.
\[A≈L_n=f(x_0)Δx+f(x_1)Δx+⋯+f(x_{n−1})Δx=\sum_{i=1}^nf(x_{i−1})Δx \label{left}\]
Figure \(\PageIndex{2}\): In the leftendpoint approximation of area under a curve, the height of each rectangle is determined by the function value at the left of each subinterval.
The second method for approximating area under a curve is the rightendpoint approximation. It is almost the same as the leftendpoint approximation, but now the heights of the rectangles are determined by the function values at the right of each subinterval.
Rule: RightEndpoint Approximation
Construct a rectangle on each subinterval \([x_{i−1},x_i]\), only this time the height of the rectangle is determined by the function value f(xi) at the right endpoint of the subinterval. Then, the area of each rectangle is \(f(x_i)Δx\) and the approximation for \(A\) is given by
\[A≈R_n=f(x_1)Δx+f(x_2)Δx+⋯+f(x_n)Δx=\sum_{i=1}^nf(x_i)Δx. \label{right}\]
The notation \(R_n\) indicates this is a rightendpoint approximation for \(A\) (Figure \(\PageIndex{3}\)).
Figure \(\PageIndex{3}\):In the rightendpoint approximation of area under a curve, the height of each rectangle is determined by the function value at the right of each subinterval. Note that the rightendpoint approximation differs from the leftendpoint approximation in Figure \(\PageIndex{2}\).
The graphs in Figure \(\PageIndex{4}\) represent the curve \(f(x)=\dfrac{x^2}{2}\).
Figure \(\PageIndex{4}\): Methods of approximating the area under a curve by using (a) the left endpoints and (b) the right endpoints.
In Figure \(\PageIndex{4b}\) we divide the region represented by the interval \([0,3]\) into six subintervals, each of width 0.5. Thus, \(Δx=0.5\). We then form six rectangles by drawing vertical lines perpendicular to \(x_{i−1}\), the left endpoint of each subinterval. We determine the height of each rectangle by calculating \(f(x_{i−1})\) for \(i=1,2,3,4,5,6.\) The intervals are \([0,0.5],[0.5,1],[1,1.5],[1.5,2],[2,2.5],[2.5,3]\). We find the area of each rectangle by multiplying the height by the width. Then, the sum of the rectangular areas approximates the area between \(f(x)\) and the \(x\)axis. When the left endpoints are used to calculate height, we have a leftendpoint approximation. Thus,
\[ \begin{align*} A &≈L_6=\sum_{i=1}^6f(x_{i−1})Δx=f(x_0)Δx+f(x_1)Δx+f(x_2)Δx+f(x_3)Δx+f(x_4)Δx+f(x_5)Δx \\[5pt] &=f(0)0.5+f(0.5)0.5+f(1)0.5+f(1.5)0.5+f(2)0.5+f(2.5)0.5 \\[5pt] &=(0)0.5+(0.125)0.5+(0.5)0.5+(1.125)0.5+(2)0.5+(3.125)0.5 \\[5pt] &=0+0.0625+0.25+0.5625+1+1.5625 \\[5pt] &=3.4375 \end{align*}\]
In Figure \(\PageIndex{4b}\), we draw vertical lines perpendicular to \(x_i\) such that \(x_i\) is the right endpoint of each subinterval, and calculate \(f(x_i)\) for \(i=1,2,3,4,5,6\). We multiply each \(f(x_i)\) by \(Δx\) to find the rectangular areas, and then add them. This is a rightendpoint approximation of the area under \(f(x)\). Thus,
\[ \begin{align*} A≈R_6=\sum_{i=1}^6f(x_i)Δx=f(x_1)Δx+f(x_2)Δx+f(x_3)Δx+f(x_4)Δx+f(x_5)Δx+f(x_6)Δx \\[5pt] &=f(0.5)0.5+f(1)0.5+f(1.5)0.5+f(2)0.5+f(2.5)0.5+f(3)0.5 \\[5pt] &=(0.125)0.5+(0.5)0.5+(1.125)0.5+(2)0.5+(3.125)0.5+(4.5)0.5 \\[5pt] &=0.0625+0.25+0.5625+1+1.5625+2.25 \\[5pt] &=5.6875.\end{align*}\]
Example \(\PageIndex{4}\): Approximating the Area Under a Curve
Use both leftendpoint and rightendpoint approximations to approximate the area under the curve of \(f(x)=x^2\) on the interval \([0,2]\); use \(n=4\).
Solution
First, divide the interval \([0,2]\) into n equal subintervals. Using \(n=4,Δx=\dfrac{(2−0)}{4}=0.5\). This is the width of each rectangle. The intervals \([0,0.5],[0.5,1],[1,1.5],[1.5,2]\) are shown in Figure \(\PageIndex{5}\). Using a leftendpoint approximation (Equation \ref{left}), the heights are \(f(0)=0,f(0.5)=0.25,f(1)=1,f(1.5)=2.25.\) Then,
\[L_4=f(x_0)Δx+f(x_1)Δx+f(x_2)Δx+f(x_3)Δx=0(0.5)+0.25(0.5)+1(0.5)+2.25(0.5)=1.75 \nonumber\]
Figure \(\PageIndex{5}\): The graph shows the leftendpoint approximation of the area under \(f(x)=x^2\) from 0 to 2.
The rightendpoint approximation is shown in Figure \(\PageIndex{6}\). The intervals are the same, \(Δx=0.5,\) but now use the right endpoint to calculate the height of the rectangles. We have
\[R_4=f(x_1)Δx+f(x_2)Δx+f(x_3)Δx+f(x_4)Δx=0.25(0.5)+1(0.5)+2.25(0.5)+4(0.5)=3.75 \nonumber\]
Figure \(\PageIndex{6}\): The graph shows the rightendpoint approximation of the area under \(f(x)=x^2\) from 0 to 2.
The leftendpoint approximation is 1.75; the rightendpoint approximation is 3.75.
Exercise \(\PageIndex{4}\)
Sketch leftendpoint and rightendpoint approximations for \(f(x)=\dfrac{1}{x}\) on \([1,2]\); use \(n=4\). Approximate the area using both methods.
 Hint

Follow the solving strategy in Example \(\PageIndex{4}\) stepbystep.
 Answer

The leftendpoint approximation (Equation \ref{left}) is 0.7595 and The rightendpoint approximation (Equation \ref{right}) is 0.6345.
Looking at Figure \(\PageIndex{4}\) and the graphs in Example \(\PageIndex{4}\), we can see that when we use a small number of intervals, neither the leftendpoint approximation nor the rightendpoint approximation is a particularly accurate estimate of the area under the curve. However, it seems logical that if we increase the number of points in our partition, our estimate of A will improve. We will have more rectangles, but each rectangle will be thinner, so we will be able to fit the rectangles to the curve more precisely.
We can demonstrate the improved approximation obtained through smaller intervals with an example. Let’s explore the idea of increasing \(n\), first in a leftendpoint approximation with four rectangles, then eight rectangles, and finally 32 rectangles. Then, let’s do the same thing in a rightendpoint approximation, using the same sets of intervals, of the same curved region. Figure \(\PageIndex{7}\) shows the area of the region under the curve \(f(x)=(x−1)^3+4\) on the interval \([0,2]\) using a leftendpoint approximation where \(n=4.\) he width of each rectangle is
\[Δx=\dfrac{2−0}{4}=\dfrac{1}{2}.\]
The area is approximated by the summed areas of the rectangles, or
\[L_4=f(0)(0.5)+f(0.5)(0.5)+f(1)(0.5)+f(1.5)0.5=7.5\]
Figure \(\PageIndex{7}\): With a leftendpoint approximation and dividing the region from a to b into four equal intervals, the area under the curve is approximately equal to the sum of the areas of the rectangles.
Figure \(\PageIndex{8}\) shows the same curve divided into eight subintervals. Comparing the graph with four rectangles in Figure \(\PageIndex{7}\) with this graph with eight rectangles, we can see there appears to be less white space under the curve when \(n=8.\) This white space is area under the curve we are unable to include using our approximation. The area of the rectangles is
\[L_8=f(0)(0.25)+f(0.25)(0.25)+f(0.5)(0.25)+f(0.75)(0.25)+f(1)(0.25)+f(1.25)(0.25)+f(1.5)(0.25)+f(1.75)(0.25)=7.75\]
Figure \(\PageIndex{8}\): The region under the curve is divided into \(n=8\) rectangular areas of equal width for a leftendpoint approximation.
The graph in Figure \(\PageIndex{9}\) shows the same function with 32 rectangles inscribed under the curve. There appears to be little white space left. The area occupied by the rectangles is
\[L_{32}=f(0)(0.0625)+f(0.0625)(0.0625)+f(0.125)(0.0625)+⋯+f(1.9375)(0.0625)=7.9375.\]
Figure \(\PageIndex{9}\): Here, 32 rectangles are inscribed under the curve for a leftendpoint approximation.
We can carry out a similar process for the rightendpoint approximation method. A rightendpoint approximation of the same curve, using four rectangles (Figure \(\PageIndex{10}\)), yields an area
\[R_4=f(0.5)(0.5)+f(1)(0.5)+f(1.5)(0.5)+f(2)(0.5)=8.5\]
Figure \(\PageIndex{10}\): Now we divide the area under the curve into four equal subintervals for a rightendpoint approximation.
Dividing the region over the interval \([0,2]\) into eight rectangles results in \(Δx=\dfrac{2−0}{8}=0.25.\) The graph is shown in Figure \(\PageIndex{11}\). The area is
\[R_8=f(0.25)(0.25)+f(0.5)(0.25)+f(0.75)(0.25)+f(1)(0.25)+f(1.25)(0.25)+f(1.5)(0.25)+f(1.75)(0.25)+f(2)(0.25)=8.25\]
Figure \(\PageIndex{11}\): Here we use rightendpoint approximation for a region divided into eight equal subintervals.
Last, the rightendpoint approximation with \(n=32\) is close to the actual area (Figure \(\PageIndex{12}\)). The area is approximately
\[R_{32}=f(0.0625)(0.0625)+f(0.125)(0.0625)+f(0.1875)(0.0625)+⋯+f(2)(0.0625)=8.0625\]
Figure \(\PageIndex{12}\): The region is divided into 32 equal subintervals for a rightendpoint approximation.
Based on these figures and calculations, it appears we are on the right track; the rectangles appear to approximate the area under the curve better as n gets larger. Furthermore, as n increases, both the leftendpoint and rightendpoint approximations appear to approach an area of 8 square units. Table shows a numerical comparison of the left and rightendpoint methods. The idea that the approximations of the area under the curve get better and better as n gets larger and larger is very important, and we now explore this idea in more detail.
Value of n  Approximate Area \(L_n\)  Approximate Area \(R_n\) 

\(n=4\)  7.5  8.5 
\(n=8\)  7.75  8.25 
\(n=32\)  7.94  8.06 
Forming Riemann Sums
So far we have been using rectangles to approximate the area under a curve. The heights of these rectangles have been determined by evaluating the function at either the right or left endpoints of the subinterval \([x_{i−1},x_i]\). In reality, there is no reason to restrict evaluation of the function to one of these two points only. We could evaluate the function at any point ci in the subinterval \([x_{i−1},x_i]\), and use \(f(x^∗_i)\) as the height of our rectangle. This gives us an estimate for the area of the form
\[A≈\sum_{i=1}^nf(x^∗_i)Δx.\]
A sum of this form is called a Riemann sum, named for the 19thcentury mathematician Bernhard Riemann, who developed the idea.
Note
Let \(f(x)\) be defined on a closed interval \([a,b]\) and let P be a regular partition of \([a,b]\). Let Δx be the width of each subinterval \([x_{i−1},x_i]\) and for each i, let \(x^∗_i\) be any point in \([x_{i−1},x_i]\). A Riemann sum is defined for \(f(x)\) as
\[\sum_{i=1}^nf(x^∗_i)Δx.\]
Recall that with the left and rightendpoint approximations (Equations \ref{left} and \ref{right}, respectively), the estimates seem to get better and better as n get larger and larger. The same thing happens with Riemann sums. Riemann sums give better approximations for larger values of n. In the next section we will define the area under a curve in terms of Riemann sums.
We look at some examples shortly. But, before we do, let’s take a moment and talk about some specific choices for \({x^∗_i}\). Although any choice for \({x^∗_i}\) gives us an estimate of the area under the curve, we don’t necessarily know whether that estimate is too high (overestimate) or too low (underestimate). If it is important to know whether our estimate is high or low, we can select our value for \({x^∗_i}\) to guarantee one result or the other.
If we want an overestimate, for example, we can choose \({x^∗_i}\) such that for \(i=1,2,3,…,n,f(x^∗_i)≥f(x)\) for all \(x∈[x_i−1,x_i]\). In other words, we choose \({x^∗_i}\) so that for \(i=1,2,3,…,n,f(x^∗_i)\) is the maximum function value on the interval \([x_{i−1},x_i]\). If we select \({x^∗_i}\) in this way, then the Riemann sum \(\displaystyle \sum_{i=1}^nf(x^∗_i)Δx\) is called an upper sum. Similarly, if we want an underestimate, we can choose {x∗i} so that for i=1,2,3,…,n,f(x∗i) is the minimum function value on the interval \([x_{i−1},x_i]\). In this case, the associated Riemann sum is called a lower sum. Note that if f(x) is either increasing or decreasing throughout the interval \([a,b]\), then the maximum and minimum values of the function occur at the endpoints of the subintervals, so the upper and lower sums are just the same as the left and rightendpoint approximations.
Example \(\PageIndex{5}\): Finding Lower and Upper Sums
Find a lower sum for \(f(x)=10−x^2\) on \([1,2]\); let \(n=4\) subintervals.
Solution
With \(n=4\) over the interval \([1,2], Δx=\dfrac{1}{4}\). We can list the intervals as \([1,1.25],[1.25,1.5],[1.5,1.75],[1.75,2]\). Because the function is decreasing over the interval \([1,2],\) Figure shows that a lower sum is obtained by using the right endpoints.
Figure \(\PageIndex{13}\): The graph of \(f(x)=10−x^2\) is set up for a rightendpoint approximation of the area bounded by the curve and the xaxis on \([1,2]\), and it shows a lower sum.
The Riemann sum is
\[\begin{align*} \sum_{k=1}^4(10−x^2)(0.25) &=0.25[10−(1.25)^2+10−(1.5)^2+10−(1.75)^2+10−(2)^2] \\[5pt] &=0.25[8.4375+7.75+6.9375+6] \\[5pt] &=7.28. \end{align*}\]
The area of 7.28 is a lower sum and an underestimate.
Exercise \(\PageIndex{5}\)
 Find an upper sum for \(f(x)=10−x^2\) on \([1,2]\); let \(n=4.\)
 Sketch the approximation.
 Hint

\(f(x)\) is decreasing on \([1,2]\), so the maximum function values occur at the left endpoints of the subintervals.
 Answer

a. Upper sum=\(8.0313.\)
b.
Example \(\PageIndex{6}\): Finding Lower and Upper Sums for \(f(x)=\sin x\)
Find a lower sum for \(f(x)=\sin x\) over the interval \([a,b]=[0,\dfrac{π}{2}]\); let \(n=6.\)
Solution
Let’s first look at the graph in Figure to get a better idea of the area of interest.
Figure \(\PageIndex{14}\): The graph of \(y=\sin x\) is divided into six regions: \(Δx=\dfrac{π/2}{6}=\dfrac{π}{12}\).
The intervals are \([0,\dfrac{π}{12}],[\dfrac{π}{12},\dfrac{π}{6}],[\dfrac{π}{6},\dfrac{π}{4}],[\dfrac{π}{4},\dfrac{π}{3}],[\dfrac{π}{3},\dfrac{5π}{12}]\), and \([\dfrac{5π}{12},\dfrac{π}{2}]\). Note that \(f(x)=\sin x\) is increasing on the interval \([0,\dfrac{π}{2}]\), so a leftendpoint approximation gives us the lower sum. A leftendpoint approximation is the Riemann sum \(\displaystyle \sum_{i=0}^5\sin x_i(\dfrac{π}{12})\).We have
\[A≈sin(0)(\dfrac{π}{12})+sin(\dfrac{π}{12})(\dfrac{π}{12})+sin(\dfrac{π}{6})(\dfrac{π}{12})+sin(\dfrac{π}{4})(\dfrac{π}{12})+sin(\dfrac{π}{3})(\dfrac{π}{12})+sin(\dfrac{5π}{12})(\dfrac{π}{12})=0.863.\]
Exercise \(\PageIndex{6}\)
Using the function \(f(x)=\sin x\) over the interval \([0,\dfrac{π}{2}],\) find an upper sum; let \(n=6.\)
 Hint

Follow the steps from Example \(\PageIndex{6}\).
 Answer

\(A≈1.125\)
Key Concepts
 The use of sigma (summation) notation of the form \(\displaystyle \sum_{i=1}^na_i\) is useful for expressing long sums of values in compact form.
 For a continuous function defined over an interval \([a,b],\) the process of dividing the interval into n equal parts, extending a rectangle to the graph of the function, calculating the areas of the series of rectangles, and then summing the areas yields an approximation of the area of that region.
 The width of each rectangle is \(Δx=\dfrac{b−a}{n}\).
 Riemann sums are expressions of the form \(\displaystyle \sum_{i=1}^nf(x^∗_i)Δx,\) and can be used to estimate the area under the curve \(y=f(x).\) Left and rightendpoint approximations are special kinds of Riemann sums where the values of \({x^∗_i}\)are chosen to be the left or right endpoints of the subintervals, respectively.
 Riemann sums allow for much flexibility in choosing the set of points \({x^∗_i}\) at which the function is evaluated, often with an eye to obtaining a lower sum or an upper sum.
Key Equations
 Properties of Sigma Notation
\(\displaystyle \sum_{i=1}^nc=nc\)
\(\displaystyle \sum_{i=1}^nca_i=c\sum_{i=1}^na_i\)
\(\displaystyle \sum_{i=1}^n(a_i+b_i)=\sum_{i=1}^na_i+\sum_{i=1}^nb_i\)
\(\displaystyle \sum_{i=1}^n(a_i−b_i)=\sum_{i=1}^na_i−\sum_{i=1}^nb_i\)
\(\displaystyle \sum_{i=1}^na_i=\sum_{i=1}^ma_i+\sum_{i=m+1}^na_i\)
 Sums and Powers of Integers
\(\displaystyle \sum_{i=1}^ni=1+2+⋯+n=\dfrac{n(n+1)}{2}\)
\(\displaystyle \sum_{i=1}^ni^2=1^2+2^2+⋯+n^2=\dfrac{n(n+1)(2n+1)}{6}\)
\(\displaystyle \sum_{i=0}^ni^3=1^3+2^3+⋯+n^3=\dfrac{n^2(n+1)^2}{4}\)
 LeftEndpoint Approximation
\(A≈L_n=f(x_0)Δx+f(x_1)Δx+⋯+f(x_{n−1})Δx=\sum_{i=1}^nf(x_{i−1})Δx\)
 RightEndpoint Approximation
\(A≈R_n=f(x_1)Δx+f(x_2)Δx+⋯+f(x_n)Δx=\sum_{i=1}^nf(x_i)Δx\)
Glossary
 leftendpoint approximation
 an approximation of the area under a curve computed by using the left endpoint of each subinterval to calculate the height of the vertical sides of each rectangle
 lower sum
 a sum obtained by using the minimum value of \(f(x)\) on each subinterval
 partition
 a set of points that divides an interval into subintervals
 regular partition
 a partition in which the subintervals all have the same width
 riemann sum
 an estimate of the area under the curve of the form \(A≈\sum_{i=1}^nf(x^∗_i)Δx\)
 rightendpoint approximation
 the rightendpoint approximation is an approximation of the area of the rectangles under a curve using the right endpoint of each subinterval to construct the vertical sides of each rectangle
 sigma notation
 (also, summation notation) the Greek letter sigma (\(Σ\)) indicates addition of the values; the values of the index above and below the sigma indicate where to begin the summation and where to end it
 upper sum
 a sum obtained by using the maximum value of \(f(x)\) on each subinterval
Contributors
Gilbert Strang (MIT) and Edwin “Jed” Herman (Harvey Mudd) with many contributing authors. This content by OpenStax is licensed with a CCBYSANC 4.0 license. Download for free at http://cnx.org.