6 Methods of Proofs-3

UNIVERSITY OF SANTO TOMAS
INSTITUTE OF INFORMATION AND COMPUTING SCIENCES
METHODS OF PROOFS
LECTURE BY:
MS. CHERRY ROSE ESTABILLO
CS201 - CRRESTABILLO
PROOF
A proof is a valid argument that establishes the
truth of a statement.
Proofs have many practical applications:
verification that computer programs are correct
establishing that operating systems are secure
enabling programs to make inferences in artificial
intelligence
showing that system specifications are consistent
DEFINITION
A theorem is a statement that can be shown to be
true using:
- definitions
- other theorems
- axioms(statements which are given as true)
- rules of inference
A lemma is a helping theorem or a result which is
needed to prove a theorem.
A corollary is a result which follows directly from a
theorem.
Less important theorems are sometimes

called propositions.
A conjecture is a statement that is being
proposed to be true.
-> Once a proof of a
conjecture is found, it becomes a theorem. It
may turn out to be false.
Definition:
The integer n is even if there exists
an integer k such that n= 2k,
and n is odd if there exists an integer k, such
that n= 2k+ 1.
Note that every integer is either even or odd
and no integer is both even and odd.
DIRECT PROOFS (p q)
Assume that p is true.

Use rules of inference, definitions, axioms, and
logical equivalences to show that q must also
be true.
Examples
1.) If n is an odd integer, then is odd.
2.) If m and n are both perfect squares, then
mn is also a perfect square.
3.) The sum of two rational numbers is rational.
INDIRECT METHOD
- It is basically done by assuming the conclusion
to be false and then the process of
arguments lead to a certain contradiction,
that is contradicting the hypothesis, or
maybe some contradictory results arises.
1.) Proof by Contraposition

q p
2.) Proof by Contradiction

To prove p, assume p and derive a
contradiction such as p p. (an indirect
form of proof).
(1) If n is an integer and n + 5 is odd, then n is

even.
(2) If n is an integer and 3n+2 is even, then n is
even.
(3) If n=ab, where a and b are positive integers,
then an or bn.
(4) Show that the square root of 2 is an
irrational number.
PROVING BI-IMPLICATIONS
Examples
1.) An integer x is even if and only if x+1 is odd.
2.) n is an even integer if and only if 52 + 12
is even
PROVING EQUIVALENT STATEMENTS

Examples
1.) Prove that the ff is equivalent:
p: x is divisible by 6
q: x is divisible by 2 and 3
r: x is an even number and divisible by 3
2.) Prove that these 3 statements about the integer
n are equivalent:
(i)2 is odd, (ii)1n is even,
(iii) 3 is odd.
DEFINITION
If we can show that p is false, then we have a

proof, called a vacuous proof
Vacuous proofs are often used to establish

special cases of theorems that state that a
conditional statement is true for all positive
integers
DEFINITION
A proof of pq that uses the fact that q is true

is called a trivial proof.
Trivial proofs are often important when special

cases of theorems are proved.
EXAMPLE
1.) Show that the proposition P(0) is true, where
P(n) is If n>1, then n2 > n and the domain
consists of all integers.
2.) Let P(n) be If a and bare positive integers

with ab, then an bn where the domain
consists of all nonnegative integers. Show that
P(0) is true.
PROOF BY CASES
Examples
1.) Prove that , 2 is an even integer.
2.) If n is an integer, then 2
PROOF BY EXHAUSTION
Examples
1.) ( + 1)3 3 if n is a positive integer n<4.
COUNTEREXAMPLE
Examples
1.) Every positive integer is the sum of the
squares of two integers.
2.) If 2 is positive, then n is positive.
Exercises
1.) Prove: Let a and b be real numbers such that
a<b. Then there exists a real number c such that
a<c<b.
(1) Show that

a+ar++arn-1=[a(1-rn)]/1-r ; n >1, r 0
(2) 1 + 3 + 6 + + [n(n+1)]/2 = [n(n+1)(n+2)]/6
(3) 1+5+9++(4n-3)=n(2n-1)
(4) + + + + = +
(5) < for all positive integers n.
(6) < ! for every integer n with n4.
PRACTICE
(1) If a and b are positive integers and a2 > b2, then a>b.
(2) If n is a perfect square, then n+2 is not a perfect square.
(3) Show that log 2 is an irrational number.
(4) The sum of an irrational number and a rational
number is irrational.
(5) If m and n are integers and mn is even, then m is even
or n is even.
(6) Show that there is no rational number r for which
3 + + 1 = 0.

6 Methods of Proofs-3

Încărcat de

Informații document

Descriere originală:

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

6 Methods of Proofs-3

Încărcat de

Drepturi de autor:

Formate disponibile

UNIVERSITY OF SANTO TOMAS

INSTITUTE OF INFORMATION AND COMPUTING SCIENCES

Less important theorems are sometimes

Assume that p is true.

1.) Proof by Contraposition

2.) Proof by Contradiction

(1) If n is an integer and n + 5 is odd, then n is

PROVING EQUIVALENT STATEMENTS

If we can show that p is false, then we have a

Vacuous proofs are often used to establish

A proof of pq that uses the fact that q is true

Trivial proofs are often important when special

2.) Let P(n) be If a and bare positive integers

2.) If n is an integer, then 2

(1) Show that

S-ar putea să vă placă și