Scribd
Upload
54 views3 pages

Math 1281 Homework 1 Solutions

This document contains solutions to homework problems from a mathematics class. Problem 1 involves showing that the product of bounds of two sets is equal to the bound of their Cartesian product. Problem 2 involves showing that a certain set A contains rational and irrational numbers between 0 and 1. Problem 3 shows that the greatest lower bound of a set S is equal to the least upper bound of the set of all lower bounds of S.

Uploaded by

Liam Cameron
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
54 views3 pages

Math 1281 Homework 1 Solutions

This document contains solutions to homework problems from a mathematics class. Problem 1 involves showing that the product of bounds of two sets is equal to the bound of their Cartesian product. Problem 2 involves showing that a certain set A contains rational and irrational numbers between 0 and 1. Problem 3 shows that the greatest lower bound of a set S is equal to the least upper bound of the set of all lower bounds of S.

Uploaded by

Liam Cameron
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Department of Mathematics and Statistics Mathematics 1281* - 2010 Solutions to Homework Assignment 1

1. (a) There are, of course, many examples: one example is A = B = [1, 0], for then s = t = 0, C = [0, 1], and r = 1. (b) We are to show that st = r, and we will do this by showing that st r and that r st. If a A and if b B then and 0 a s, 0 b t, and hence ab st. Since every point in C has the form ab, where a A and b B, this shows that for each c C we have c st, hence st is an upper bound for C, and therefore r st as r is the least upper bound for C. For the reverse inequality rst notice that if s = 0 then A = {0}, thus C = {0} and r = 0, and hence st = r. A similar argument will show that if t = 0 then st = r, and so we may assume that neither s nor t is 0. This means that there will be an > 0 such that s > 0 and t > 0. Then we know that there will be a A and b B such that s < a s and t < b t, and therefore (s )(t ) < ab r st s t + 2 < r st < r + s + t 2 st lim r + s + t 2 = r,
0+

and so st r. (It is necessary to know that s > 0 and t > 0 in order to conclude that (s )(t ) < ab.) 2. (a) There are two decimal expansions of .5, .50000 and .49999 , and in neither one are all but a nite number of the digits 3s or 7s. This means that .5 A. 1

(b) Long division gives 37/99 = .373737 and so 37/99 A. (c) We will show that 0 = inf A and 1 = sup A. Now it is obvious that 0 is a lower bound for A and that 1 is an upper bound for A, and so it is only necessary to show that there is no lower bound for A which is larger than 0 and that there is no upper bound for A which is smaller than 1. For each k N consider the number ak = . 00 00 3333 .
k

This number certainly belong to A and ak = 10k .3333 = 10k /3, hence limk ak = 0, and so there cannot be a lower bound for A which is larger than 0. Indeed, if s > 0 there will be a k such that ak < s and hence s is not a lower bound for A. Now for each k N consider the number bk = . 99 99 3333 .
k

This number also belong to A and bk > . 99 99 = 1 . 00 00 1 = 1 10k ,


k k1

hence limk bk = 1, and so there can be no upper bound for A which is smaller than 1. Indeed, if t < 1 there will be a k such that bk > t and hence t is not an upper bound for A. 3. Put T = {x : x is a lower bound for S} s = inf S, t = sup T. We need to show that s = t and we will do this by showing that s t and t s.

For each x T , x s since x is a lower bound for S and s is the greatest lower bound for S, hence s is an upper bound for T , and therefore t s since t is the least upper bound for T . Next, s is a lower bound for S, hence s T , and therefore s t since t is an upper bound for T.

You might also like