- Estimate the area under a curve by adding up the areas of rectangles
- Estimate the area under a curve using Riemann sums
Approximating Area
The Main Idea
- Area under a curve can be approximated using rectangles
- Two main methods: left-endpoint and right-endpoint approximations
- Increasing the number of rectangles improves accuracy
- Riemann sums formalize this approximation process
- Partitions:
- Divide interval [a,b][a,b] into n subintervals
- Regular partition: subintervals of equal width Δx=(b−a)nΔx=(b−a)n
- Left-Endpoint Approximation:
- Ln=∑ni=1f(xi−1)ΔxLn=∑ni=1f(xi−1)Δx
- Rectangle heights based on function value at left endpoint
- Right-Endpoint Approximation:
- Rn=∑ni=1f(xi)ΔxRn=∑ni=1f(xi)Δx
- Rectangle heights based on function value at right endpoint
- Convergence:
- As nn increases, approximations generally become more accurate
- Left and right approximations often converge to the true area
Find the sum of the values of f(x)=x3f(x)=x3 over the integers 1,2,3,⋯,101,2,3,⋯,10.
Find left and right-endpoint approximations for ∫20x2dx∫20x2dx with n=4n=4.
Riemann Sums
The Main Idea
- Riemann sums generalize left and right endpoint approximations. They allow evaluation of the function at any point within each subinterval
- As the number of subintervals increases, the approximation improves
- Riemann sums can be used to define the area under a curve
- Riemann Sum Definition:
- n∑i=1f(x∗i)Δxn∑i=1f(x∗i)Δx where x∗ix∗i is any point in the subinterval [xi−1,xi][xi−1,xi]
- Area Under a Curve:
- A=limn→∞n∑i=1f(x∗i)ΔxA=limn→∞n∑i=1f(x∗i)Δx
- Upper and Lower Sums:
- Upper sum:
- Choose x∗ix∗i for maximum f(x∗i)f(x∗i) in each subinterval
- Lower sum:
- Choose x∗ix∗i for minimum f(x∗i)f(x∗i) in each subinterval
- Upper sum:
- Convergence:
- For continuous functions, the limit of Riemann sums is unique
- The limit doesn’t depend on the choice of x∗ix∗i
Find a lower sum for f(x)=sinxf(x)=sinx over the interval [a,b]=[0,π2][a,b]=[0,π2]; let n=6n=6.
Using the function f(x)=sinx over the interval [0,π2], find an upper sum; let n=6.