What Are Cyclic, Abelian, and Non-Abelian Groups?

  • Thread starter Thread starter Kate2010
  • Start date Start date
  • Tags Tags
    Cyclic Groups
Kate2010
Messages
134
Reaction score
0

Homework Statement



Let G1 and G2 be groups, let G = G1 x G2 and define the binary operation on G by
(a1,a2)(b1,b2):=(a1b1,a2b2)
Prove that this makes G into a group. Prove G is abelian iff G1 and G2 are abelian.

Hence or otherwise give examples of a non-cyclic abelian group of order 8 and a non-abelian group of order 42.

Homework Equations





The Attempt at a Solution



I have done the 1st part of this question and I'm just struggling with the examples. From reading around the subject I think a non-cyclic abelian group of order 8 would be Z2 x Z2 x Z2 where Z2 is the integers modulo 2 under addition. However, I don't really understand this.

Also, I'm unsure how to tackle the non-abelian group of order 42.

Thanks :)
 
Physics news on Phys.org
I think you are right with Z2xZ2xZ2. Why isn't it cyclic? For the other one think of two groups whose order multiplies to 42, and at least one of which isn't abelian.
 
I'm not sure I fully understand what cyclic actually means. If we have any element in the group, in our case it will look like (a,b,c) where a,b,c are either 0 or 1. When we square it we will get 1, will this be (1,1,1) for us? But this doesn't actually make sense, if we have (1,0,0)(1,0,0) = (1,0,0)? I think I'm very confused.

For the order 42 group, could I use sym(3) x Z7 (Z7 is the integers modulo 7 under addition) and sym(3) is not abelian. Again, I really don't understand why this works, if it does.
 
When they define the group operation by (a1,a2)(b1,b2):=(a1b1,a2b2) a1b1 doesn't mean multiply, it means combine a1 and b1 according to whatever the group operation is. For Z2 that's addition mod 2. (1,1,1) is not the identity of Z2xZ2xZ2. Does that help?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top