1. 5 Basic Proof Methods It .

Proof of p 2 by contraposition .

us up

be real numbers such that

Example :
Let ✗ andy
Prove that if 3×2 -12g
'
then 3kg
✗ < 2g .
7×9 £ , .

Proof , Suppose 3✗EY is not true ,

then 3×79 ⇐7
3×-9 so
.

Because ✗
2)
<
2g ✗ 0
-
>
.

(3×-9) (
Zyx ) so

,|whichispry\
7✗y -2g
'
-3×2 > o

u ( 7×9<-3×2+293
☒I

•
Proof of P by contraditwm .

Suppose up ,
therefore . Q and uh .

✗ 4×+2 and y=✗-z

Example :
prove that
the
graphs of y=

do not intersect in the universe of real numbers .

 29=7/-2
✗4×+2
y=
= [ ✗+ IT -1
¥

the graphs of

proof : P :VY= ✗4×+2 and

g- ✗-2 do not intersect .

and interests
up :
the
graphs of g- ✗4×+2 y=✗-L

suppose 9=114×+2 and y=✗ -2 intersects at some

point

carb ] .

and b= a- 2
b = a'+ atz

'

a -2 =
a 't a -12 ⇐ a + 4=0

⇐) of +4=0 which is a contradiction .

Ah is T
2 :
20 .

v2 : at co
 show that it irrational number
Example 2 : is an .

B- is a rational number
Proof :
Suppose .

that
Then if =
Iq for some
integers p
and g. such

p
and
q have
no common factor .

rz = Plq 2 =
pyqi p2= zqe
be proved by contraposition
.

this can
f.
number number
p2 is an even
p is an even

K
F- 2k for some integer .

'
2k is even
g- = I p2 = .

number
of is an even

and have the Comm factor 21 contradiction !

p q

Thus V2 is an irrational number .

Example 2 : Prove that the set of prime numbers is infinite

there only finite number of prime numbers
suppose
are
proof
.

's write all prime numbers as

Let
Pi Rs Pa Where n is a
positive integer
.

, ,
. .
.

,
 define thus has
Then pipa putt n
=
we n -
. .
.

divisor of
a
prime
.

Because of is a
prime
neebtnber ,
q=p . for one taken

q divides pipzp } - -

pnel Pipp } -

-
putt -_ GMM for some
integer m

pipa .
.
.

putt
=
Pkm I =
Pk C- Pi - - -

pupae . .
.

Pn -1m
)

1 this is a contradiction to PK is a
prime
Pk divides .

number .

Thus the set of prime numbers is infinite .

☐ .

•
Two -

part proof of p Q .

show show a
-
Ii )
p A cii)
p .

p it R , IH R .
,
.
.
. if Rn . if A.

Rn Rn Rn -02
p R R Rz
-

i
-
. -
.

. .
.

a Rne . .
.
.
Rm p

b. and positive integers

Example :
Suppose a. c are

divides be if and only if a divides b.

prove that ac

[ Exercise 15 . 7cal ) .
Proof :
Ac divides be be = Ack for some meager k

b = ak for some meager K

⇐) a divides b.

1. 6 .
Proofs involving quantifiers .

•
Direct proof of 1W✗)p-
be arbitrary object the universe
Proof : Let ✗ an in .

- -
-
. Hence Pix) is true .
Therefore ④ ×) #ex, is true .

real number
Example :L :
show that the sum of a
positive
and its
reciprocal is at least 2 .

be real number
Proof Let ✗ an
arbitrary positive
.

Plxl :
✗+ ¥ 72 .

✗+ ¥72 ✗ -

2+1×20

⇐> ( Tx )
'
-
2A -

¥ + ( ¥520

of -

¥520 is T .

☐ .
 If f- is odd function then
fco
Example 2 an .
, =o
:
.

be
Proof :
Let f- an
arbitrary fraction

| -idd f=
Then f- is an odd function

f- a) =
-

fl -
×) it ✗ EIR

fco > = -

fc -0 ) 2
fco )=o
for )=o
Example 3 ( Theorem 1.6 . 13 .

and c dirties a and c divides

If a ,
b. c are
integers ,
,

b then C divides linear combination of a and b.

every
.

A linear combination of integers a and b is an integer of the

form axtby , where ✗ andy are integers

Proof . Let a ib . and c be arbitrary integers .

ftp.ca.by#x.y-Zax-by.
Cla , clb a= Ck ,
b=cl for some integers Kal .

Then let and be any integers

✗
y
.

axtby =
ckxtcly =
cckxtdg
c Icaxtby , ☐