Assignment 1 - Maths 332 Problem 1. Solution 1. Assume that b1 , b2 are additive inverses of a (a, b1 , b2 R).

. Thus, we have the following b1 = b1 + 0 = b1 + (a + b2 ) = = (b1 + a) + b2 0 + b2 (associativity) (additive identity)

= b2 Hence, the addictive inverse of a number in R is unique. Problem 2. Solution 2. (i) a b Suppose that z is an upper bound of S, thus, by (a), we have u z. However, by the initial assumption, we have z < u. This yields the contradiction. Thus, z is not n upper bound of S. (ii) b c Suppose that there does not exist y S such that z < y; this means y S, y z. This implies that z is an upper bound of S. This again contradicts the initial assumption that if z < u then z is NOT an upper bound of S. (iii) c d Notice that > 0, we have u such that u < y . (iv) d a Let v is an upper bound of S. Suppose that u > v. Let = uv v = u . Since > 0, there exists y S such that u < y , i.e v < y . This yields a contradiction (since v is an upper bound of S then v y y S). Problem 3. Solution 3. Let N N and N For all > 0 and N = 17 . 2 17 + 1. Thus, this immediately implies that 2 < u, thus, by (c), there exists y S

> 0, there exist N N such that for all n N, n N , one has = 17 + 17 + n 17 1 17 17 2n N 2 2 n2 1

n2 + 17 n 0

(since

n2 + 17 > n)

Thus, we conclude that

n

lim

n2 + 17 n = 0

Problem 4. Solution 4. For question (a) and (b), we have C and D are bounded sequences in R, this implies that C + D and C D are also bounded sequences. Using the Completeness Axiom, we have sup(C), sup(D), sup(C D) and sup(C + D) exist. (a) Let c + d C + D where c C and d D. Thus, we have c + d sup(C + D) This implies that c C, c sup(C + D) d Thefore, sup(C + D) d is an upper bound of C. Thus, sup(C) sup(C + D) d This is equivalent to d sup(C + D) sup(C) By similar argument as above, we obtain sup(C) + sup(D) sup(C + D) Moreover, we have for all c + d C + D c d sup(C) sup(D) (1)

c + d sup(C) + sup(D) This means sup(C) + sup(D) is an upper bound for (C+D). Thus, sup(C + D) sup(C) + sup(D) (2)

From (1) and (2) above, sup(C) + sup(D) = sup(C + D). (b) WLOG, suppose that sup(C) = max{sup(C), sup(D)}. Let x C D, therefore, x C or x D. In either case, x sup(C). Thus, sup(C) is an upper bound of C D. Therefore, sup(C D) sup(C). (*) Also, let y C, therefore, y C D and thus, y sup(C D). This says that sup(C D) is an upper bound of C. Therefore, sup(C) sup(C D)(**). From (*) and (**), we have sup(C D) = sup(C). 2

(c) We consider the following bounded sequences 1 n is odd an = 1 n is even and bn =

1 1

n is even n is odd

We have sup(an ) = 1 and sup(bn ) = 1 and thus, sup(an + bn ) = 2. Moreover, we also see that an + bn = 0 Therefore, sup(an + bn ) = 0 This clearly shows that sup(an + bn ) = sup(an ) + sup(bn ) Problem 5. Solution 5. We will use Cauchy sequence to investigate the convergence or the divergence of the sequence xn . We might symbolise the denition of Cauchy sequence as follows Cauchy Sequence ( > 0) (N N) (m, n N ) [|am an | < ] and the converse is presented as follows Not Cauchy Sequence ( > 0) (N N) (m, n N ) [|am an | ] (a) We will show that xn = n is a Cauchy sequence. Let > 0 and N = 2n + 1 1 1 +1. We immediately see that N > . Thus, m, n N (m, n N), n N

we have n m 2m + 1 2n + 1 = Thus, xn is convergent in R. 3 |m n| (2m + 1)(2n + 1) m+n 1 1 = + 2nm 2m 2n 1 = N

(b) We have the following subsequences of xn a = 2n 2n 2n + 1 (2n + 1) a 2n+1 = 2n + 2 We have

n

lim a2n = lim

2 2+

1 n

=1

and
n

lim a2n+1 = lim

1 2 n 2 = 1 n 2 + n

Since
n

lim a2n = lim a2n+1

n

By the theorem given in the lecture, the limit of two subsequences of xn when n are not the same. Thus, xn is divergent. (c) Let N N, and m=N +1 n=N We consider |xm xn | = = = = If we also let = n2 m2 m+1 n+1 |mn(m n) + (m n)(m + n)| (m + 1)(n + 1) |m n|(mn + m + n) (m + 1)(n + 1) N (N + 1) + 2N + 1 N 2 + 3N + 1 = 2 (N + 1)(N + 2) N + 3N + 2

1 then we have 3N |xm xn | >

Therefore, xn is not Cauchy and hence, xn is divergent. (d) We will show that the limit of the sequence xn is 2. Indeed, let > 0 1 1 and N = + 1. We immediately see that N N and N > and for

all n N, n N , one has |xn 2| = < < Thus,

n

1 n2 + 1 1 n 1 < N

lim xn = 2

Problem 6. Solution 6. Notice that (yn ) > 0 n N. We have yn+2 yn+2 yn+1 yn+2 lim n yn+1 l = yn+1 + yn yn = 1+ yn+1 yn = lim +1 n yn+1 1 = 1+ l

This is equivalent to the following quadratic equation l2 l 1 = 0 Solving this gives l1,2 Furthermore, l > 0 so we have yn+1 1+ 5 lim =l= n yn 2 1 5 = 2