Scribd
Upload
22 views17 pages

Proofs

The document discusses different types of proofs in mathematics including direct proofs, proofs by contradiction, and proofs by induction. It provides examples of each type of proof, such as a direct proof that the square of an odd integer is odd, a proof by contradiction that there are infinitely many prime numbers, and an inductive proof about tiling a defective chessboard with triominos. The key aspects, styles, and methods of different proof techniques are explained at a high level.

Uploaded by

Madhava Sangamagrama
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
22 views17 pages

Proofs

The document discusses different types of proofs in mathematics including direct proofs, proofs by contradiction, and proofs by induction. It provides examples of each type of proof, such as a direct proof that the square of an odd integer is odd, a proof by contradiction that there are infinitely many prime numbers, and an inductive proof about tiling a defective chessboard with triominos. The key aspects, styles, and methods of different proof techniques are explained at a high level.

Uploaded by

Madhava Sangamagrama
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 17

Proofs

Andreas Klappenecker
What is a Proof?

A proof is a sequence of statements, each of


which is either assumed, or follows follows from
preceding statements by a rule of inference.

We already learned many rules of inference (and


essentially all of them are common sense rules).
Use Plain English!

In predicate logic, we already learned how to do


formal proofs. In mathematical arguments, we
essentially use the same method. However,
formal proofs are not very appealing to humans
(the intended readership of our proofs), so we
should try to formulate our proofs in plain
English!
Example

Instead of writing an implication in the form


p -> q
we will write
If p, then q.
For instance:
If 2x=5, then x=5/2.
Styles of Proofs

We have essentially three basic styles of proof:

- Direct proof

- Proof by contradiction

- Proof by induction

In addition, we have some variations of these basic styles of


proofs.
Direct Proof (1)

Definition: An integer n is called even if and only if there exists


an integer k such that n=2k.

An integer n is called odd if and only if there exists an integer


k such that n=2k+1.

Theorem: If n is an odd integer, then n2 is an odd integer.

How can we proof it?


Direct Proof (2)

Theorem: If n is an odd integer, then n2 is an odd integer.

Proof: Since n is an odd integer, there exists an integer k such


that n=2k+1.

Therefore, n2 = (2k+1)2 = 4k2+4k+1 = 2(2k2+2k)+1.

Thus, by definition of an odd integer, we can conclude that n2


is an odd integer (as it is one more than twice the integer
2k2+2k).
Contrapositive

The contrapositive of an implication p -> q is given


by ¬q -> ¬p. We have (p -> q) ≡ (¬q -> ¬p).

p q p->q ¬q ¬p ¬q-> ¬p
F F T T T T
F T T F T T
T F F T F F
T T T F F T
Proof by Contraposition

In a proof of contraposition of p->q, one assumes


¬q and shows that ¬p must follow.

This is of course a variation on the direct proof.


Proof by Contraposition

Theorem: For all integers n, if n2 is even then n is


even.

We prove the contrapositive.


Suppose that n is not even, that is, n is odd. Then n = 2k
+ 1 for some integer k. So n2 = (2k +1)2 = 4k2 + 4k + 1 = 2
(2k2 + 2k) + 1 which is odd.Thus we have proved: if n is
not even, then n2 is not even.
So by the contrapositive, we can conclude that if n2 is
even, then n is even.
Prime Numbers

A prime number is a natural number p>=2 whose


only positive divisors are 1 and p.
A natural number m >= 2 that is not prime is
called composite.

Examples of prime numbers: 2,3,5,7,11,...


Fundamental Theorem of Arithmetic

Theorem: Every natural number n >=2 can be


factored into a product of primes
n = p1p2 ... pn
in exactly one way.
Proof by Contradiction

Theorem. There are infinitely many prime numbers.


Proof. Seeking a contradiction, suppose that there are
only finitely many prime numbers, say p1 < p2< ... < pn.
Consider the number q = p1p2... pn + 1.
The number q is not divisible by p1, p2 ..., pn.
Thus, the number q is either prime, or divisible by a
prime larger than pn. In either case, there is a prime
greater than pn which proves our theorem.
Proof by Induction

Suppose we wish to prove a certain assertion concerning


positive integers.
Let A(n) be the assertion concerning the integer n.
To prove it for all natural numbers n>=1, we can do the
following:
Basis: Prove that the assertion A(1) is true.

Inductive Step: For all n, show that A(n) implies A(n+1).


We can conclude that A(n) is true for all n>=1.
A Tiling Problem

We want to consider tiling problems.

Consider a chessboard of side length 2n x 2n.

We call the chessboard defective if and only if it has


precisely one square missing.

We want to cover the nondefective part with triominos,


where turning the triominos is allowed.
Triomino Tiling

Theorem: Any defective 2n x 2n chessboard can be


covered by triominos.
Proof by Mathematical Induction

Basis : n = 1

Induction step :
2 n+1 2n 2n

2n

2 n+1

2n

You might also like