Sylow Subgroups and Conjugation
$begingroup$
Suppose that $G$ is a finite group whose order is divisible by a prime $p$. Let $S$ be the set of Sylow $p$-subgroups of $G$; let $H$ be an element of $S$. $H$ acts on $S$ by conjugation. The fact that is the key to the proof of the Third Sylow Theorem is that there is only one $H$-orbit of order $1$. I was wondering if we could say more about this action.
- I first thought that maybe there are only two $H$-orbits. But this turned out to be false in general. (I saw that it was false in the dihedral group $D_{5}$.)
- Next I checked whether all the orbits other than ${H}$ has order $H$. This is false in general, too. (This is false in $A_{5}$.)
After fiddling with some examples, I found that
all the $H$-orbits except ${H}$ seem to have the same order.
But I can neither prove or disprove this claim. So here are my questions:
- Is the above claim correct? If so, why?
- Is there any other things we can say about the $H$-orbits?
Any help is appreciated. Thanks in advance!
abstract-algebra group-theory finite-groups sylow-theory
$endgroup$
add a comment |
$begingroup$
Suppose that $G$ is a finite group whose order is divisible by a prime $p$. Let $S$ be the set of Sylow $p$-subgroups of $G$; let $H$ be an element of $S$. $H$ acts on $S$ by conjugation. The fact that is the key to the proof of the Third Sylow Theorem is that there is only one $H$-orbit of order $1$. I was wondering if we could say more about this action.
- I first thought that maybe there are only two $H$-orbits. But this turned out to be false in general. (I saw that it was false in the dihedral group $D_{5}$.)
- Next I checked whether all the orbits other than ${H}$ has order $H$. This is false in general, too. (This is false in $A_{5}$.)
After fiddling with some examples, I found that
all the $H$-orbits except ${H}$ seem to have the same order.
But I can neither prove or disprove this claim. So here are my questions:
- Is the above claim correct? If so, why?
- Is there any other things we can say about the $H$-orbits?
Any help is appreciated. Thanks in advance!
abstract-algebra group-theory finite-groups sylow-theory
$endgroup$
add a comment |
$begingroup$
Suppose that $G$ is a finite group whose order is divisible by a prime $p$. Let $S$ be the set of Sylow $p$-subgroups of $G$; let $H$ be an element of $S$. $H$ acts on $S$ by conjugation. The fact that is the key to the proof of the Third Sylow Theorem is that there is only one $H$-orbit of order $1$. I was wondering if we could say more about this action.
- I first thought that maybe there are only two $H$-orbits. But this turned out to be false in general. (I saw that it was false in the dihedral group $D_{5}$.)
- Next I checked whether all the orbits other than ${H}$ has order $H$. This is false in general, too. (This is false in $A_{5}$.)
After fiddling with some examples, I found that
all the $H$-orbits except ${H}$ seem to have the same order.
But I can neither prove or disprove this claim. So here are my questions:
- Is the above claim correct? If so, why?
- Is there any other things we can say about the $H$-orbits?
Any help is appreciated. Thanks in advance!
abstract-algebra group-theory finite-groups sylow-theory
$endgroup$
Suppose that $G$ is a finite group whose order is divisible by a prime $p$. Let $S$ be the set of Sylow $p$-subgroups of $G$; let $H$ be an element of $S$. $H$ acts on $S$ by conjugation. The fact that is the key to the proof of the Third Sylow Theorem is that there is only one $H$-orbit of order $1$. I was wondering if we could say more about this action.
- I first thought that maybe there are only two $H$-orbits. But this turned out to be false in general. (I saw that it was false in the dihedral group $D_{5}$.)
- Next I checked whether all the orbits other than ${H}$ has order $H$. This is false in general, too. (This is false in $A_{5}$.)
After fiddling with some examples, I found that
all the $H$-orbits except ${H}$ seem to have the same order.
But I can neither prove or disprove this claim. So here are my questions:
- Is the above claim correct? If so, why?
- Is there any other things we can say about the $H$-orbits?
Any help is appreciated. Thanks in advance!
abstract-algebra group-theory finite-groups sylow-theory
abstract-algebra group-theory finite-groups sylow-theory
asked Jan 9 at 3:29
KenKen
16919
16919
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Let $mathcal{S}={S leq G: S in Syl_p(G)}$ be the set of Sylow $p$-subgroups of $G$. Fix a $S in mathcal{S}$ and let $S$ act on $mathcal{S}$ by conjugation. Then the length of an orbit of a $T in mathcal{S}$ is clearly $|S:N_S(T)|$, the index of the normalizer of $T$ relative to $S$. The following holds true.
Proposition Let $S,T$ be Sylow $p$-subgroups of $G$, then $N_S(T)=S cap T=N_T(S)$.
Proof Let's prove the first equality, since by symmetry the other holds to. Clearly if $x in S cap T$, then $x in N_S(T)$. So assume $x in N_S(T)$, in particular $x in S $. Then $langle x rangle T$ is a subgroup. And, it is a $p$-subgroup, since $|langle x rangle T|=frac{|langle x rangle| cdot |T|}{|langle x rangle cap T|}$ and note that $x$ is a $p$-element. But $T subseteq langle x rangle T$, but $T$ is a maximal $p$-subgroup since it is Sylow. Hence $T = langle x rangle T$, that is, $x in T$.
So the size of each of the orbits is $|S:S cap T|$ (which equals $|T:S cap T|$). Your question boils down to what can be said about the intersections of the different Sylow $p$-subgroups. These do not have to be equal as the example of $S_3 times S_3$ and its Sylow $2$-subgroups demonstrate (see @Verret). Finally observe, since the oribit size of $S$ itself is $1$ as you remarked, the number Sylow $p$-subgroups $n_p(G) equiv 1$ mod $|S:S cap T|$, where $|S cap T|$ is chosen to be as large as possible among the $T$'s not equal to $S$. This generalizes the regular formula $n_p(G) equiv 1$ mod $p$.
$endgroup$
add a comment |
$begingroup$
By computer calculation, the smallest counterexample is $S_3^2$ which has $9$ Sylow $2$-subgroups, and the action of one of them by conjugation has one fixed point, one orbit of length $4$, and two orbits of size $2$.
$endgroup$
$begingroup$
Thank you for your answer! I accepted Nicky's answer but yours was equally helpful. I have one question; what software/program did you use? (I have never used computers for calculations involving groups and I am curious if there is any suggestion.)
$endgroup$
– Ken
Jan 10 at 1:28
1
$begingroup$
I used "magma", which is not free, but they have a free online calculator at magma.maths.usyd.edu.au/calc which is more than good enough for easy calculations like this. A free alternative is "GAP" gap-system.org
$endgroup$
– verret
Jan 10 at 3:04
1
$begingroup$
Just to get you started, this is a program that runs through the groups of order at most 10 and prints the order of their sylow subgroups: for n in [1..10] do for i in [1..NumberOfSmallGroups(n)] do G:=SmallGroup(n,i); for p in PrimeDivisors(Order(G)) do P:=SylowSubgroup(G,p); [n,i,p]; #P; end for; end for; end for;
$endgroup$
– verret
Jan 10 at 3:07
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3067039%2fsylow-subgroups-and-conjugation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $mathcal{S}={S leq G: S in Syl_p(G)}$ be the set of Sylow $p$-subgroups of $G$. Fix a $S in mathcal{S}$ and let $S$ act on $mathcal{S}$ by conjugation. Then the length of an orbit of a $T in mathcal{S}$ is clearly $|S:N_S(T)|$, the index of the normalizer of $T$ relative to $S$. The following holds true.
Proposition Let $S,T$ be Sylow $p$-subgroups of $G$, then $N_S(T)=S cap T=N_T(S)$.
Proof Let's prove the first equality, since by symmetry the other holds to. Clearly if $x in S cap T$, then $x in N_S(T)$. So assume $x in N_S(T)$, in particular $x in S $. Then $langle x rangle T$ is a subgroup. And, it is a $p$-subgroup, since $|langle x rangle T|=frac{|langle x rangle| cdot |T|}{|langle x rangle cap T|}$ and note that $x$ is a $p$-element. But $T subseteq langle x rangle T$, but $T$ is a maximal $p$-subgroup since it is Sylow. Hence $T = langle x rangle T$, that is, $x in T$.
So the size of each of the orbits is $|S:S cap T|$ (which equals $|T:S cap T|$). Your question boils down to what can be said about the intersections of the different Sylow $p$-subgroups. These do not have to be equal as the example of $S_3 times S_3$ and its Sylow $2$-subgroups demonstrate (see @Verret). Finally observe, since the oribit size of $S$ itself is $1$ as you remarked, the number Sylow $p$-subgroups $n_p(G) equiv 1$ mod $|S:S cap T|$, where $|S cap T|$ is chosen to be as large as possible among the $T$'s not equal to $S$. This generalizes the regular formula $n_p(G) equiv 1$ mod $p$.
$endgroup$
add a comment |
$begingroup$
Let $mathcal{S}={S leq G: S in Syl_p(G)}$ be the set of Sylow $p$-subgroups of $G$. Fix a $S in mathcal{S}$ and let $S$ act on $mathcal{S}$ by conjugation. Then the length of an orbit of a $T in mathcal{S}$ is clearly $|S:N_S(T)|$, the index of the normalizer of $T$ relative to $S$. The following holds true.
Proposition Let $S,T$ be Sylow $p$-subgroups of $G$, then $N_S(T)=S cap T=N_T(S)$.
Proof Let's prove the first equality, since by symmetry the other holds to. Clearly if $x in S cap T$, then $x in N_S(T)$. So assume $x in N_S(T)$, in particular $x in S $. Then $langle x rangle T$ is a subgroup. And, it is a $p$-subgroup, since $|langle x rangle T|=frac{|langle x rangle| cdot |T|}{|langle x rangle cap T|}$ and note that $x$ is a $p$-element. But $T subseteq langle x rangle T$, but $T$ is a maximal $p$-subgroup since it is Sylow. Hence $T = langle x rangle T$, that is, $x in T$.
So the size of each of the orbits is $|S:S cap T|$ (which equals $|T:S cap T|$). Your question boils down to what can be said about the intersections of the different Sylow $p$-subgroups. These do not have to be equal as the example of $S_3 times S_3$ and its Sylow $2$-subgroups demonstrate (see @Verret). Finally observe, since the oribit size of $S$ itself is $1$ as you remarked, the number Sylow $p$-subgroups $n_p(G) equiv 1$ mod $|S:S cap T|$, where $|S cap T|$ is chosen to be as large as possible among the $T$'s not equal to $S$. This generalizes the regular formula $n_p(G) equiv 1$ mod $p$.
$endgroup$
add a comment |
$begingroup$
Let $mathcal{S}={S leq G: S in Syl_p(G)}$ be the set of Sylow $p$-subgroups of $G$. Fix a $S in mathcal{S}$ and let $S$ act on $mathcal{S}$ by conjugation. Then the length of an orbit of a $T in mathcal{S}$ is clearly $|S:N_S(T)|$, the index of the normalizer of $T$ relative to $S$. The following holds true.
Proposition Let $S,T$ be Sylow $p$-subgroups of $G$, then $N_S(T)=S cap T=N_T(S)$.
Proof Let's prove the first equality, since by symmetry the other holds to. Clearly if $x in S cap T$, then $x in N_S(T)$. So assume $x in N_S(T)$, in particular $x in S $. Then $langle x rangle T$ is a subgroup. And, it is a $p$-subgroup, since $|langle x rangle T|=frac{|langle x rangle| cdot |T|}{|langle x rangle cap T|}$ and note that $x$ is a $p$-element. But $T subseteq langle x rangle T$, but $T$ is a maximal $p$-subgroup since it is Sylow. Hence $T = langle x rangle T$, that is, $x in T$.
So the size of each of the orbits is $|S:S cap T|$ (which equals $|T:S cap T|$). Your question boils down to what can be said about the intersections of the different Sylow $p$-subgroups. These do not have to be equal as the example of $S_3 times S_3$ and its Sylow $2$-subgroups demonstrate (see @Verret). Finally observe, since the oribit size of $S$ itself is $1$ as you remarked, the number Sylow $p$-subgroups $n_p(G) equiv 1$ mod $|S:S cap T|$, where $|S cap T|$ is chosen to be as large as possible among the $T$'s not equal to $S$. This generalizes the regular formula $n_p(G) equiv 1$ mod $p$.
$endgroup$
Let $mathcal{S}={S leq G: S in Syl_p(G)}$ be the set of Sylow $p$-subgroups of $G$. Fix a $S in mathcal{S}$ and let $S$ act on $mathcal{S}$ by conjugation. Then the length of an orbit of a $T in mathcal{S}$ is clearly $|S:N_S(T)|$, the index of the normalizer of $T$ relative to $S$. The following holds true.
Proposition Let $S,T$ be Sylow $p$-subgroups of $G$, then $N_S(T)=S cap T=N_T(S)$.
Proof Let's prove the first equality, since by symmetry the other holds to. Clearly if $x in S cap T$, then $x in N_S(T)$. So assume $x in N_S(T)$, in particular $x in S $. Then $langle x rangle T$ is a subgroup. And, it is a $p$-subgroup, since $|langle x rangle T|=frac{|langle x rangle| cdot |T|}{|langle x rangle cap T|}$ and note that $x$ is a $p$-element. But $T subseteq langle x rangle T$, but $T$ is a maximal $p$-subgroup since it is Sylow. Hence $T = langle x rangle T$, that is, $x in T$.
So the size of each of the orbits is $|S:S cap T|$ (which equals $|T:S cap T|$). Your question boils down to what can be said about the intersections of the different Sylow $p$-subgroups. These do not have to be equal as the example of $S_3 times S_3$ and its Sylow $2$-subgroups demonstrate (see @Verret). Finally observe, since the oribit size of $S$ itself is $1$ as you remarked, the number Sylow $p$-subgroups $n_p(G) equiv 1$ mod $|S:S cap T|$, where $|S cap T|$ is chosen to be as large as possible among the $T$'s not equal to $S$. This generalizes the regular formula $n_p(G) equiv 1$ mod $p$.
edited Jan 9 at 15:23
answered Jan 9 at 14:59
Nicky HeksterNicky Hekster
28.8k63456
28.8k63456
add a comment |
add a comment |
$begingroup$
By computer calculation, the smallest counterexample is $S_3^2$ which has $9$ Sylow $2$-subgroups, and the action of one of them by conjugation has one fixed point, one orbit of length $4$, and two orbits of size $2$.
$endgroup$
$begingroup$
Thank you for your answer! I accepted Nicky's answer but yours was equally helpful. I have one question; what software/program did you use? (I have never used computers for calculations involving groups and I am curious if there is any suggestion.)
$endgroup$
– Ken
Jan 10 at 1:28
1
$begingroup$
I used "magma", which is not free, but they have a free online calculator at magma.maths.usyd.edu.au/calc which is more than good enough for easy calculations like this. A free alternative is "GAP" gap-system.org
$endgroup$
– verret
Jan 10 at 3:04
1
$begingroup$
Just to get you started, this is a program that runs through the groups of order at most 10 and prints the order of their sylow subgroups: for n in [1..10] do for i in [1..NumberOfSmallGroups(n)] do G:=SmallGroup(n,i); for p in PrimeDivisors(Order(G)) do P:=SylowSubgroup(G,p); [n,i,p]; #P; end for; end for; end for;
$endgroup$
– verret
Jan 10 at 3:07
add a comment |
$begingroup$
By computer calculation, the smallest counterexample is $S_3^2$ which has $9$ Sylow $2$-subgroups, and the action of one of them by conjugation has one fixed point, one orbit of length $4$, and two orbits of size $2$.
$endgroup$
$begingroup$
Thank you for your answer! I accepted Nicky's answer but yours was equally helpful. I have one question; what software/program did you use? (I have never used computers for calculations involving groups and I am curious if there is any suggestion.)
$endgroup$
– Ken
Jan 10 at 1:28
1
$begingroup$
I used "magma", which is not free, but they have a free online calculator at magma.maths.usyd.edu.au/calc which is more than good enough for easy calculations like this. A free alternative is "GAP" gap-system.org
$endgroup$
– verret
Jan 10 at 3:04
1
$begingroup$
Just to get you started, this is a program that runs through the groups of order at most 10 and prints the order of their sylow subgroups: for n in [1..10] do for i in [1..NumberOfSmallGroups(n)] do G:=SmallGroup(n,i); for p in PrimeDivisors(Order(G)) do P:=SylowSubgroup(G,p); [n,i,p]; #P; end for; end for; end for;
$endgroup$
– verret
Jan 10 at 3:07
add a comment |
$begingroup$
By computer calculation, the smallest counterexample is $S_3^2$ which has $9$ Sylow $2$-subgroups, and the action of one of them by conjugation has one fixed point, one orbit of length $4$, and two orbits of size $2$.
$endgroup$
By computer calculation, the smallest counterexample is $S_3^2$ which has $9$ Sylow $2$-subgroups, and the action of one of them by conjugation has one fixed point, one orbit of length $4$, and two orbits of size $2$.
answered Jan 9 at 5:23
verretverret
3,1881922
3,1881922
$begingroup$
Thank you for your answer! I accepted Nicky's answer but yours was equally helpful. I have one question; what software/program did you use? (I have never used computers for calculations involving groups and I am curious if there is any suggestion.)
$endgroup$
– Ken
Jan 10 at 1:28
1
$begingroup$
I used "magma", which is not free, but they have a free online calculator at magma.maths.usyd.edu.au/calc which is more than good enough for easy calculations like this. A free alternative is "GAP" gap-system.org
$endgroup$
– verret
Jan 10 at 3:04
1
$begingroup$
Just to get you started, this is a program that runs through the groups of order at most 10 and prints the order of their sylow subgroups: for n in [1..10] do for i in [1..NumberOfSmallGroups(n)] do G:=SmallGroup(n,i); for p in PrimeDivisors(Order(G)) do P:=SylowSubgroup(G,p); [n,i,p]; #P; end for; end for; end for;
$endgroup$
– verret
Jan 10 at 3:07
add a comment |
$begingroup$
Thank you for your answer! I accepted Nicky's answer but yours was equally helpful. I have one question; what software/program did you use? (I have never used computers for calculations involving groups and I am curious if there is any suggestion.)
$endgroup$
– Ken
Jan 10 at 1:28
1
$begingroup$
I used "magma", which is not free, but they have a free online calculator at magma.maths.usyd.edu.au/calc which is more than good enough for easy calculations like this. A free alternative is "GAP" gap-system.org
$endgroup$
– verret
Jan 10 at 3:04
1
$begingroup$
Just to get you started, this is a program that runs through the groups of order at most 10 and prints the order of their sylow subgroups: for n in [1..10] do for i in [1..NumberOfSmallGroups(n)] do G:=SmallGroup(n,i); for p in PrimeDivisors(Order(G)) do P:=SylowSubgroup(G,p); [n,i,p]; #P; end for; end for; end for;
$endgroup$
– verret
Jan 10 at 3:07
$begingroup$
Thank you for your answer! I accepted Nicky's answer but yours was equally helpful. I have one question; what software/program did you use? (I have never used computers for calculations involving groups and I am curious if there is any suggestion.)
$endgroup$
– Ken
Jan 10 at 1:28
$begingroup$
Thank you for your answer! I accepted Nicky's answer but yours was equally helpful. I have one question; what software/program did you use? (I have never used computers for calculations involving groups and I am curious if there is any suggestion.)
$endgroup$
– Ken
Jan 10 at 1:28
1
1
$begingroup$
I used "magma", which is not free, but they have a free online calculator at magma.maths.usyd.edu.au/calc which is more than good enough for easy calculations like this. A free alternative is "GAP" gap-system.org
$endgroup$
– verret
Jan 10 at 3:04
$begingroup$
I used "magma", which is not free, but they have a free online calculator at magma.maths.usyd.edu.au/calc which is more than good enough for easy calculations like this. A free alternative is "GAP" gap-system.org
$endgroup$
– verret
Jan 10 at 3:04
1
1
$begingroup$
Just to get you started, this is a program that runs through the groups of order at most 10 and prints the order of their sylow subgroups: for n in [1..10] do for i in [1..NumberOfSmallGroups(n)] do G:=SmallGroup(n,i); for p in PrimeDivisors(Order(G)) do P:=SylowSubgroup(G,p); [n,i,p]; #P; end for; end for; end for;
$endgroup$
– verret
Jan 10 at 3:07
$begingroup$
Just to get you started, this is a program that runs through the groups of order at most 10 and prints the order of their sylow subgroups: for n in [1..10] do for i in [1..NumberOfSmallGroups(n)] do G:=SmallGroup(n,i); for p in PrimeDivisors(Order(G)) do P:=SylowSubgroup(G,p); [n,i,p]; #P; end for; end for; end for;
$endgroup$
– verret
Jan 10 at 3:07
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3067039%2fsylow-subgroups-and-conjugation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown