The definition of §161 says that ∫abf(x)dx is the limit of sums ∑fvδv as the pieces shrink. Usually we never use this directly: an antiderivative is far quicker. §164 shows that for a few functions the limit can be computed by hand, which makes the definition concrete. More importantly, the same identity can be read backwards: a complicated limit of a sum is sometimes recognisable as an integral, and then it is easy. That second use will reappear whenever we meet a sum that “looks like” a Riemann sum.
The idea
Two things in the definition are free for us to choose, because the theorem of §161 guarantees the same limit for every choice:
the division points, as long as the longest piece tends to 0;
the sample point in each piece, where fv is evaluated.
Equal pieces are the obvious choice, and they work well for polynomials, since sums of powers of integers have closed forms. But equal pieces are not always the convenient ones. For xk (with k not a positive integer) Hardy divides [a,b] in geometric progression: the points a,ar,ar2,…,arn=b. Then the left-hand sum is a geometric series, which can always be summed.
ExploreUnequal pieces that make the sum easy
Try this.Start with k=2 and n=4, and double n a few times. Watch the factor (r−1)/(rk+1−1) in the read-out. Then choose k=−1.
∫14x2dx with division points 1,r,r2,…,r4=4, so r=1.4142
xy
y = x²
rectangle on [arᵛ, arᵛ⁺¹] with height f(arᵛ)
division points: each is r times the last
power k
Sum of the rectangles =14.272078; in closed form it is (bk+1−ak+1)rk+1−1r−1=14.272078.
The only part that depends on n is rk+1−1r−1=0.226541, which tends to k+11=0.333333; the limit is k+1bk+1−ak+1=21. Error now −6.73.
What to notice
The pieces are narrow near a and wide near b, yet all of them shrink as n grows, which is all the definition asks. The whole dependence on n sits in one factor, which tends to 1/(k+1). For k=−1 that formula breaks down, and the sum becomes n{(b/a)1/n−1}, which tends to log(b/a): the logarithm appears as an area, as it should.
Precise statements
The theorem behind every calculation in this lesson is the existence theorem of Definite integrals and areas, read as a statement about limits.
TheoremRiemann sums with any pointsHardy: §§161, 164
Let f be continuous on [a,b]. For each n let a=x0(n)<x1(n)<⋯<xkn(n)=b be a partition whose longest piece tends to 0 as n→∞, and let ξv(n) be any point of the v-th piece. Then
The second is the one to look for when you meet a limit of a sum: try to write the r-th term as n1f(r/n).
Proofs
The theorem is a restatement of §161: given ε, take the δ of the existence theorem; once the longest piece is shorter than δ (which happens for all large n) every Riemann sum is within ε of the integral. Here instead is the model calculation, Hardy’s first example, as a step-through proof.
Proof∫abxdx=21(b2−a2) from the definition
Strategy
Use n equal pieces and left endpoints, so the sum is an arithmetic series. Sum it in closed form, then let n→∞. The theorem above guarantees that the limit of these particular sums is the integral.
Set up the sum
With h=(b−a)/n the points are xv=a+vh, and the left-endpoint sum is
v=0∑n−1h(a+vh)=nha+h2{0+1+⋯+(n−1)}.
Sum the arithmetic series
0+1+⋯+(n−1)=21n(n−1), and nh=b−a, so the sum is
(b−a){a+(b−a)2n2n(n−1)}.
Let n→∞
n(n−1)/(2n2)=21(1−1/n)→21, so the sum tends to (b−a){a+21(b−a)}=21(b−a)(b+a)=21(b2−a2).
Check by a picture
The region under y=x from a to b (for 0≤a<b) is a trapezium with parallel sides a and b and width b−a, of area 21(a+b)(b−a). The same answer, as it must be.
∎
Proof∫abxkdx by a geometric partition (0<a<b, k=−1)
Strategy
With points in geometric progression, the left-endpoint terms form a geometric progression too. Sum it exactly; all the dependence on n collapses into a single factor whose limit is a derivative in disguise.
The terms
Let r=(b/a)1/n and xv=arv. The v-th piece has length arv(r−1) and left value (arv)k, so its term is ak+1(r−1)(rk+1)v.
Sum the geometric series
Summing for v=0,…,n−1 and using rn(k+1)=(b/a)k+1,
ak+1(r−1)rk+1−1rn(k+1)−1=(bk+1−ak+1)rk+1−1r−1.
The pieces do shrink
The longest piece is the last, arn−1(r−1)<b(r−1), and r=(b/a)1/n→1 (§74), so the longest piece tends to 0 and the theorem applies.
The limit of the factor
r−1rk+1−1 is the difference quotient of t↦tk+1 between 1 and r; as r→1 it tends to the derivative at t=1, namely k+1. So the sum tends to k+1bk+1−ak+1.
∎
Worked examples and exercises
ExerciseThe logarithm as a limit of sums●●○Hardy: Examples LXIV, 2 (case k=−1)
Using the geometric partition, show that ∫abxdx=limn→∞n{(b/a)1/n−1} for 0<a<b, and conclude that this limit is log(b/a).
Hint
With k=−1 every term is a0(r−1)r0=r−1.
Solution
Each piece [arv,arv+1] contributes (arv+1−arv)⋅arv1=r−1, so the left sum is n(r−1)=n{(b/a)1/n−1}. The longest piece tends to 0 as before, so these sums tend to ∫abdx/x. By §162 that integral is logb−loga=log(b/a), where log is defined as ∫1xdt/t. This gives a second proof that the limit of §75 exists, and identifies it.
Exercisex2 and cosmx with equal pieces●●○Hardy: Examples LXIV, 3
Evaluate ∫abx2dx and ∫abcosmxdx (m=0) from the definition, with n equal pieces.
Hint
For x2 you need ∑v=0n−1v=21n(n−1) and ∑v=0n−1v2=61(n−1)n(2n−1).
Hint
For the cosine, multiply ∑v=0n−1cos(α+vβ) by 2sin21β and use 2sinBcosA=sin(A+B)−sin(A−B): the sum telescopes.
Since nβ=m(b−a), the right side is sin(mb−21mh)−sin(ma−21mh). So the Riemann sum equals
2sin21mhh{sin(mb−21mh)−sin(ma−21mh)}.
As h→0, 2sin21mhh→m1 (because sinu/u→1) and the bracket tends to sinmb−sinma. The integral is (sinmb−sinma)/m.
The next exercise is the “backwards” use. Here is the sum it asks about, drawn as rectangles.
ExploreA limit of sums that is really an integral
Try this.This is the left-endpoint sum for 1/(1+x2) on [0,1] with n equal pieces. Double n several times and compare the sum with the exact value.
∫011+x21dx, left rule with n=4
xy
y = f(x)
pieces above the axis count +
below the axis count −
Rule
Left sum S4=0.845294; exact value 0.785398; error 0.0599 (refine and watch how fast it shrinks).
What to notice
The exact value is 41π=0.785398…, and the error roughly halves each time n doubles: it is about 1/(4n). The sum is exactly n∑r=0n−11/(n2+r2), a limit that would be hard to guess without the picture.
Exercise●○○Hardy: Examples LXIV, 4
Prove that nr=0∑n−1n2+r21→41π as n→∞.
Hint
Divide the numerator and the denominator of each term by n2.
The sum is n1∑r=0n−11−(r/n)2, the left-endpoint sum for 1−x2 on [0,1], so it tends to ∫011−x2dx=41π, the area of a quarter of the unit disc. Geometrically, the sum counts the area of n columns standing under the quarter circle; each column reaches up to the circle at its left edge, so the columns cover the quarter disc. (Since 1−x2 is decreasing, these are the upper sums.)
ExerciseSpotting the integral●●○Hardy: §164
Find n→∞lim(n+11+n+21+⋯+2n1).
Hint
Write the r-th term as n1⋅1+r/n1.
Solution
The sum is n1∑r=1n1+r/n1, the right-endpoint sum for 1/(1+x) on [0,1] with n equal pieces. It tends to ∫011+xdx=log2≈0.6931. (For n=10 the sum is 0.6688; the right-endpoint sum of a decreasing function is too small.)
Check yourself
Check yourselfChoose one
In computing ∫abf for continuous f as a limit of sums ∑fvδv, which of these must we take care to ensure?
Why
By the existence theorem, every choice of division points and sample points gives the same limit, provided the longest piece shrinks to 0. Making the number of pieces tend to infinity is not enough: one piece could stay long.
Hardy’s division of [a,b] at a,ar,…,arn is only a heuristic, because the definite integral is defined using equal pieces.
Why
False. The definition of §161 allows any partition; the theorem says that all partitions whose longest piece tends to 0 give the same limit. The geometric partition qualifies, since its longest piece arn−1(r−1) tends to 0.
Check yourselfChoose one
The limit n→∞limn1r=1∑n(nr)3 equals which integral?
Why
The term is n1f(r/n) with f(x)=x3, a right-endpoint sum on [0,1], so the limit is 41. Directly: ∑r=1nr3=41n2(n+1)2, and dividing by n4 gives a quantity tending to 41; the n4 growth is exactly cancelled.
Hardy’s language
Summary
Summary
The definition leaves both the division points and the sample points free; only the longest piece must tend to 0.
Equal pieces turn ∫xdx and ∫x2dx into sums of powers of integers; a geometric partition turns ∫xkdx into a geometric series, for any k.
For k=−1 the geometric partition gives log(b/a)=limn{(b/a)1/n−1}.
Read backwards: a limit of the form limn1∑f(r/n) is ∫01f, which turns hard limits into easy integrals.