Prove that permutation group is automorphism group of some structure
$begingroup$
Let $G$ be a permutation group on $X= { x_1,x_2,...,x_n}$
Prove that $Aut(X,G)=G$
I have no ideas how to prove it.
Besides, there is a question that the problem asks to prove $Aut(X,G) = G $ , i.e. prove automorphism group with the structure (permutation group G) is the permutation group.
But, in context the textbook says that we indeed prove every permutation group is the automorphism group of some object .
What's the connected?
Here are some definitions from textbook
group-theory permutations automorphism-group
asked Dec 12 '18 at 16:56
matchzmatchz
515
$endgroup$
add a comment |
$begingroup$
Let $G$ be a permutation group on $X= { x_1,x_2,...,x_n}$
Prove that $Aut(X,G)=G$
I have no ideas how to prove it.
Besides, there is a question that the problem asks to prove $Aut(X,G) = G $ , i.e. prove automorphism group with the structure (permutation group G) is the permutation group.
But, in context the textbook says that we indeed prove every permutation group is the automorphism group of some object .
What's the connected?
Here are some definitions from textbook
group-theory permutations automorphism-group
asked Dec 12 '18 at 16:56
matchzmatchz
515
$endgroup$
add a comment |
$begingroup$
Let $G$ be a permutation group on $X= { x_1,x_2,...,x_n}$
Prove that $Aut(X,G)=G$
I have no ideas how to prove it.
Besides, there is a question that the problem asks to prove $Aut(X,G) = G $ , i.e. prove automorphism group with the structure (permutation group G) is the permutation group.
But, in context the textbook says that we indeed prove every permutation group is the automorphism group of some object .
What's the connected?
Here are some definitions from textbook
group-theory permutations automorphism-group
asked Dec 12 '18 at 16:56
matchzmatchz
515
$endgroup$
Let $G$ be a permutation group on $X= { x_1,x_2,...,x_n}$
Prove that $Aut(X,G)=G$
I have no ideas how to prove it.
Besides, there is a question that the problem asks to prove $Aut(X,G) = G $ , i.e. prove automorphism group with the structure (permutation group G) is the permutation group.
But, in context the textbook says that we indeed prove every permutation group is the automorphism group of some object .
What's the connected?
Here are some definitions from textbook
group-theory permutations automorphism-group
group-theory permutations automorphism-group
asked Dec 12 '18 at 16:56
matchzmatchz
515
asked Dec 12 '18 at 16:56
matchzmatchz
515
asked Dec 12 '18 at 16:56
matchzmatchz
515
asked Dec 12 '18 at 16:56
matchzmatchz
515
asked Dec 12 '18 at 16:56
matchzmatchz
515
515
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
By definition $operatorname{Aut}(X,G)$ is a subset of $S(X)$, the group of all permutations of $X$. By definition a permutation $sigmain S(X)$ is an automorphism of $(X,G)$ if and only if $Gsigma=G$. In particular this implies that $esigma=sigmain G$, which shows that $operatorname{Aut}(X,G)subset G$. On the other hand, for all $gin G$ you have $Gg=G$ and hence $ginoperatorname{Aut}(X,G)$, which shows that $Gsubsetoperatorname{Aut}(X,G)$. Hence $operatorname{Aut}(X,G)=G$.
This shows that $G$ is the automorphism group of $(X,G)$. As $G$ was an arbitrary permutation group to begin with, this proves that every permutation group is an automorphism group.
answered Dec 12 '18 at 17:07
ServaesServaes
23.6k33893
$endgroup$
$begingroup$
Thanks! I have realized almost things but the $esigma=sigmain G$. The $sigma$ is permutation like $(g_1) sigma = g_2$. How can I derive it?
$endgroup$
– matchz
Dec 12 '18 at 18:31
$begingroup$
Well $g_1,g_2in G$ and $G$ is a group, so $g_1^{-1}g_2in G$.
$endgroup$
– Servaes
Dec 12 '18 at 18:37
$begingroup$
Or $sigma$ is not a permutation function ($S(X)$)? how to say a function is a element in $G$
$endgroup$
– matchz
Dec 12 '18 at 18:58
$begingroup$
By definition $G$ is a subset of $S(X)$.
$endgroup$
– Servaes
Dec 12 '18 at 20:24
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%2f3036939%2fprove-that-permutation-group-is-automorphism-group-of-some-structure%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
$begingroup$
By definition $operatorname{Aut}(X,G)$ is a subset of $S(X)$, the group of all permutations of $X$. By definition a permutation $sigmain S(X)$ is an automorphism of $(X,G)$ if and only if $Gsigma=G$. In particular this implies that $esigma=sigmain G$, which shows that $operatorname{Aut}(X,G)subset G$. On the other hand, for all $gin G$ you have $Gg=G$ and hence $ginoperatorname{Aut}(X,G)$, which shows that $Gsubsetoperatorname{Aut}(X,G)$. Hence $operatorname{Aut}(X,G)=G$.
This shows that $G$ is the automorphism group of $(X,G)$. As $G$ was an arbitrary permutation group to begin with, this proves that every permutation group is an automorphism group.
answered Dec 12 '18 at 17:07
ServaesServaes
23.6k33893
$endgroup$
$begingroup$
Thanks! I have realized almost things but the $esigma=sigmain G$. The $sigma$ is permutation like $(g_1) sigma = g_2$. How can I derive it?
$endgroup$
– matchz
Dec 12 '18 at 18:31
$begingroup$
Well $g_1,g_2in G$ and $G$ is a group, so $g_1^{-1}g_2in G$.
$endgroup$
– Servaes
Dec 12 '18 at 18:37
$begingroup$
Or $sigma$ is not a permutation function ($S(X)$)? how to say a function is a element in $G$
$endgroup$
– matchz
Dec 12 '18 at 18:58
$begingroup$
By definition $G$ is a subset of $S(X)$.
$endgroup$
– Servaes
Dec 12 '18 at 20:24
add a comment |
$begingroup$
By definition $operatorname{Aut}(X,G)$ is a subset of $S(X)$, the group of all permutations of $X$. By definition a permutation $sigmain S(X)$ is an automorphism of $(X,G)$ if and only if $Gsigma=G$. In particular this implies that $esigma=sigmain G$, which shows that $operatorname{Aut}(X,G)subset G$. On the other hand, for all $gin G$ you have $Gg=G$ and hence $ginoperatorname{Aut}(X,G)$, which shows that $Gsubsetoperatorname{Aut}(X,G)$. Hence $operatorname{Aut}(X,G)=G$.
This shows that $G$ is the automorphism group of $(X,G)$. As $G$ was an arbitrary permutation group to begin with, this proves that every permutation group is an automorphism group.
answered Dec 12 '18 at 17:07
ServaesServaes
23.6k33893
$endgroup$
$begingroup$
Thanks! I have realized almost things but the $esigma=sigmain G$. The $sigma$ is permutation like $(g_1) sigma = g_2$. How can I derive it?
$endgroup$
– matchz
Dec 12 '18 at 18:31
$begingroup$
Well $g_1,g_2in G$ and $G$ is a group, so $g_1^{-1}g_2in G$.
$endgroup$
– Servaes
Dec 12 '18 at 18:37
$begingroup$
Or $sigma$ is not a permutation function ($S(X)$)? how to say a function is a element in $G$
$endgroup$
– matchz
Dec 12 '18 at 18:58
$begingroup$
By definition $G$ is a subset of $S(X)$.
$endgroup$
– Servaes
Dec 12 '18 at 20:24
add a comment |
$begingroup$
By definition $operatorname{Aut}(X,G)$ is a subset of $S(X)$, the group of all permutations of $X$. By definition a permutation $sigmain S(X)$ is an automorphism of $(X,G)$ if and only if $Gsigma=G$. In particular this implies that $esigma=sigmain G$, which shows that $operatorname{Aut}(X,G)subset G$. On the other hand, for all $gin G$ you have $Gg=G$ and hence $ginoperatorname{Aut}(X,G)$, which shows that $Gsubsetoperatorname{Aut}(X,G)$. Hence $operatorname{Aut}(X,G)=G$.
This shows that $G$ is the automorphism group of $(X,G)$. As $G$ was an arbitrary permutation group to begin with, this proves that every permutation group is an automorphism group.
answered Dec 12 '18 at 17:07
ServaesServaes
23.6k33893
$endgroup$
By definition $operatorname{Aut}(X,G)$ is a subset of $S(X)$, the group of all permutations of $X$. By definition a permutation $sigmain S(X)$ is an automorphism of $(X,G)$ if and only if $Gsigma=G$. In particular this implies that $esigma=sigmain G$, which shows that $operatorname{Aut}(X,G)subset G$. On the other hand, for all $gin G$ you have $Gg=G$ and hence $ginoperatorname{Aut}(X,G)$, which shows that $Gsubsetoperatorname{Aut}(X,G)$. Hence $operatorname{Aut}(X,G)=G$.
This shows that $G$ is the automorphism group of $(X,G)$. As $G$ was an arbitrary permutation group to begin with, this proves that every permutation group is an automorphism group.
answered Dec 12 '18 at 17:07
ServaesServaes
23.6k33893
answered Dec 12 '18 at 17:07
ServaesServaes
23.6k33893
answered Dec 12 '18 at 17:07
ServaesServaes
23.6k33893
answered Dec 12 '18 at 17:07
ServaesServaes
23.6k33893
23.6k33893
$begingroup$
Thanks! I have realized almost things but the $esigma=sigmain G$. The $sigma$ is permutation like $(g_1) sigma = g_2$. How can I derive it?
$endgroup$
– matchz
Dec 12 '18 at 18:31
$begingroup$
Well $g_1,g_2in G$ and $G$ is a group, so $g_1^{-1}g_2in G$.
$endgroup$
– Servaes
Dec 12 '18 at 18:37
$begingroup$
Or $sigma$ is not a permutation function ($S(X)$)? how to say a function is a element in $G$
$endgroup$
– matchz
Dec 12 '18 at 18:58
$begingroup$
By definition $G$ is a subset of $S(X)$.
$endgroup$
– Servaes
Dec 12 '18 at 20:24
add a comment |
$begingroup$
Thanks! I have realized almost things but the $esigma=sigmain G$. The $sigma$ is permutation like $(g_1) sigma = g_2$. How can I derive it?
$endgroup$
– matchz
Dec 12 '18 at 18:31
$begingroup$
Well $g_1,g_2in G$ and $G$ is a group, so $g_1^{-1}g_2in G$.
$endgroup$
– Servaes
Dec 12 '18 at 18:37
$begingroup$
Or $sigma$ is not a permutation function ($S(X)$)? how to say a function is a element in $G$
$endgroup$
– matchz
Dec 12 '18 at 18:58
$begingroup$
By definition $G$ is a subset of $S(X)$.
$endgroup$
– Servaes
Dec 12 '18 at 20:24
$begingroup$
Thanks! I have realized almost things but the $esigma=sigmain G$. The $sigma$ is permutation like $(g_1) sigma = g_2$. How can I derive it?
$endgroup$
– matchz
Dec 12 '18 at 18:31
$begingroup$
Thanks! I have realized almost things but the $esigma=sigmain G$. The $sigma$ is permutation like $(g_1) sigma = g_2$. How can I derive it?
$endgroup$
– matchz
Dec 12 '18 at 18:31
$begingroup$
Well $g_1,g_2in G$ and $G$ is a group, so $g_1^{-1}g_2in G$.
$endgroup$
– Servaes
Dec 12 '18 at 18:37
$begingroup$
Well $g_1,g_2in G$ and $G$ is a group, so $g_1^{-1}g_2in G$.
$endgroup$
– Servaes
Dec 12 '18 at 18:37
$begingroup$
Or $sigma$ is not a permutation function ($S(X)$)? how to say a function is a element in $G$
$endgroup$
– matchz
Dec 12 '18 at 18:58
$begingroup$
Or $sigma$ is not a permutation function ($S(X)$)? how to say a function is a element in $G$
$endgroup$
– matchz
Dec 12 '18 at 18:58
$begingroup$
By definition $G$ is a subset of $S(X)$.
$endgroup$
– Servaes
Dec 12 '18 at 20:24
$begingroup$
By definition $G$ is a subset of $S(X)$.
$endgroup$
– Servaes
Dec 12 '18 at 20:24
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%2f3036939%2fprove-that-permutation-group-is-automorphism-group-of-some-structure%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
