Why does proof by contradiction not work on Rational numbers but only on Irrational numbers

irrational-numberslogicproof-explanation

The most common way to prove the irrationality of a number is to do it by contradiction.
However, in this proof the contradiction arises from having two numbers, say p\q that are assumed to not have any common factors but are later proved to share the number under the radical as a factor. But for instance if the question so arises:

Is √4 rational or not? Answer with a proof.

At first glance, it is obviously rational, but assuming I do not know that √4 can be simplified to 2, what would stop me from arriving at irrationality as my conclusion?

This question seems quite trivial and probably stupid. Is this meant to be by definition or am I missing something fundamental to the aforementioned fallacy?

Best Answer

The proof of the irrationality of $\sqrt{a}$, where $a$ isn't a perfect square, goes by contradiction. Assume it is rational, i.e.:

$\begin{equation*} \sqrt{a} = \dfrac{p}{q} \end{equation*}$

where $\gcd(p, q) = 1$ (the fraction is in lowest terms) and $q \ne 1$ ($a$ is not a square). Then:

$\begin{align*} a &= \frac{p^2}{q^2} \\ a q^2 &= p^2 \end{align*}$

Now $p^2$ divides the right hand side, so it must divide the left hand side. But $p$ has no factors in common with $q$, so $\gcd(p^2, q^2) = 1$ also; so it divides $a$. That means $a = b p^2$:

$\begin{align*} b p^2 q^2 &= p^2 \\ b q^2 &= 1 \end{align*}$

This is impossible, $q \ne 1$.