Summary Real Analysis Notes (Mathematics) , Level: M. Sc || Comprehensive Test Bank, Ultimate Guide A+

REAL ANALYSIS NOTES
Chapter 1 – Real Number System
Subject: Real Analysis (Mathematics) Level: M.Sc

The rational number system is inadequate for many purposes, both as a field
and as an order set for many purposes. This leads to introduction of so-called
irrationalnumbers. We can prove in many ways that the rational number system has
certain gaps and hence we fail to use it as an ordered set and as a field. ❑
 Theorem
There is no rational p such that p2 =2 .
Proof
Let us suppose that there exists a rational p such that p2 =2 .
This implies we can write
m
p= where m, n  & m, n have no common factor.
n
2 m2 2 2
Then p =2  2 =2  m =2n
n
 m is even
2
PR


 m is even
 m is divisible by 2 and so m2 is divisible by 4.
 2n2 is divisible by 4 and so n2 is divisible by 2. Q m2 =2n2
i.e. n2 is even  n is even
O


 m and n both have common factor 2.
Which is contradiction. (because m and n have no common factor.)
Hence p2 =2 is impossible for rational p. ❑
FD


 Theorem
Let A be the set of all positive rationals p such that p2 2 and let B consist of
all positive rationals p such that p2 2 then A contain no largest member and B
O


contains no smallest member.
Proof
We are to show that for every p in A there exists a rational q  A such that
C


p q and for all p  B we can find rational q  B such that q  p .
Associate with each rational p 0 the number
p2 − 2 2p + 2
q =p − = ……..……. (i)
p+2 p+2





2
2 p + 2  2( p2 − 2) ……………(ii)
Then q2 − 2 =  − 2 =
 p + 2  ( p + 2)2
Now if p  A then p2 2  p2 − 2 0
p2 − 2
Since from (i) q =p −  q p
p+2
2( p 2 − 2) 2 2

, Ch. 01 - Real Number System - 2

p2 − 2
Since form (i) q =p −  q p
p+2
2( p 2 − 2) 2 2
And 0  q − 2 0  q 2  qB
( p + 2)2
The purpose of above discussion is simply to show that the rational number
system has certain gaps, in spite of the fact that the set of rationals is dense i.e. we
can always find a rational between any two given rational numbers. These gaps are
r+s
filled by the irrational number. (e.g. if r s then r  s .) ❑
2
 Order on a set
Let S be a non-empty set. An order on a set S is a relation denoted by “ ” with
the following two properties
(i) If x S and y S ,
then one and only one of the statement x  y , x =y , y x is true.
(ii) If x, y, z  S and if x y , y z then x z .
 Ordered Set
A set S is said to be ordered set if an order is defined on S.
 Bound
Let S be an ordered set and E  S . If there exists a b S such that
PR


x b  x E , then we say that E is bounded above, and b is known as upper
bound of E.
Lower bound can be define in the same manner with  in place of .
 Least Upper Bound (Supremum)
O


Suppose S is an ordered set, E  S and E is bounded above. Suppose there
exists an a S such that
FD


(i) a is an upper bound of E.
(ii) If g a then g is not an upper bound of E.
Then a is called the least upper bound of E or supremum of E and is written as
sup E =a .
In other words a is the least member of the set of upper bound of E.
O


We can define the greatest lower bound or infimum of a set E , which is bounded
below, in the same manner. ❑
C


 Example
Consider the sets
A= p: p  p2 2
B= p: p  p2 2
where is set of rational numbers.
Then the set A is bounded above. The upper bound of A are the exactly the members
of B. Since B contain no smallest member therefore A has no supremum in .
Similarly B is bounded below. The set of all lower bounds of B consists of A and
r  with r 0 . Since A has no largest member, therefore, B has no infimum in .
 Example
If a is supremum of E then a may or may not belong to E.

, Ch. 01 - Real Number System - 3

 Example
1
Let E be the set of all numbers of the form , where n is the natural numbers.
n
i.e. E = 1 1 1 ,....... 
1, , , 
2 3 4 
Then sup E =1 which is in E, but inf E =0 which is not in E. ❑

 Least Upper Bound Property
A set S is said to have the least upper bound property if the followings is true
(i) S is non-empty and ordered.
(ii) If E  S and E is non-empty and bounded above then supE exists in S.
Greatest lower bound property can be defined in a similar manner. ❑
 Example
Let S be set of rational numbers and
E = p : p   p 2 2
then E  , E is non-empty and also bounded above but supremum of E is not in S,
this implies that the set of rational numbers does not posses the least upper bound
property. ❑
 Theorem
Suppose S is an ordered set with least upper bound property. B  S , B is non-
PR


empty and is bounded below. Let L be set of all lower bounds of B then a =sup L
exists in S and alsoa =inf B .
In particular infimum of B exists in S.
OR
O


An ordered set which has the least upper bound property has also the greatest
lower bound property.
Proof
FD


Since B is bounded below; therefore, L is non-empty.
Since L consists of exactly those y S which satisfy the inequality.
y x  x B
We see that every x  B is an upper bound of L.
O


 L is bounded above.
Since S is ordered and non-empty therefore L has a supremum in S. Let us call it a .
If g a , then g is not upper bound of L.
C


 g B L B
 a x  x B  a L g a
Now if a b then b  L because a =sup L .
We have shown that a L but b  L if b a . In other words, a is a lower
bound of B, but b is not if b a . This means that a =inf B . ❑

………………………

, Ch. 01 - Real Number System - 4

 Field
A set F with two operations called addition and multiplication satisfying the
following axioms is known to be field.
Axioms for Addition:
(i) If x, y  F then x + y  F . Closure Law
(ii) x + y =y + x  x, y F . Commutative Law
(iii) x + ( y + z) =(x + y) + z  x, y, z F . Associative Law
(iv) For any x F ,  0 F such that x + 0 =0 + x =x Additive Identity
(v) For any x F ,  − x  F such that x + (−x) =(−x) + x =0 +tive Inverse
Axioms for Multiplication:
(i) If x, y  F then x y  F . Closure Law
(ii) x y =y x  x, y  F Commutative Law
(iii) x ( y z) =(x y) z  x, y, z  F
(iv) For any x F ,  1 F such that x  1 =1x =x Multiplicative Identity
1
(v) For any x F , x 0 ,  F , such that x 1  1 
x =  x =1 tive Inverse.
x    x
Distributive Law
For any x, y, z  F , (i) x( y + z) =xy + xz
(ii) (x + y)z =xz + yz ❑
PR


 Theorem
The axioms for addition imply the following:
(a) If x + y =x + z then y =z
(b) If x + y =x then y =0
O


(c) If x + y =0 then y =−x .
(d) −(− x) =x
FD


Proof
(a) Suppose x + y =x + z .
Since y =0 + y
=(− x + x) + y Q − x + x =0
O


=− x + (x + y) by Associative law
=− x + (x + z) by supposition
=(− x + x) + z
C


by Associative law
=(0) + z Q − x + x =0
=z
(b) Take z =0 in (a)
x + y =x + 0
 y =0
(c) Take z =− x in (a)
x + y =x + (− x)
 y =−x
(d) Since (−x) + x =0
then (c) gives x =−(− x) ❑