Abelian Group Order: Find Largest Possible # of Subgroups

Dawson64
Messages
5
Reaction score
0
This isn't homework, it was proposed by a professor of mine and I'm dying here because the hint makes no sense to me

Let G be an abelian group of order 540, what is the largest possible number of subgroups of order 3 such a group G can have?
He said to classify abelian groups of order 27, but I'm not sure how that's related. Anyone know how to solve this?
 
Physics news on Phys.org
The fundamental theorem of group theory says that any group G of order 540 can be expressed as

G=G_1\times G_2

where G1 is a group of order 27 and G2 is a group of order 20.

If your searching for every group of order 3, then you'll actually be search for every element of order 3. (number of subgroups of order 3= number of elements of order 3 divides by 2). Since an element of order 3 can only be in G1, you'll be searching for elements of order 3 in a group of order 27. This will require classifying all groups of order 27...
 
micromass said:
The fundamental theorem of group theory says that any group G of order 540 can be expressed as

G=G_1\times G_2

where G1 is a group of order 27 and G2 is a group of order 20.

If your searching for every group of order 3, then you'll actually be search for every element of order 3. (number of subgroups of order 3= number of elements of order 3 divides by 2). Since an element of order 3 can only be in G1, you'll be searching for elements of order 3 in a group of order 27. This will require classifying all groups of order 27...

Is this an alright proof?

First note that Z(n) has exactly one d-subgroup, where d is any divisor of n.
Using the fundamental theorem of finite abelian groups, G can be isomorphic to either:
Z540, which has only one 3-subgroup,
Z3 x Z180, which has three 3-subgroups (namely, the subgroups generated by (1,0), (0, 60), and (1, 60))
Z3 x Z3 x Z60, which has seven (generated by (1,0,0), (0,1,0), (0,0,60), (1,1,0), (1,0,60), (0,1,60), and (1,1,60)), or
Z3 x Z3 x Z3 x Z20, which also has seven.

Note that there other possibilities to which G may be isomorphic, but you can check and see that none of them will yield more than seven 3-subgroups.

So the answer is seven.

And doesn't Z27 only have one 3-subgroup?
 
Yes, this seems to be correct.

Please note tho, that

Z3 x Z3 x Z60 = Z3 x Z3 x Z3 x Z20
 
Lol, whoops.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top