What Are the Non-abelian Groups of a Given Order?

  • Thread starter Thread starter Jupiter
  • Start date Start date
  • Tags Tags
    Groups
Jupiter
Messages
46
Reaction score
0
Given a group of a certain size, I'm interested in determining whether a non-abelian group of that order exists, and if so how many and what are they up to isomorphism.
For example, for |G|=6, the permutation group S_3 is non-abelian. How can I show that any non-abelian group of order 6 is isomorphic to S_3? Ican show that a given non-abelian group of order six must have 2 elements of order 3, and three of order 2. Now it seems reasonable that I can pair up these elements with the elements of S_3 and show that the two are isomorphic. But, when |G|=8, there are 2 non-abelian groups, D_4 and Q_8. How can I show that any non-abelian, order 8 group is isomorphic to one of these? I imagine as the order increases, the number of possible non-abelian groups will increase, so how is it that I can find them all?
Also, say I'm given a group of order 20. How can I construct/find a non-abelian group of that order?
 
Physics news on Phys.org
If there is a systematic way of finding nonabelian groups, I haven't learned about it. That ain't saying much, though. :rolleyes:

As far as "How can I construct/find a non-abelian group of ... order [20]?"

Well, there's the dihedral-10 group, which fits the bill. But you knew that already, I'll bet.
 
Given certain numbers, all groups of that order must be isomorphic. Those are primes and the squares of primes.

For other numbers one needs to consider extensions of groups.

There is always a non-abelian group of order 2n for n>2, the dihedral group.

It suffices to show that for any two distinct odd primes there is a non-abelian extension of one by the other, and also prime powers of order larger than 3. Off the top of my head I don't know that that is true, but it feels true. Try looking up extensions of groups in your favourite algebra source.

You are asking too much to know if there is a way of determining all the structures of possible groups of a given order. It is an open question for p-groups.
 
Ok, so I guess I know it's too much to ask, but I just learned how to classify all finite abelian groups, so I figured the next step was to ask what we can know about nonabelian groups. Concerning matt grime's comment that any two groups of order p^2 are isomorphic, I was under the impression that this is not the case. For instance, Z_p^2 and Z_p x Z_p are both groups of order p^2 but they are not isomorphic. Maybe you meant to say "abelian" rather than "isomorphic." But in any event, is this the most we can say about non-abelian groups - that at least one exists for each group of order 2n (n>2)? My motivation here was to try to use what I've learned in group theory to classify small groups (say <30 elements). This shouldn't be too hard since groups of order 1,2,3,4,5,7,9,11,13,15,17,19,23,25 and 29 are all abelian. So all that remains is 6,8,10,12,14,16,18,20,21,22,24,26,27,28.
I looked up "extension" in my text but it came under Chapter 10, "Field Theory." We're just starting ring theory today, so I'll wait on that.
 
Last edited:
apologies, I meant abelian, not isomorphic.

and the extensions you want arent' field extensions.

classifying possible structures of a given order is computationally very complex (but doable).

also see direct and semi-direct product - classifying certain kinds of extension is as hard as working out automorphism groups and homomorphisms into automorphism groups
 
Last edited:
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\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...
Back
Top