Many results can be established directly simply by starting from the given assumptions and proceeding through a succession of inferences to deduce the desired conclusion. Workshop exercises and exam questions which invite such a proof will often begin with words like ‘‘verify’’ or ‘‘check’’.
To establish an implication of the form ‘‘’’ (which may alternatively be phrased ‘‘ implies ’’, or ‘‘if , then ’’) by direct proof, one should assume to be true and then deduce that is true.
Verify that satisfies .
Proof. Let . Then we have , and so
from which we conclude that
as required.
Check that is a solution to the differential equation
(3.2.1) |
Proof. Let . Then we have
so that
as required.
Let and be integers. If is even, then so is the product .
Proof. Every even number is a multiple of , and so we can write for some . Consequently we have , which is even because is an integer.
Denote by the set of even integers. We can then rewrite the statement of Example 3.2.4 as
all three statements mean the same.
In general, statements which begin with ‘‘for all’’ can be rephrased in the form ‘‘’’ for suitable statements and , because if is a set and is any statement involving a variable , then the statements ‘‘’’ and ‘‘’’ are logically equivalent.
For every odd integer , the integer is odd.
Proof. Denote by the set of odd integers. We then observe that this statement can be rewritten as
To prove this, let . Then we can write for some , and consequently we have
so is odd because is even.
Sometimes a proof may involve separate consideration of different cases, which between them cover all possibilities; this allows us to make extra assumptions within each of the cases. When there are only a few possibilities, such as in the context of truth tables or parity models, this is a reasonable way to proceed. When there are many cases to consider, proof by consideration of all cases can be tedious and unilluminating.
For every integer , the integer is even.
Proof. Let , and observe that . If is even, then so is the product by Example 3.2.4. Otherwise is odd; then is even, and once again the product is even by Example 3.2.4. Thus for every , is even.
In the proof of Example 3.2.7, the two ‘‘strands’’ only came back together at the very end. Consequently the whole statement ‘‘’’ (where stands for the statement ‘‘’’, while represents ‘‘ is even’’) was stated there to clarify matters. When carrying out proof by consideration of cases, it is helpful to the reader to know when all cases have been established and the proof is complete.
The statement in an implication of the form ‘‘’’ may involve ‘‘’’. In such cases the proof usually involves constructing the required element somehow.
For every integer , there exists an integer such that .
Proof. We observe that this statement can be rewritten as
To prove this, let , and define ; then , and as required.
So far we have considered proofs of statements of the form ‘‘’’. If we wish to prove a bi-implication, that is, a statement of the form ‘‘’’, then we must prove both the forward implication ‘‘’’ and its converse ‘‘’’. These two parts of the proof may involve quite different arguments.
Let , , and be real numbers, and suppose that . Then and are solutions to the quadratic equation if and only if and .
Proof. ‘‘’’. Suppose that and are solutions to the equation . Since they are distinct, the standard formula for solving a quadratic equation implies that
(or the other way round, which would not affect our proof), and therefore we have
and
as required.
‘‘’’. Conversely, suppose that and . Then , and hence
Rearranging this equation, we see that , so that is a solution to the equation , as desired. In a similar way we can verify that is a solution to this equation.