Since you are trying to prove that something is not the case, you use proof by contradiction: you assume that the number is rational ( or algebraic) and show that this leads to two contradictory conclusions.
The classic example is the proof that [symbol]Ö[/symbol]2 is irrational. Suppose that it not. That means we can write it as a fraction, say
[symbol]Ö[/symbol]2 = m/n
Now it may be that m/n is not in its lowest terms, but if this is the case then we cancel it down until it is. Then
[symbol]Ö[/symbol]2 = a/b
and there is no number greater than 1 which goes into both a and b ( or we could cancel it down further).
Now square both sides of the equation and multiply up by b[sup]2[/sup]. We now have
a[sup]2[/sup] = 2b[sup]2[/sup] (*)
The number 2b[sup]2[/sup] is clearly even. Therefore a[sup]2[/sup] is even. What does this tell us about a? Well, the square of any odd number is odd [(2m+1)[sup]2[/sup] = 4m[sup]2[/sup] + 4m + 1 = 2(2m[sup]2[/sup] + 2m) +1]. Since the square of a is even, it follows that a must be even as well ( if it were odd, its square would be as well).
By definition of even, this means we can write a = 2c, say. Substituting this into (*) we have
2b[sup]2[/sup] = a[sup]2[/sup] = (2c)[sup]2[/sup] = 4c[sup]2[/sup]
Cancelling a factor of 2,
b[sup]2[/sup] = 2c[sup]2[/sup]
This equation shows that b[sup]2[/sup] is even. By exactly the same reasoning as above, it follows that b is even. But now we are done, for a/b was in its lowest terms and we have shown that the numerator and denominator both have a factor of 2. These are the two contadictory conclusions mentioned above.
Note that it would be quite wrong to argue “Well, why not just cancel the factor of 2, and then the fraction might be in its lowest terms.” This would be wrong on two counts:
(i) The above argument shows that after we had cancelled the factor of 2 from the fraction, there would still be a factor of 2 remaining.
(ii) More importantly, the precise nature of the contradiction is unimportant. What matters is that the assumption that [symbol]Ö[/symbol]2 is rational leads inevitably to a contradiction. Therefore, that assumption is false.
Since being transcendental is a much stronger property than being irrational, proofs are naturally more difficult. We can spot some common themes, though.
We assume that the number in question is algebraic, i.e. it is the root of a polynomial equation. By the exercise of great ingenuity, we deduce the existence of a number m having three properties:
(a) m is an integer
(b) m > 0
© m < 1
These three statements clearly produce a contradiction.
Using various forms of this strategy we can prove
e is transcendental
[symbol]p[/symbol] is irrational
[symbol]p[/symbol] is transcendental
The Gelfand-Schneider Theorem: Suppos that [symbol]a[/symbol] and [symbol]b[/symbol] are algebraic, that [symbol]a[/symbol] is not 0 or 1, and that [symbol]b[/symbol] is irrational. Then [symbol]a[/symbol][sup][symbol]b[/symbol][/sup] is transcendental.