Show that the $m \times n$ matrix $A$ with integer entries is an injective linear map from $\mathbb{R}^n$ to $\mathbb{R}^m$ iff it is injective as a linear map from $\mathbb{Z}^n$ to $\mathbb{Z}^m$.
One direction is quite obvious, it is injective on the reals, the kernel is empty and intersecting that with $\mathbb{Z}^n$ is still empty so the map restricted to the lattice has trivial kernel and is therefore injective.
In the other direction I can't seem to make progress. I have been trying to think about it in two different ways. The first, consider the columns of the matrix. For it to be injective as a map between lattices, these columns need to be linearly independent, i.e. they satisfy no non trivial relation ($\sum r_iv_i =0$ implies $r_i = 0$). However, the key is that they don't satisfy an non trivial relation over the integers, but this may not be the case over the reals; there may be some non-zero real numbers $r'_i$ that cause $\sum r_iv_i =0$ and thus the map is not injective as a map between real spaces. This is where we need to use the fact that entries in the column vectors are also integers. Clearly injectivity over integers implies it for the rationals because if we could find special rationals $r'_i$ that cause $\sum r_iv_i =0$ we could just clear denominators and derive a contradiction.
The other way I've been trying to think about it is by proving the converse. Suppose the map wasn't injective we have to show that it can't be both composed of integer entries and injective as map between lattices. For it to be injective as a lattice map though would mean that the none of standard basis elements of $\mathbb{R}$ are in the kernel, and that no integer (or rational and just clear denominators) combination of them are in the kernel either, thus for something to be in the kernel it has to be linear combination of the basis vectors with at least one coefficient irrational. I think this proves it, but I feel unsatisfied, so I am not sure if something is wrong.