Notes@HKU by Jax

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.

Basis Rules

NameTautologyExample
Modus Ponens(p(pq))q(p \land (p \rightarrow q)) \rightarrow qIf it is raining, then the ground is wet, it is raining, therefore the ground is wet
Modus Tollens((pq)¬q)¬p((p \rightarrow q) \land \neg q) \rightarrow \neg pIf it is raining, then the ground is wet, the ground is not wet, therefore it is not raining
Hypothetical Syllogism((pq)(qr))(pr)((p \rightarrow q) \land (q \rightarrow r)) \rightarrow (p \rightarrow r)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(pq)¬pq(p \lor q) \land \neg p \rightarrow qEither it is raining or the ground is wet, it is not raining, therefore the ground is wet
Additionp(pq)p \rightarrow (p \lor q)If it is raining, then it is raining or the ground is wet
Simplification(pq)p(p \land q) \rightarrow pIf it is raining and the ground is wet, then it is raining
Resolution((pq)(¬pr))qr((p \lor q) \land (\neg p \lor r)) \rightarrow q \lor rIf 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

  1. Only A or B or C can be involved.
  2. If C does a robbery, he needs A alongside.
  3. B does not know how to drive.

Can you identify a burglar with certainty?

Propositions:

  1. ABCA \lor B \lor C
  2. CAC \rightarrow A
  3. ¬B(CA)\neg B \rightarrow (C \lor A)

Where A,B,C are the propositions that A, B, C are involved in the robbery. The master proposition:

(ABC)(CA)(¬B(CA))(AC)(CA)By resolution of 1 and 3(AC)(¬CA)By implication of 2ABy resolution of remaining\begin{align*} & (A \lor B \lor C) \land (C \rightarrow A) \land (\neg B \rightarrow (C \lor A)) \\ & (A \lor C) \land (C \to A) & \text{By resolution of 1 and 3}\\ & (A \lor C) \land (\neg C \lor A) & \text{By implication of 2}\\ & A & \text{By resolution of remaining}\\ \end{align*}

Using Rules of Inference

Methods of proofs

To prove a statement of the form pqp \rightarrow q is true, we can use the following methods:

NameAssumptionGoal
Directppqq
Contrapositive¬q\neg q¬p\neg p
Contradiction¬p\neg pShow a false statement

For other statement forms:

NameFormsGoal
Casesp1p2qp_1 \lor p_2 \lor \ldots \to qp1qp2qp_1 \to q \land p_2 \to q \land \ldots
Equivalencepqp \leftrightarrow qpqqpp \rightarrow q \land q \rightarrow p
Vacuouspqp\to q¬p\neg p (Since always true for pp false)
Trivialpqp\to qqq (Since always true for qq true)
Constructive existencexP(x)\exists x P(x)a:P(a)a: P(a) (Witness)
Non-constructive existencexP(x)\exists x P(x)Prove without finding witness (e.g. using theorems)
InductionxP(x)\forall x P(x)P(1)k[P(k)P(k+1)]P(1)\land\forall k[P(k)\to P(k+1)]
Direct proof example

Prove that if nn is an even integer, then n2n^2 is also an even integer.

Let n=2kn = 2k for some integer kk. Then n2=(2k)2=4k2=2(2k2)n^2 = (2k)^2 = 4k^2 = 2(2k^2). Since 2k22k^2 is an integer, n2n^2 is even.

Contrapositive proof example

Prove that if n2n^2 is an odd integer, then nn is also an odd integer.

Assume nn is an even integer. Then n=2kn = 2k for some integer kk. Then n2=(2k)2=4k2=2(2k2)n^2 = (2k)^2 = 4k^2 = 2(2k^2). Since 2k22k^2 is an integer, n2n^2 is even. Therefore, if n2n^2 is odd, then nn is odd.

Contradiction proof example

Prove that 2\sqrt{2} is irrational.

Assume 2\sqrt{2} is rational. Then 2=ab\sqrt{2} = \frac{a}{b} for some integers aa and bb. We can assume that aa and bb are coprime. Then 2=a2b22 = \frac{a^2}{b^2}, so 2b2=a22b^2 = a^2. Since a2a^2 is even, aa is even. Then a=2ka = 2k for some integer kk. Then 2b2=(2k)2=4k22b^2 = (2k)^2 = 4k^2, so b2=2k2b^2 = 2k^2. Since b2b^2 is even, bb is even. But aa and bb are coprime, so this is a contradiction. Therefore, 2\sqrt{2} is irrational.

Cases proof example

Prove that there are no rational solutions to x3+x+1=0x^3 + x + 1 = 0.

Let pq\frac{p}{q} be rational solutions. Then we have p3q3+pq+1=0p3+pq2+q3=0\frac{p^3}{q^3} + \frac{p}{q} + 1 = 0 \rightarrow p^3+pq^2+q^3=0. Consider the following cases:

{p,qevenContradiction as not reduced formpeven,qoddeven+even+odd=odd0podd,qevenodd+even+even=odd0p,qoddodd+odd+odd=odd0\begin{cases} p,q \text{even} & \text{Contradiction as not reduced form} \\ p \text{even}, q \text{odd} & \text{even} + \text{even} + \text{odd} = \text{odd} \neq 0 \\ p \text{odd}, q \text{even} & \text{odd} + \text{even} + \text{even} = \text{odd} \neq 0 \\ p,q \text{odd} & \text{odd} + \text{odd} + \text{odd} = \text{odd} \neq 0 \\ \end{cases}

Since in all possible cases we get no rational solutions, proved.

On this page