Professional Documents
Culture Documents
Exercise 2 3
Exercise 2 3
𝑦 𝑦 𝑦
𝑦>0⇒ > 0 ⇒ ∈ 𝑆1 & < 𝑦
2 2 2
2. Let S2 := { x ∈ ℝ ∶ 𝑥 > 0} . Does S2 have lower bounds? Does S2 have upper bounds?
Does inf S2 exists? Does sup S2 exists? Prove your statements
Proof:
1) Let S2 := { x ∈ ℝ ∶ 𝑥 > 0}
Since 0 < x for all x ∈ S1, we have that 0 is a lower bound of S2 and therefore,
any real number smaller than 0 is also a lower bound of S2.
Suppose now that S2 has at least one upper bound, then there exists u ∈ ℝ
such that x ≤ 𝑢 for all x ∈ S2.
Since, 0 < x and x ≤ u for all x ∈ S2 it follows that 0 < u which gives us that 0
< 1 ≤ u + 1 and therefore u,u+1 ∈ S2.
Thus since u is an upper bound of S2 and u + 1 ∈ S2 we have that u + 1 ≤ u
which gives us that 1 ≤ 0 which we know is not true.
Hence, S2 has no upper bounds.
2) We already know that 0 is a lower bound of S2. Suppose there exists a lower
bound s of S2 such that 0 < s. Then, we have in particular that s ∈ S2.
Observe now that 0 < s/2 < s. Thus, we have that s/2 ∈ S and s/2 < s which
contradicts the fact that s is a lower bound of S2.
Hence, S2 has no lower bound bigger than 0 and therefore inf S2 = 0.
Since the supremum of a nonempty set is always an upper bound of the set and S2
has no upper bounds, it follows that sup S2 does not exists.
1
3. Let 𝑆3 = { 𝑛 ∶ 𝑛 ∈ ℕ }. Show that sup 𝑆3 = 1 and inf 𝑆3 ≥ 1 ( It will follow from the
1
Let 𝑆3 ≔ {𝑛 ∶ 𝑛 ∈ ℕ }.
1
Since 1 ≤ 𝑛 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ∈ ℕ we have that 0 < 𝑛 ≤ 1 for all 𝑛 ∈ ℕ which gives us
1
Observe also that since = 1 we have that 1 ∈ 𝑆3 which gives us that given 𝑥 < 1
1
there exists 𝑆 ′ ∈ 𝑆3 such that 𝑥 < 𝑠′ ( just take 𝑠 ′ = 1 ) which gives us that 𝑥 is not an
upper bound od 𝑆3 and then since 𝑥 is an arbirary number smaller than 1 we have that
sup 𝑆3 = 1.
Since 𝑆3 is bounded from below we have that inf 𝑆3 exists. Since 0 is a lower bound
of 𝑆3 it follows from the definition of infimum that 0 ≤ inf 𝑆3 .
Answer :
(−1)𝑛
Let 𝑆4 ≔ {1 − : 𝑛 ∈ 𝑁}.
𝑛
(−1)𝑛 1
If 𝑛 𝑖𝑠 𝑜𝑑𝑑 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑡ℎ𝑎𝑡 = − 𝑛 𝑎𝑛𝑑 1 ≤ 𝑛 𝑤ℎ𝑖𝑐ℎ 𝑔𝑖𝑣𝑒𝑠 𝑢𝑠 𝑡ℎ𝑎𝑡 1 −
𝑛
(−1)𝑛 −1 1 1
=1−(𝑛)= 1+𝑛 ≥1>2
𝑛
(−1)𝑛 1
𝐼𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑡ℎ𝑎𝑡 = 𝑛 𝑎𝑛𝑑 2 ≤ 𝑛 𝑤ℎ𝑖𝑐ℎ 𝑔𝑖𝑣𝑒𝑠 𝑢𝑠 𝑡ℎ𝑎𝑡 1 −
𝑛
(−1)𝑛 1 1 1
= 1 − (𝑛) ≥ 1−2=2
𝑛
𝑆𝑖𝑛𝑐𝑒 − 1/𝑛 < 1/𝑛 ≤ 1 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ∈ 𝑁 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑡ℎ𝑎𝑡 1 − 1/𝑛 < 1 + 1/𝑛 ≤
2 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ∈ 𝑁.
1 (−1)𝑛
𝑇ℎ𝑢𝑠, 2 ≤ 1 = ≤ 2 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ∈ 𝑁.
𝑛
1
𝐻𝑒𝑛𝑐𝑒, 𝑆4 𝑖𝑠 𝑏𝑜𝑢𝑛𝑑𝑒𝑑 𝑏𝑒𝑙𝑜𝑤 𝑏𝑦 𝑎𝑛𝑑 𝑆4 𝑖𝑠 𝑏𝑜𝑢𝑛𝑑𝑒𝑑 𝑎𝑏𝑜𝑣𝑒 𝑏𝑦 2 𝑎𝑛𝑑 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 inf 𝑆4 𝑎𝑛𝑑 sup 𝑆4 𝑏𝑜𝑡ℎ 𝑒𝑥𝑖𝑠𝑡.
2
𝑊𝑒 ℎ𝑎𝑣𝑒 𝑎𝑙𝑠𝑜 𝑡ℎ𝑎𝑡 𝑢 inf 𝑆4 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑙𝑜𝑤𝑒𝑟 𝑏𝑜𝑢𝑛𝑑 𝑢 𝑜𝑓 𝑆4 𝑎𝑛𝑑 sup 𝑆4 ≤
𝑢 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑢𝑝𝑝𝑒𝑟 𝑏𝑜𝑢𝑛𝑑 𝑢 𝑜𝑓 𝑆4 .
1 1
𝑇ℎ𝑢𝑠, 𝑠𝑖𝑛𝑐𝑒 𝑖𝑠 𝑎 𝑙𝑜𝑤𝑒𝑟 𝑏𝑜𝑢𝑛𝑑 𝑜𝑓 𝑆4 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑡ℎ𝑎𝑡
2 2
≤ inf 𝑆4 𝑎𝑛𝑑 𝑠𝑖𝑛𝑐𝑒 2 𝑖𝑠 𝑎𝑛 𝑢𝑝𝑝𝑒𝑟 𝑏𝑜𝑢𝑛𝑑 𝑜𝑓 𝑆4 𝑤𝑒 ℎ𝑎𝑣𝑒 𝑡ℎ𝑎𝑡 sup 𝑆4
≤ 2.
1 1 1
𝐻𝑒𝑛𝑐𝑒, ≤ inf 𝑆4 ≤ 𝑎𝑛𝑑 2 ≤ sup 𝑆4 ≤ 2 𝑎𝑛𝑑 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 inf 𝑆4 = 𝑎𝑛𝑑 sup 𝑆4 = 2.
2 2 2
5. Find the infimum and supremum, if they exist, of each of the following sets.
(a) 𝐴 ∶= {𝑥 ∈ ℝ: 2𝑥 + 5 > 0}
Answer:
𝐴 = {𝑥 ∈ ℝ: 2𝑥 + 5 > 0},
5
𝐴 = {𝑥 ∈ ℝ: 𝑥 > − 2},
5 5
All x ∈ 𝐴 are greater that − 2, that is we can say that A is bounded below and − 2
is a lower bound of A.
5
Let suppose infA= − 2 = 𝑤
The condition (1’) Is already statisfied. For condition (2’) lets suppose the
5
opposite, that is that there exist a lower bound of A called t and that 𝑡 > 𝑤 = − 2,
5
then 𝑡 + 2 > 0 and 𝑡 ≤ 𝑥, for all 𝑥 ∈ 𝐴.
5 1
𝑡+ − >0
2 𝑛
1 5
𝑡− >−
𝑛 2
1
From there, using the definition of the set A, we can conclude that 𝑡 − 𝑛 ∈ 𝐴.
1 1
𝑡 − 𝑛 < 𝑡 and 𝑡 − 𝑛 ∈ 𝐴, gives us a contradiction with the hypothesis that t is a
lower bound. We found a number that is smaller from t and also inside the set A
wich contradicts the definition of the lower bound).
5
From that we conclude that t cannot be a lower bound, that is 𝑡 ≥ 𝑤 and 𝑤 = −
2
5
is the greatest lower bound. Therefore, infA= − 2
(b) Find the infimum and supremum, if they exist, of each of the following sets
𝐵 ∶= {𝑥 ∈ ℝ, 𝑥 + 2 ≥ 𝑥 2 }.
Answer :
Let :
x = -2 then the value of 𝑥 + 2 ≥ 𝑥 2 is 0 ≥ 4. So -2 does not fit to the inequality
x = -1 then the value of 𝑥 + 2 ≥ 𝑥 2 is 1 ≥ 1. So -1 fit to the inequality
x = 0 then the value of 𝑥 + 2 ≥ 𝑥 2 is 2 ≥ 0. So 0 fit to the inequality
x = 1 then the value of 𝑥 + 2 ≥ 𝑥 2 is 3 ≥ 1. So 1 fit to the inequality
x = 2 then the value of 𝑥 + 2 ≥ 𝑥 2 is 4 ≥ 4. So 2 fit to the inequality
x = 3 then the value of 𝑥 + 2 ≥ 𝑥 2 is 5 ≥ 9. So 3 does not fit to the inequality
From 2.3.2 Defenition, suppose that inf B = -1 and sup B = 2. Then we need to do
fill all of the conditions from 2.3.2 defenition.
Let infB = w = -1
Then, the first condition is already satisfied
To fit the second condition, we know that 0 is another lower bound, let 0
=w
Then, 𝑡 ≤ 𝑤 → −1 ≤ 0
(True)
Let supB = u = 1
Then, the first condition is already satisfied
To fit the second condition, we know that 2 is another upper bound, let 2 = v
Then, 𝑢 ≤ 𝑣 → 1 ≤ 2
(True)
So, we can conclude that the infimum and supremum from 𝐵 ∶= {𝑥 ∈ ℝ, 𝑥 +
2 ≥ 𝑥 2 } is inf B = -1 and sup B = 2
(c) Lets consider the given set and rewrite the conditions :
1
𝐶 ={𝑥 ∈𝑅 ∶ < 0}
𝑥
𝑥2 − 1
={𝑥 ∈𝑅 ∶ < 0}
𝑥
(𝑥 − 1)(𝑥 + 1)
={𝑥 ∈𝑅 ∶ < 0}
𝑥
𝑥 ∈ 〈−∞, −1〉
𝑥 ∈ 〈0,1〉
Hance, we have
𝐶 = {−∞, −1} ∪ {0,1}
It is easy to see that infimum of C does not exist since C is not bounded below. We can see
that C is bounded above
The condition (1) is already satistied. For the condition (2) lets suppose the opposite, that
there exists upper bound of C called 𝑢 such that 𝑢 < 𝑣 − 1 𝑎𝑛𝑑 𝑢 ≥ 𝑥 for all 𝑥 ∈ 𝐶. Then
𝑢 − 1 < 0 , that 1 − 𝑢 < 0 by the achimedean property, ∃ 𝑚 ∈ 𝑁 such that
1
0< <1−𝑢
𝑚
1
𝑢+ <1
𝑚
From there, using the definition of the set C, we can conclude that
1
𝑢+ ∈𝐶
𝑚
1 1
𝑢 + 𝑚 > 𝑢 and 𝑢 + 𝑚 ∈ 𝐶, gives it’s a contradiction with the hypothesis that 𝑢 is an upper
bound,(we found a number that is greater than 𝑢 and also inside the set C which contradicts
is the definition of the upper bound). From that we conclude that 𝑢 cannot be an upper
bound. That is 𝑢 ≤ 𝑣 and 𝑣 − 1 is the upper bound. Therefore sub 𝐶 = 1
(d) Find the infimum and supremum, if they exist, of each of the following sets.
D := {𝑥 ∈ 𝑅: 𝑥 2 − 2𝑥 − 5 < 0}
Solution :
Let’s rewrite the given set
𝐷 = {𝑥 ∈ 𝑅 ∶ 𝑥 − (1 + √6))(𝑥 − (1 − √6)) < 0}
= {𝑥 ∈ 𝑅 ∶ (𝑥 − 𝛼)(𝑥 − 𝛽) < 0}
Where have two cases:
1° (𝑥 − 𝛼) > 0 𝑎𝑛𝑑 (𝑥 − 𝛽) < 0
𝑥 > 𝛼 𝑎𝑛𝑑 𝑥 < 𝛽
No solution
2° (𝑥 − 𝛼) < 0 𝑎𝑛𝑑 (𝑥 − 𝛽) > 0
𝑥 < 𝛼 𝑎𝑛𝑑 𝑥 > 𝛽
𝛽<𝑥<𝛼
Therefore, D=≺ 𝛽, 𝛼 ≻
From there we can see that the set D is bounded above and below, where upper
bound is 𝛼
And lower bound is 𝛽.
First we suppose 𝑖𝑛𝑓𝐷 = 𝛽 = 𝑤
The condition (1’) is already satisfied. For the condition (2’) let’s suppose the
opposite that
There exists a lower bound of D called t and that 𝑡 > 𝑤 = 𝛽. Then 𝑡 − 𝛽 >
0 𝑎𝑛𝑑 𝑡 ≤ 𝑥, for all 𝑥 ∈ 𝐷.
By the Archimedean property, ∃ 𝑛 ∈ 𝑁 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡
1
0<𝑛<𝑡−𝛽
1
𝑡−𝛽− >0
𝑛
1
𝑡−𝑛>𝛽
From there, using the definition of the set D, we can conclude that
1
𝑡−𝑛∈𝐷
1 1
𝑡 − 𝑛 < 𝑡 𝑎𝑛𝑑 𝑡 − 𝑛 ∈ 𝐷, gives us a contradiction with the hypothesis that t is a
lower bound. (We found a number that is smaller from t and also inside the set D
which contradicts the definition of the lower bound). From that we conclude that t
cannot be a lower bound, that is, 𝑡 ≥ 𝑤 𝑎𝑛𝑑 𝑤 = 𝛽 is the greatest lower bound.
Therefore, 𝑖𝑛𝑓𝐷 = 𝛽 = 1 − √6.
From there, using the definition of the set D, we can conclude that
1
𝑢+𝑚∈𝐷
1 1
𝑢 + 𝑚 > 𝑢 𝑎𝑛𝑑 𝑢 + 𝑚 ∈ 𝐷, gives us a contradiction with the hypothesis that u
is an upper bound. (We found a number that is greater than u and also inside
the set D which contradicts the definition of the upper bound). From that we
conclude that u cannot be an upper bound, that is, 𝑢 ≤ 𝑣 𝑎𝑛𝑑 𝑣 = 𝛼 is the
least upper bound. Therefore, 𝑠𝑢𝑝𝐷 = 𝛼 = 1 + √6.
6. T Let S be a nonempty subset of R that is bounded below. Prove that inf S=-sup〖
{-s:s∈S}.〗
Answer:
Proof: Let T={-s:s∈S},w≤s. We need to show that -w=supT.┤
First we will show that –w is an upper bound for T.By definition of
≥-s.Thus for every-s ∈T,-w≥-s.This shows that-w is an upper bound for T.〗
Second,we will show that for every r∈R such that r<-w there exists-s∈T such
that r <-s.(i.e.we show-w is the least upper bound.) Let r be arbitrary real
number such that r<-w.Then,w<-r.Since,w=inf S,there exists s∈S such that s<-
r.Thus,there exists s∈S such that r<-s.But this means there exists-s∈T such that
r<-s.This shows-w is indeed the least upper bound for T and completes the
proof.
7. If a set 𝑆 ⊆ ℝ contains one if its upper bounds ,show that this upper bound is the
supemum of S.
Answer :
Let S be a nonempty subset of ℝ that is bounded above. Then there exits sup S.
By defenition of supremum we have that sup 𝑆 ≤ 𝑢 for all upper bound u of S
and 𝑠 ≤ sup S for all 𝑠 ∈ 𝑆.
Suppose that S contains one of its upper bounds u0 . Then we have that u0 ≤
𝑠𝑢𝑝 S ≤ u0.
Hence, u0 = sup S
8. Let S < lR be nonempty. Show that u E lR is an upper bound of S if and only if the conditions
t E lR and t > u imply that t �S
9. Let Sç R be nonempty. Show that if u= sup s then for every number n ϵ N the number
u-1/n is not an upper bound of S, but the number u+1/n is an upper bound of S. (The
converse is also true see exercise 2.4.3)
Answer: \
Let u=sup S. U is by definition an upper bound of S,u+1/n is also an upper bound of
S, since u+1/n>u,˅nϵ N.
For ϵ=1/n by Lemma 2.3.4 there exists an sϵ ϵS such that
u-1/n=u-ϵ<sϵ
10. Show that if A and B are bounded subsets of R, then A U B is a bounded set. Show
that sup(A U B) = sup{ sup A, sup B}.
Answer :
Let u := sup A , v:= sup B and define w := sup{u, v}
Then w is an upper bound of A U B.
If x A, then x u w, and if x B then x v w.
If z is an upper bound of A U B, then z is an upper bound of A and of B
U z, u A and v z, v B w z.
Therefore, z is the least upper bound of A U B, that is,
Sup(A U B) = w = sup{sup A, sup B}
11. Since 𝑆0 ⊆ 𝑆, 𝑒𝑣𝑒𝑟𝑦 𝑢𝑝𝑝𝑒𝑟 𝑏𝑜𝑢𝑛𝑑 𝑜𝑓 𝑆 𝑖𝑠 𝑎𝑙𝑠𝑜 𝑎𝑛 𝑢𝑝𝑝𝑒𝑟 𝑏𝑜𝑢𝑛𝑑 𝑜𝑓 𝑆0 , 𝑏𝑢𝑡 𝑠𝑖𝑛𝑐𝑒 sup 𝑆0 is
the least upper bound of 𝑆0 , it follows that
sup 𝑆0 ≤ 𝑆
Simillary, inf s is a lower bound of 𝑆0 ⊆ S. Inf 𝑆0 being the largest lower ound of 𝑆0 , It
foolows that
inf 𝑆 ≤ 𝐼𝑛𝑓 𝑆0
Since inf A ≤ sup A, for any set A, we finally get
inf 𝑆 ≤ inf 𝑆0 ≤ 𝑠𝑢𝑝 𝑆0 ≤ 𝑠𝑢𝑝 𝑆
12. Let S ⊆ R and suppose that 𝑠 ∗ := sup S belongs to S. If 𝑢 ∉ 𝑆 , show that sup
(𝑆 ∪ {𝑢}) = sup{𝑠 ∗ , 𝑢}.
1. 𝑢 ≥ 𝑠 ∗ ⇒ 𝑢 = sup(𝑆 ∪ {𝑢})
Proof :
𝑢 ≥ 𝑠 ∗ ≥ 𝑠, ∀𝑠 ∈ 𝑆 ⇒ 𝑢 is upper bound of 𝑆 ∪ {𝑢}.
Let 𝑦 be an upper bound of 𝑆 ∪ {𝑢}.
Specially, 𝑦 ≥ 𝑢 ⇒ 𝑢 is the least upper boud of 𝑆 ∪ {𝑢}.
2. 𝑠 ∗ ≥ 𝑢 ⇒ 𝑠 ∗ = sup(𝑆 ∪ {𝑢})
Proof :
𝑠 ∗ = sup 𝑆 𝑎𝑛𝑑 𝑠 ∗ ≥ 𝑢 ⇒ 𝑠 ∗ is an upper bound of 𝑆 ∪ {𝑢}
Suppose y is an upper bound of 𝑆 ∪ {𝑢}. Specially, y is an upper bound of S.
𝑠 ∗ is the least upper bound of S so 𝑦 ≥ 𝑠 ∗.
Therefore
sup(𝑆 ∪ {𝑢}) = sup{𝑠 ∗ , 𝑢}