Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.
-
Upload
bertina-griffin -
Category
Documents
-
view
215 -
download
0
Transcript of Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.
![Page 1: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/1.jpg)
Proof By ContradictionProof By Contradiction
Chapter 3Indirect Argument
Contradiction
Theorems 3.6.1 and 3.6.2
pg. 171
![Page 2: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/2.jpg)
Your Hosts
Robert Di Battista Introduction, slides
Da’niel Rowan Theorem 3.6.1
Annette Stiller Theorem 3.6.2
![Page 3: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/3.jpg)
Proof By Contradiction
Indirect Argument Prove the negation is false. reductio ad absurdum Assume its negation is true, until it is
reduced to an impossibility or absurdity. This leaves only one possibility.
![Page 4: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/4.jpg)
Method of Proof By Contradiction
Suppose the statement to be proved is false, i.e. suppose the negation of the statement is true.
Show that this supposition leads logically to a contradiction.
Conclude that the statement to be proved is true.
![Page 5: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/5.jpg)
Analogous to…
Shows truth by discounting the opposite. Sarcasm Reverse psychology
![Page 6: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/6.jpg)
Theorem 3.6.1
There is no greatest integer.There is no greatest integer.
![Page 7: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/7.jpg)
Theorem 3.6.1
[We take the negation of the theorem
and suppose it to be true]
Suppose not. That is, suppose there is a greatest integer N.
[We must deduce
a contradiction]
Then N > n for every integer n.
![Page 8: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/8.jpg)
Theorem 3.6.1
Let M = N + 1.
M is an integer since it is the sum of integers.
Also M > N since M = N + 1.
![Page 9: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/9.jpg)
Theorem 3.6.1
Thus M is an integer that is greater than N. So N is the greatest integer and N is not the greatest integer, which is a contradiction.
[This contradiction shows that the
supposition is false and, hence,
that the theorem is true.]
![Page 10: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/10.jpg)
Theorem 3.6.1
Bill Gates is disgustingly rich, but someone can always have $1 more than him.
![Page 11: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/11.jpg)
Theorem 3.6.1
Exam question:Prove by contradiction
“There is no greatest odd integer.”
![Page 12: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/12.jpg)
WAIT!
![Page 13: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/13.jpg)
THERES MORE
![Page 14: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/14.jpg)
Theorem 3.6.2
There is no integer that There is no integer that
is both even and odd.is both even and odd.
![Page 15: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/15.jpg)
Theorem 3.6.2
[We take the negation of the theorem
and suppose it to be true]
Suppose not. That is, suppose there is an integer N that is both even and odd.
[We must deduce
a contradiction.]
![Page 16: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/16.jpg)
Theorem 3.6.2
By definition of even, n = 2a for some integer a, and by definition of odd, n = 2b + 1 for some integer b. Consequently,
2a = 2b +1 [By equating the two expressions for n.]
And so2a – 2b = 12(a – b) = 1 (a – b) = 1/2 [by algebra]
![Page 17: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/17.jpg)
Theorem 3.6.2
Now since a and b are integers, the difference a – b must also be an integer. But a – b = 1/2, and 1/2 is not an integer. Thus a – b is an integer and a – b is not an integer, which is a contradiction.
[This contradiction shows that the
supposition is false and, hence,
that the theorem is true.]
![Page 18: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/18.jpg)
Analogous to…
Mutually exclusive groups: Male or female Positive or negative True or false
![Page 19: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/19.jpg)
Theorem 3.6.2
Exam question:
Prove by contradiction
“There is no real number that is both positive and negative.”
![Page 20: Proof By Contradiction Chapter 3 Indirect Argument Contradiction Theorems 3.6.1 and 3.6.2 pg. 171.](https://reader036.fdocuments.us/reader036/viewer/2022082612/5697bf751a28abf838c80544/html5/thumbnails/20.jpg)
Related Homework
Section 3.6 3 -15 21 – 27 32