Definition

A direct proof of a conditional statement is constructed by

  • Assume is true
  • Use rules of inferences, axioms, and logical (basic) equivalences to show that must follow

Note: In some cases, you may want to use direct proof by contraposition

Example 1: Give a direct proof of the theorem “If is an odd integer, then is odd.”

: An integer is said to be even if there exists an integer such that

: An integer is said to be odd if there exists an integer such that

For direct proof, we will assume the hypothesis is true.

Proof:

Assume is odd, then we have , for some integer (this is essentially a universal instantiation)

Squaring , , we get where is an integer

\begin{flalign} n^2 \\ \equiv\, <\mathrm{substitution}> \\ (2k+1)^2 \\ \equiv\, <\mathrm{algebra}> \\ 4k^2+4k+1 \\ \equiv\, <\mathrm{algebra}> \\ 2(2k^2+2k)+1 \\ \equiv\, <\mathrm{substitution}> \\ 2r+1 \end{flalign}

What if we skip the last substitution? We can do this instead:

Since is an integer, is also an integer. can be written as by the definition of odd integers, is odd.

Example 2: Give a direct proof of the theorem “The sum of two real rational numbers is rational”

Remember the definition of a rational number:

Rational Number

: A real number is rational if there exists integers and , where ,

Link to original

Proof:

Arbitrarily pick 2 rational numbers. and be two real rational numbers. there exist integers ( and such that and ).

Now,

Let = and . Since are integers & and , and are integers and . by definition of rational numbers, is rational.