Given the matrices with coefficients in $\mathbb Z_5$, I am asked to consider: $G= \left\{\begin{pmatrix} a & 0 \\ 0 &d \end{pmatrix} \mid ad\neq 0 \bmod 5 \right\}$ and: $ H= \left\langle \begin{pmatrix} 1 & 0 \\ 0 &-1 \end{pmatrix}, \begin{pmatrix} -1 & 0 \\ 0 &1 \end{pmatrix}\right \rangle$
And find matrices $A_1, A_2, A_3, A_4$ in $G$, such that: $$ G/H= \{A_1H, A_2 H, A_3 H, A_4 H \} $$
I know that a standard coset is definitely the set $H$ itself, so a good idea would be to consider: $A_k=kI$ for $k=1,2,3,4$ How can I efficiently check that this works? (or not) I mean, I can compute the action of these matrices on the 4 elements of $H$ and show it constructs all 16 elements each in their own little 4-sized coset, but is there a faster way?
Edit: This partitions does not seem to work:
$$H= \begin{pmatrix} 1 & 0 \\ 0 &-1 \end{pmatrix} ,\begin{pmatrix} -1 & 0 \\ 0 &1 \end{pmatrix} , \begin{pmatrix} -1 & 0 \\ 0 &-1 \end{pmatrix} , \begin{pmatrix} 1 & 0 \\ 0 &1 \end{pmatrix} $$ We will now compute all these matrices modulo 5 and check whether or not we partition all matrices into their own coset. We should get 4 disjoint sets that represent the equivalence classes of $G/H$. Notice that matrix multiplication by a diagonal matrix of the form $\lambda I$ just scales all the entries by $\lambda$. $H= \begin{pmatrix} 1 & 0 \\ 0 &4 \end{pmatrix} ,\begin{pmatrix} 4 & 0 \\ 0 &1 \end{pmatrix} , \begin{pmatrix} 4 & 0 \\ 0 &4 \end{pmatrix} , \begin{pmatrix} 1 & 0 \\ 0 &1 \end{pmatrix} $ $ 2H= \begin{pmatrix} 2 & 0 \\ 0 &8 \end{pmatrix} ,\begin{pmatrix} 8 & 0 \\ 0 &2 \end{pmatrix} , \begin{pmatrix} 8 & 0 \\ 0 &8 \end{pmatrix} , \begin{pmatrix} 2 & 0 \\ 0 &2 \end{pmatrix} \equiv \begin{pmatrix} 2 & 0 \\ 0 &3 \end{pmatrix} ,\begin{pmatrix} 3 & 0 \\ 0 &2 \end{pmatrix} , \begin{pmatrix} 3 & 0 \\ 0 &3 \end{pmatrix} , \begin{pmatrix} 2 & 0 \\ 0 &2 \end{pmatrix} \bmod 5 $ $3H= \begin{pmatrix} 3 & 0 \\ 0 & 12 \end{pmatrix} ,\begin{pmatrix} 12 & 0 \\ 0 &3 \end{pmatrix} , \begin{pmatrix} 12 & 0 \\ 0 &12 \end{pmatrix} , \begin{pmatrix} 3 & 0 \\ 0 &3 \end{pmatrix} \equiv \begin{pmatrix} 3 & 0 \\ 0 &2 \end{pmatrix} ,\begin{pmatrix} 3 & 0 \\ 0 &2 \end{pmatrix} , \begin{pmatrix} 2 & 0 \\ 0 &2 \end{pmatrix} , \begin{pmatrix} 3 & 0 \\ 0 &3 \end{pmatrix} \bmod 5 $ $4H= \begin{pmatrix} 4 & 0 \\ 0 & 16 \end{pmatrix} ,\begin{pmatrix} 16 & 0 \\ 0 &4 \end{pmatrix} , \begin{pmatrix} 16 & 0 \\ 0 &16 \end{pmatrix} , \begin{pmatrix} 4 & 0 \\ 0 &4 \end{pmatrix} \equiv \begin{pmatrix} 4 & 0 \\ 0 &1 \end{pmatrix} ,\begin{pmatrix} 1 & 0 \\ 0 &4 \end{pmatrix} , \begin{pmatrix} 1 & 0 \\ 0 &1 \end{pmatrix} , \begin{pmatrix} 4 & 0 \\ 0 &4 \end{pmatrix} \bmod 5 $
So close! but it does not work =(
Actually, garnering from your answer, the algorithm for this specific problem is quite simple. Let $H$ be a subgroup of $G$, then it is known for two cosets $aH$, $bH$ it is either $aH = bH$ or $aH \cap bH = \emptyset$.
So you start by looking at what elements $G$ has. Then $H$ is your first coset. Take any element $A_1 \in G - H$. Then $A_1H$ is your next coset. Take any $A_2 \in G - (H \cup A_1H)$ and then $A_2H$ is your next coset. Continue until $G$ is completely partitioned.
I suggest you try out $A_3 = \begin{pmatrix} 1 & 0 \\ 0 & 2 \end{pmatrix}$ and $A_4 = \begin{pmatrix} 2 & 0 \\ 0 &1 \end{pmatrix}$.