Order of Elements: Non-Abelian Group G & Correlation between |a|, |b|, |ab|?

  • Thread starter Thread starter Bachelier
  • Start date Start date
  • Tags Tags
    Elements
Bachelier
Messages
375
Reaction score
0
If a group G is non abelian and a and b in G have orders |a|= n and |b|= m, is there a correlation we can draw between m and n and |ab|?
 
Physics news on Phys.org
in general, no. it may be that |ab| isn't even finite.

for example, if G is the quotient of the free group on two generators defined by:

a2 = b2 = e

then ab is not of finite order, even though both a and b are of order 2.
 
Deveno said:
in general, no. it may be that |ab| isn't even finite.

for example, if G is the quotient of the free group on two generators defined by:

a2 = b2 = e

then ab is not of finite order, even though both a and b are of order 2.

Thanks. That's what I thought.

So How do I go about figuring out the order of different elements in a group. For instance, consider Dihedral D9 then I can define as : {a,b| |a|=9 and |b|=2}

Now if I'm trying to figure out the different Sylow 2-subgroups, I need to get the elements with order 2. How do I do it?
 
I guess in this case everything that is multiplied by b^2=e has order 2, it seems like I should treat e as zero under the multiplication rule.
 
Bachelier said:
Thanks. That's what I thought.

So How do I go about figuring out the order of different elements in a group. For instance, consider Dihedral D9 then I can define as : {a,b| |a|=9 and |b|=2}

Now if I'm trying to figure out the different Sylow 2-subgroups, I need to get the elements with order 2. How do I do it?

for the dihedral group Dn, the elements of order 2 depend on whether or not n is even.

if n is odd, then the sylow 2-subgroups are all of order 2, because half the elements are of odd order (the rotations). geometrically, it's obvious the reflections are of order 2, but we can prove this algebraically, as well:

given: rn = 1, s2 = 1, and rs = sr-1, let's calculate (srk)2.

first, a small detour:

lemma: rs = sr-1 → rks = sr-k.


for k = 1, this is given by the defining relations on Dn.

suppose this is true for k = m.

then rm+1s = r(rms) = r(sr-m) = (rs)r-m
= (sr-1)r-m = sr-(m+1),

so the general result holds by induction on k.

corollary: srk = r-ks

since r-k = rn-k,

we have rn-ks = srk-n, so rnr-ks = srkr-n, so the result follows, because both rn and r-n are the identity.

ok, back to showing what the square of a reflection is:

(srk)2 = (srk)(srk)

= (r-ks)(srk) = r-k(ss)rk

= r-krk = 1.

so every reflection has order 2. now, since 9 is odd, this means we have 9 sylow 2-subgroups, one for each reflection.

(if n is even, we have a slightly more involved situation, because now 4 divides the order of the group).
 
##\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