methods of proof
DESCRIPTION
Methods of Proof. What’s wrong with that?. The Vicky Pollard Proof Technique. Prove that when n is even n 2 is even. Assume n is 0, then n 2 is 0, and that is even. Assume n is 2, then n 2 is 4, and that is even. Assume n is 4, then n 2 is 16, and that is even. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/1.jpg)
![Page 2: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/2.jpg)
Methods of Proof
![Page 3: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/3.jpg)
Prove that when n is even n2 is even.
Assume n is 2, then n2 is 4, and that is even
Assume n is -2, then n2 is 4 , and that is even also!
Assume n is 0, then n2 is 0, and that is even
Assume n is 4, then n2 is 16, and that is even
Assume n is 6, then n2 is 36, and that is even
Therefore when n is even n2 is even!
What’s wrong with that?
The Vicky Pollard Proof Technique
![Page 4: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/4.jpg)
It’s got to be a logical, convincing argument!
![Page 5: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/5.jpg)
Direct Proof
qp
• (1) assume that p is true• (2) use
• rules of inference • theorems already proved• to show q is true
![Page 6: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/6.jpg)
What’s a theorem then?
A theorem is a statement that can be shown to be true
![Page 7: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/7.jpg)
![Page 8: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/8.jpg)
So, what’s a theory?
![Page 9: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/9.jpg)
![Page 10: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/10.jpg)
The square of an even number is even
)()( 2nevenneven
• (1) assume even(n)• (2) n = 2k• (3) n2 = 4k2 = 2(2k2) which is even• Q.E.D
Direct Proof
Quod erat demonstrandum
That which was to be proved
![Page 11: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/11.jpg)
Indirect Proof
pqqp
• (0) show that contrapositive is true• (1) assume that q is false• (2) use
• rules of inference • theorems already proved• to show p is false
• (4) “Since the negation of the conclusion of the implication (¬q) implies that the hypothesis is false (¬p), the original implication is true”
![Page 12: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/12.jpg)
If n is an integer and 3n + 2 is even then n is even
)()23( nevenneven
• (1) assume odd(n)• (2) n = 2k + 1• (3) 3n + 2
• = 3(2k + 1) + 2• = 6k + 3 + 2• = 6k + 5• = 6k + 4 + 1• = 2(3k + 2) + 1• which is odd
• QED
Indirect Proof
)23()( noddnodd
![Page 13: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/13.jpg)
If n2 is even then n is even
)()( 2 nevenneven
• assume odd(n) n = 2k + 1 n2 = (2k + 1)2
= 4k2 + 4k + 1 = 2(2k2 + 2) + 1 which is odd
• QED
Indirect Proof
)()( 2noddnodd
![Page 14: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/14.jpg)
If n2 is even then n is even
)()( 2 nevenneven
• assume even(n2) n2 = 2k n = …
• QED
Could we prove this directly?
Q: Why use an indirect proof?A: It might be the easy option
![Page 15: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/15.jpg)
If n2 is even then n is even
)()( 2 nevenneven
• Suppose that n2 is even.• Then 2k = n2 for some integer k.• Let n = 2m for some integer m• Therefore n is even• QED
Direct Proof again What’s wrong with this?
Where did we get “n = 2m” from?This is circular reasoning, assuming true what we have to prove!
![Page 16: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/16.jpg)
Theorem: If n2 is even then n is even
Indirect Proof It’s an argument. Present it well
Proof:We prove this indirectly, i.e. we show that if a number is odd then when we square it we get an odd result. Assume n is odd, and can be represented as 2k + 1, where k is an integer. Then n squared is 4k2 + 4k + 1, and we can express that as 2(2k2 + 2k) + 1, and this is an even number plus 1, i.e. an odd number. Therefore, when n2 is even n is even. QED
![Page 17: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/17.jpg)
Proving if and only if
To prove p q
prove p q and prove q p
The proof is in 2 parts!!
![Page 18: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/18.jpg)
Proving if and only if
To prove p q prove p q & prove q p
n is odd if and only if n2 is odd
• prove odd(n) odd(n2) if n is odd then n = 2k + 1 n2 = 4k2 + 4k + 1, which is 2(2k2 + 2k) + 1 and this is an odd number • prove odd(n2) odd(n) use an indirect proof, i.e. even(n) even(n2) we have already proved this (slide 3)
• Since we have shown that p q & q p we have shown that the theorem is true
![Page 19: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/19.jpg)
Trivial Proof
qqp )(
• p implies q AND we are told q is true• true true is true and false true is also true• then it is trivially true
![Page 20: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/20.jpg)
Trivial Proof
nn bababanP 00:)(
• Prove P(0)• a0 = 1• b0 = 1• therefore a0 b0
• QED
![Page 21: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/21.jpg)
Proof by Contradiction
• Assume the negation of the proposition to be proved and derive a contradiction• To prove P implies Q, (P Q)
• assume both P and not Q (P Q)• remember the truth table for implication?• This is the only entry that is false.
• derive a contradiction (i.e. assumption must be false)
Assume the negation of what you want to proveand show that this assumption is untenable.
![Page 22: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/22.jpg)
![Page 23: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/23.jpg)
Proof by Contradiction If 3n + 2 is odd then n is odd
• assume odd(3n + 2) and even(n)• even(n) therefore n = 2 k• 3n + 2 = 3(2k) + 2• 6k + 2 = 2(3k + 1)• 2(3k + 1) is even• therefore even(3n + 2)• this is a contradiction• therefore our assumption is wrong
• n must be odd• QED
ioncontradictqpqpRTP
)(
:
![Page 24: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/24.jpg)
Proof by Contradiction (properly)If 3n + 2 is odd then n is odd
• assume odd(3n + 2) and even(n)• even(n) therefore n = 2 k• 3n + 2 = 3(2k) + 2• 6k + 2 = 2(3k + 1)• 2(3k + 1) is even• therefore even(3n + 2)• this is a contradiction• therefore our assumption is wrong
• n must be odd• QED
Theorem: If 3n+2 is odd then n is odd.
Proof:We use a proof by contradiction. Assume that 3n+2 is odd andn is even. Then we can express n as 2k, where k is an integer.Therefore 3n+2 is then 6k+2, i.e. 2(3k+1), and this is aneven number. This contradicts our assumptions, consequently n must be odd. Therefore when 3n+2 is odd, n is odd. QED
![Page 25: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/25.jpg)
Proof by contradiction that P is true
Assume P is false and show that is absurd
![Page 26: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/26.jpg)
Proof by Contradiction The square root of 2 is irrational
• to be rational a number can be expressed as• x = a/b• a and b must be relative prime
• otherwise there is some number that divides a and b • to be irrational, we cannot express x as a/b• 2 is irrational 2 a/b• To prove this we will assume 2 a/b and derive a contradiction
A brief introduction to the proof
An example of a larger, more subtle proof
![Page 27: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/27.jpg)
Proof by Contradiction The square root of 2 is irrational
• assume 2 is rational (and show this leads to a contradiction)
2 = a/b a and b are integers relativePrime(a,b) i.e. gcd(a,b) = 1
• 2 = (a2)/(b2) 2b2 = a2
even(a2)• we have already proved
• even(n2) even(n) even(a) a = 2c 2b2 = a2 = 4c2
b2 = 2c2
even(b)• but gcd(a,b) = 1
a and b cannot both be even• Our assumption must be false, and root 2 is irrational• QED
![Page 28: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/28.jpg)
![Page 29: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/29.jpg)
Proof by Cases
• To prove P Q• find a set of propositions P1, P2, …, Pn• (P1 or P2 or … or Pn) Q• prove
P1 -> Q and P2 -> Q and … and Pn -> Q
We look exhaustively for all cases and prove each one
*2121 )](...)()[(])...[( qpqpqpqppp nn
To prove this qppp n )...( 21
Know that
Rule of inference, p177
![Page 30: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/30.jpg)
Proof by Cases
Factoid: the 4-colour theorem had > 1000 cases
![Page 31: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/31.jpg)
Proof by Cases
• There are 2 cases to consider,• x > 0• x < 0
• x > 0 then clearly x2 is greater than zero• x < 0
• the product of two negative integers is positive• consequently x2 is again greater than zero
• QED
For every non-zero integer x, x2 is greater than zero
![Page 32: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/32.jpg)
Proof by Cases
• There are 4 cases to consider• n = 5k + 1
n2 = 25k2 + 10k + 1 = 5(5k2 + 2k) + 1• n = 5k + 2
n2 = 25k2 + 20k + 4 = 5(5k2 + 4k) + 4• n = 5k + 3
n2 = 25k2 + 30k + 9 = 5(5k2 + 6k + 1) + 4• n = 5k + 4
n2 = 25k2 + 40k + 16 = 5(5k2 + 8k + 3) + 1 the remainders are 1 or 4• QED
The square of an integer, not divisible by 5 ,leaves a remainder of 1 or 4 when divided by 5
![Page 33: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/33.jpg)
Vacuous Proof
• prove P(3)• if 3 > 4 then …• if false then …
• Since the hypothesis in this implication is false
• the implication is vacuously true
• QED
When P is false P implies Q is trueIf we can prove P is false we are done!
nnnnP 34:)( 3
![Page 34: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/34.jpg)
Existence Proof
• Prove, or disprove something, by presenting an instance (a witness).• This can be done by
• producing an actual instance• showing how to construct an instance• showing it would be absurd if an instance did not exist
Disprove the assertion “All odd numbers are prime”
Number nine
![Page 35: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/35.jpg)
Existence Proof Is n2 - n + 41 prime when n is positive?
• let n = 41• n2 - n + 41 = 41.41 - 41 + 41
= 41.41 which is composite
• therefore n2 - n + 41 is not always prime• QED
![Page 36: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/36.jpg)
Existence Proof
Show that there are n consecutive composite integers for any +ve n
What does that mean?
• for example, let n = 5• consider the following sequence of 5 numbers
• 722 divisible by 2• 723 divisible by 3• 724 divisible by 4• 725 divisible by 5• 726 divisible by 6
• the above consecutive numbers are all composite
![Page 37: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/37.jpg)
Existence Proof
Show that there are n consecutive composite integers for any +ve n
let x = (n + 1)! + 1 x = 1.2.3.4 … n.(n+1) + 1
• x + 1 = 2 + (n + 1)! = 2(1 + (n + 1)!/2)• x + 2 = 3 + (n + 1)! = 3(1 + (n + 1)!/3)• x + 3 = 4 + (n + 1)! = 4(1 + (n + 1)!/4)• …• x + n = (n + 1) + (n + 1)! = (n + 1)(1 + (n + 1)!/(n + 1))
We have constructed n consecutive composite integers QED
![Page 38: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/38.jpg)
Are there an infinite number of primes?
• Reformulate this as• “For any n, is there a prime greater than n?”
• compute a new number x = n! + 1• x = (1.2.3.4.5.6…n-1.n) + 1
• x is not divisible by any number in the range 2 to n• we always get remainder 1
• the FTA states x is a product of primes• x has a prime divisor• x’s smallest prime divisor is greater than n
• Consequently for any n there is a prime greater than n
Existence Proof
![Page 39: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/39.jpg)
Bad proofs: Rosen 1.5 page 69
Fallacies
pqqp ])[( Fallacy of affirming the conclusion
qpqp ])[( Fallacy of denying the hypothesis
![Page 40: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/40.jpg)
Fallacies
Give us an example.
Go on
Examples
![Page 41: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/41.jpg)
Fallacies Examples
The fallacy of affirming the consequent
p
q
qp
If the butler did it he has blood on his handsThe butler has blood on his handsTherefore the butler did it!
pqqp ])[(
This is NOT a tautology, not a rule of inference!
![Page 42: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/42.jpg)
Fallacies Examples
The fallacy of affirming the consequent
If the butler did it he has blood on his handsThe butler has blood on his handsTherefore the butler did it!
I told you!
![Page 43: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/43.jpg)
Fallacies Examples
The fallacy of denying the antecedent
q
p
qp
If the butler is nervous, he did it!The butler is really relaxed and calm.Therefore, the butler did not do it.
qpqp ])[(
This is NOT a tautology, not a rule of inference!
![Page 44: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/44.jpg)
Fallacies Examples
The fallacy of denying the antecedent
You see, I told you!
If the butler is nervous, he did it!The butler is really relaxed and calm.Therefore, the butler did not do it.
![Page 45: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/45.jpg)
Fallacies Examples
Begging the question Or
Circular reasoning
We use the truth of a statement being proved in the proof itself!
Ted: God must exist.Dougal: How do you know that then Ted?Ted: It says so in the bible Dougal.Dougal: Ted. Why should I believe the bible Ted?Ted: Dougal, God wrote the bible.
![Page 46: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/46.jpg)
Fallacies Examples
Begging the question Or
Circular reasoning
Ted: God must exist.Dougal: How do you know that then Ted?Ted: It says so in the bible Dougal.Dougal: Ted. Why should I believe the bible Ted?Ted: Dougal, God wrote the bible.
![Page 47: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/47.jpg)
Proofs. Who cares?
![Page 48: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/48.jpg)
Are there some things that cannot be proved?
![Page 49: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/49.jpg)
Proof techniques
• rules of inference• fallacies• direct proof• indirect proof• if and only if• trivial proof• proof by contradiction• proof by cases• vacuous proof• existence proof
![Page 50: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/50.jpg)
![Page 51: Methods of Proof](https://reader036.vdocuments.site/reader036/viewer/2022081515/56812bb2550346895d8fee7f/html5/thumbnails/51.jpg)
fin