Professional Documents
Culture Documents
Introduction To Proofs
Introduction To Proofs
Proofs are the heart of mathematics. If you are a math major, then
you must come to terms with proofs--you must be able to read,
understand and write them. What is the secret? What magic do you
need to know? The short answer is: there is no secret, no mystery,
no magic. All that is needed is some common sense and a basic
understanding of a few trusted and easy to understand techniques.
A well written proof will flow. That is, the reader should feel as
though they are being taken on a ride that takes them directly and
inevitably to the desired conclusion without any distractions about
irrelevant details. Each step should be clear or at least clearly
justified. A good proof is easy to follow.
When you are finished with a proof, apply the above simple test to
every sentence: is it clearly (a) an assumption or (b) a justified
conclusion? If the sentence fails the test, maybe it doesn't belong in
the proof.
s2 = 2.
s = p/q
where p and q are a pair of integers. Infact, by dividing out the
common multiple if neccessary, we may even assume p and q have
no common multiple (other than 1). If we now substitute this into
the first equation we obtain, after a little algebra, the equation
p2 = 2 q2 .
Direct Proofs
Let's start with an example.
b = a k1 and c = b k2.
Consequently,
c = b k2 = a k1 k2.
If P, Then Q
Most theorems (homework or test problems) that you want to
prove are either explicitly or implicity in the form "If P, Then Q".
In the previous example, "P" was "If a divides b and b divides c"
and "Q" was "a divides c". This is the standard form of a theorem
(though it can be disguised). A direct proof should be thought of as
a flow of implications beginning with "P" and ending with "Q".
P -> ... -> Q
Most proofs are (and should be) direct proofs. Always try direct
proof first, unless you have a good reason not to.
One-to-One Functions
A function f:X->Y is called one-to-one if for any pair a, b in X
such that f(a) = f(b) then a = b. Also, if f:X->Y and g:Y->Z are two
functions then the composition gf:X->Z is the function defined by
gf(a) = g(f(a)) for every a in X. Note that the composition gf is
only defined if the domain of f is contained in the range of g.
Theorem. If two one-to-one functions can be composed then their
composition is one-to-one.
Roots of Polynomials
A number r is called a root of the polynomial p(x) if p(r) = 0.
Exercises
Prove each of the following.
1. If a divides b and a divides c then a divides b + c. (Here a,
b, and c are positive natural numbers and the definition of
divisibility is given above.)
2. If a is an integer, divisible by 4, then a is the difference of
two perfect squares.
3. If a and b are real numbers, then a2 + b2 >= 2 a b.
4. The sum of two rational numbers is a rational number.
5. If two onto functions can be composed then their
composition is onto. (A function f:X->Y is called onto if
for every b in Y there is an element a in X such that f(a) =
b. )
6. If r1, r2, r3 are three distinct (no two the same) roots of the
polynomial p(x) = x3 + b x2 + c x+ d, then r1 r2 + r1 r3 + r2 r3
= c.
Proof by Contradiction
In a proof by contradiction we assume, along with the hypotheses,
the logical negation of the result we wish to prove, and then reach
some kind of contradiction. That is, if we want to prove "If P, Then
Q", we assume P and Not Q. The contradiction we arrive at could
be some conclusion contradicting one of our assumptions, or
something obviously untrue like 1 = 0. Read the proof of the
irrationality of the square root of 2 in the introduction for an
example.
Proof. Assume to the contrary that there are only finitely many
prime numbers, and all of them are listed as follows: p1, p2 ..., pn.
Consider the number q = p1p2... pn + 1. The number q is either
prime or composite. If we divided any of the listed primes pi into q,
there would result a remainder of 1 for each i = 1, 2, ..., n. Thus, q
cannot be composite. We conclude that q is a prime number, not
among the primes listed above, contradicting our assumption that
all primes are in the list p1, p2 ..., pn.
p3 + p q2 + q3 = 0
There are three cases to consider. (1) If p and q are both odd, then
the left hand side of the above equation is odd. But zero is not odd,
which leaves us with a contradiction. (2) If p is even and q is odd,
then the left hand side is odd, again a contradiction. (3) If p is odd
and q is even, we get the same contradiction. The fourth case--p
even and q even--is not posssible because we assumed that p/q is in
reduced form. This completes the proof.
Exercises
Use the method of Proof by Contradiction to prove each of the
following.
1. The cube root of 2 is irrational.
2. There are no positive integer solutions to the diophantine
equation x2 - y2 = 10.
3. There is no rational number solution to the equation x5 + x4
+ x3+x2+ 1 = 0.
4. If a is a rational number and b is an irrational number, then
a+b is an irrational number.
Proof by Contrapositive
Proof by contrapositive takes advantage of the logical equivalence
between "P implies Q" and "Not Q implies Not P". For example,
the assertion "If it is my car, then it is red" is equivalent to "If that
car is not red, then it is not mine". So, to prove "If P, Then Q" by
the method of contrapositive means to prove "If Not Q, Then Not
P".
Example: Parity
Here is a simple example that illustrates the method. The proof will
use the following definitions.
Definitions.
1. An integer x is called even (respectively odd) if there is
another integer k for which x = 2k (respectively 2k+1).
2. Two integers are said to have the same parity if they are
both odd or both even.
For the purpose of this example we will assume as proved that each
integer is either even or odd.
Theorem. If x and y are two integers for which x+y is even, then x
and y have the same parity.
The second idea is the remainder and modular arithmetic. For two
integers m and n, n mod(m) = r will be the remainder resulting
when we divide m into n. This means that there is an integer q such
that n = mq + r. For example, 127 mod(29) = 11 since 29 will go
into 127 4 times with a remainder of 11 (or, in other words, 127 =
(4)(29) + 11). Determining whether or not a positve integer is a
perfect square might be difficult. For example, is 82,642,834,671 a
perfect square? First we compute 82,642,834,671 mod(4) = 3.
Then use this theorem:
Exercises
Prove each of the following by the contrapositive method.
1. If x and y are two integers whose product is even, then at
least one of the two must be even.
2. If x and y are two integers whose product is odd, then both
must be odd.
3. If n is a positive integer such that n mod(3) = 2, then n is
not a perfect square.
4. If a and b a real numbers such that the product a b is an
irrational number, then either a or b must be an irration
number.
Example: Division
In this example we will use a very useful fact about integers, the so
called Division Algorithm: If n and m are integers, then there are
two other integers q and r, where 0 <= r < m, and such that n = qm
+ r. For example, if n = 103 and m = 15, then 103 = (6)(15) + 13.
(That is, if we divide15 into 103, we get a quotient of q = 6, with a
remainder of r = 13.)
Proof. Since this is an "If, and Only If" theorem, we must prove
two implications.
q
Sometimes you can prove an "If, and Only If" assertion without
explicitly dividng the proof into two parts. The next example
illustrates how this might be done.
q
Exercises
Prove each of the following.
1. If a is an integer, then a is not evenly divisible by 5 if, and
only if, a4 -1 is evenly divisble by 5.
2. For two integers a and b, a+b is odd if, and only if, exactly
one of the integers, a or b, is odd.
3. For two integers a and b, the product ab is even if and only
if at least one of the integers, a or b, is even.
4. A postive integer n is evenly divisible by 9 if, and only if,
the sum of the digits of n is divisble by 9.
5. A postive integer n is evenly divisible by 11 if, and only if,
the difference of the sums of the digits in the even and odd
positions in n is divisible by 11.
Mathematical Induction
Let's begin with an example.
Initial Step. We must verify that P(1) is True. P(1) asserts "1 =
1(2)/2", which is clearly true. So we are done with the initial step.
Since you have verified P(a), it follows from the inductive step that
P(a+1) is true, and hence, P(a+2) is true, and hence P(a+3) is true,
and so on. In this way the theorem has been proved.
Exercises
Prove each of the following by Mathematical Induction.
1. For all positive integers n, 12 + 22 + ... + n2 = (n)(n+1)
(2n+1)/6.
2. Define a sequence a0, a1, a2 by the recurrsive formula an+1 =
2 an - an2. Then, a closed form formula for an is an = 1 - (1 -
a0)2n for all n = 0, 1, 2, ....
Theorem. The binary operation gcd is associative, that is, for any
three positve integers a, b and c,
(2) Now we suppose d' divides a and gcd(b, c). Then, d' divides b
and c, so d' must divide gcd(a, b) too. But then by our assumption,
d>d'. And this is all we needed to prove.
Exercises
Prove each of the following.
1. The least common multiple of two positive integers a and
b, lcm(a, b), is the positive integer m that satisfies the two
conditions: (1) a and b evenly divide m and (2) if m' is
another positive integer for which a and b divide m', then m
< m'. The least common multiple is associative, i.e. for any
three positive integers, lcm(lcm(a, b), c) = lcm(a, lcm(b,
c)).
2. If a is an algebraic number and r is a rational number, then
the product ra is an algebraic number.
Constructive Versus Existential
Proofs
Constructive Proofs
How would you prove 299 + 1 is a composite number? You would
exhibit a factorization:
299 + 1 = (233)3 + 1 =(233 + 1)((233)2 - 233 + 1).
Proof. The square root of 10 100 is 10 50. After a little bit of trial and
error, we let x = 10 50 + 10 -51, which is clearly a rational number
bigger than the squre root of 10 100. To prove that x is less than the
square root of 10100+1, we compute
Existential Proofs
Sometimes it is possible to prove the existence of something
mathematical without actually constructing it. Why would you
want to do this? Well, it could be that you just cannot think of a
constructive proof, or that a constructive proof is very long and
tedious. In any case, existential proofs are another valuble
technique in proofs. Let's look at a familiar example from the
calculus.
Part 1. (Direct Existential Proof.) First we will prove p(x) has one
real root. We appeal to the Intermediate Value Theorem with a = 0
and b = 1: p(0) = - 1 < 0 and p(1) = 1 > 0. Since 0 (N = 0) is
between -1 (=p(0)) and 1 (=p(1)), we may conclude that there is a
real number c, between 0 and 1, for which p(c) = 0.
Exercises
Prove each of the following.
1. 425650925 - 1 is a composite number. (Constructive proof.)
2. There is a rational number that lies strictly between 19 100 -
1 and 19 100. (Constructive proof.)
3. sqrt(2) + sqrt(3) is an algebraic number. (See the section on
Unwinding Defintions (Getting Started) for the definition
of an algebraic number.) (Hint: First compute (sqrt(2) +
sqrt(3))2.) (Constructive proof.)
4. Suppose f(x) is a real valued differentiable function (of real
numbers) with f(1) = -1 and f(2) = -2, then there is a value
of x = x0, between 1 and -2 such that the y-intercept of the
tangent line to the curve at x = x0 is equal to f(t0) + t0.
(Existential proof--use the Mean Value Theorem).
Counter Examples
Counter examples play an important role in mathematics.
Whereas a complicated proof may be the only way to demonstrate
the validity of a particular theorem, a single counter example is all
that is need to refute the validity of a proposed theorem. For
example, numbers in the form 22n + 1, where n is a positive integer,
were once thought to be prime. These numbers are prime for n = 1,
2, 3 and 4. But when n = 5, we get
225 + 1 = 4294967297 = (641)(6700417)
q
A natural place for counter examples to occur is when the converse
of a known theorem comes into question. The converse of an
assertion in the form "If P, Then Q" is the assertion "If Q, Then P".
Exercises
1. State the converse of "If a and b are even integers then a+b
is an even integer". Show that the converse is not true by
producing a counter example.
2. State the converse of "If a, b and c are real numbers such
that a + b = c, then (a+b)2 = c2". Show that the converse is
not true by producing a counter example.
3. State the converse of "If a, b and c are integers such that a
divides b, then a divides the product bc." Show that the
converse is not true by producing a counter example.
4. State the converse of "If a and b are rational numbers, then
so is the product ab". Show that the converse is not true by
producing a counter example.
Example: Divisibility
Theorem. If n is a positive integer then n7 - n is divisible by 7.
Exercises
Prove each of the following using a case by case analysis.
q
So "well defined" means that the definition being made has no
internal inconsistencies and is free of contradictions. To better
understand this idea, let's look at an example where a definition
turns out not to be well defined.
Example:Functions Modulo m
In the previous two examples, we looked at the "numbers" modulo
m. In this system there are only m "numbers", represented by 0,
1, ..., m-1. It is traditional to call this set Zm. For example, Z4 has 4
elements, represented by 0, 1, 2, 3. Remember, all other integers
are just other names for these 4. For example, 13 = 1 mod(4) and -
13 = 3 mod(4).
Theorem. The function f:Z4 -> Z4, given by f(x) = 2x+1 is well
defined.
Exercises
Prove each of the following.
1. Multiplication is well defined in arithmetic modulo m. That
is, if a = b mod(m) and c = d mod(m), then (a c) = (b d)
mod(m).
2. The function f:Zm -> Zm given by f(x) = x2 + x is well
defined.
Proof. Let a1, a2, ..., aN be the numbers. For each ai, let ri be the
remainder that results from dividing ai by N - 1. (So ri = ai mod(N-
1) and ri can take on only the values 0, 1, ..., N-2.) There are N-1
possible values for each ri, but there are N ri's. Thus, by the pigeon
hole principle, there must be two of the ri's that are the same, rj = rk
for some pair j and k But then, the corresponding ai's have the same
remainder when divided by N-1, and so their difference aj - ak is
evenly divisble by N-1.
Example
Theorem. For any N positive integers, the sum of some of these
integers (perhaps one of the numbers itself) is divisible by N.
Exercises
Prove each of the following using the pigeon hole principle.
1. If a city has 10,000 different telephone lines numbered by
4-digit numbers and more than half of the telephone lines
are in the downtown, then there are two telephone numbers
in the downtown whose sum is again the number of a
downtown telephone line.
2. If there are 6 people at a party, then either 3 of them knew
each other before the party or 3 of them were complete
strangers before the party.