Understanding a Sylow theory proof

  • Context: Undergrad 
  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Proof Theory
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
4 replies · 2K views
Mr Davis 97
Messages
1,461
Reaction score
44
https://imgur.com/a/oSioYel

I am trying to understand this proof, but am tripped up on the part that says "Consider the action of ##G## on ##\operatorname{Syl}_2(G)## by conjugation." My question is, how is this a well-defined action if ##\operatorname{Syl}_2(G)## is not normal? Isn't this action by conjugation defined only on subgroups that are normal?
 
on Phys.org
Mr Davis 97 said:
https://imgur.com/a/oSioYel

I am trying to understand this proof, but am tripped up on the part that says "Consider the action of ##G## on ##\operatorname{Syl}_2(G)## by conjugation." My question is, how is this a well-defined action if ##\operatorname{Syl}_2(G)## is not normal? Isn't this action by conjugation defined only on subgroups that are normal?
Given any operation ##\varphi \, : \, U\times G \longrightarrow G## with a subgroup ##U\leqslant G## we can define cosets ##g.U=\varphi(g,U)=\{\,g.u\,|\,u\in U\,\}## which in our case are the sets ##gUg^{-1}##. This partitions ##G## into subsets of equal size.

Now the point is, that those sets are just that: sets. Since ##U## isn't normal, we simply cannot define a group structure on this set ##G/U## of sets. So as long as we are only counting elements, everything will be fine. If we want to consider homomorphisms ##U \rightarrowtail G \twoheadrightarrow G/U## we will have a problem if ##U## isn't normal. So normality directly corresponds to the fact, that ##G/U## is again a group or not.
 
[itex]Syl_2(G)[/itex] is not a subgroup of [itex]G[/itex]; rather, it is the set of all of the 2-Sylow subgroups of [itex]G[/itex]. If [itex]H\in Syl_2(G)[/itex], then [itex]gHg^{-1}\in Syl_2(G)[/itex] too (and can be a different element if [itex]H[/itex] is not normal).
 
  • Like
Likes   Reactions: Mr Davis 97
Infrared said:
[itex]Syl_2(G)[/itex] is not a subgroup of [itex]G[/itex]; rather, it is the set of all of the 2-Sylow subgroups of [itex]G[/itex]. If [itex]H\in Syl_2(G)[/itex], then [itex]gHg^{-1}\in Syl_2(G)[/itex] too (and can be a different element if [itex]H[/itex] is not normal).
Got it. One more question. Why does that fact that ##\rho## is transitive imply that it is nontrivial?
 
Let [itex]H_1,H_2\in Syl_2(G)[/itex]. Since the action is transitive, there is an element [itex]g\in G[/itex] such that [itex]gH_1g^{-1}=H_2[/itex]. We can pick [itex]H_1,H_2[/itex] to be different, and then this means that [itex]\rho(g)[/itex] is not the trivial permutation.
 
  • Like
Likes   Reactions: Mr Davis 97