Sylow 2 subgroups of S4












5












$begingroup$


I am trying to find all the Sylow 2 subgroups of S4 using Sylow’s theorems. Now, I know that a Sylow 2 subgroup of S4 has size 8, and that there are either 1 or 3 of them (as the number of of Sylow 2-subgroups has form 1+2k and divides 3, the index).



Now my lecturer states “stabilisers of the 3 different bisections of {1,2,3,4} yield 3 distinct Sylow 2 subgroups”



Now my questions are:



1) What does it mean by stabilisers of 3 different bijections of {1,2,3,4}? Is that to say the elements of S4 which send {1,2} and {3,4} to {1,2},{3,4} i.e. by (12)(34)?



2) How does he know that there are 8 elements of this set? Perhaps this will become clearer after the 1st question is answered.



Many thanks, group theory is hard.






group-theory sylow-theory permutation-cycles







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    @MarkBennet i goofed, i meant bisections, thanks
    $endgroup$
    – jacobe
    Jan 20 at 17:08
















5












$begingroup$


I am trying to find all the Sylow 2 subgroups of S4 using Sylow’s theorems. Now, I know that a Sylow 2 subgroup of S4 has size 8, and that there are either 1 or 3 of them (as the number of of Sylow 2-subgroups has form 1+2k and divides 3, the index).



Now my lecturer states “stabilisers of the 3 different bisections of {1,2,3,4} yield 3 distinct Sylow 2 subgroups”



Now my questions are:



1) What does it mean by stabilisers of 3 different bijections of {1,2,3,4}? Is that to say the elements of S4 which send {1,2} and {3,4} to {1,2},{3,4} i.e. by (12)(34)?



2) How does he know that there are 8 elements of this set? Perhaps this will become clearer after the 1st question is answered.



Many thanks, group theory is hard.






group-theory sylow-theory permutation-cycles







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    @MarkBennet i goofed, i meant bisections, thanks
    $endgroup$
    – jacobe
    Jan 20 at 17:08














5












5








5


1



$begingroup$


I am trying to find all the Sylow 2 subgroups of S4 using Sylow’s theorems. Now, I know that a Sylow 2 subgroup of S4 has size 8, and that there are either 1 or 3 of them (as the number of of Sylow 2-subgroups has form 1+2k and divides 3, the index).



Now my lecturer states “stabilisers of the 3 different bisections of {1,2,3,4} yield 3 distinct Sylow 2 subgroups”



Now my questions are:



1) What does it mean by stabilisers of 3 different bijections of {1,2,3,4}? Is that to say the elements of S4 which send {1,2} and {3,4} to {1,2},{3,4} i.e. by (12)(34)?



2) How does he know that there are 8 elements of this set? Perhaps this will become clearer after the 1st question is answered.



Many thanks, group theory is hard.






group-theory sylow-theory permutation-cycles







share|cite|improve this question











$endgroup$




I am trying to find all the Sylow 2 subgroups of S4 using Sylow’s theorems. Now, I know that a Sylow 2 subgroup of S4 has size 8, and that there are either 1 or 3 of them (as the number of of Sylow 2-subgroups has form 1+2k and divides 3, the index).



Now my lecturer states “stabilisers of the 3 different bisections of {1,2,3,4} yield 3 distinct Sylow 2 subgroups”



Now my questions are:



1) What does it mean by stabilisers of 3 different bijections of {1,2,3,4}? Is that to say the elements of S4 which send {1,2} and {3,4} to {1,2},{3,4} i.e. by (12)(34)?



2) How does he know that there are 8 elements of this set? Perhaps this will become clearer after the 1st question is answered.



Many thanks, group theory is hard.






group-theory sylow-theory permutation-cycles




group-theory sylow-theory permutation-cycles






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 20 at 17:08







jacobe

















asked Jan 20 at 16:24









jacobejacobe

736




736








  • 1




    $begingroup$
    @MarkBennet i goofed, i meant bisections, thanks
    $endgroup$
    – jacobe
    Jan 20 at 17:08














  • 1




    $begingroup$
    @MarkBennet i goofed, i meant bisections, thanks
    $endgroup$
    – jacobe
    Jan 20 at 17:08








1




1




$begingroup$
@MarkBennet i goofed, i meant bisections, thanks
$endgroup$
– jacobe
Jan 20 at 17:08




$begingroup$
@MarkBennet i goofed, i meant bisections, thanks
$endgroup$
– jacobe
Jan 20 at 17:08










1 Answer
1






active

oldest

votes


















5












$begingroup$

1) Yes, you've got it. There are three unique ways to write ${1,2,3,4}$ as a union of two sets of size two. These are ${1,2}cup{3,4}$, ${1,3}cup{2,4}$, and ${1,4}cup{2,3}$. These should not be called "bijections of ${1,2,3,4}$", but this is what was probably meant. Let's look at the first one, the one you mentioned: ${1,2}cup{3,4}$. We can consider the subgroup $H$ of $S_4$ consisting of permutations that preserve this decomposition, i.e., which send ${1,2}$ to either ${1,2}$ or ${3,4}$. You can see
$$H = {(1), (1 2), (3 4), (1 2)(3 4), (1 3)(2 4), (1 4)(2 3), (1 3 2 4), (1 4 2 3)}.$$
2) It's clear there are going to be 8 elements in $H$, since we have 4 choices for where $1$ is sent, then we have no choice for where to send $2$ (it must stick next to where $1$ is sent), and then we have $2$ choices for where to send $3$, and then no choice for $4$.



So $H$ is a 2-Sylow subgroup of $S_4$. Two others come from the other two decompositions. There can't be more than three of them, as you said. So these are all of them.



In case you're curious, you can show that $H$ (and thus all of the 2-Sylow subgroups) is isomorphic to $D_4$, the dihedral group of order 8. You can see this pretty concretely if you know how $D_4$ acts on the vertices of a square by rotation and reflection. If you label the vertices of a square clockwise by $1$, $3$, $2$, and $4$, then all of these rotations and reflections keep opposite corners together, i.e., they do what elements of $H$ did. The other 2-Sylow subgroups come from labeling the vertices differently (and that's exactly the fact that the 2-Sylow subgroups are conjugate in $S_4$, since conjugacy is pretty explicitly just relabeling in the symmetric groups).






share|cite|improve this answer










New contributor




csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$









  • 1




    $begingroup$
    Thanks for clearing this up, I completely get it now :)
    $endgroup$
    – jacobe
    Jan 20 at 17:09






  • 2




    $begingroup$
    The comment about the geometric interpretation of the situation in terms of the symmetries of a square makes this a particularly nice answer.
    $endgroup$
    – Travis
    Jan 20 at 17:27










  • $begingroup$
    "These should not be called 'bijections of ${1,2,3,4}$'": You are correct, and it appears Jacobe misread the problem, because it says bisections, which makes more sense.
    $endgroup$
    – Bob Jones
    Jan 20 at 22:37











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3080776%2fsylow-2-subgroups-of-s4%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









5












$begingroup$

1) Yes, you've got it. There are three unique ways to write ${1,2,3,4}$ as a union of two sets of size two. These are ${1,2}cup{3,4}$, ${1,3}cup{2,4}$, and ${1,4}cup{2,3}$. These should not be called "bijections of ${1,2,3,4}$", but this is what was probably meant. Let's look at the first one, the one you mentioned: ${1,2}cup{3,4}$. We can consider the subgroup $H$ of $S_4$ consisting of permutations that preserve this decomposition, i.e., which send ${1,2}$ to either ${1,2}$ or ${3,4}$. You can see
$$H = {(1), (1 2), (3 4), (1 2)(3 4), (1 3)(2 4), (1 4)(2 3), (1 3 2 4), (1 4 2 3)}.$$
2) It's clear there are going to be 8 elements in $H$, since we have 4 choices for where $1$ is sent, then we have no choice for where to send $2$ (it must stick next to where $1$ is sent), and then we have $2$ choices for where to send $3$, and then no choice for $4$.



So $H$ is a 2-Sylow subgroup of $S_4$. Two others come from the other two decompositions. There can't be more than three of them, as you said. So these are all of them.



In case you're curious, you can show that $H$ (and thus all of the 2-Sylow subgroups) is isomorphic to $D_4$, the dihedral group of order 8. You can see this pretty concretely if you know how $D_4$ acts on the vertices of a square by rotation and reflection. If you label the vertices of a square clockwise by $1$, $3$, $2$, and $4$, then all of these rotations and reflections keep opposite corners together, i.e., they do what elements of $H$ did. The other 2-Sylow subgroups come from labeling the vertices differently (and that's exactly the fact that the 2-Sylow subgroups are conjugate in $S_4$, since conjugacy is pretty explicitly just relabeling in the symmetric groups).






share|cite|improve this answer










New contributor




csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$









  • 1




    $begingroup$
    Thanks for clearing this up, I completely get it now :)
    $endgroup$
    – jacobe
    Jan 20 at 17:09






  • 2




    $begingroup$
    The comment about the geometric interpretation of the situation in terms of the symmetries of a square makes this a particularly nice answer.
    $endgroup$
    – Travis
    Jan 20 at 17:27










  • $begingroup$
    "These should not be called 'bijections of ${1,2,3,4}$'": You are correct, and it appears Jacobe misread the problem, because it says bisections, which makes more sense.
    $endgroup$
    – Bob Jones
    Jan 20 at 22:37
















5












$begingroup$

1) Yes, you've got it. There are three unique ways to write ${1,2,3,4}$ as a union of two sets of size two. These are ${1,2}cup{3,4}$, ${1,3}cup{2,4}$, and ${1,4}cup{2,3}$. These should not be called "bijections of ${1,2,3,4}$", but this is what was probably meant. Let's look at the first one, the one you mentioned: ${1,2}cup{3,4}$. We can consider the subgroup $H$ of $S_4$ consisting of permutations that preserve this decomposition, i.e., which send ${1,2}$ to either ${1,2}$ or ${3,4}$. You can see
$$H = {(1), (1 2), (3 4), (1 2)(3 4), (1 3)(2 4), (1 4)(2 3), (1 3 2 4), (1 4 2 3)}.$$
2) It's clear there are going to be 8 elements in $H$, since we have 4 choices for where $1$ is sent, then we have no choice for where to send $2$ (it must stick next to where $1$ is sent), and then we have $2$ choices for where to send $3$, and then no choice for $4$.



So $H$ is a 2-Sylow subgroup of $S_4$. Two others come from the other two decompositions. There can't be more than three of them, as you said. So these are all of them.



In case you're curious, you can show that $H$ (and thus all of the 2-Sylow subgroups) is isomorphic to $D_4$, the dihedral group of order 8. You can see this pretty concretely if you know how $D_4$ acts on the vertices of a square by rotation and reflection. If you label the vertices of a square clockwise by $1$, $3$, $2$, and $4$, then all of these rotations and reflections keep opposite corners together, i.e., they do what elements of $H$ did. The other 2-Sylow subgroups come from labeling the vertices differently (and that's exactly the fact that the 2-Sylow subgroups are conjugate in $S_4$, since conjugacy is pretty explicitly just relabeling in the symmetric groups).






share|cite|improve this answer










New contributor




csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$









  • 1




    $begingroup$
    Thanks for clearing this up, I completely get it now :)
    $endgroup$
    – jacobe
    Jan 20 at 17:09






  • 2




    $begingroup$
    The comment about the geometric interpretation of the situation in terms of the symmetries of a square makes this a particularly nice answer.
    $endgroup$
    – Travis
    Jan 20 at 17:27










  • $begingroup$
    "These should not be called 'bijections of ${1,2,3,4}$'": You are correct, and it appears Jacobe misread the problem, because it says bisections, which makes more sense.
    $endgroup$
    – Bob Jones
    Jan 20 at 22:37














5












5








5





$begingroup$

1) Yes, you've got it. There are three unique ways to write ${1,2,3,4}$ as a union of two sets of size two. These are ${1,2}cup{3,4}$, ${1,3}cup{2,4}$, and ${1,4}cup{2,3}$. These should not be called "bijections of ${1,2,3,4}$", but this is what was probably meant. Let's look at the first one, the one you mentioned: ${1,2}cup{3,4}$. We can consider the subgroup $H$ of $S_4$ consisting of permutations that preserve this decomposition, i.e., which send ${1,2}$ to either ${1,2}$ or ${3,4}$. You can see
$$H = {(1), (1 2), (3 4), (1 2)(3 4), (1 3)(2 4), (1 4)(2 3), (1 3 2 4), (1 4 2 3)}.$$
2) It's clear there are going to be 8 elements in $H$, since we have 4 choices for where $1$ is sent, then we have no choice for where to send $2$ (it must stick next to where $1$ is sent), and then we have $2$ choices for where to send $3$, and then no choice for $4$.



So $H$ is a 2-Sylow subgroup of $S_4$. Two others come from the other two decompositions. There can't be more than three of them, as you said. So these are all of them.



In case you're curious, you can show that $H$ (and thus all of the 2-Sylow subgroups) is isomorphic to $D_4$, the dihedral group of order 8. You can see this pretty concretely if you know how $D_4$ acts on the vertices of a square by rotation and reflection. If you label the vertices of a square clockwise by $1$, $3$, $2$, and $4$, then all of these rotations and reflections keep opposite corners together, i.e., they do what elements of $H$ did. The other 2-Sylow subgroups come from labeling the vertices differently (and that's exactly the fact that the 2-Sylow subgroups are conjugate in $S_4$, since conjugacy is pretty explicitly just relabeling in the symmetric groups).






share|cite|improve this answer










New contributor




csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






$endgroup$



1) Yes, you've got it. There are three unique ways to write ${1,2,3,4}$ as a union of two sets of size two. These are ${1,2}cup{3,4}$, ${1,3}cup{2,4}$, and ${1,4}cup{2,3}$. These should not be called "bijections of ${1,2,3,4}$", but this is what was probably meant. Let's look at the first one, the one you mentioned: ${1,2}cup{3,4}$. We can consider the subgroup $H$ of $S_4$ consisting of permutations that preserve this decomposition, i.e., which send ${1,2}$ to either ${1,2}$ or ${3,4}$. You can see
$$H = {(1), (1 2), (3 4), (1 2)(3 4), (1 3)(2 4), (1 4)(2 3), (1 3 2 4), (1 4 2 3)}.$$
2) It's clear there are going to be 8 elements in $H$, since we have 4 choices for where $1$ is sent, then we have no choice for where to send $2$ (it must stick next to where $1$ is sent), and then we have $2$ choices for where to send $3$, and then no choice for $4$.



So $H$ is a 2-Sylow subgroup of $S_4$. Two others come from the other two decompositions. There can't be more than three of them, as you said. So these are all of them.



In case you're curious, you can show that $H$ (and thus all of the 2-Sylow subgroups) is isomorphic to $D_4$, the dihedral group of order 8. You can see this pretty concretely if you know how $D_4$ acts on the vertices of a square by rotation and reflection. If you label the vertices of a square clockwise by $1$, $3$, $2$, and $4$, then all of these rotations and reflections keep opposite corners together, i.e., they do what elements of $H$ did. The other 2-Sylow subgroups come from labeling the vertices differently (and that's exactly the fact that the 2-Sylow subgroups are conjugate in $S_4$, since conjugacy is pretty explicitly just relabeling in the symmetric groups).







share|cite|improve this answer










New contributor




csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this answer



share|cite|improve this answer








edited Jan 20 at 17:56





















New contributor




csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









answered Jan 20 at 16:50









cspruncsprun

42616




42616




New contributor




csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






csprun is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 1




    $begingroup$
    Thanks for clearing this up, I completely get it now :)
    $endgroup$
    – jacobe
    Jan 20 at 17:09






  • 2




    $begingroup$
    The comment about the geometric interpretation of the situation in terms of the symmetries of a square makes this a particularly nice answer.
    $endgroup$
    – Travis
    Jan 20 at 17:27










  • $begingroup$
    "These should not be called 'bijections of ${1,2,3,4}$'": You are correct, and it appears Jacobe misread the problem, because it says bisections, which makes more sense.
    $endgroup$
    – Bob Jones
    Jan 20 at 22:37














  • 1




    $begingroup$
    Thanks for clearing this up, I completely get it now :)
    $endgroup$
    – jacobe
    Jan 20 at 17:09






  • 2




    $begingroup$
    The comment about the geometric interpretation of the situation in terms of the symmetries of a square makes this a particularly nice answer.
    $endgroup$
    – Travis
    Jan 20 at 17:27










  • $begingroup$
    "These should not be called 'bijections of ${1,2,3,4}$'": You are correct, and it appears Jacobe misread the problem, because it says bisections, which makes more sense.
    $endgroup$
    – Bob Jones
    Jan 20 at 22:37








1




1




$begingroup$
Thanks for clearing this up, I completely get it now :)
$endgroup$
– jacobe
Jan 20 at 17:09




$begingroup$
Thanks for clearing this up, I completely get it now :)
$endgroup$
– jacobe
Jan 20 at 17:09




2




2




$begingroup$
The comment about the geometric interpretation of the situation in terms of the symmetries of a square makes this a particularly nice answer.
$endgroup$
– Travis
Jan 20 at 17:27




$begingroup$
The comment about the geometric interpretation of the situation in terms of the symmetries of a square makes this a particularly nice answer.
$endgroup$
– Travis
Jan 20 at 17:27












$begingroup$
"These should not be called 'bijections of ${1,2,3,4}$'": You are correct, and it appears Jacobe misread the problem, because it says bisections, which makes more sense.
$endgroup$
– Bob Jones
Jan 20 at 22:37




$begingroup$
"These should not be called 'bijections of ${1,2,3,4}$'": You are correct, and it appears Jacobe misread the problem, because it says bisections, which makes more sense.
$endgroup$
– Bob Jones
Jan 20 at 22:37


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3080776%2fsylow-2-subgroups-of-s4%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

An IMO inspired problem

Image
14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
Read more

Management

Image
Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
Read more

Has there ever been an instance of an active nuclear power plant within or near a war zone?

Image
36 3 The question Has there ever been a military combat going on around an active (running or in outage but not decommissioned) commercial nuclear power plant? Or dangerously near it? If yes, how did the plant and its personnel fare in such situation? Why I ask Let's assume for the scope of this question modern commercial nuclear power plants (CANDU, PWR, BWR of generation II plus all of gen III and newer) are usually reasonably safe to operate given that the engineering has been done right and there is a whole cohort of very well trained personnel on-site at all times, well rested and with considerable resources on their hands. Things hard to get with an armed conflict like the recent Syrian war raging around. I can't seem to find any reference or a comprehensive article about this, hence this question.
Read more