Skip to content

Limit of a sequence from the definition, squeeze and bounds

Math I: Calculus · Week 2 test, open question · 7 points · Lecture 3

Problem

Define, for n≥1,n\geq1\text{,}

an=2(−1)nn2+n,bn=2cos⁡(1n).a_n=\frac{2(-1)^n}{n^2+n},\quad b_n=\sqrt{2}\cos\left(\frac{1}{n}\right).
  • (a) Prove, using the definition, that (an)n=1∞(a_n)_{n=1}^{\infty} converges to 0.0\text{.} [2 points]
  • (b) Determine whether the sequence a1b1,a2b2,…a_1b_1,a_2b_2,\dots is convergent. If it is, find its limit; if not, justify. [2 points]
  • (c) Evaluate inf⁡n≥1an−sup⁡n≥1bn\inf_{n\geq1}a_n-\sup_{n\geq1}b_n and briefly justify both bounds. [3 points]

What you need

Plan

In (a), find a simple upper bound for ∣an∣|a_n| that clearly goes to 0,0\text{,} and choose NN from it. In (b), do not compute lim⁡bn\lim b_n at all: boundedness of (bn)(b_n) is enough. In (c), list the first few terms to see where the extreme values sit, then justify each bound separately. One of them is attained and the other is not.

Step-by-step solution

Try each step yourself before you open it.

(a) Step 1 · Bound the distance to the limit and choose N (1 point)

Let ε>0.\varepsilon>0\text{.} Since n2+n>n,n^2+n>n\text{,}

∣an−0∣=2n2+n<2n.|a_n-0|=\frac{2}{n^2+n}<\frac{2}{n}.

So it is enough to make 2/n<ε.2/n<\varepsilon\text{.} Choose a positive integer N>2/ε.N>2/\varepsilon\text{.}

Concept: Limit of a sequence

(a) Step 2 · Verify for all n ≥ N (1 point)

If n≥N,n\geq N\text{,} then

∣an−0∣<2n≤2N<ε.|a_n-0|<\frac{2}{n}\leq\frac{2}{N}<\varepsilon.

Since ε>0\varepsilon>0 was arbitrary, an→0a_n\to0 by definition.

(b) Step 1 · Bound the second factor (1 point)

Because ∣cos⁡x∣≤1|\cos x|\leq1 for all x,x\text{,} we have ∣bn∣≤2|b_n|\leq\sqrt{2} for every n.n\text{.} You do not need the limit of (bn)(b_n) here.

(b) Step 2 · Squeeze (1 point)

Then

0≤∣anbn∣≤2 ∣an∣→0.0\leq|a_nb_n|\leq\sqrt{2}\,|a_n|\to0.

By the squeeze theorem ∣anbn∣→0,|a_nb_n|\to0\text{,} so anbn→0.a_nb_n\to0\text{.} The sequence converges, with limit 0.0\text{.}

Concept: Squeeze theorem for sequences

(c) Step 1 · The infimum of (a_n) (1 point)

The sign of ana_n alternates: an>0a_n>0 for even nn and an<0a_n<0 for odd n.n\text{.} For odd nn the size 2/(n2+n)2/(n^2+n) decreases as nn grows:

a1=−1,a3=−16,a5=−115, …a_1=-1,\quad a_3=-\frac{1}{6},\quad a_5=-\frac{1}{15},\ \dots

So every term is at least a1=−1,a_1=-1\text{,} and −1-1 is itself a term. Hence inf⁡n≥1an=−1;\inf_{n\geq1}a_n=-1\text{;} it is even a minimum.

(c) Step 2 · The supremum of (b_n) (1 point)

For every n,n\text{,} 0<1/n≤1,0<1/n\leq1\text{,} so cos⁡(1/n)<1\cos(1/n)<1 and bn<2.b_n<\sqrt{2}\text{.} Thus 2\sqrt{2} is an upper bound.

It is the least upper bound because 1/n→01/n\to0 and cosine is continuous, so bn→2.b_n\to\sqrt{2}\text{.} For any η>0\eta>0 some bnb_n exceeds 2−η,\sqrt{2}-\eta\text{,} so no smaller number is an upper bound. Hence sup⁡n≥1bn=2,\sup_{n\geq1}b_n=\sqrt{2}\text{,} although no term equals 2.\sqrt{2}\text{.}

Concept: Supremum

(c) Step 3 · Combine (1 point)
inf⁡n≥1an−sup⁡n≥1bn=−1−2.\inf_{n\geq1}a_n-\sup_{n\geq1}b_n=-1-\sqrt{2}.

Where marks are lost

  • Choosing NN that depends on n.n\text{.} In (a), NN may depend on ε\varepsilon only.
  • Trying to compute lim⁡bn\lim b_n in (b) and multiplying limits. That works here, but boundedness is all you need, and the bounded-times-null argument also works when (bn)(b_n) has no limit.
  • Saying "the supremum is the largest term". In (c) the supremum 2\sqrt{2} is not attained. You must show it is an upper bound and that nothing smaller is.
  • Ignoring the sign of an.a_n\text{.} The infimum comes from the negative terms, not from the limit 0.0\text{.}

Try next

Symbols: delta, epsilon, eta, infinity, square root, sum