« ICFP roundup » The network reliability problem

A strange representation of Z6

Posted on November 15, 2015
Tagged , , ,

On my other blog I am writing about a proof of the Lucas-Lehmer test, and today in the course of working up some examples I stumbled across this little gem.

Let MM be a monoid, and let MM^* denote the subset of elements of MM which actually have an inverse. Then it is not hard to show that MM^* is a group: the identity is its own inverse and hence is in MM^*; it is closed under the monoid operation since if aa and bb have inverses then so does abab (namely, b1a1b^{-1}a^{-1}); and clearly the inverse of every element in MM^* is also in MM^*, because being an inverse also implies having one.

Now let M={a+b30a,b<3}M = \{a + b\sqrt{3} \mid 0 \leq a,b < 3\}, where the operation is multiplication, but the coefficients aa and bb are reduced modulo 3. For example, (2+3)(2+23)=(4+6)+(4+2)3=1+03(2 + \sqrt 3)(2 + 2 \sqrt 3) = (4 + 6) + (4 + 2) \sqrt 3 = 1 + 0 \sqrt 3. This does turn out to be associative, and is clearly commutative; and 1=1+031 = 1 + 0\sqrt 3 is the identity. I wrote a little program to see which elements have inverses, and it turns out that the three elements with a=0a = 0 do not, but the other six do. So this is an Abelian group of order 6; but there’s only one such group, namely, the cyclic group Z6\mathbb{Z}_6. And, sure enough, MM^* turns out to be generated by 2+32 + \sqrt 3 and 2+232 + 2 \sqrt 3.