Yesterday we defined
along with a binary operation which works by multiplying and reducing coefficients . So, is this a group? Well, let’s check:
It’s a bit tedious to prove formally, but the binary operation is in fact associative. Intuitively this follows from the fact that we could choose to do the reductions immediately, or delay them until after completing several multiplications—and we know that normal multiplication is indeed associative.
is the identity for the operation.
Do all elements in have inverses? Well… no! One simple counterexample is : there cannot possibly be any element such that . But is not the only one. Depending on the choice of , there can be many elements of without inverses. For example, when , you can check that and do not have inverses either (though the other elements do).
So is a monoid (it has an associative binary operation with an identity) but it is not a group, because not every element has an inverse. Argh! But we really need a group, so that we have something to which we can apply all those nifty facts we proved! Well, fear not, it turns out that there is a simple way to turn any monoid into a group. Do you have an idea? Tomorrow I’ll explain how, and prove that it does in fact result in a valid group.
Pingback: MaBloWriMo 20: the group X star | The Math Less Traveled