MA101: Answer Key : Tutorial - 1

Question 11: Let {Pn } be a sequence of rationals such that P1 < P2 < P3 < · · ·
and Pn → 0 as n → ∞. Let
∞
[
A= (Pi , Pi+1 )
i=1
What is sup A and inf A?
Solution 11:Solution:- Let x ∈ A, our claim is x ≤ 0. Suppose x > 0, then ∃ a
m ∈ N(set of natural number) such that Pm−1 < x < Pm . Now
0 < x < pm < pm+1 < ... < pn < ...
and limn→∞ Pn → 0, hence x = 0(which is a contradiction to the assumption that x > 0).
Therefore, our initial assumption was wrong. Hence x ≤ 0. So we can say 0 is an upper
bound of A. Let r ∈ R(set of real number) be another upper bound of A such that,
a ≤ r ≤ 0, ∀a ∈ A
. Let n ∈ N be natural number. Let a ∈ A ⊆ (pn , pn+1 ). Then pn < a ≤ r ≤ 0. Hence
∀n ∈ N, pn < r ≤ 0 is true. Since limn→∞ pn → 0. Hence we can conclude that r = 0.
Therefore 0 is the suprimum of A.
For any a ∈ A, p1 < a. Hence p1 is a lower bound of A. Let r ∈ R be another lower
bound of A such that
p1 ≤ r ≤ a, ∀a ∈ A
. We claim that r < p2 . If not suppose r ≥ p2 . Let a ∈ (p1 , p2 ) ⊂ A. Then p1 < a <
p2 ≤ r. Hence a < r(which is a contradiction to the assumption that r is a lower bound
of A). Hence r < p2 . Let c ∈ (p1 , r) ⊆ (p1 , p2 ) ⊆ A. Therefore, c ∈ A. Since c ∈ (p1 .r),
therefore, p1 < c < r(which is a contradiction to the assumption that r is a lower bound
of A). Hence our initial asuumption was wrong. Hence there does not exists any r ∈ R
such that
p1 ≤ r ≤ a, ∀a ∈ A
. Hence p1 is the infimum of A..

Question 12: Let A = {x ∈ R| 3x2 + 8x − 3 < 0}. Find sup and inf of A.
Solution 12:
3x2 + 8x − 3 = (x + 3)(3x − 1) (1)
2
Now 3x + 8x − 3 < 0 implies
Case 1.: (x + 3) < 0 and (3x − 1) > 0.Which implies x < −3 and x > 13 .Which is not
possible.
Case 2.: (x + 3) > 0 and (3x − 1) < 0. Which implies x > −3 and x < 13 . Which is true.
Hence the set
1
A = {x ∈ R| 3x2 + 8x − 3 < 0} = {x : −3 < x < }
3
 1
Therefore 3
is an upper bound of A. Let r ∈ R be another bound of A such that

x ≤ r, ∀x ∈ A

and r < 31 . Consider c ∈ R such that, r < c < 13 . Then c ∈ A(which is a contradiction
since r is the upper bound of A). Hence our assumption is wrong. Hence there does bot
exists another bound of A such that x ≤ r, ∀x and r < 13 . Hence 13 is the supremum of
A. Similarly infimum of A=-3.
Alternate solution: Let f (x) = 3x2 +8x−3, then f touch origin for x where f (x) = 0,
i.e., x = −3 and x = 1/3. Since f is a continuous function. We divide domain of
function into three parts (−∞, −3], (−3, 1/3), [1/3, ∞). for any given interval graph is
either completely positive or negative. Just pick any value of x inside all the given
interval. We will have positive value when x is in (−3, 1/3), like f (0) = −3. Now we
can say that our A will be interval (−3, 1/3). Hence supremum is 1/3 and infimum is 3.

supinf.JPG
 Question 13: Let S and T are non-empty subsets of R, such that s ∈ S, t ∈ T ⇒
s ≤ t for every s ∈ S and t ∈ T . Prove that sup S ≤ inf T .
Solution 13: we will prove it by contradiction.
Suppose sup S > inf T .
By definition, sup S ≥ s, ∀s ∈ S, and inf T ≤ t, ∀t ∈ T .
Claim: inf T ≥ s ∀s ∈ S.
Otherwise, there is some s ∈ S such that s > inf T . By the definition of infimum, there
is some t ∈ T such that s > t, contradiction. Hence inf T is an upper bound for S.
Therefore,

sup S ≤ inf T.
Question 14. Find sup and inf of A.
1 1
(a) A = { + : m, n ∈ N}
m n
n + (−1)n
(b) A={ : n ∈ N}
n
1
(c) A = {x ∈ R | sin = 0}
x
(−1)n
(d) A = {n : n ∈ N}
∞
\ 1 1
(e) A= [− , 1 + ]
n=1
n n
1
(f ) A = {1 − : n ∈ N}
3n
nπ
(g) A = {cos( ) : n ∈ N}
3
1
(h) A = { : n ∈ N and n is prime}
n
(−1)n
(i) A = {1 − : n ∈ N}
n
1 1
(j) A={ − : m, n ∈ N}
n m
Solution 14:
(a) We know that m1 ≤ 1 ∀ m ∈ N. Then m1 + n1 ≤ 1 + 1 = 2 for all m, n ∈ N. So, 2 is
an upper bound of the set A and since 2 ∈ A, there can’t be any other upper bound L
of A such that L < 2. Therefore, 2 is the supremum of A.
Again, m1 + n1 > 0 for all m, n ∈ N. So, 0 is a lower bound of the set A. If possible let
l is the infimum of A and l > 0. By the Archimedean property there exists an integer
x > 0 such that lx > 1. Then l > x1 = 2x 1
+ 2x1
∈ A. This contradicts that l is the
infimum of A. Therefore, 0 is the infimum of A.

(b) We have
(
1
n + (−1)n 1− n
if n is odd
= 1
n 1+ n
if n is even

For any positive odd integer n, 1 − n1 < 1 < 32 and also for any positive even integer n,
n ≥ 2 ⇒ 1 + n1 ≤ 32 . So, 32 is an upper bound of the set A and since 23 ∈ A, there can’t
be any other upper bound L of A such that L < 32 . Therefore, 32 is the supremum of A.
 Again, 1 − n1 ≥ 0 and 1 + n1 ≥ 0 for all n ∈ N. So, 0 is a lower bound of the set A
and since 0 ∈ A, there can’t be any other lower bound l of A such that l > 0. Therefore,
0 is the infimum of A.

(c) sin x1 = 0 ⇒ x = 1
nπ
where n is a nonzero integer. Then for all x ∈ A,

1 1
− ≤x≤ .
π π
So, π1 is an upper bound and − π1 is a lower bound of A and since both π1 and − π1 are
members of the set A, they are respectively the supremum and the infimum of A.

(d) We have
(
1
(−1)n if n is odd
n
n =
n if n is even

Since A has no upper bound, supA = ∞.

Again, n1 > 0 for all positive odd integer n. So, 0 is a lower bound of A. If possible
let l is the infimum of A and l > 0. By the Archimedean property there exists an
integer x > 0 such that lx > 1. Then l > x1 > x+1 1
. Now, either x or 1 + x is odd and
1 1
consequently either x or 1+x is a member of A. This contradicts that l is the infimum
of A. Therefore, 0 is the infimum of A.

(e) If possible let x ∈ A is such that x > 1 i.e. (x − 1) > 0. By the Archimedean
property there exists an integer m > 0 such that m(x − 1) > 1 which implies x > 1 + m1 .
Thus, x ∈ / [− m1 , 1 + m1 ] ⊃ A which is a contradiction. Hence x ≤ 1 ∀ x ∈ A and so 1 is
an upper bound of A. Also, 1 ∈ [− n1 , 1 + n1 ] ∀ n ∈ N and hence 1 ∈ A. Therefore, 1 is
the supremum of A.
Again, if possible let y ∈ A is such that y < 0 i.e. (−y) > 0. By the Archimedean
property there exists an integer m > 0 such that m(−y) > 1 i.e. y < (− m1 ) and so
y∈/ [− m1 , 1 + m1 ] ⊃ A which is a contradiction. Thus y ≥ 0 ∀ y ∈ A and so 0 is a lower
bound of A. Also, 0 ∈ [− n1 , 1 + n1 ] ∀ n ∈ N and hence 0 ∈ A. Therefore, 0 is the infimum
of A.

(f ) For all n ∈ N, 1 − 31n < 1. So, 1 is an upper bound of A. If possible let L be the
supremum of A such that L < 1 i.e. (1 − L) > 0. By the Archimedean property there
exists an integer m > 0 such that m(1 − L) > 1 ⇒ 3m (1 − L) > 1 ⇒ L < 1 − 31m ∈ A
which contradicts that L is the supremum of A. Therefore, 1 is the supremum of A.
For all n ∈ N, 31n ≤ 31 ⇒ 1 − 31n ≥ 1 − 13 = 23 . So, 23 is a lower bound of A and since
2
3
∈ A, we can conclude that 23 is the infimum of A.

(g) We have A = {cos( nπ

3
) : n ∈ N} = { 12 , − 12 , −1, 1}. Therefore, the supremum of A
is 1 and the infimum of A is −1.

(h) Since 2 is the smallest prime number we have n1 ≤ 12 for all n ∈ N where n is a
prime. So, 21 is an upper bound of A and since 21 is a member of A, the supremum of A
is 21 .
Again, n1 > 0 ∀ n ∈ N and so 0 is a lower bound of A. If possible let l is the infimum
of A and l > 0. By the Archimedean property there exists an integer m > 0 such that
ml > 1 i.e. l > m1 > p1 where p is a prime number greater than m and since 1
p
∈ A, this
contradicts that l is the infimum of A. Therefore, 0 is the infimum of A.

(i) We have
(
1
(−1)n 1+ n
if n is odd
1− = 1
n 1− n
if n is even

Now, this can be solved similar to (b).

(j) n1 ≤ 1 ∀ n ∈ N and m1 > 0 ∀ m ∈ N. Then n1 − m1 < 1 ∀ m, n ∈ N. So, 1 is an

upper bound of A. If possible let L is the supremum of A and L < 1 i.e. (1 − L) > 0. By
the Archimedean property there exists an integer k > 0 such that k(1 − L) > 1 which
implies L < 1 − k1 ∈ A. This contradicts that L is the supremum of A. Therefore, 1 is
the supremum of A.
Again, − m1 ≥ −1 ∀ m ∈ N and n1 > 0 ∀ n ∈ N. Then n1 − m1 > −1 ∀ m, n ∈ N. So,
−1 is a lower bound of A. If possible let l is the infimum of A and l > −1 i.e. (l + 1) > 0.
By the Archimedean property there exists an integer k > 0 such that k(l + 1) > 1 which
implies l > k1 − 1 ∈ A. This contradicts that l is the infimum of A. Therefore, −1 is the
infimum of A.

Question 15: Let An = x ∈ R | x ≤ − n1 or x ≥ n1 , n ∈ N. A = ∪∞


n=1 An , B =
∞
∩n=1 An . Find sup and inf of A and B if exist.
Solution 15: Given An = x ∈ R | x ≤ − n1 or x ≥ n1 , then

A1 = {(−∞, −1] ∪ [1, ∞)}

 
−1 1
A2 = (−∞, ] ∪ [ , ∞)
2 2
 
−1 1
A1 ∪ A2 = (−∞, −1] ∪ (−∞, ] ∪ [ , ∞) ∪ [1, ∞)
2 2
 
−1 1
= (−∞, ] ∪ [ , ∞) .
2 2

Similarly,
 
−1 1
∪kn=1 An = (−∞, ] ∪ [ , ∞) .
k k

Therefore,

A = ∪∞
n=1 An
= lim ∪kn=1 An
k→∞
=(−∞, 0) ∪ (0, ∞).

Hence,

inf A = −∞.
sup A = ∞.
Since A1 ⊂ A2 ⊂ A3 · · · ⊂ An , then ∩∞
i=1 An = A1 ,
i.e.

B = ∩∞
n=1 An = {(−∞, −1] ∪ [1, ∞)} .

Therefore,

inf B = −∞.
sup B = ∞.

Question 16. Show that if m and n are rational numbers then m + n and mn are
also rational numbers.
Solution 16: Since m and n are rational numbers so they can be expressed in the p/q
form where p, q ∈ Z and q ̸= 0. So let m = p1 /q1 and n = p2 /q2 where p1 , p2 , q1 , q2 ∈ Z
and q1 , q2 ̸= 0. Now we have two cases
p1 +p2
Case 1: m + n = q1
if q1 = q2 ,
and

Case 2: m + n = p1 qq21+p
q2
2 q1
if q1 ̸= q2 .
In both the cases numerator and denominator are integers and none of the denomi-
nator is zero. Hence in both the cases m + n is rational.
Similarly, we can prove that mn is also rational.

Question 17: If x > −1, then show that (1 + x)n ≥ 1 + nx for all n ∈ N.
Solution 17: We prove this result by mathematical induction on n. If n = 1 then
(1 + x)n = 1 + nx hence result is true for n = 1. Let us assume that the result is true
for n = k i.e.
(1 + x)k ≥ 1 + kx. (2)
Now we prove that result is true for n = k + 1 i.e. we need to prove

(1 + x)(k+1) ≥ 1 + (k + 1)x. (3)

Consider

(1 + x)(k+1) = (1 + x)k (1 + x)
≥ (1 + kx)(1 + x) [using (1)]
= 1 + x + kx + kx2
= 1 + (k + 1)x + kx2
≥ 1 + (k + 1)x [since kx2 ≥ 0].

Hence, result is true for n = k + 1. Therefore result is true for all n ∈ N.

Question 18:
Give an example of a set which is
(a)bounded above but not bounded below.
Solution: A={x ∈ R : x < 1}
(b) bounded below but not bounded above.
Solution: N
(c) bounded above as well as below.
Solution: A={x ∈ R : x2 < 1}
(d) neither bounded above nor bounded below.
Solution: Z

Question 19:
Let S and T be nonempty bounded subsets of R.
(i) Prove that if S ⊆ T , then inf T ≤ inf S ≤ sup S ≤ sup T .
Proof: ∀ s ∈ S, s ≥ inf S. Since S ⊆ T , s ≥ inf T , ∀ s ∈ S, i.e., inf T is a lower bound
of S. So, inf S ≥ inf T .
∀ s1 ∈ S, s1 ≤ sup S. Since S ⊆ T , s1 ≤ sup T , ∀ s1 ∈ S, i.e., sup T is an upper bound
of S. So, sup S ≤ sup T .
Also the infimum of any non-empty set is always less than or equal to its supremum.
Combining all the inequalities,
S the result follows.
(ii) Prove that sup(S TS ) = max{sup S, sup T }.
Solution 19: Let x ∈ S T
⇒ x ∈ S or x ∈ T ⇒ x ≤ sup S or xS≤ sup T ⇒ x ≤ max{sup S, sup T } . So
max{sup S, sup T } is an upper bound S of S T . S
Let M is anyS other upper bound of S T . Then ∀x ∈ S T, x ≤ M .
⇒ ∀x ∈ S T, x ≤ M . ⇒ sup S ≤ M and sup T ≤SM . ⇒ max{sup A, sup B} ≤ M .
So, max{sup A, sup B} is the least upper bound of S T .

Question 20: If y > 0, show that there exist n ∈ N such that

1
<y
2n
Solution 20: If possible let us suppose that for all n ∈ N, 21n ≥ y.
Now, for n ∈ N, 2n > 0 and we know that 2n > n for all n ∈ N. Hence y ≤ 21n < n1 for
all n ∈ N. This implies that y will be the lower bound for 1/n. (Argument 1)
But from the Archimedean property there exists a positive integer m such that my > 1
i.e. y > m1 which contradicts the Argument 1. This shows our supposition was wrong
that for all n ∈ N, 21n ≥ y. Therefore, there exists n ∈ N such that 21n < y.

Question 21: If x and y are member of bounded sets A and B of real numbers, prove
that bounds of the set C of numbers xy are the sup B
inf A
inf B
and sup A
, provided inf A ̸= 0 and
sup B ̸= 0 and numbers of A and B are all positive.
Solution 21: Choose two arbitrary real number a and b such that a ∈ A and b ∈ B.
Since sup B ≥ y for all y ∈ B. Therefore supa B ≥ ay for all y ∈ B (given a is positive).
Since inf A ≤ x for all x ∈ A, =⇒ inf1 A ≥ x1 for all x ∈ A =⇒ inf1 A ≥ a1 . Multiplying
both side by sup B, we get sup B
inf A
≥ xy for all y ∈ B and x ∈ A. (Proved)
Since inf B ≤ y for all y ∈ B, =⇒ infa B ≤ ay for all y ∈ B (Given a is positive and
a ̸= 0).
Since sup A ≥ x for all x ∈ A, =⇒ sup1 A ≤ x1 for all x ∈ A =⇒ sup inf B
A
≤ xy for all
x ∈ A and y ∈ B. (Proved)

Question 22: Give an example of a relation which is:

(i) symmetric and anti-symmetric.
(ii) neither reflexive nor symmetric nor transitive.
Solution 22: consider the set S = {1, 2, 3, 4} and two relations,
R1 = {(1, 1), (2, 2)}
 R2 = {(1, 2), (2, 2), (2, 3), (3, 3)}
(i) The relation R1 is symmetric and also anti-symmetric.
(ii) The relation R2 is neither reflexive nor symmetric nor transitive.
∞
( 1i , 1)
S
Question 23: Prove that: (0, 1) =
i=1
Solution 23: Take x ∈ (0, 1).
Then 0 < x < 1.
By using Archimedean property on x and 1,
we have nx > 1, for some positive integer n,
i.e. n1 < x < 1
S
thus x ∈ n1 , 1 ⊆ ∞ 1


i=1 i , 1

S∞ 1


hence, (0, 1) ⊆ i=1 i
,1 . . . (1)
Again take,
∞  
[ 1
y∈ ,1
i=1
i
1


Then y ∈ m
,1 , for some positive integer m.
∞  
1 [ 1
So, 0 < < y < 1 and hence , 1 ⊆ (0, 1) . . . (2)
m i=1
i

Combining (1) and (2)

∞
[ 1
(0, 1) = ( , 1).
i=1
i
Question 24. Prove that e is an irrational number.
Solution. We know
x x2 xn
ex = 1 + + + ··· + + ···
1! 2! n!
1 1 1
e1 = e = 1 + + + · · · + + · · · Then e − en > 0
1! 2! n!
1 1 1 1
Let en = + + + · · · +
0! 1! 2! n! 
1 1 1
e − en = lim + + ··· +
N →∞ (n + 1)! (n + 2)! (n + N )!
1 h
1 1
i
= lim 1 + n+2 + · · · + (n+2)(n+3)···(n+N −1)(n+N )
(n + 1)! N →∞
1
1 1 − (n+1) N
= lim 1
(n + 1)! N →∞ 1 − n+1
1 n+1
= ·
(n + 1)! n
1
Thus, 0 < e − en < n·n! . . . (1)
If e is a rational number then e = pq , where p and q are integers and q ̸= 0.
Then we have from (1)
0 < q!(e − eq ) < 1q . . . (2)
Now, q! × e is an integer, since eq = p is an integer.
  
1 1 1 1
Also, q! × eq = q! + + ··· +
0! 1! 2! q!
is an integer. Thus q!(e − eq ) is an integer
and from (2) we see that it lies strictly in between 0 and 1 which is absurd. Therefore,
e is an irrational number.