Scribd
Upload
149 views3 pages

Math 2510: Real Analysis I - Homework Solutions 12: 12 The Completeness Axiom

This document contains solutions to homework problems from a real analysis course. It discusses concepts like supremum, infimum, and completeness as they relate to subsets of real numbers. For each problem, it provides explanations and proofs of key properties, like showing that the supremum of a non-empty bounded set is unique, or that multiplying a set by a non-negative constant k preserves the relationships between the supremum/infimum and k.

Uploaded by

arengifoipen
Copyright
© © All Rights Reserved
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
149 views3 pages

Math 2510: Real Analysis I - Homework Solutions 12: 12 The Completeness Axiom

This document contains solutions to homework problems from a real analysis course. It discusses concepts like supremum, infimum, and completeness as they relate to subsets of real numbers. For each problem, it provides explanations and proofs of key properties, like showing that the supremum of a non-empty bounded set is unique, or that multiplying a set by a non-negative constant k preserves the relationships between the supremum/infimum and k.

Uploaded by

arengifoipen
Copyright
© © All Rights Reserved
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
You are on page 1/ 3

Math 2510: Real Analysis I Homework Solutions 12

Fall 2008

12 The Completeness Axiom


12.3 For each subset of R, give its supremum and its maximum, if they exist. Otherwise, write none.
(a) {1, 3}
sup{1, 3} = max{1, 3} = 3
(c) [0, 4]
sup[0, 4] = max[0, 4] = 4

|nN
(e)



Notice that n1 | n N = 1, 12 , 13 , 14 , . . . .




sup n1 | n N = max n1 | n N = 1
n
o
n
(g) n+1
|nN
n
o 

n
| n N = 12 , 23 , 34 , 54 , . . . .
Notice that n+1
n
o
n
sup n+1
| n N = 1, maximum is none.
o
n
n
(i) n + (1)
|
n

N
n
n
o 

n
Notice that n + (1)
|
n

N
= 0, 2 + 21 , 3 13 , 4 + 14 , 5 15 , . . . .
n
The set is not bounded above, so the supremum is none and the maximum is none.


1
n

12.4 Repeat Exercise 12.3 for the infimum and the minimum of each set.
(a) {1, 3}
inf{1, 3} = min{1, 3} = 1
(c) [0, 4]
inf[0, 4] = min[0, 4] = 0

(e) n1 | n N



Notice that n1 | n N = 1, 12 , 13 , 14 , . . . .
1

inf n | n N = 0, minimum is none
n
o
n
(g) n+1
|nN
n
o 

n
Notice that n+1
| n N = 12 , 23 , 34 , 54 , . . . .
n
o
n
o
n
n
inf n+1
| n N = min n+1
| n N = 12
n
o
n
(i) n + (1)
|nN
n


n
o 

n
Notice that n + (1)
|
n

N
= 0, 2 + 21 , 3 13 , 4 + 14 , 5 15 , . . . .
n
n
o
n
o
inf n + (1)
= min n + (1)
=0
n |nN
n |nN
12.6a Let S be a non-empty bounded subset of R. Prove that sup S is unique.
Suppose that x and y are both suprema for S. Then
(1) x is an upper bound for S.
(2) If z is any upper bound for S, then x z.
(3) y is an upper bound for S.
(4) If z is any upper bound for S, then y z.
By (1), x is an upper bound for S and so by (4), y x. By (3), y is an upper bound for S
and so by (2), x y. Therefore x y and y x, so x = y by Trichotomy.
12.7a Let S be a non-empty bounded subset of R and let k be in R. Define kS = { ks | s S }. Prove the
following: If k 0, then sup(kS) = k sup S and inf(kS) = k inf S.
To prove that sup(kS) = k sup S there are two cases.
If k = 0, then kS = 0 S = {0} and so
sup(kS) = sup{0} = 0 = 0 sup S = k sup S.
Now suppose that k > 0. The number sup(kS) is the unique real number with the properties
(a) sup(kS) is an upper bound for kS and
(b) if y is any upper bound for kS, then sup(kS) y
Therefore, because sup(kS) is the only number for which properties (a) and (b) are true, to
show sup(kS) = k sup S it is sufficient to show that (a) k sup S is an upper bound for kS
and (b) if y is any upper bound for kS, then k sup S y.
To show that k sup S is an upper bound for kS, suppose that x is in kS. Then there is
an s in S so that x = ks. Then s sup S since sup S is an upper bound for S and so
x = ks k sup S. Since x was arbitrary, k sup S is an upper bound for kS.
To show (b), suppose that y is an upper bound for kS. Then ks y for every s in S, so
s y/k for every s in S. Therefore, y/k is an upper bound for S and so sup S y/k.
Multiplying by k we see that k sup S y as desired.
To prove that inf(kS) = k inf S there are two cases.
If k = 0, then kS = 0 S = {0} and so
inf(kS) = inf{0} = 0 = 0 inf S = k inf S.
Now suppose that k > 0. To show inf(kS) = k inf S it is sufficient to show that (c) k inf S is
a lower bound for kS and (d) if y is any lower bound for kS, then y k inf S.
To show that k inf S is a lower bound for kS, suppose that x is in kS. Then there is an s in
S so that x = ks. Then s inf S since inf S is a lower bound for S and so x = ks k inf S.
Since x was arbitrary, k inf S is a lower bound for kS.
To show (d), suppose that y is a lower bound for kS. Then ks y for every s in S, so s y/k
for every s in S. Therefore, y/k is a lower bound for S and so inf S y/k. Multiplying by
k we see that k inf S y as desired.

12.10a Prove:If x and y are real numbers with x < y, then there are infinitely many rational numbers in the
interval [x, y].
In class.

You might also like