Proofs
Rules of Inference
Proofs are valid arguments to show the truth of statement. Valid arguments are a sequence of statements that end with a conclusion, where each conclusions follows the truth of preceding statements. We need to use rules of inference to show the validity of the argument.
Name | Tautology | Example |
---|---|---|
Modus Ponens | If it is raining, then the ground is wet, it is raining, therefore the ground is wet | |
Modus Tollens | If it is raining, then the ground is wet, the ground is not wet, therefore it is not raining | |
Hypothetical Syllogism | If it is raining, then the ground is wet, if the ground is wet, then the plants are watered, therefore if it is raining, then the plants are watered | |
Disjunctive Syllogism | Either it is raining or the ground is wet, it is not raining, therefore the ground is wet | |
Addition | If it is raining, then it is raining or the ground is wet | |
Simplification | If it is raining and the ground is wet, then it is raining | |
Resolution | If stay home, study. If study, get A. Therefore, if stay home, get A. |
Example application
There has been a robbery. We know that the burglars left in a car. We also know that
- Only A or B or C can be involved.
- If C does a robbery, he needs A alongside.
- B does not know how to drive.
Can you identify a burglar with certainty?
Propositions:
Where A,B,C are the propositions that A, B, C are involved in the robbery. The master proposition:
Using Rules of Inference
To prove a statement of the form is true, we can use the following methods:
Name | Assumption | Goal |
---|---|---|
Direct | ||
Contrapositive | ||
Contradiction | Show a false statement |
For other statement forms:
Name | Forms | Goal |
---|---|---|
Cases | ||
Equivalence | ||
Vacuous | (Since always true for false) | |
Trivial | (Since always true for true) | |
Constructive existence | (Witness) | |
Non-constructive existence | Prove without finding witness (e.g. using theorems) | |
Induction |
Direct proof example
Prove that if is an even integer, then is also an even integer.
Let for some integer . Then . Since is an integer, is even.
Contrapositive proof example
Prove that if is an odd integer, then is also an odd integer.
Assume is an even integer. Then for some integer . Then . Since is an integer, is even. Therefore, if is odd, then is odd.
Contradiction proof example
Prove that is irrational.
Assume is rational. Then for some integers and . We can assume that and are coprime. Then , so . Since is even, is even. Then for some integer . Then , so . Since is even, is even. But and are coprime, so this is a contradiction. Therefore, is irrational.
Cases proof example
Prove that there are no rational solutions to .
Let be rational solutions. Then we have . Consider the following cases:
Since in all possible cases we get no rational solutions, proved.