Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $\begin{bmatrix} a & b \\ c & d\end{bmatrix} \in \mathrm{SL}_2(\mathbb{Z})$. Let $S$ be the set $(\mathbb{Z} \times \mathbb{Z}) \setminus \{(0,0)\}$. Show that the map $\varphi: S \rightarrow S$ given by $\varphi((m,n)) = (am + cn, bm + dn)$ is a bijection. Hint: try to construct the inverse map.

I need to show that $\varphi$ is injective and surjective.

Injectivity: I tried to show this part by showing that if $(m_1,n_1) \neq (m_2, n_2)$, then $\varphi(m_1,n_1) \neq \varphi(m_2, n_2)$. I think this is one way to start the proof.

Surjectivity: I am not sure where to start, but I believe the hint works for this problem.

share|cite|improve this question
Why not use the hint? – vadim123 May 3 '14 at 1:51

Since $\begin{bmatrix} a & b \\ c & d\end{bmatrix} \in \mathrm{SL}_2(\mathbb{Z})$ , also $\begin{bmatrix} a & c \\ b & d\end{bmatrix} \in \mathrm{SL}_2(\mathbb{Z})$. Now the inverse of this matrix is given by $\begin{bmatrix} d & -c \\ -b & a\end{bmatrix} \in \mathrm{SL}_2(\mathbb{Z})$. Note in all this, I used the fact that we have $ad-bc=1$. I think you can work your way now.

share|cite|improve this answer


$$\phi(m,n)=\begin{bmatrix}m & n\end{bmatrix}\begin{bmatrix}a&b\\c&d\end{bmatrix}$$

$$\phi^{-1}(m,n)=\begin{bmatrix}m & n\end{bmatrix}\begin{bmatrix}d&-c\\-b&a\end{bmatrix}$$

share|cite|improve this answer
I made that mistake too, your $ \phi (m,n) $ is wrong. – The very fluffy Panda May 3 '14 at 12:05
Already figured out. – NasuSama May 3 '14 at 14:46
@PandaBear Thank you for pointing out this. – gaoxinge May 4 '14 at 2:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.