Formal Mathematical Proof
Theorem: Prove that $\sqrt{2}$ is an irrational number.
Proof (by Reductio ad Absurdum):
Assume to the contrary that $\sqrt{2}$ is a rational number.
Therefore, there exist two positive integers $a$ and $b$ such that:
$$\sqrt{2} = \frac{a}{b}, \quad \text{where } b \neq 0 \text{ and } \gcd(a, b) = 1 \text{ (i.e., } a \text{ and } b \text{ are coprime).}$$
Squaring both sides of the equation:
$$2 = \frac{a^2}{b^2} \implies a^2 = 2b^2 \quad \text{--- (Equation 1)}$$
Since $2b^2$ is divisible by $2$, it follows that $a^2$ is divisible by $2$.
Lemma: If a prime number $p$ divides $n^2$, then $p$ divides $n$. Hence, since $2$ divides $a^2$, $2$ divides $a$.
Thus, we can write $a = 2k$ for some integer $k$.
Substitute $a = 2k$ into Equation 1:
$$(2k)^2 = 2b^2 \implies 4k^2 = 2b^2 \implies b^2 = 2k^2$$
This implies that $b^2$ is divisible by $2$, and consequently, by the same lemma, $2$ divides $b$.
Contradiction: We have established that $2$ is a common factor of both $a$ and $b$. But this directly contradicts our initial assumption that $\gcd(a, b) = 1$ (that $a$ and $b$ are coprime).
This contradiction arose solely because of our false assumption that $\sqrt{2}$ is rational.
$$\therefore \mathbf{\sqrt{2} \text{ is strictly an irrational number.}} \quad \blacksquare$$