What are the cyclic subgroups in Z6 x Z3?

  • Thread starter Thread starter scharl4
  • Start date Start date
scharl4
Messages
6
Reaction score
0

Homework Statement


Find all cyclic subgroups of Z6 x Z3.

Homework Equations





The Attempt at a Solution


I understand how to find a cyclic subgroup of a simpler group such as Z4, but having trouble understanding what subgroups look like in a direct product of integer spaces, let alone cyclic subgroups. Also, having trouble understanding what makes a direct product subgroup cyclic. Is it cyclic when (a1, a2)^n = (e1, e2)? Please help!
 
Physics news on Phys.org
scharl4 said:

Homework Statement


Find all cyclic subgroups of Z6 x Z3...

...Also, having trouble understanding what makes a direct product subgroup cyclic. Is it cyclic when (a1, a2)^n = (e1, e2)? Please help!

A group is cyclic if it is generated by a single element. So find subgroup generated by each element (some elements might generate the same subgroup).
 
Direct product of two groups G and H, is the group G\times H = \{ (g,h) | g \in G, h \in H \}.

If * is the operation of G and H, (g,h)*(g_1,h_1) = (g*g_1,h*h_1). Similarly the inverse (g,h)^{-1} = (g^{-1},h^{-1}).

Now can you find any element (g,h) \in \mathbb{Z}_6\times \mathbb{Z}_3 such that each element in \mathbb{Z}_6\times \mathbb{Z}_3 can be represented in the form (g^n,h^n)?
 
Last edited:
  • Like
Likes 6yasmin6
Ok so I think I found all the subgroups generated by each element of Z6 x Z3. It looks like (0,0), (0,1), (1,0), (1,1), (3,0), (3,1), (4,0), (4,1), (5,0), (5,1) each generate only themselves, while each of the other elements of Z6 x Z3 only generate 2 elements. So, it appears that there are no cyclic subgroups, unless i computed the subgroups incorrectly.
 
scharl4 said:
Ok so I think I found all the subgroups generated by each element of Z6 x Z3. It looks like (0,0), (0,1), (1,0), (1,1), (3,0), (3,1), (4,0), (4,1), (5,0), (5,1) each generate only themselves, while each of the other elements of Z6 x Z3 only generate 2 elements. So, it appears that there are no cyclic subgroups, unless i computed the subgroups incorrectly.

If your notation includes zero, you must be using the additive notation. When you say (0,1) only generates itself, do you mean it generates a subgroup of one element? There's two things wrong with that.

One is, every group, and subgroup, must contain the identity by definition. Under your implicit choice of addition as the operation, the identity is (0,0).

The second problem is, 5 is relatively prime to 6, so for instance 5+...+5=5*5=25=1+24=1 mod 6. So (5,0) generates the same group (1,0) does.

Perhaps you do not know what it means for an element to generate a subgroup. Under addition, all multiples, under multiplication, all powers (a sometimes tricky distinction).

Please be more careful, and propose different groups.
 
OK thanks. I got a little confused because the other post said I should generate by using (a^n, b^n). I think I have my subgroups correct now.
 
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...
Back
Top