Scribd
Upload
12 views

Methods of Proofs

Uploaded by

Saad Malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
12 views

Methods of Proofs

Uploaded by

Saad Malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Methods of Proofs

What is A theorem?

● A theorem is a statement that can be shown to be true.


● Less important theorems sometimes are called propositions. Theorems can also be
referred to as facts or results.
● A theorem may be the universal quantification of a conditional statement with one or
more premises and a conclusion.
What is A Proof?
● A proof is a valid argument that establishes the truth of a theorem. The statements used in a
proof can include axioms (or postulates) which are the statements we assume to be true
● We demonstrate that a theorem is true with a proof.
Methods of Proving Theorems

● To construct proofs we need all available ammunition, including a powerful battery of


different proof methods. These methods provide the overall approach and strategy of
proofs. Understanding these methods is a key component of learning how to read and
construct mathematical proofs. One we have chosen a proof method, we use axioms,
definitions of terms, previously proved results, and rules of inference to complete the proof.
● To prove a theorem of the form ∀x(P(x) → Q(x)), our goal is to show that P(x) → Q(x) is
true, where x is an arbitrary element of the domain, and then apply universal generalization.
In this proof, we need to show that a conditional statement is true. Because of this, we now
focus on methods that show that conditional statements are true. Recall that p → q is true
unless p is true but q is false. Note that to prove the statement p → q, we need only show
that q is true if p is true.
1. Direct Proofs

A direct proof shows that a conditional statement p → q is true by showing that if p is true,
then q must also be true, so that the combination p true and q false never occurs. In a
direct proof, we assume that p is true and use axioms, definitions, and previously proven
theorems, together with rules of inference, to show that q must also be true.
More problems on direct proof

1. Use a direct proof to show that the sum of two odd integers is even.

solution in class

2. Show that the square of an even number is an even number using a direct proof.

solution in class

3. Use a direct proof to show that the product of two odd numbers is odd.

Solution in class
Show that

=1
Proof by Contraposition (indirect proof)

Proofs by contraposition make use of the fact that the conditional statement p → q is
equivalent to its contrapositive, ¬q →¬p. This means that the conditional statement p → q
can be proved by showing that its contrapositive, ¬q →¬p, is true. In a proof by
contraposition of p → q, we take ¬q as a premise, and using axioms, definitions, and
previously proven theorems, together with rules of inference, we show that ¬p must follow
Examples of Contrapositive

1. Prove that if 3n + 2 is odd, then n is odd. (n is an integer)

Try Direct Proof


Let , an odd number.

About a ratio of integers, we can not say, it is odd or


even.
So we get STUCK???
Try In-Direct Proof – by Contraposition

If is NOT odd (even), then is NOT odd (even).


If is EVEN, then is EVEN.
Let then
It is multiple of 2, hence even number. Hence proved by Contraposition.
Use contraposition to show that if is odd, then is odd. ( is an
integer)
Try Direct Proof
Let , an odd number.

What to do next???
So we get STUCK again???
Try In Direct Proof – by Contraposition

If is NOT odd (even), then is NOT odd (even).


If is EVEN, then is EVEN.
Let then
It is multiple of 2, hence even number. Hence proved by Contraposition.
If , where are positive integers, then and b .
Proof:
Contraposition: If OR , then
If , or b>n minimum possible value of n .
Then .
Proof by Cases:
● Only consecutive integers which are perfect powers less than 100 are 8
and 9.
● Perfect power:

● We can check one by one all perfect powers less than 100.

1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100


● If is an integer, then

● Proof
● We have 3 cases:
I. , is positive.
II.
III. . is negative. (because is negative number.)
Proof by Counter Example:

You might also like