Shiv Nadar University

MAT-101
Assignment -1
Due Date: September 12, 2014, before 5 p.m.
Instructions: Please drop your assignment in the mailbox near C-320 C.
1. (a) State the denition of
i. Upper bound and lower bound of a set
ii. Bounded set
iii. Maximum and Supremum of a set.
(b) Give example of
i. A set which is bounded above but not bounded below.
ii. A Bounded innite set.
iii. A non-empty set which is bounded above but does not have a maximum element.
iv. A set A such that sup(A) A
v. A set A such that sup(A) A.
(c) i. State the least upper bound Axiom.
ii. Let A be a non-empty subset of R and R. Show that = Sup(A) if and only if
1
n
is not
an upper bound but +
1
n
is an upper bound of A n N.
2. (a) State and prove Archimedean principle.
(b) Prove that N, the set of natural numbers is not bounded above.
(c) Prove the Archimedean principle for Q, the set of rational numbers.
(d) Prove that between any two distinct real numbers x and y, a rational number q Q such that
x < q < y.
(e) Consider the sets
A = {r Q : 0 < r and r
2
< 2}
B = {r Q : r
2
> 2}
Show using the Archimedean principle that A does not have a supremum in Q and B does not have an
inmum in Q.
3. (a) State the denition of Inductive set and positive integers.
(b) Show that the set of positive integers is inductive.
(c) Prove 1 is the smallest positive integer.
(d) Prove If a, b P, where P is the set of positive integers then a + b P, i.e., if a, b are two positive
integers, then a + b is a positive integer.
(e) Is the above true for any inductive set ? i.e., if If a, b I, where I is an Inductive set then a + b I ?
(f) Prove Mathematical Induction using the concept of Inductive Set.
4. (a) State the well ordering principle.
(b) Prove well ordering principle is equivalent to principle of mathematical induction.
(c) Prove
n
i=1
i =
n.(n+1)
2
by using the well ordering principle. (Note: Do not use induction directly).
(d) Prove Bernoullis inequality using induction
(1 + x)
n
1 + nx, x 0
.
1
5. (a) State the denitions of the following
i. Sequence
ii. Bounded sequence
iii. Increasing sequence,
iv. Strictly increasing sequence
v. Monotonic sequence
vi. Convergent sequence
vii. Cauchy sequence
(b) Prove the following
i. If x
n
= c, n then x
n
c.
ii. If x
n
l then y
n
= c.x
n
c.l
iii. If x
n
a x
n
b then x
n
+ y
n
a + b, x
n
.y
n
a.b.
iv. x
n
= 1
1
n
show that x
n
1
(c) i. Prove
1
n
0 by using the Archimedean Principle.
ii. Prove that every monotonically increasing sequence which is bounded above converges to its supre-
mum.
iii. State and prove Sandwich theorem.
(d) Let x R, 0 < x < 1. Show that x
n
0. By using
Archimedean Principle and Sandwich Theorem.
Bernoullis Inequality and Sandwich Theorem.
By showing its a monotonically decreasing sequence which is bounded below and then using algebra
of limits.
(e) What is the criteria for a sequence to not converge to a value L R (Express mathematically).
2