Scribd
Upload
62 views15 pages

mth321 Lecture 02

This document provides an overview of concepts in real analysis including definitions of supremum and infimum, remarks on least upper bound and greatest lower bound properties, examples of sets that satisfy these properties, definitions of fields and ordered fields, and a note that the real number system is the only set that is ordered, a field, and satisfies the completeness axiom.

Uploaded by

Huzaifa
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
62 views15 pages

mth321 Lecture 02

This document provides an overview of concepts in real analysis including definitions of supremum and infimum, remarks on least upper bound and greatest lower bound properties, examples of sets that satisfy these properties, definitions of fields and ordered fields, and a note that the real number system is the only set that is ordered, a field, and satisfies the completeness axiom.

Uploaded by

Huzaifa
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/ 15

Real Number System: Lecture 02

Course Title: Real Analysis 1 Course Code: MTH321


Course instructor: Dr. Atiq ur Rehman Class: BSM-V
Course URL: www.mathcity.org/atiq/fa22-mth321

You don't have to be a mathematician to have a feel


for numbers. John Forbes Nash, Jr.
Chap 01 - 2

❖ Least Upper Bound (Supremum) and Greatest Lower


Bound (Infimum)
Definition: Suppose S is an ordered set, E  S and E is bounded
above. Suppose there exists an   S such that
(i)  is an upper bound of E.
(ii) If    for   S , then  is not an upper bound of E.
Then  is called least upper bound of E or supremum of E and
written as sup E =  .
Example: Consider S = 1,2,3,...,50 and E = 5,10,15,20 .
(i) It is clear that 20 is upper bound of E .
(ii) For   S if   20 then clearly  is not an upper
bound of E . Hence sup E = 20 .
Chap 01 - 3

Definition: Suppose S is an ordered set, E  S and E is bounded


below. Suppose there exists a   S such that
(i)  is a lower bound of E.
(ii) If    for   S , then  is not a lower bound of E.
Then  is called greatest lower bound of E or infimum of E and
written as inf E =  .
Example: Consider S = 1,2,3,...,50 and E = 5,10,15,20 .
(i) It is clear that 5 is lower bound of E .
(ii) For   S if 5   , then clearly  is not lower bound
of E . Hence inf E = 5 .
Chap 01 - 4

❖ Remarks
▪ A set is unbounded if either its set of upper bounds or set of
lower bounds is empty.
▪ Supremum is the least member of the set of upper bound of
the given set.
▪ Infimum is the greatest member of the set of lower bound of
the given set.
▪ If  is supremum or infimum of E, then  may or may not
belong to E.
o Let E1 = r : r   r  0 and
E2 = r : r   r  0 . Then sup E1 = inf E2 = 0 but
0  E1 and 0  E2 .
Chap 01 - 5

o Let E  be the set of all numbers of the form 1 ,


n
where n is the natural numbers, that is,
 1 1 1 
E = 1, , , ,  .
 2 3 4 
Then sup E = 1 which is in E, but inf E = 0 which is not in E.
Chap 01 - 6

❖ Least Upper Bound Property and Greatest Lower Bound


Property
Definition: 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.
Definition: A set S is said to have the greatest lower 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 below then
infE exists in S.
Chap 01 - 7

Examples: (i) The sets and satisfies least upper bound


property.
(ii) The set of rational numbers doesn’t satisfy
completeness axiom. Consider a set E =  x : x   x 2  2 .
One can prove that supremum of E doesn’t exist in even
E is a bounded set.
If U and L denotes the set of upper and lower bounds of E
respectively, then
U =  x : x   x 2  2 ^ x  0 and
L = x : x   x 2  2 ^ x  0 .
If r is the supremum of E , then clearly r 2 = 2 .
Here, we prove there is no rational p such that p 2 = 2 .
Chap 01 - 8

Let us suppose that there exists a rational p such that p 2 = 2


.
This implies we can write
m
p= where m, n  , n  0 & m, n have no common
n
factor.
m2
Then p = 2  2 = 2  m2 = 2n2
2

n
 m is even
2
 m is even
 m is divisible by 2 and so m 2 is divisible by 4.
 2n2 is divisible by 4 and so n2 is divisible by 2.
m2 = 2n2 .
i.e. n2 is even  n is an even
Chap 01 - 9

 m and n both have common factor 2.


which is contradiction because m and n have no common
factor.
Hence p 2 = 2 is impossible for rational p.
Finally, we conclude that the set E, which is bounded in
doesn’t have supremun and infimum in , hence set of
rational doesn’t satisfy the least upper bound property.
❖ Remark
The above property is known as completeness axiom or LUB
axiom or continuity axiom or order completeness axiom.
Chap 01 - 10

❖ Theorem
Suppose S is an ordered set with least upper bound property,
B  S , B is non-empty and is bounded below. Let L be set of all
lower bound of B. Then
 := sup L
exists in S and  = inf B .
❖ Remark
Above theorem can be stated as follows:
An ordered set which has the least upper bound property has
also the greatest lower bound property.
Chap 01 - 11

❖ 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
Chap 01 - 12

(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
Chap 01 - 13

Distributive Law
For any x, y, z  F , (i) x( y + z ) = xy + xz
(ii) ( x + y ) z = xz + yz
❖ Ordered Field
Definition: An ordered field is a field F which is also an ordered
set such that
i) x + y  x + z if x, y , z  F and y  z .
ii) xy  0 if x, y  F , x  0 and y  0 .
Example: the set of rational number is an ordered field.
Chap 01 - 14

❖ Existence of Real Field


It is worth mentioning that and are completely order sets
but not a field.
While is ordered field but not satisfy completeness axiom.
What about a set which satisfy all three properties, that is, i.
ordered ii. field and iii. satisfy completeness axiom. Amazingly,
(set of real numbers) is the only set which satisfy all these
properties.
Chap 01 - 15

References:
[1] Principles of Mathematical Analysis by Walter Rudin (McGraw-Hill, Inc.)
[2] Introduction to Real Analysis by R.G.Bartle, and D.R. Sherbert (John
Wiley & Sons, Inc.)
[3] Mathematical Analysis by Tom M. Apostol, (Pearson; 2nd edition.)
[4] Real Analysis by Dipak Chatterjee (PHI Learning, 2nd edition.)

A password protected “zip” archive of above three resources can be downloaded


from the following URL: http://bit.ly/2BViMnB

You might also like