Order Formula Under Second Isomorphism Theorem: Does it Hold?

quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32
In the conditions where the second isomorphism theorem applies, one has H/HnK = HK/K so in particular, taking orders (in the finite case), one has the order formula

|HK| = |H|*|K|/|H n K|.

Does anyone know if this formula holds in general, or under lesser hypotheses? Thx.
 
Physics news on Phys.org
Yes! The formula applies in the case where H and K are finite subgroups. So no normality is required. Of course, the proof will be a lot different as you cannot use the first isomorphism theorem anymore...

Also, note that HK will not be a subgroup anymore! You'll need normality of H or K for this to be a subgroup. But that doesn't mean that the formula doesn't hold anymore...
 
Last edited:
For your convenience, I'll write the proof down:

Let X=\{Hg~\vert~g\in G\}. Then K acts on X by multiplication (thus Hg=H.g). It follows that

HK=\{hk~\vert~h\in H, k\in K\}=\bigcup_{k\in K}{H\cdot k}

and \{H\cdot k~\vert~k\in K\} is the orbit of the element x:=H. Also, we have that the stabilizer K_x=K\cap H, thus there are |K|/|H\cap K| elements in an orbit. Also, we have |H.k|=|H|. Thus

|HK|=|H||K|/|H\cap K|
 
Oh. Very nice, thanks micromass!
 
##\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