WTW220 HOMEWORK 04

Homework Problem 1. Squeezes

(1) Let x ∈ R. Prove: If, for every ε > 0, we have 0 ≤ x < ε, then x = 0. [Hint: Try a proof by contradiction.
Write the proof outline as usual, but suppose that the conclusion of the implication is false. Try using
x/2 for ε].

(2) Let x ∈ R. Prove: If, for every n ∈ N, we have 0 ≤ x < 1/n, then x = 0. [Hint: Try a proof by
contradiction. Write the proof outline as usual, but suppose that the conclusion of the implication is
false. Use the Archimedean postulate].

Homework Problem 2. Definitions

Let (xn ) ⊆ R be a sequence and let x ∈ R.

(1) Write down the definition of “(xn ) to converges to x”.

(2) Write down the definition of “(xn ) is monotone increasing.”

(3) Write down the definition of “(xn ) is monotone decreasing.”

(4) Write down the definition of “(xn ) is bounded above.”

(5) Write down the definition of “(xn ) is bounded below.”

(6) Write down the definition of “(xn ) is bounded.”

(7) Write down the definition of “(xn ) to diverges to +∞”.

(8) Write down the definition of “(xn ) does not converge to x” [Hint: Negate the definition of “(xn ) to
converges to x”].

(9) Write down the definition of “(xn ) is not bounded.” [Hint: Negate the definition of “(xn ) is bounded”].

Homework Problem 3. Approximating by a sequence of rationals

(1) Let b ∈ R. Construct a sequence of rational numbers in the interval (−∞, b) that converges to b. Prove
explicitly using the definition that this sequence converges to b. [Hint: For every n ∈ N, use the density
of rationals to obtain a rational inside (b − n1 , b). Label appropriately].

Note here that there is no restriction on b. In particular, we can approximate any irrational number by a
sequence of rational numbers. Pay attention to how the completeness axiom and the well-ordering principle
plays (an indirect) role here.
1
 WTW220 HOMEWORK 04 2

Homework Problem 4. Some sequence and limit proofs

(1) Let (xn ) ⊆ R and x ∈ R. Prove: If (xn ) converges to x, then (|xn |) converges to |x|. [Hint: Use the
reverse triangle inequality].

(2) Let (xn ) ⊆ R and x ∈ R. Prove: If (xn ) converges to x, then (xn ) is bounded. [Hint: Use 1 for ε in the
assumption].

(3) Let (xn ) ⊆ R and x ∈ R. Prove: If (xn ) is bounded, then, for every K ∈ R, the sequence (xn + K) is
bounded.

(4) Define (
0 n even
zn := (n ∈ N).
1 n odd
(a) Using the negation of the definition, prove that (zn ) does not converge to 0.

(b) Using the negation of the definition, prove that (zn ) does not converge to 1.

(5) Let (xn ) ⊆ R and x, b ∈ R. Prove: If (xn ) converges to x and, for all n ∈ N, xn ≤ b, then x ≤ b. [Hint:
Try a proof by contradiction. Suppose b < x then use 0 < x − b =: ε0 in the definition of convergence
to obtain an N ∈ N so that b < xN ].

(6) Let (xn ), (yn ) ⊆ R and x, y ∈ R. (Sum Law) Prove: If (xn ) converges to x and (yn ) converges to y,
then (xn + yn ) converges to x + y.

(7) Let (xn ), (yn ) ⊆ R and x, y ∈ R. Prove: If (xn ) diverges to +∞ and (yn ) converges to y, then (xn + yn )
diverges to +∞. [Hint: We can force (yn ) to eventually be within a distance 1 of y.].

(8) (A left shift) Let (xn ) ⊆ R and x ∈ R.

(a) Prove: If (xn ) converges to x, then, for any K ∈ N, (xn+K ) converges to x.

(b) Without using any words draw a picture of the sets {(j, xj ) ∈ R2 : j ∈ N} and {(j, xj+K ) ∈ R2 :
j ∈ N} that to illustrate what is going on here.

(9) Let (xn ), (yn ) ⊆ R and x, y ∈ R. Prove: If (xn ) is bounded, then there exists M ≥ 0 so that, for every
n ∈ N,
|xn yn − xy| ≤ M |yn − y| + |y||xn − x|.

(10) (Product Law) Let (xn ), (yn ) ⊆ R and x, y ∈ R. Use (9) to prove: If (xn ) converges to x and (yn )
converges to y, then (xn yn ) converges to xy. [Hint: be careful not to divide by zero; 0 ≤ z < z + 1
makes it safe to divide by z + 1].

(11) Let (xn ) ⊆ R and x ∈ R. Prove directly using the definition: If (xn ) converges to x, then (x2n )
converges to x2 . [Hint: (xn + x) is bounded].

(12) Let (xn ) ⊆ R and x ∈ R. Prove using induction: For every m ∈ N, if (xn ) converges to x, then (xm
n)
converges to xm . [Hint: Maybe don’t try to prove this directly. Use the product law].