Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect...
Transcript of Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect...
![Page 1: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/1.jpg)
Indirect Proofs
![Page 2: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/2.jpg)
Announcements
● Problem Set 1 goes out today!
● Checkpoint due Monday at 2:30PM.
● Grade determined by attempt rather than accuracy. It's okay to make mistakes – we want you to give it your best effort, even if you're not completely sure what you have is correct.
● We will get feedback back to you with comments on your proof technique and style.
● The more effort you put in, the more you'll get out.● Remaining problems due Friday at 2:30PM.
● Feel free to email staff list with questions, stop by office hours, or ask questions on Piazza!
![Page 3: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/3.jpg)
Outline for Today
● Negations and their Applications● How do you show something is not true?
● What is an Implication?● Understanding a key type of mathematical statement.● Negations of implications.
● Proof by Contrapositive● What's a contrapositive?● And some applications!
● Proof by Contradiction● The basic method.● And some applications!
![Page 4: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/4.jpg)
Quick concluding item from Wednesday
● We learned how to prove that one set S is a subset of another set T.● Pick an arbitrary element x from S. Show x is in T.● This is the only acceptable way to show subset!
● At the end of the slides, you’ll find an example of how to prove that a set S is equal to a set T.● You must essentially write two proofs: ● Show that S is a subset of T (using method above).● Show that T is a subset of S (using method above).● This is the only acceptable way to show set equality!
![Page 5: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/5.jpg)
Negations
![Page 6: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/6.jpg)
Negations
● A proposition is a statement that is either true or false.● Sentences that are questions or commands are not
propositions.● Some examples:
● If n is an even integer, then n2 is an even integer.● Ø = ℝ.
● The negation of a proposition X is a proposition that is true whenever X is false and is false whenever X is true.
● Example:● Proposition X: “a > 5”● Negation of X: “a ≤ 5” ● Incorrect negation of X: “a < 5” ⚠
![Page 7: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/7.jpg)
The negation of a universal statement
Every P is a Q.For all x, P(x) is true.
is an existential statement
There is a P that is not a Q.There exists an x where P(x) is false.
![Page 8: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/8.jpg)
The negation of an existential statement
There exists a P that is a Q.There exists an x where P(x) is true.
is a universal statement
Every P is not a Q.For all x, P(x) is false.
![Page 9: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/9.jpg)
Negation Example: Puppy Logic
● Consider the statement
I love all puppies.
![Page 10: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/10.jpg)
Puppy Logic
● Consider the statement
I love all puppies.
Answer at PollEv.com/cs103 ortext CS103 to 22333 once to join, then A, B, or C.
Answer at PollEv.com/cs103 ortext CS103 to 22333 once to join, then A, B, or C.
What is the negation?
A. I don’t love any puppies.B. I love some puppies and not others.C. There is at least one puppy I don’t love.
What is the negation?
A. I don’t love any puppies.B. I love some puppies and not others.C. There is at least one puppy I don’t love.
![Page 11: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/11.jpg)
Puppy Logic
● Consider the statement
I love all puppies.
Things I LovePuppies
“I love all puppies.”
![Page 12: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/12.jpg)
Puppy Logic
● Consider the statement
I love all puppies.
⚠ I don’t love any puppies. ⚠
Things I LovePuppies
“I love all puppies.”
● The following statement is not the negation of the original statement:
![Page 13: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/13.jpg)
Puppy Logic
● Consider the statement
I love all puppies.
⚠ I don’t love any puppies. ⚠
Things I LovePuppies
Puppies
ThingsI Love
“I love all puppies.” “I don't love any puppies.”
● The following statement is not the negation of the original statement:
![Page 14: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/14.jpg)
Puppy Logic
● Consider the statement
I love all puppies.
⚠ I don’t love any puppies. ⚠
Things I LovePuppies
Puppies
ThingsI Love
ThingsI Love
“I love all puppies.” “I don't love any puppies.”
● The following statement is not the negation of the original statement:
“It's complicated.”
Puppies
![Page 15: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/15.jpg)
Puppy Logic
● Consider the statement
I love all puppies.● Here's the proper negation of our initial statement
about puppies:
There's at least one puppy I don't love.
Things I LovePuppies
“I love all puppies.” “There's at least one puppy I don't love.”
Puppies
ThingsI Love
ThingsI Love
Puppies
![Page 16: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/16.jpg)
Logical Implication
![Page 17: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/17.jpg)
Implications
● An implication is a statement of the form
If P is true, then Q is true.● Some examples:
● Math: If n is an even integer, then n2 is an even integer.
● Set Theory: If A ⊆ B and B ⊆ A, then A = B.● Beyonce: If you like it, then you shoulda put
a ring on it.
![Page 18: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/18.jpg)
Implications as defined in logic/math (this class):
● Implication is directional.● “If X then Y” is NOT the same as “If Y then X.”
● Implication is conditional. ● It only says something about the consequent (“then”
part) when the antecedent (“if” part) is true.● If the antecedent is false, “all bets are off.”
● Implication says nothing about causality.● Simply an assertion about the pattern of True/False
occurrences of the antecedent and consequent.
![Page 19: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/19.jpg)
What Implications Mean
● In mathematics, a statement of the form
For any x, if P(x) is true, then Q(x) is true
means that any time you find an object x where P(x) is true, you will see that Q(x) is also true (for that same x).
![Page 20: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/20.jpg)
Implication, Diagrammatically
Set of objects x whereQ(x) is true.
Set of objects x whereP(x) is true.
Any time P is true, Q is true
as well.
Any time P is true, Q is true
as well.
If P isn't true, Q may or may not
be true.
If P isn't true, Q may or may not
be true.
![Page 21: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/21.jpg)
Negating Implications
![Page 22: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/22.jpg)
“If your March Madness bracket is perfect,then you get an A in CS103.”
is the statement
“Your March Madness bracket is perfect,and you still didn’t get an A in CS103.
The negation of an implicationis not an implication!
Which of the following is inconsistent with the above statement?
(A) Your bracket was terrible, and you got an A. (B) Your bracket was terrible, and you got a B+. (C) Your bracket was perfect, and you got a B+. (D) Both (A) and (C)
Which of the following is inconsistent with the above statement?
(A) Your bracket was terrible, and you got an A. (B) Your bracket was terrible, and you got a B+. (C) Your bracket was perfect, and you got a B+. (D) Both (A) and (C)
Intuition starter:
![Page 23: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/23.jpg)
The negation of the statement
“If P is true,then Q is true”
is the statement
“P is true, and Q is false.”
Note: the negation of an implicationis not an implication!
![Page 24: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/24.jpg)
The negation of the statement
“If P is true,then Q is true”
can also be written as
“P is true, but Q is false.”
Note: the negation of an implicationis not an implication!
We frequently use “but” as a synonym for “and.” “But” carries an emotional connotation of a surprise/unexpected outcome,
however from a logic standpoint they are synonyms.
![Page 25: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/25.jpg)
The negation of the statement
“If your March Madness bracket is perfect,then you get an A in CS103.”
is the statement
“Your March Madness bracket is perfect,and you still didn’t get an A in CS103.
“Your March Madness bracket is perfect,but you still didn’t get an A in CS103.
or, equivalently
![Page 26: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/26.jpg)
Compound Negations
![Page 27: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/27.jpg)
The negation of the statement
“For any x, if P(x) is true,then Q(x) is true”
requires applying both rules we just learned, giving is the statement
“There is at least one x whereP(x) is true and Q(x) is false.”
![Page 28: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/28.jpg)
Relatives of Negation
![Page 29: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/29.jpg)
Relatives of Negation
● The converse of the implication
“If P, then Q”
is
“If Q, then P.”● For example:
● “If your March Madness bracket is perfect, then you get an A in CS103.”
● Converse: “If you got an A in CS103 then your March Madness bracket was perfect.”
● Warning: the converse of a true statement is not necessarily true!
![Page 30: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/30.jpg)
Relatives of Negation
● The inverse of the implication
“If P, then Q”
is
“If not P, then not Q.”● For example:
● “If your March Madness bracket is perfect, then you get an A in CS103.”
● Inverse: “If your March Madness bracket is not perfect, then you won’t get an A in CS103.”
● Warning: the inverse of a true statement is not necessarily true!
![Page 31: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/31.jpg)
The Contrapositive
● The contrapositive of the implication
“If P, then Q”
is
“If not Q, then not P.”● For example:
● “If your March Madness bracket is perfect, then you get an A in CS103.”
● Contrapositive: “If you didn’t get an A in CS103 then your March Madness bracket wasn’t perfect.”
● “If you like it, then you shoulda put a ring on it.”
● Contrapositive: “If you shouldn’t have put a ring on it, then you don’t like it.”
● The contrapositive of a true statement is guaranteed to be true. (Thanks, rules of logic!)
![Page 32: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/32.jpg)
Proof by Contrapositive
![Page 33: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/33.jpg)
To prove the statement
“If P is true, then Q is true,”
you could choose to instead prove the equivalent statement
“If Q is false, then P is false.”
(if that seems easier).
This is called a proof by contrapositive.
![Page 34: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/34.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 35: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/35.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd.
![Page 36: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/36.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 37: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/37.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
We're starting this proof by telling the reader that it's a proof by
contrapositive. This helps cue the reader into what's about to come
next.
We're starting this proof by telling the reader that it's a proof by
contrapositive. This helps cue the reader into what's about to come
next.
![Page 38: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/38.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 39: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/39.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 40: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/40.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 41: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/41.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
Here, we're explicitly writing out the contrapositive. This tells the
reader what we're going to prove. It also acts as a safety reinforcement for ourselves by forcing us to write
out what we think the contrapositive is (to prevent a
careless error in details of taking the contrapositive).
Here, we're explicitly writing out the contrapositive. This tells the
reader what we're going to prove. It also acts as a safety reinforcement for ourselves by forcing us to write
out what we think the contrapositive is (to prevent a
careless error in details of taking the contrapositive).
![Page 42: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/42.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 43: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/43.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 44: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/44.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 45: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/45.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 46: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/46.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 47: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/47.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality andsimplifying gives the following:
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 48: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/48.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality gives us that
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 49: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/49.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality gives us that
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 50: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/50.jpg)
Theorem: For any n ∈ ℤ, if n2 is even, then n is even.
Proof: By contrapositive; we prove that if n is odd,then n2 is odd.
Let n be an arbitrary odd integer. Since n is odd,there is some integer k such that n = 2k + 1.Squaring both sides of this equality gives us that
n2 = (2k + 1)2
n2 = 4k2 + 4k + 1n2 = 2(2k2 + 2k) + 1.
From this, we see that there is an integer m(namely, 2k2 + 2k) such that n2 = 2m + 1.Therefore, n2 is odd. ■
![Page 51: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/51.jpg)
Biconditionals
● Combined with what we saw on Wednesday, we have proven that, if n is an integer:
If n is even, then n2 is even.
If n2 is even, then n is even.● Therefore, if n is an integer:
n is even if and only if n2 is even.● “If and only if” is often abbreviated if:
n is even iff n2 is even.
![Page 52: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/52.jpg)
Proving Biconditionals
● To prove a theorem of the form P iff Q, you need to prove that P implies Q and that Q implies P. (two separate proofs)
● You can use any proof techniques you'd like to show each of these statements.● In this case, we happened to use a direct
proof for one and a proof by contrapositive for the other.
![Page 53: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/53.jpg)
Proof by Contradiction
![Page 54: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/54.jpg)
“When you have eliminated all which is impossible, then whatever remains,
however improbable, must be the truth.”
- Sir Arthur Conan Doyle, The Adventure of the Blanched Soldier
![Page 55: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/55.jpg)
Proof by Contradiction
● A proof by contradiction is a proof that works as follows:● To prove that P is true, assume that P is not true.● Beginning with this assumption, use logical
reasoning to conclude something that is clearly impossible.– For example, that 1 = 0, that x ∈ S and x ∉ S, etc.
● This means that if P is false, something that cannot possibly happen, happens!
● Therefore, P can't be false, so it must be true.
![Page 56: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/56.jpg)
An Example: Set Cardinalities
![Page 57: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/57.jpg)
Set Cardinalities
● We’ve seen sets of many different cardinalities:● |Ø| = 0● |{1, 2, 3}| = 3● |{ n ∈ ℕ | n < 137}| = 137● |ℕ| = ₀.ℵ
● These span from the finite up through the infinite.
● Question: Is there a “largest” set? That is, is there a set that’s bigger than every other set?
![Page 58: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/58.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
![Page 59: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/59.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
![Page 60: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/60.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
To prove this statement by contradiction, we’re going to assume its negation.
What is the negation of the statement“there is no largest set?”
One option: “there is a largest set.”
To prove this statement by contradiction, we’re going to assume its negation.
What is the negation of the statement“there is no largest set?”
One option: “there is a largest set.”
![Page 61: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/61.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
To prove this statement by contradiction, we’re going to assume its negation.
What is the negation of the statement“there is no largest set?”
One option: “there is a largest set.”
To prove this statement by contradiction, we’re going to assume its negation.
What is the negation of the statement“there is no largest set?”
One option: “there is a largest set.”
![Page 62: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/62.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
To prove this statement by contradiction, we’re going to assume its negation.
What is the negation of the statement“there is no largest set?”
One option: “there is a largest set.”
To prove this statement by contradiction, we’re going to assume its negation.
What is the negation of the statement“there is no largest set?”
One option: “there is a largest set.”
![Page 63: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/63.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
To prove this statement by contradiction, we’re going to assume its negation.
What is the negation of the statement“there is no largest set?”
One option: “there is a largest set.”
To prove this statement by contradiction, we’re going to assume its negation.
What is the negation of the statement“there is no largest set?”
One option: “there is a largest set.”
![Page 64: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/64.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
![Page 65: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/65.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
![Page 66: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/66.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
Notice that we're announcing
1. that this is a proof by contradiction, and2. what, specifically, we're assuming.
This helps the reader understand where we're going. Remember – proofs are meant to be read by other people!
Notice that we're announcing
1. that this is a proof by contradiction, and2. what, specifically, we're assuming.
This helps the reader understand where we're going. Remember – proofs are meant to be read by other people!
![Page 67: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/67.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
![Page 68: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/68.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
![Page 69: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/69.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
![Page 70: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/70.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
We’ve reached a contradiction, so our assumption must have been wrong. Therefore, there is no largest set. ■
![Page 71: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/71.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
there is no largest set. ■If S is the largest set, there can’t be a set larger than it, but we found one! We assumed our theorem was false, and then something that can’t possibly happen, happened! Where we must have gone wrong to bring about this contradiction was the moment we assumed our theorem was false. All propositions are either true or false, and we just showed this one can’t be false, so...it’s true!
If S is the largest set, there can’t be a set larger than it, but we found one! We assumed our theorem was false, and then something that can’t possibly happen, happened! Where we must have gone wrong to bring about this contradiction was the moment we assumed our theorem was false. All propositions are either true or false, and we just showed this one can’t be false, so...it’s true!
![Page 72: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/72.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
Therefore, there is no largest set. ■
![Page 73: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/73.jpg)
Theorem: There is no largest set.
Proof: Assume for the sake of contradiction thatthere is a largest set; call it S.
Now, consider the set (℘ S). By Cantor’s Theorem, we know that |S| < | (℘ S)|, so (℘ S) is a larger set than S. This contradicts the fact that S is the largest set.
Therefore, there is no largest set. ■
![Page 74: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/74.jpg)
Proving Implications
● To prove the implication
“If P is true, then Q is true.”● you can use these three techniques:
● Direct Proof.– Assume P and prove Q.
● Proof by Contrapositive.– Assume not Q and prove not P.
● Proof by Contradiction.– … what does this look like?
![Page 75: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/75.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but that n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1 (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 76: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/76.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that _______
integer and that n2 is even, but that n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1 (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
What is the assumption?
A. if n is odd, then n2 is odd B. n is an integer and n2 is even, but n is odd C. if n is an integer and n2 is odd, then n is odd
D. n is an integer and n2 is odd, but n is odd
What is the assumption?
A. if n is odd, then n2 is odd B. n is an integer and n2 is even, but n is odd C. if n is an integer and n2 is odd, then n is odd
D. n is an integer and n2 is odd, but n is odd
Answer at PollEv.com/cs103 ortext CS103 to 22333 once to join, then A, B, or C.
Answer at PollEv.com/cs103 ortext CS103 to 22333 once to join, then A, B, or C.
![Page 77: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/77.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1 (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 78: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/78.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1 (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 79: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/79.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 80: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/80.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 81: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/81.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 82: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/82.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 83: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/83.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 84: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/84.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 85: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/85.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 86: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/86.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 87: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/87.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1 (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
The three key pieces:
1. Say that the proof is by contradiction. 2. Say what the negation of the original statement is. 3. Say you have reached a contradiction and what the contradiction entails.
In CS103, please include all these steps in your proofs!
The three key pieces:
1. Say that the proof is by contradiction. 2. Say what the negation of the original statement is. 3. Say you have reached a contradiction and what the contradiction entails.
In CS103, please include all these steps in your proofs!
![Page 88: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/88.jpg)
Theorem: If n is an integer and n2 is even, then n is even.Proof: Assume for the sake of contradiction that n is an
integer and that n2 is even, but n is odd.
Since n is odd we know that there is an integer k suchthat
n = 2k + 1. (1)
Squaring both sides of equation (1) and simplifyinggives the following:
n2 = (2k + 1)2
= 4k2 + 4k + 1= 2(2k2 + 2k) + 1 (2)
Equation (2) tells us that n2 is odd, which is impossible;by assumption, n2 is even.
We have reached a contradiction, so our assumptionmust have been incorrect. Thus if n is an integer andn2 is even, n is even as well. ■
![Page 89: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/89.jpg)
What We Learned
● What's an implication?● It's statement of the form “if P, then Q,” and states that if P is
true, then Q is true.● How do you negate formulas?
● It depends on the formula. There are nice rules for how to negate universal and existential statements and implications.
● What is a proof by contrapositive?● It's a proof of an implication that instead proves its contrapositive.● (The contrapositive of “if P, then Q” is “if not Q, then not P.”)
● What's a proof by contradiction?● It's a proof of a statement P that works by showing that P cannot
be false.
![Page 90: Indirect Proofs - Stanford Universityweb.stanford.edu/class/cs103/lectures/02-IndirectProof/Indirect Proofs.pdf · Quick concluding item from Wednesday We learned how to prove that](https://reader031.fdocuments.net/reader031/viewer/2022040910/5e846bc88c6d080f0a2404e3/html5/thumbnails/90.jpg)
Next Time
● Mathematical Logic● How do we formalize the reasoning from our
proofs?● Propositional Logic
● Reasoning about simple statements.● Propositional Equivalences
● Simplifying complex statements.