Logic and Proof Techniques
Definition
A proposition is a sentence that is either true or false (not both !)
We can combine propositions to obtain a new proposition. In order to do that, we can use logical connectives.
Symbol | Name | Intuition |
---|---|---|
negation | not | |
$\wedge | conjunction | and |
disjunction | or | |
implication | if ... then | |
equivalence | if and only if | |
exclusive | either | |
for all | all have to be true | |
there exists | at least one |
Negation of Predicates
Examples
For each of the following examples, write the expression with the help of quantifiers and logical operators. Determine if the expression is true of false. Indicate the method of proof used and ... prove it!
1. Prove or disprove: The sum of two odd integers is an even integer.
Written as quantifiers: , where means "x is odd"
Here is a direct proof. An arbitrary odd integer, , has the formula , where . Hence if we take 2 odd integers, & , we get (I know the middle step is useless, but I kept it just for the sake of it). Now we are left with where can be thought as any integer, say . So is clearly divisible by , hence it must be even. This proves that the sum of two odd integers is an even integer.
2. Prove or disprove: The equation below admits a real-numbered solution.
Written as quantifiers:
This proof is straightforward. If you use the quadratic formula you'll get roots and . As you can none of the roots belong to . Hence disproving the statement.
3. Prove or disprove: Let x be an integer. If the square of x is an even integer, then x is even.
Written as quantifiers: where means "x is even."
This can be proved using a proof by contraposition. Here we are trying to prove that . If is not even, then , where . Hence will be , where the part in the parentheses can be thought of as . Hence we have proved that if is not even, then its square is also not even, which in turn proves our initial statement.
4. Prove or disprove: Let m and n be two integers. If the product of the two is even, then m is even or n is even.
Written as quantifiers:
Similarly, this can be proved by contraposition. So we are trying to prove which can be simplified to . Let , where . Thus we get . Hence we proved that if and are both odd, then their product is odd as well. This proves the initial statement.
5. Prove or disprove: If x & y are multiples of 3, then 3x+2y is odd.
Written as quantifiers: where means "x is a multiple of 3".
This statement is false, because if we take then we get which is not odd.
6. Prove or disprove: The square root of 2 is irrational.
This statement is true. Here is a proof by contradiction. We want to prove that is not irrational, in other words it is rational. Suppose that is ratonal, i.e. . If a number is rational, it can be written as a fraction. Hence, that means that for some integers not equal to and this fraction is reduced. . This means is even and we proved in an earlier proof that is also even. Therefore, . This means that is also even, and so is . Let . Hence we get which is not reduced. Hence we have a contradiction.
7. Prove or disprove: If x is a positive real number, then the root of x is less than x.
Written as quantifiers: .
This statement is false. If we take