Chapter-1 6
Chapter-1 6
Chapter-1 6
Introduction to PROOFs
PROOFs
Two types of proof:
Formal proof
Informal proof
2 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Formal Proofs
A formal proof of a conclusion C, given premises p1 ,
p2 , ...,pn consists of a sequence of steps, each of
which applies some inference rule to premises or to
previously proven statements (as hypotheses) to yield a
new true statement (the conclusion)
3 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Informal Proofs
Where the axioms being assumed.
Where the rule of inference used are not explicitly
stated.
4 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Direct Proof
The implication p→q can be proved by showing that if
p is true then q must be true.
5 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Examples of Direct Proof
Before the examples of direct proof, we need to learn
some definition:
DEFINITION 1: The integer n is even if there exists an
integer k such that n=2k and it is odd if there exists an
integer k such that n=2k+1
6 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Examples of direct proofs
EXAMPLE 1: Give a direct proof of the theorem “If n
is an odd integer, then n2 is an odd integer”.
7 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Indirect Proofs (Proof by Contrapositive)
Since the implication p→q is equivalent to its
contrapositive ¬q→¬p, the implication p→q can be
proved by showing that its contrapositive ¬q→¬p is
true.
8 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Examples of Indirect Proof
Give an indirect proof of the theorem, “If 3n+2 is odd,
then n is odd”
9 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Examples of Indirect Proof
Prove that the sum of two rational numbers is rational.
10 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Example
Prove: If n is an integer and 3n + 2 is odd, then n
is odd.
First, attempt a direct proof:
Assume that 3n + 2 is odd, thus 3n + 2 = 2k + 1 for some k
Can solve to find that n = (2k – 1)/3
12 nazia.majadi.googlepages.com/dm_cse09 08/01/21
Proof by Contradiction
Given a conditional p → q, the only way to reject this claim
is to prove that p ∧ ¬q is true.
¬ (p→q) ¬(¬pq) p ∧ ¬q
15 nazia.majadi.googlepages.com/dm_cse09 08/01/21
END
16 nazia.majadi.googlepages.com/dm_cse09 08/01/21