Scribd
Upload
18 views13 pages

Section 1.5: Basic Proof Methods II: Dr. Yassir Dinar

This document discusses various proof methods in mathematics, including: 1) Proof by contraposition, which proves statement P implies Q by assuming not Q and proving not P. 2) Proof by contradiction, which assumes a statement and its negation and derives a contradiction. 3) Existence proofs using proof by contradiction, such as proving the set of prime numbers is infinite. 4) Proving biconditionals with a two part proof showing statement P implies Q and Q implies P. 5) Different proofs can exist for the same mathematical result using various techniques.

Uploaded by

mmm19991077
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views13 pages

Section 1.5: Basic Proof Methods II: Dr. Yassir Dinar

This document discusses various proof methods in mathematics, including: 1) Proof by contraposition, which proves statement P implies Q by assuming not Q and proving not P. 2) Proof by contradiction, which assumes a statement and its negation and derives a contradiction. 3) Existence proofs using proof by contradiction, such as proving the set of prime numbers is infinite. 4) Proving biconditionals with a two part proof showing statement P implies Q and Q implies P. 5) Different proofs can exist for the same mathematical result using various techniques.

Uploaded by

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

Section 1.

5: Basic Proof Methods II

Dr. Yassir Dinar

Spring 2020

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 1 / 13
Proof by Contraposition

The proposition form P ⇒ Q is equivalent to its contraposition


∼ Q ⇒∼ P . Hence to prove P ⇒ Q we can use the following:
Proof by contraposition of P ⇒ Q.
Assume ∼ Q.
{Use definitions, axioms, properties,algebraic manipulation,
principles of logic, mathematical tricks, etc...}
Therefore ∼ P ,
Thus, ∼ Q ⇒∼ P
Thus, P ⇒ Q.

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 2 / 13
Examples of Proof by Contraposition I

Example 5.1
Let m be an integer. Prove that if m2 is even, then m is even.

Note that the contraposition is “If m is odd then m2 is odd”


Solution.
Let m be an integer. Suppose m is odd.Then, by definition, m = 2t + 1
for some integer t.

m2 = (2t + 1)2 = 4t2 + 4t + 1 = 2(2t2 + 2t) + 1.

Since (2t2 + 2t) is an integer. Therefore, m2 is is odd.Thus, if m is odd,


then m2 is odd. Therefore, if m2 is even, then m is even.

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 3 / 13
Examples of Proof by contraposition II

Example 5.2
Let a, b be integers. If ab is even, then either a or b is even.

What is the contraposition of the above statement?


Solution.

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 4 / 13
Proof of P ⇒ Q by Contradiction

Recall that ∼ (P ⇒ Q) ≡ P ∧ ∼ Q

Proof of P ⇒ Q by Contradiction.
Assume P ∧ ∼ Q.
{Use definitions, axioms, properties,algebraic manipulation,
principles of logic, mathematical tricks, etc...}
Therefore, R
Therefore, ∼ R
Hence, R∧ ∼ R a contradiction
Thus, P ⇒ Q

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 5 / 13
Examples of Proof by Contradiction I

Example 5.3
Let m be an integer. Prove that if m2 is even, then m is even.

What is the negation of the above statement?


Solution.

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 6 / 13
Proof of T by Contradiction

Proof by Contradiction works for any statement of the form T by


assuming ∼ T and finding an statement R and its negation ∼ R.
Proof of T by Contradiction .
Assume ∼ T .
{Use definitions, axioms, properties,algebraic manipulation,
principles of logic, mathematical tricks, etc...}
Therefore, R
Therefore, ∼ R
Hence, R∧ ∼ R a contradiction
Thus, T .

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 7 / 13
Examples Proof by Contradiction II

Example 5.4
√
Prove that 2 is irrational.

Solution.
√ √ p
Assume 2 is rational. Then by definition, 2= q for some integers p, q
2
and q 6= 0. Suppose p and q have no common factors. Then 2 = pq2 ,
which implies 2q 2 = p2 . Then p2 is even which implies p is even.
Hence p = 2k for some integer k. Substituting, 2q 2 = (2k)2 = 4k 2 . Thus
q 2 = 2k 2 , which implies q 2 is even. Therefore, q is even.
Since both p and q are even, then p and q have 2 as a common factor.
This is a contradiction
√ to the assumption that p and q has no common
factor. Therefore, 2 is irrational.

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 8 / 13
Proof of Contradiction III

Find the solution of the following examples


Example 5.5
Prove that the graphs of y = x2 + x + 2 and y = x − 2 do not intersect.

Solution.
Suppose that two graphs .... Therefore, two graphs does not intersect.

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 9 / 13
Proof by Contradiction IV
Example 5.6
The set of prime integers is infinite.

In the solution below the following statements are used:


Let a, b and c be integers, If a|b and a|c, then a|(b − c).You can
prove it as an exercises.
Let n > 1 be a natural number. Then n has a prime divisor. Will be
proved by Mathematical Induction

Solution.
Suppose the set of prime numbers is finite. Let p1 , p2 , . . . , pk be all these
prime numbers. Let n = p1 p2 · · · pk + 1. Then n is an integer greater than
1. Then there exist a prime number q divides n. Since q is prime, it
divides the product of all prime numbers (p1 p2 · · · pk ). Hence q divides
n − (p1 p2 · · · pk ) = 1. This gives a contradiction since q > 1. Therefore,
the set of prime numbers is infinite.
Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 10 / 13
Proof of Biconditional
Recall that P ⇔ Q ≡ (P ⇒ Q) ∧ (Q ⇒ P ).

Two part proof of P ⇔ Q.


Show P ⇒ Q. Show Q ⇒ P . Therefore, P ⇔ Q

Example 5.7
Let m be integer. Show that m2 is even if and only if m is even.

Solution.
Suppose m2 is even and m is odd.Then, by definition, m = 2t + 1 for some
integer t. m2 = 2(2t2 + 2t) + 1. Since (2t2 + 2t) is an integer. Therefore,
m2 is odd, a contradiction Therefore, if m2 is even, then m is even.
For the converse, suppose m is even. Then m = 2k for some integer k.
Thus m2 = 2(2k 2 ) is even since 2k 2 is an integer. Therefore, if m is even
then m2 is even.

Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 11 / 13
Proof of Biconditional
Biconditional Proof of P ⇔ Q.
P if and only if R1
if and only if R2
···
if and only if Rn
if and only if Q

Example 5.8
Suppose a, b, c and d are real numbers with a 6= 0 and c 6= 0. Show that the lines
y = ax + b and y = cx + d have the same x-intercept if and only if ad = bc.

Solution.
The lines have the same x-intercept if and only if −b/a = −d/c
if and only if −bc = −ad
if and only if ad = bc
Dr. Yassir Dinar Section 1.5: Basic Proof Methods II Spring 2020 12 / 13
Different Proofs of The Same Result

Dr. Yassir Dinar


Figure: Caption
Section 1.5: Basic Proof Methods II Spring 2020 13 / 13

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy