Is G a Cyclic Group of Prime Order?

  • Thread starter Thread starter semidevil
  • Start date Start date
  • Tags Tags
    Abstract
AI Thread Summary
A non-trivial group G with only the identity and G as its subgroups must be cyclic of prime order. By the Fundamental Theorem of Cyclic groups, if G is cyclic, then any subgroup, including the one generated by a non-identity element g, must equal G itself. This implies that every element in G can be expressed as a power of g. Consequently, the order of g, which is the same as the order of G, cannot be divisible by any number other than 1 and itself. Therefore, G is confirmed to be cyclic of prime order.
semidevil
Messages
156
Reaction score
2
let G be a non-trivial group whose only supgroups are {e} and G. Show that G is cyclic of prime order.

ok...so basically, it is asking I need show that it is cyclic that has an order that is only divisible by 1 and itself right?

I don't know how to approace this, but I know the Fundamental Theorem of Cyclic groups, which says "Every subgroup of cyclic group is cyclic. So if the only subgroups are teh identity and itself, by the problem, doesn't that mean that it is prime order?

:frown:
 
Physics news on Phys.org
(a) Suppose it's not cyclic. What can you prove?
(b) Suppose it's not of prime order. What can you prove?
 


Yes, you are correct. Since G is a non-trivial group, it must have at least one non-identity element. Let's call this element g. Since G is a cyclic group, there exists an integer n such that g^n = e (the identity element). This means that the order of g is n.

Now, let's consider the subgroup generated by g, denoted <g>. By the Fundamental Theorem of Cyclic groups, <g> is also a cyclic group. But since the only subgroups of G are {e} and G itself, <g> must be equal to G. This means that every element in G can be written as a power of g, and thus G is cyclic.

Since the order of g is n, and every element in G can be written as a power of g, the order of G must also be n. But since n is the order of a non-identity element in G, it cannot be divisible by any number other than 1 and itself. Therefore, G is cyclic of prime order.
 
I multiplied the values first without the error limit. Got 19.38. rounded it off to 2 significant figures since the given data has 2 significant figures. So = 19. For error I used the above formula. It comes out about 1.48. Now my question is. Should I write the answer as 19±1.5 (rounding 1.48 to 2 significant figures) OR should I write it as 19±1. So in short, should the error have same number of significant figures as the mean value or should it have the same number of decimal places as...
Thread 'A cylinder connected to a hanging mass'
Let's declare that for the cylinder, mass = M = 10 kg Radius = R = 4 m For the wall and the floor, Friction coeff = ##\mu## = 0.5 For the hanging mass, mass = m = 11 kg First, we divide the force according to their respective plane (x and y thing, correct me if I'm wrong) and according to which, cylinder or the hanging mass, they're working on. Force on the hanging mass $$mg - T = ma$$ Force(Cylinder) on y $$N_f + f_w - Mg = 0$$ Force(Cylinder) on x $$T + f_f - N_w = Ma$$ There's also...
Back
Top