33 - Sequences

A sequence is a function f:N→R. an=f(n).

Example:
3, 9, 27, ...
(an)n∈N

Arithmetic sequence:

Geometric sequence:

Limits:
limn→∞1n=0

Choose an epsilon ε for which to be within the limit.

Call the x value where this happens N. All x after N must be within ε.

∀ε>0,∃N∈R,∀n∈N,n>N⟹|an−L|<ε.

!Screenshot 2023-12-04 at 10.18.42 AM.png
!Screenshot 2023-12-04 at 1.00.14 PM.png

Proof of limit:
The sequence (an)n∈N defined by an=3−4n converges to L=3.

∀ε>0,∃N∈R,∀n∈Nn>N⟹|(3−4n)−3|<ε.

Scratch work.
Let ε>0.
|(3−4n)−3|<ε
4n<ε
4<nε
n>4ε
Set N=4ε

Proof.
Let ε>0. Fix N=4ε. Let n∈N,n>N
Then

|3−4n−3|=|−4n|=4n<4N=4(4ε)=ε

◻

Prove that limn→∞(n2+1−n)=0

Scratch work

|n2+1−n−0|<εn2+1−n<εn2+1=n+εn2+1=(n+ε)2n2+1=n2+2εn+ε2n=1−ε22ε

Proof. Let ε>0. Fix N=1−ε22ε. Let n>N,n∈N. Then

n>1−ε22ε2εn>1−ε22εn+ε2>1n2+2εn+ε2>n2+1(n+ε)2>n2+1n+ε>n2+1ε>n2+1−n

Thus ε>|n2+1−n−0|. ◻

E 33.8
¬(∀ε>0,∃n∈R,n>N⟹|an−L|<ε) =
∃ε>0,∀N∈R,∃n∈N,n>N∧|an−L|≥ε



HW 33

Ben Finch

E 33.1
a)

b)

c)

d)

E 33.2
a) ∀ε>0,∃N∈R,n>N⟹|(3−4n)−3|<ε
b) ∃ε>0,∀N∈R,∃n∈N,n>N∧|6−3|≥ε

E 33.3
a)
Proof. We have two cases:
Suppose max(a,b)=a. Thus max(a,b)≥a. Then a≥b so max(a,b)≥b.
Suppose max(a,b)=b. Thus max(a,b)≥b. Then b>a, so max(a,b)>a. ◻

b)
Proof. We have two cases:
Suppose min(a,b)=a. Thus min(a,b)≤a. Then a≤b so min(a,b)≤b.
Suppose min(a,b)=b. Thus min(a,b)≤b. Then b<a so min(a,b)<a.

c)
Proof. Assume x>max(a,b). We have two cases:
Suppose max(a,b)=a. Then x>a≥b.
Suppose max(a,b)=b. Then x>b>a. ◻

E 33.4

Scratch work:

|2n2|<ε2n2<ε2<εn22ε<n2N=2ε

Proof.
Let ε>0. Fix N=2ε. Let n>N,n∈N. Then

n>2εn2>2εεn2>2ε>2n2

Thus ε>|2n2−0| and so the limn→∞2n2=0. ◻

E 33.5
Scratch work:

|3n−52n+4−32|<ε3n−52n+4−32<ε2(3n−5)−3(2n+4)2(2n+4)<ε6n−10−6n−124n+8<ε−224n+8<ε−22<ε(4n+8)−22<4εn+8ε−4εn<22+8ε4εn>−22−8εn>−22−84εN=−22−84ε

Proof.
Let ε>0. Fix N=−22−84ε. Let n>N,n∈N. Then

n>−22−84ε4εn>−22−8ε−4εn<22+8ε−22<4εn+8ε−22<ε(4n+8)−224n+8<ε6n−10−6n−124n+8<ε2(3n−5)−3(2n+4)2(2n+4)<ε3n−52n+4−32<ε

Thus ε>|3n−52n+4−32|. ◻

E 33.6
The sequence does converge with a limit at 1.

Scratch Work:

|n+1n−1|<εn+1n−1<εn+1−nn<ε1n<εn>1εN=1ε

Proof.
Let ε>0. Fix N=1ε. Let n>N,n∈N. Then

n>1ε1n<εn+1−nn<εn+1n−1<ε

Thus ε>|n+1n−1|. So the sequence converges with a limit at 1. ◻

E 33.7

Let ε>0. We want to find N∈N such that for all n>N, |an−c|<ε holds.

Since an=c for all n, we can see that:
|an−c|=|c−c|=0<ε

The inequality 0<ε holds for any positive ε, as 0 is less than any positive number.

Therefore, we can choose any N, for example N=1, and the condition |an−c|<ε will be satisfied for all n>N, because the left-hand side of the inequality is always 0, which is less than any positive ε.

This proves that the constant sequence c,c,c,… converges to c. ◻

E 33.8
Proposition. ∃ε>0,∀N∈R,∃n∈N,n>N∧|n−3|≥ε

Proof.
Fix ε=1. We want to show that for any real number N, there exists a natural number n>N such that |n−3|≥1.

For any given N, choose n to be the smallest integer greater than N. Then n>N.

If n≥4, then |n−3|=n−3≥1.
If n≤2, then |n−3|=3−n≥1.

Therefore, no matter how large we choose N, we can always find an n>N such that |an−L|≥ε, which means the sequence an=n does not converge to L=3. ◻

E 33.9
Scratch work:

|n2+1−n−0|<εn2+1−n<εn2+1=n+εn2+1=(n+ε)2n2+1=n2+2εn+ε2n=1−ε22ε

Proof. Let ε>0. Fix N=1−ε22ε. Let n>N,n∈N. Then

n>1−ε22ε2εn>1−ε22εn+ε2>1n2+2εn+ε2>n2+1(n+ε)2>n2+1n+ε>n2+1ε>n2+1−n

Thus ε>|n2+1−n−0|. ◻

E 33.10
a)
Proof.
Let ε>0 be given. Since |r|<1, the sequence rn converges to 0. Hence, there exists an N such that for all n>N, |rn|<ε|c|. Then for all n>N:

|an−0|=|c⋅rn−1|=|c|⋅|rn−1|<|c|⋅ε|c|=ε

Thus, an converges to 0.

b)
Proof.
Suppose |r|≥1. Then an=c⋅rn−1 cannot converge to 0, because for |r|=1, an would stay at |c|, and for |r|>1, an would increase unbounded. Since an is given to converge to 0, we must have |r|<1. ◻

c)

Proof.
Let c>0 and r>1. Since r>1, rn→∞ as n→∞. Thus, an=c⋅rn−1 also tends to infinity as n increases, so an diverges. ◻