Finding the centraliser of an element in $S_5$
Let $x = (12)(34) in S_5$. Is there a quick way to find $C_{S_5}(x)$ ?
I know that conjugation leaves cycle types unchanged. Thus, if $sigma in C_{S_5}(x)$, then $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$, but how does this help me?
Any help would be appreciated. Thanks!
abstract-algebra group-theory symmetric-groups
add a comment |
Let $x = (12)(34) in S_5$. Is there a quick way to find $C_{S_5}(x)$ ?
I know that conjugation leaves cycle types unchanged. Thus, if $sigma in C_{S_5}(x)$, then $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$, but how does this help me?
Any help would be appreciated. Thanks!
abstract-algebra group-theory symmetric-groups
add a comment |
Let $x = (12)(34) in S_5$. Is there a quick way to find $C_{S_5}(x)$ ?
I know that conjugation leaves cycle types unchanged. Thus, if $sigma in C_{S_5}(x)$, then $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$, but how does this help me?
Any help would be appreciated. Thanks!
abstract-algebra group-theory symmetric-groups
Let $x = (12)(34) in S_5$. Is there a quick way to find $C_{S_5}(x)$ ?
I know that conjugation leaves cycle types unchanged. Thus, if $sigma in C_{S_5}(x)$, then $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$, but how does this help me?
Any help would be appreciated. Thanks!
abstract-algebra group-theory symmetric-groups
abstract-algebra group-theory symmetric-groups
edited Dec 2 at 9:58
Chinnapparaj R
5,2601826
5,2601826
asked Dec 1 at 19:20
the man
697715
697715
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
For $sigma in S_5$ we have that $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$ holds if and ony if ${sigma({1,2}),sigma({3,4})}={{1,2},{3,4}}$.
Thus we have two possibilities: either $sigma({1,2})={1,2}$ and $sigma({3,4})={3,4}$ or $sigma({1,2})={3,4}$ and $sigma({3,4})={1,2}$.
In the first case, we get the possibilities $mathrm{id},(12),(34),(12)(34)$, in the second case, we get the possibilities $(13)(24),(14)(23),(1324),(1423)$
add a comment |
There may be a faster way to do this, but the first that comes to mind is to use the fact that $(sigma(1)sigma(2))(sigma(3),sigma(4)) = (12)(34)$ to determine which $sigma$ are possible.
Since $sigma$ is a bijection, $(sigma(1),sigma(2))(sigma(3),sigma(4))$ is written in disjoint cycle notation. Thus $(sigma(1),sigma(2)) = (1,2)$ or $(3,4)$ and $(sigma(3),sigma(4)) = (3,4)$ or $(1,2)$. In any case we see $sigma$ must fix $5$. We can choose any value for $sigma(1)$ in ${1,2,3,4}$. This then determines the value of $sigma(2)$. Once we've chosen $sigma(1)$. The choice of $sigma(3)$ determines $sigma(4)$. With these observations we can list the elements.
$C_{S_5}((12)(34)) = {1, (34), (12), (12)(34), (13)(24), (1324), (1423), (14)(23)}$
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%2f3021706%2ffinding-the-centraliser-of-an-element-in-s-5%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
For $sigma in S_5$ we have that $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$ holds if and ony if ${sigma({1,2}),sigma({3,4})}={{1,2},{3,4}}$.
Thus we have two possibilities: either $sigma({1,2})={1,2}$ and $sigma({3,4})={3,4}$ or $sigma({1,2})={3,4}$ and $sigma({3,4})={1,2}$.
In the first case, we get the possibilities $mathrm{id},(12),(34),(12)(34)$, in the second case, we get the possibilities $(13)(24),(14)(23),(1324),(1423)$
add a comment |
For $sigma in S_5$ we have that $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$ holds if and ony if ${sigma({1,2}),sigma({3,4})}={{1,2},{3,4}}$.
Thus we have two possibilities: either $sigma({1,2})={1,2}$ and $sigma({3,4})={3,4}$ or $sigma({1,2})={3,4}$ and $sigma({3,4})={1,2}$.
In the first case, we get the possibilities $mathrm{id},(12),(34),(12)(34)$, in the second case, we get the possibilities $(13)(24),(14)(23),(1324),(1423)$
add a comment |
For $sigma in S_5$ we have that $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$ holds if and ony if ${sigma({1,2}),sigma({3,4})}={{1,2},{3,4}}$.
Thus we have two possibilities: either $sigma({1,2})={1,2}$ and $sigma({3,4})={3,4}$ or $sigma({1,2})={3,4}$ and $sigma({3,4})={1,2}$.
In the first case, we get the possibilities $mathrm{id},(12),(34),(12)(34)$, in the second case, we get the possibilities $(13)(24),(14)(23),(1324),(1423)$
For $sigma in S_5$ we have that $(12)(34) = sigma^{-1}(12)(34)sigma = (sigma(1), sigma(2))(sigma(3), sigma(4))$ holds if and ony if ${sigma({1,2}),sigma({3,4})}={{1,2},{3,4}}$.
Thus we have two possibilities: either $sigma({1,2})={1,2}$ and $sigma({3,4})={3,4}$ or $sigma({1,2})={3,4}$ and $sigma({3,4})={1,2}$.
In the first case, we get the possibilities $mathrm{id},(12),(34),(12)(34)$, in the second case, we get the possibilities $(13)(24),(14)(23),(1324),(1423)$
answered Dec 1 at 21:05
MatheinBoulomenos
7,9961936
7,9961936
add a comment |
add a comment |
There may be a faster way to do this, but the first that comes to mind is to use the fact that $(sigma(1)sigma(2))(sigma(3),sigma(4)) = (12)(34)$ to determine which $sigma$ are possible.
Since $sigma$ is a bijection, $(sigma(1),sigma(2))(sigma(3),sigma(4))$ is written in disjoint cycle notation. Thus $(sigma(1),sigma(2)) = (1,2)$ or $(3,4)$ and $(sigma(3),sigma(4)) = (3,4)$ or $(1,2)$. In any case we see $sigma$ must fix $5$. We can choose any value for $sigma(1)$ in ${1,2,3,4}$. This then determines the value of $sigma(2)$. Once we've chosen $sigma(1)$. The choice of $sigma(3)$ determines $sigma(4)$. With these observations we can list the elements.
$C_{S_5}((12)(34)) = {1, (34), (12), (12)(34), (13)(24), (1324), (1423), (14)(23)}$
add a comment |
There may be a faster way to do this, but the first that comes to mind is to use the fact that $(sigma(1)sigma(2))(sigma(3),sigma(4)) = (12)(34)$ to determine which $sigma$ are possible.
Since $sigma$ is a bijection, $(sigma(1),sigma(2))(sigma(3),sigma(4))$ is written in disjoint cycle notation. Thus $(sigma(1),sigma(2)) = (1,2)$ or $(3,4)$ and $(sigma(3),sigma(4)) = (3,4)$ or $(1,2)$. In any case we see $sigma$ must fix $5$. We can choose any value for $sigma(1)$ in ${1,2,3,4}$. This then determines the value of $sigma(2)$. Once we've chosen $sigma(1)$. The choice of $sigma(3)$ determines $sigma(4)$. With these observations we can list the elements.
$C_{S_5}((12)(34)) = {1, (34), (12), (12)(34), (13)(24), (1324), (1423), (14)(23)}$
add a comment |
There may be a faster way to do this, but the first that comes to mind is to use the fact that $(sigma(1)sigma(2))(sigma(3),sigma(4)) = (12)(34)$ to determine which $sigma$ are possible.
Since $sigma$ is a bijection, $(sigma(1),sigma(2))(sigma(3),sigma(4))$ is written in disjoint cycle notation. Thus $(sigma(1),sigma(2)) = (1,2)$ or $(3,4)$ and $(sigma(3),sigma(4)) = (3,4)$ or $(1,2)$. In any case we see $sigma$ must fix $5$. We can choose any value for $sigma(1)$ in ${1,2,3,4}$. This then determines the value of $sigma(2)$. Once we've chosen $sigma(1)$. The choice of $sigma(3)$ determines $sigma(4)$. With these observations we can list the elements.
$C_{S_5}((12)(34)) = {1, (34), (12), (12)(34), (13)(24), (1324), (1423), (14)(23)}$
There may be a faster way to do this, but the first that comes to mind is to use the fact that $(sigma(1)sigma(2))(sigma(3),sigma(4)) = (12)(34)$ to determine which $sigma$ are possible.
Since $sigma$ is a bijection, $(sigma(1),sigma(2))(sigma(3),sigma(4))$ is written in disjoint cycle notation. Thus $(sigma(1),sigma(2)) = (1,2)$ or $(3,4)$ and $(sigma(3),sigma(4)) = (3,4)$ or $(1,2)$. In any case we see $sigma$ must fix $5$. We can choose any value for $sigma(1)$ in ${1,2,3,4}$. This then determines the value of $sigma(2)$. Once we've chosen $sigma(1)$. The choice of $sigma(3)$ determines $sigma(4)$. With these observations we can list the elements.
$C_{S_5}((12)(34)) = {1, (34), (12), (12)(34), (13)(24), (1324), (1423), (14)(23)}$
answered Dec 1 at 21:08
Sean Haight
675519
675519
add a comment |
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3021706%2ffinding-the-centraliser-of-an-element-in-s-5%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