I would like critiques on correctness, conciseness, and clarity. Thanks!
Proposition: There is no rational number whose square is 12
Proof: Suppose there were such a number, $a = \in \mathbb{Q}$ s.t. $a^2 = 12$.
This implies that $\exists$ $m, n \in \mathbb{Z}$ s.t. $\frac{m^2}{n^2} = 12.$ Assume without loss of generality that $m,~ n$ have no factors in common.
$\Rightarrow m^2 = 12n^2$.
This implies that $m^2$ is even, and therefore that $m$ is even; it can thus be written $2k = m$ for some $k \in \mathbb{Z}$.
Thus $m^2 = 12n^2 $
$\Rightarrow 4k^2 = 12n^2 $
$\Rightarrow \frac{k^2}{3} = n^2$
Because $n^2$ is an integer, it is clear that $3$ divides $k^2$ which imples that $k$ has $3$ or $\frac{k}{n}$ has a factor (because $\frac{k^2}{n^2}= 3$)
Suppose that the former is true, and $3$ is a factor of $k$. Then $k = 3j$ for some integer j, which implies that $(3j)^2 = 3n^2$
$\Rightarrow 9j^2 = 3n^2 $
$\Rightarrow n^2 = 3j^2 $
$\Rightarrow n^2 = \frac{k^2}{n^2}j^2$
$\Rightarrow k = \frac{n^2}{j}$ but this implies that $j$ divides $n^2$, but $j$ divides $m$, and by initial assumption $n$ and $m$ have no factors in common, so this is a contradiction.
Suppose now that $\frac{k}{n}$ is a factor of k. Then $k = \frac{k}{n}j$ for some integer $j$. Then $(\frac{k}{n}j)^2 = 3n^2$ which implies that $3j^2 = 3n^2 \Rightarrow j^2 = n^2 \Rightarrow j = n$. But this means that $n$ divides $m$, which again is a contradiction. Thus any rational representation of the number whose square equals $12$ leads to a contradiction and this number must therefore have no rational representation.
Proof. Assume $\sqrt{12} \in \mathbb{Q}$ is rational, then it can be written as $\sqrt{12}=\cfrac{m}{n}$ with $m,n \in \mathbb{Z}$ coprime.
Squaring the equality gives $m^2 = 12 n^2 = 3 \cdot 4 \cdot n^2\,$. Therefore $3 \mid m^2 = m \cdot m$ and, since $3$ is a prime, it follows by Euclid's Lemma that $3 \mid m\,$.
Then $m = 3k$ for some $k \in \mathbb{Z}$ and substituting back gives $9 k^2 = 12 n^2 \iff 3 k^2 = 4 n^2\,$. Therefore $3 \mid 4 n^2$ and, since $3 \not \mid 4$ it follows that $3 \mid n^2$ then, again by Euclid's Lemma, $3 \mid n\,$.
But $3 \mid m$ and $3 \mid n$ contradicts the assumption that $m,n$ are coprime, so the premise that $\sqrt{12} \in \mathbb{Q}$ must be false, therefore $\sqrt{12}$ is irrational.
Critique of the posted proof.
So far so good.
The fact that $2 \mid m^2 \implies 2 \mid m$ may sound obvious, but still needs some justification. You could argue by contradiction, or use Euclid's Lemma.
Correct. As an observation, $k^2 = 3 n^2$ just eliminated the perfect square factor of $4$ and reduced the problem to proving that $\sqrt{3}$ is irrational.
You should generally avoid fractions where they are not necessary. The previous line gave $k^2 = 3 n^2\,$, which directly implies that $3 \mid k^2\,$.
This makes no sense, and it is in fact not needed to complete the proof.
The proof is complete right here at this point, if you just note that the last equality implies that $3 \mid n^2\,$, and therefore $3 \mid n$ which contradicts the assumption that $m,n$ are coprime.