Completeness Axiom

supremum of set
a → let A be a
nonempty
subset of IR -

An element ✗ ER is said to be

supremum or the least upper boundtlub) AA

② ✗ is an
upper bound d- A
② St u is
any upper bound of A ,
then

✗ Ill .

A =
{ KEIR I 22--23
✗ =
52 is the lab
A =
{ t In c- IN } 2=1 is the lab .
Infimum of setts An element PER said to
-

a is

lower bound
be the infimum or the
greatest
of A if

② p is an lower bound d-A

② d- l is a lower bound d- A then
,

LIB . I

Indeed
In IN 3
A =
{% c-
p=o is the
AEA
,
920 infinitum of A .

0 is a lower bound of A -
Completeness bounded
axiom :→
Every
non
empty
above subset of R has the least upper bound

or supremum .

*
bounded below subset AR
Every non
empty
lower bound infinitum
has the
greatest or .

A =
{ KEIR 1 a £5 }
A is bounded above but not bounded below
and 2--5 is the supremum .
 B = E NER I 22 -23

B is bounded below but not bounded above .

P = -
2 is the infimum .

'

A =

Emma 1 Mont }
IN

A
'
is bounded above as well as bounded

below

Exercise:→ Find sub and inf d- A !

# A set is called bounded if it is bounded above as well

as bounded below .
 -

at
Archimedean
Property Guion
any
xelR ,
there

exists natural NEIN such

xsn.pro#
a no

AP not (there exist)FaHR

suppose .
is true
(this
new implies)
such n sa *

x is an upper bound of HEIR

IN is a bounded above subset of IR -

thence

IN has the supremum ✗ €1K

-

say
.
.

Then ✗ -1 is not an upper bound d- IN .

L -

L < no no C- IN .

✗ < not 1 Chot possible]

 In IN }
Example :-. A =
{ £ c-

lit in f- (A) = 420

If d- IR and
by using
✗ 1=0 ,
then c-
A- P .

F ne IN such that
"

d- < n
*
( by AP )
* < ✗

He
'

✗ is not a lower bound d- A .

Hence ✗ is not the infimum .

Therefore ✗ = 0 .
 that
Density theorem :→ let x
,
y EIR be such

nary Canyon] .

Then there exist re ☒ such

that no < r <

y .

C Between too real numbers there exists

any
a

national ]
number

Proofs consider 0 < ✗ < Y

As x< Y , (9-2)--0
¥2 C- IR

By ftp.tn.EINs.ty-nlh
 In < Y - no

consider the set

following
A =

{ MEIN
i.mn > so }
A is non -

empty ( by AP 2 m >
.
nnER
)
¢ FAE IN

least element
By
well
ordering of N A has -

then
say
no .
mq_ > no
y
Furthur Mo -

1¢ A
moth In
 mo-tn-o.no m-gsxtl-n.sn/-@-oY

set CY )=Y
n
MI
< < -

-
n

<
n
mg < y

If 2<0 choose h C- NS.t

,

Chtn 20

'
hta > and
Then x = o

'
21 = ntn < nty = Y

n' & y '

Aptly last
part of to
get the result .
 m÷
' '
n <
< y

ht x ←
m÷ I nty

m÷ y
<
2 n
<
-

21-52 41-52
< -mn <

n <
mn- -52 < y