Fiveable

โž—Calculus II Unit 1 Review

QR code for Calculus II practice questions

1.1 Approximating Areas

1.1 Approximating Areas

Written by the Fiveable Content Team โ€ข Last updated August 2025
Written by the Fiveable Content Team โ€ข Last updated August 2025
โž—Calculus II
Unit & Topic Study Guides

Approximating areas under curves is one of the central problems that motivates integration. By dividing a region into rectangles and summing their areas, you build the intuition for what a definite integral actually computes. Before you can do that efficiently, though, you need sigma notation to handle those sums without writing out dozens of terms.

Sigma Notation and Summation

Sigma notation for integer sums

Sigma notation is shorthand for writing the sum of a sequence of numbers using the Greek letter ฮฃ\Sigma. Instead of writing 1+4+9+16+251 + 4 + 9 + 16 + 25, you can write โˆ‘i=15i2\sum_{i=1}^{5} i^2. The general form is:

โˆ‘i=abf(i)\sum_{i=a}^{b} f(i)

where:

  • ii is the index of summation (the variable that changes with each term)
  • aa is the lower limit (starting value of ii)
  • bb is the upper limit (ending value of ii)
  • f(i)f(i) is the expression being summed (like i2i^2 or 2i+12i+1)

Properties of summation let you break apart and simplify sums:

  • Constant multiple rule: โˆ‘i=abcf(i)=cโˆ‘i=abf(i)\sum_{i=a}^{b} cf(i) = c\sum_{i=a}^{b} f(i). You can pull constants out front. For example, โˆ‘i=153i=3โˆ‘i=15i\sum_{i=1}^{5} 3i = 3\sum_{i=1}^{5} i.
  • Sum/Difference rule: โˆ‘i=ab[f(i)ยฑg(i)]=โˆ‘i=abf(i)ยฑโˆ‘i=abg(i)\sum_{i=a}^{b} [f(i) \pm g(i)] = \sum_{i=a}^{b} f(i) \pm \sum_{i=a}^{b} g(i). You can split a sum of two expressions into two separate sums.

Closed-form formulas you should memorize for evaluating sums quickly:

  • Sum of first nn integers: โˆ‘i=1ni=n(n+1)2\sum_{i=1}^{n} i = \frac{n(n+1)}{2}. For n=10n=10: 10(11)2=55\frac{10(11)}{2} = 55.
  • Sum of first nn squares: โˆ‘i=1ni2=n(n+1)(2n+1)6\sum_{i=1}^{n} i^2 = \frac{n(n+1)(2n+1)}{6}. For n=5n=5: 5(6)(11)6=55\frac{5(6)(11)}{6} = 55.
  • Sum of first nn cubes: โˆ‘i=1ni3=(n(n+1)2)2\sum_{i=1}^{n} i^3 = \left(\frac{n(n+1)}{2}\right)^2. For n=4n=4: (4(5)2)2=100\left(\frac{4(5)}{2}\right)^2 = 100.

These formulas become essential when you need to evaluate Riemann sums for specific functions, since the expressions inside the sum often reduce to combinations of ii, i2i^2, and i3i^3.

Sigma notation for integer sums, calculus - Sigma Notation multiple sigma - Mathematics Stack Exchange

Approximating Areas

Sigma notation for integer sums, Approximating Areas ยท Calculus

Rectangular approximations for curve areas

The core idea: to estimate the area under a curve f(x)f(x) on an interval [a,b][a, b], divide that interval into nn equal subintervals, build a rectangle on each one, and add up the rectangle areas. The width of each rectangle is always ฮ”x=bโˆ’an\Delta x = \frac{b-a}{n}, and the subinterval endpoints are xi=a+iฮ”xx_i = a + i\Delta x. What differs between methods is how you choose the height.

Left Riemann Sum uses the left endpoint of each subinterval for the height:

Ln=โˆ‘i=1nf(xiโˆ’1)ฮ”xL_n = \sum_{i=1}^{n} f(x_{i-1})\Delta x

If ff is increasing on [a,b][a,b], the left endpoint is the smallest value in each subinterval, so LnL_n underestimates the true area. If ff is decreasing, it overestimates.

Right Riemann Sum uses the right endpoint of each subinterval:

Rn=โˆ‘i=1nf(xi)ฮ”xR_n = \sum_{i=1}^{n} f(x_i)\Delta x

The pattern flips: for an increasing function, RnR_n overestimates; for a decreasing function, it underestimates.

Midpoint Riemann Sum uses the midpoint of each subinterval:

Mn=โˆ‘i=1nf(xiโˆ’1+xi2)ฮ”xM_n = \sum_{i=1}^{n} f\left(\frac{x_{i-1} + x_i}{2}\right)\Delta x

This tends to be more accurate than left or right sums because the overestimates and underestimates within each subinterval partially cancel out.

As you increase nn, all three methods get closer to the true area. Going from n=10n=10 to n=100n=100 to n=1000n=1000 rectangles, the approximation tightens significantly.

Upper and Lower Sums

These are a more theoretical way to bound the area:

  • Upper sum: Use the maximum value of ff on each subinterval as the rectangle height. This always overestimates the area.
  • Lower sum: Use the minimum value of ff on each subinterval. This always underestimates.

The true area is always squeezed between the lower and upper sums. As nn increases, both converge to the same value, which is the exact area. Note that for an increasing function, the left sum is the lower sum and the right sum is the upper sum, but this correspondence doesn't hold for all functions.

Riemann sums for definite integrals

The definite integral โˆซabf(x)โ€‰dx\int_a^b f(x)\, dx represents the exact area under f(x)f(x) from x=ax = a to x=bx = b (with area below the xx-axis counted as negative). Riemann sums are how we formally define this integral.

The connection is a limit:

โˆซabf(x)โ€‰dx=limโกnโ†’โˆžโˆ‘i=1nf(xiโˆ—)ฮ”x\int_a^b f(x)\, dx = \lim_{n \to \infty} \sum_{i=1}^{n} f(x_i^*)\Delta x

where xiโˆ—x_i^* is any sample point in the ii-th subinterval and ฮ”x=bโˆ’an\Delta x = \frac{b-a}{n}. It doesn't matter whether you pick left endpoints, right endpoints, or midpoints; as nโ†’โˆžn \to \infty, they all converge to the same value (provided ff is integrable on [a,b][a,b]).

Steps to compute a Riemann sum for a specific nn:

  1. Find the width of each subinterval: ฮ”x=bโˆ’an\Delta x = \frac{b-a}{n}.
  2. Identify the sample points xiโˆ—x_i^* in each subinterval (left, right, or midpoint).
  3. Evaluate f(xiโˆ—)f(x_i^*) at each sample point.
  4. Multiply each function value by ฮ”x\Delta x to get the area of that rectangle.
  5. Sum all rectangle areas: โˆ‘i=1nf(xiโˆ—)ฮ”x\sum_{i=1}^{n} f(x_i^*)\Delta x.

To find the exact area, you'd carry out steps 1-5 with a general nn, use the closed-form summation formulas from earlier to simplify, and then take limโกnโ†’โˆž\lim_{n \to \infty} of the result.