Testing whether a binary structure is a group

Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Consider the binary structure given by multiplication mod 20 on {4, 8, 12, 16}.
Is this a group? If not, why not?

Homework Equations

The Attempt at a Solution


I started by constructing a Cayley table, and working things out. It turns out that 16 acts as an identity element, 4 is the inverse of itself, 12 and 8 are mutual inverses, and 16 is the inverse of itself. One more things to check would be to see if the associative property is satisfied for all elements. However, this would seem to be a very tedious process.

On the other hand, I know that, up to isomorphism, there are only two types of groups of order 4, the cyclic group ##\mathbb{Z}_4## and the Klein four-group. Just by comparing tables, the Cayley table for this binary structure is equivalent to that of the Klein four-group. So is it valid to say, by isomorphism, that this binary structure is also a group, or do I have to explicitly show associativity?
 
Physics news on Phys.org
The isomorphism is sufficient, because you already know, that the other group is associative. Beside that, you only need the closure, i.e. that the multiplication stays inside the set. Associativity is then inherited by ##\mathbb{Z}_{20}## or even by ##\mathbb{Z}## itself.
 
  • Like
Likes Mr Davis 97
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top