CSC510 Lecture Slides

05/10/2015

Proof
Methods of Proof

Muthukkaruppan Annamalai

A proof is an argument that establishes the truth (or the

validity) of a proposition

A simple argument consists of hypotheses and a

conclusion, is of the form F1, F2, , Fn G, where Fi
and G are logical propositions

In constructing a proof, ensure the arguments used are

valid (c.f. factual definitions, axioms and inference rules)

The process of deducing a conclusion from a set of

hypotheses is deductive reasoning

mk@tmsk.uitm.edu.my

5/9/2015

Indirect Proof (by Contrapositive)

PQ

P Q Q P; P P = false (contradiction)

We only need to consider the case P is true because

when is false, the argument is true (by default)
Assume the hypothesis P is true,
and together with other axioms
and inference rules, we deduce
Q is true

PQ

0
0
1
1

0
1
0
1

1
1
0
1

Assume the hypothesis P is true,

but conclusion Q is false

PQ

0
0
1
1

0
1
0
1

1
1
0
1

Using the hypothesis P and Q, and

together with other axioms and
inference rules, we derive a contradiction

Hence P is true; so the proposition is correct

Therefore P exist; so the proposition is correct

e.g. (mathematics) Prove that

e.g. (mathematics) Prove that

1.
2.
5/9/2015

mk

Direct Proof

mk

For all real numbers x, if x is even, then x2 is also even

For all integers m, n, if m and n are odd, then m x n is odd
mk

1.

For all real numbers x, y, if x + y > 2, then either x > 1 or y > 1

2.

For all integers m, n, if m is odd and n is even, then m + n is

odd

5/9/2015

mk

CSC510 Lecture Slides

05/10/2015

Proving Universally Quantified

Logical Proposition

Proof by Cases
P Q, where P = P1 P2 Pn

If the hypothesis naturally breaks down into parts

(P1 P2 Pn), we prove P1 Q, P2 Q, , Pn Q

Hence P (the whole of parts) is true; so the proposition is

correct

e.g. (mathematics) Prove that

1. For all real numbers x, y, | x + y | | x | + | y |
2.

5/9/2015

To prove X p(X) is true, we exhaustively show

that for every X in the DoD, p(X) is true, i.e., it is
satisfiable by any value for X in the DoD

To prove X p(X) is false, we provide a

counter-example to show that there exist a value
for X in the DoD that makes p(X) false

For all real numbers x, y, max(x, y) + min(x, y) = x + y

mk

1.

Proof that X (integer(X) greaterThan(square(X), 0)) is false

2.

Proof that all prime numbers are odd

5/9/2015

Proving Existentially Quantified

Logical Proposition

To prove X p(X) is false, we show that the

proposition is unsatisfiable, i.e., every X in the
DoD makes p(X) false
1.

Proof that X (bird(X) canFly(X)) is true

Let x and y be prime numbers with x < y. Prove that there is a
prime number z satisfying x < z < y

3.

Let x and y be non-zero integers. Prove that there is a nonzero integer z satisfying x2 + y2

5/9/2015

mk

mk

Exercise

To prove X p(X) is true, we provide an

example to show that the proposition is
satisfiable in the DoD, i.e., there is a value for X
in the DoD that makes p(X) true

2.

mk

1.

For all real numbers d, d1, d2, x, if d = min (d1, d2) and
x < d, then x < d1 and x < d2

2.

Prove that for all integers m, n, if m and n are even,

then m + n is even

3.

Prove that the following argument is valid:

(P Q) R; (P R); (Q R) / Q (P R)

5/9/2015

mk