Sylow Theorem Part 2: Find Order of Subgroup PQ

  • Thread starter Thread starter catcherintherye
  • Start date Start date
  • Tags Tags
    Theorem
catcherintherye
Messages
47
Reaction score
0
okay so I'm going through the proof of sylow part 2, i.e. the bit that says if
N_p is the number of subgroups of G of order p^n then N_p \equiv1modp<br />

now I have got to the part where I have taken the subgroup P of order P^n that you get from sylow part 1 and I have to show that it is a unique fixed point W.r.t conjugation of P on S={Q: Q subgroup of G: |Q|=p^n}...anyway for those of you who know the proof, I am trying to find the order of the subgroup PQ, where Q is the supposed subgroup used in the contradiction argument...

so anyway |PQ| is what I am trying to deduce, I have noethers 1st isomorphism theorem

PQ/Q isomorphic to P/P \capQ Q

|P|=p^n...

the next line asserts |P\cap Q| =p^e for som e e\leq n

how is this so is P intersection Q a subgroup of P??:confused:
 
Physics news on Phys.org
You really should explain what you're trying to do more clearly since we haven't all seen the particular proof you're going from. I think I've worked out what you're doing, and even though you probably know all this, I'll go over it again in case I'm wrong, or if someone else wants to follow along.

We have |S|=np, and if we let P act on S by conjugation, we get a partition of S into distinct orbits. One of these will contain P by itself, since conjugation of P by any element in P gives back P.

For any other orbit O, say, let Q be a representative from O. Then we have |O|=[P:N_G(Q) \cap P ] (do you see why?), and since |P| is a power of p, |O| must be as well.

If |O|=1, this would mean P is contained in N_G(Q). Then the first isomorphism theorem says:

PQ/Q \cong P/P \cap Q

or, taking the orders, using the fact that |G/H|=|G|/|H| for finite groups, and rearranging, we get:

|PQ| = \frac{|P||Q|}{|P \cap Q|}

(note this is also true from a more basic argument even when PQ isn't a subgroup).

Since all groups on the RHS have order a power of p (since, yes, P \cap Q is a subgroup of P, which I hope isn't your whole question, because it's the easiest part of this proof), so does PQ. But by assumption, P (as well as Q) is a maximal p-subgroup, so we must have PQ=P, ie, P=Q.

To finish up, since np is the sum of the sizes of the different orbits, and since exactly one of these is 1, with all the others are divisible by p (since they are powers of p greater than 1), we see np=1 (mod p).
 
Last edited:
##\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...

Similar threads

Replies
2
Views
2K
Replies
3
Views
2K
Replies
5
Views
2K
Replies
1
Views
1K
Replies
5
Views
2K
Replies
2
Views
2K
Back
Top