Let $G$ be a finite group, and $H$,$K$ be subgroups. Then we can form the set $$HK = \{hk: h \in H, k \in K\}$$
It is well known that $HK$ is a subgroup of $G$ if and only if $HK=KH$. If $H \cap K = \{e\}$, then we clearly have $|HK| = |H||K|$ (indeed, the group multiplication $H \times K \to HK$ is a bijection).
On the other extreme, if $H \subset K$ then $|HK| = |K|$. In general we have the formula
$$|HK| = \frac{|H||K|}{|H \cap K|}$$
which quantifies the idea that we "$HK$ collapses in proportion to how many elements $H,K$ share". I'm trying to get a bit more intuition for this fact.
I've seen an argument by which we establish a bijection between the sets of cosets $HK/K$ and $H/(H\cap K)$, but it wasn't "manual" enough for me (that is to say, I'm willing to believe that it's an enlightening proof, to someone who is more savvy with cosets).
One idea for an argument I had was counting: if we seek to prove $|HK||H \cap K| = |H||K|$ then it's attractive to try to show that every distinct element of $HK$ obtained by writing $g = hk$ is multiply counted $|H \cap K|$ times. Indeed, suppose that $h_{1}k_{1} = h_{2}k_{2}$. Then we obtain the element $h_{1}^{-1}h_{2} = k_{1}k_{2}^{-1} \in H \cap K$. Then I get a bit stuck, because I want to show the duplicate elements biject with $H \cap K$ but I can't tell how. Of course, it might not be possible, but my intuition says maybe.
Any of the following would constitute a helpful answer (and be greatly appreciated!):
- A bit of exposition into why the coset-based argument is an intuitive one to make (especially without knowing the answer in advance)
- Some help finishing off the argument I've tried to start
- A oonvincing reason the argument I've started is hopeless