If $|G|<infty$ acts transitively on a set $X$ with $|X|=10$ then $G$ has an element of order $5$
Let $G$ be a finite group that acts transitively on a set $X$ with $|X|=10$. Show that $exists gin G$ of order $5$
There is a homomorphism $phi:Gmapsto S_{10}$ that sends $gin G$ to its corresponding permutation in $S_{10}$.
So $G$ is isomorphic to a subgroup of $S_{10}$. I want to prove that $G$ contains a $5$-cycle.
Since $G$ acts transitively $forall x,yin {1,2,...,10}~exists gin G$ such that $gx=y.$ Let $x$ be in ${1,2,...,10}$ Let's consider the set $langle grangle x ={x,gx,g^2x,...}$. If it contains $X$ then $g$ is a $10$-cycle and $g^2$ has order $5$.
There must be some cycles in $G$ of length $ge 3$ because if we only have disjoint transpositions $G$ doesn't act transitively.
I think I need some kind of hint.
abstract-algebra group-theory symmetric-groups group-actions
add a comment |
Let $G$ be a finite group that acts transitively on a set $X$ with $|X|=10$. Show that $exists gin G$ of order $5$
There is a homomorphism $phi:Gmapsto S_{10}$ that sends $gin G$ to its corresponding permutation in $S_{10}$.
So $G$ is isomorphic to a subgroup of $S_{10}$. I want to prove that $G$ contains a $5$-cycle.
Since $G$ acts transitively $forall x,yin {1,2,...,10}~exists gin G$ such that $gx=y.$ Let $x$ be in ${1,2,...,10}$ Let's consider the set $langle grangle x ={x,gx,g^2x,...}$. If it contains $X$ then $g$ is a $10$-cycle and $g^2$ has order $5$.
There must be some cycles in $G$ of length $ge 3$ because if we only have disjoint transpositions $G$ doesn't act transitively.
I think I need some kind of hint.
abstract-algebra group-theory symmetric-groups group-actions
add a comment |
Let $G$ be a finite group that acts transitively on a set $X$ with $|X|=10$. Show that $exists gin G$ of order $5$
There is a homomorphism $phi:Gmapsto S_{10}$ that sends $gin G$ to its corresponding permutation in $S_{10}$.
So $G$ is isomorphic to a subgroup of $S_{10}$. I want to prove that $G$ contains a $5$-cycle.
Since $G$ acts transitively $forall x,yin {1,2,...,10}~exists gin G$ such that $gx=y.$ Let $x$ be in ${1,2,...,10}$ Let's consider the set $langle grangle x ={x,gx,g^2x,...}$. If it contains $X$ then $g$ is a $10$-cycle and $g^2$ has order $5$.
There must be some cycles in $G$ of length $ge 3$ because if we only have disjoint transpositions $G$ doesn't act transitively.
I think I need some kind of hint.
abstract-algebra group-theory symmetric-groups group-actions
Let $G$ be a finite group that acts transitively on a set $X$ with $|X|=10$. Show that $exists gin G$ of order $5$
There is a homomorphism $phi:Gmapsto S_{10}$ that sends $gin G$ to its corresponding permutation in $S_{10}$.
So $G$ is isomorphic to a subgroup of $S_{10}$. I want to prove that $G$ contains a $5$-cycle.
Since $G$ acts transitively $forall x,yin {1,2,...,10}~exists gin G$ such that $gx=y.$ Let $x$ be in ${1,2,...,10}$ Let's consider the set $langle grangle x ={x,gx,g^2x,...}$. If it contains $X$ then $g$ is a $10$-cycle and $g^2$ has order $5$.
There must be some cycles in $G$ of length $ge 3$ because if we only have disjoint transpositions $G$ doesn't act transitively.
I think I need some kind of hint.
abstract-algebra group-theory symmetric-groups group-actions
abstract-algebra group-theory symmetric-groups group-actions
edited Jan 5 at 21:30
Matt Samuel
37.4k63665
37.4k63665
asked Jan 5 at 21:23
John CataldoJohn Cataldo
1,0961216
1,0961216
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
This is actually easy. By the orbit-stabilizer theorem $G$ has order divisible by $10$. By Cauchy's theorem it therefore has an element of order $5$.
Could you have used any of the Sylow theorems for this?
– John Cataldo
2 days ago
@John Have you not encountered the orbit stabilizer or Cauchy's theorem?
– Matt Samuel
2 days ago
Yes I have, well, I read about the Cauchy theorem outside of class. But we did prove the Sylow theorems and the orbit-stabilizer theorem so I was interested in a proof using those. And it seems like Cauchy and Sylow are very similar
– John Cataldo
2 days ago
@John The strong version of Sylow's first theorem says that there is a subgroup of order $5$, and that is necessarily cyclic. That usually comes up in the proof. If you just use them out of the box, though, Sylow's theorems don't prove it. Cauchy's theorem is very basic and usually proved before Sylow's theorems.
– Matt Samuel
2 days ago
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%2f3063210%2fif-g-infty-acts-transitively-on-a-set-x-with-x-10-then-g-has-an-ele%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
This is actually easy. By the orbit-stabilizer theorem $G$ has order divisible by $10$. By Cauchy's theorem it therefore has an element of order $5$.
Could you have used any of the Sylow theorems for this?
– John Cataldo
2 days ago
@John Have you not encountered the orbit stabilizer or Cauchy's theorem?
– Matt Samuel
2 days ago
Yes I have, well, I read about the Cauchy theorem outside of class. But we did prove the Sylow theorems and the orbit-stabilizer theorem so I was interested in a proof using those. And it seems like Cauchy and Sylow are very similar
– John Cataldo
2 days ago
@John The strong version of Sylow's first theorem says that there is a subgroup of order $5$, and that is necessarily cyclic. That usually comes up in the proof. If you just use them out of the box, though, Sylow's theorems don't prove it. Cauchy's theorem is very basic and usually proved before Sylow's theorems.
– Matt Samuel
2 days ago
add a comment |
This is actually easy. By the orbit-stabilizer theorem $G$ has order divisible by $10$. By Cauchy's theorem it therefore has an element of order $5$.
Could you have used any of the Sylow theorems for this?
– John Cataldo
2 days ago
@John Have you not encountered the orbit stabilizer or Cauchy's theorem?
– Matt Samuel
2 days ago
Yes I have, well, I read about the Cauchy theorem outside of class. But we did prove the Sylow theorems and the orbit-stabilizer theorem so I was interested in a proof using those. And it seems like Cauchy and Sylow are very similar
– John Cataldo
2 days ago
@John The strong version of Sylow's first theorem says that there is a subgroup of order $5$, and that is necessarily cyclic. That usually comes up in the proof. If you just use them out of the box, though, Sylow's theorems don't prove it. Cauchy's theorem is very basic and usually proved before Sylow's theorems.
– Matt Samuel
2 days ago
add a comment |
This is actually easy. By the orbit-stabilizer theorem $G$ has order divisible by $10$. By Cauchy's theorem it therefore has an element of order $5$.
This is actually easy. By the orbit-stabilizer theorem $G$ has order divisible by $10$. By Cauchy's theorem it therefore has an element of order $5$.
answered Jan 5 at 21:26
Matt SamuelMatt Samuel
37.4k63665
37.4k63665
Could you have used any of the Sylow theorems for this?
– John Cataldo
2 days ago
@John Have you not encountered the orbit stabilizer or Cauchy's theorem?
– Matt Samuel
2 days ago
Yes I have, well, I read about the Cauchy theorem outside of class. But we did prove the Sylow theorems and the orbit-stabilizer theorem so I was interested in a proof using those. And it seems like Cauchy and Sylow are very similar
– John Cataldo
2 days ago
@John The strong version of Sylow's first theorem says that there is a subgroup of order $5$, and that is necessarily cyclic. That usually comes up in the proof. If you just use them out of the box, though, Sylow's theorems don't prove it. Cauchy's theorem is very basic and usually proved before Sylow's theorems.
– Matt Samuel
2 days ago
add a comment |
Could you have used any of the Sylow theorems for this?
– John Cataldo
2 days ago
@John Have you not encountered the orbit stabilizer or Cauchy's theorem?
– Matt Samuel
2 days ago
Yes I have, well, I read about the Cauchy theorem outside of class. But we did prove the Sylow theorems and the orbit-stabilizer theorem so I was interested in a proof using those. And it seems like Cauchy and Sylow are very similar
– John Cataldo
2 days ago
@John The strong version of Sylow's first theorem says that there is a subgroup of order $5$, and that is necessarily cyclic. That usually comes up in the proof. If you just use them out of the box, though, Sylow's theorems don't prove it. Cauchy's theorem is very basic and usually proved before Sylow's theorems.
– Matt Samuel
2 days ago
Could you have used any of the Sylow theorems for this?
– John Cataldo
2 days ago
Could you have used any of the Sylow theorems for this?
– John Cataldo
2 days ago
@John Have you not encountered the orbit stabilizer or Cauchy's theorem?
– Matt Samuel
2 days ago
@John Have you not encountered the orbit stabilizer or Cauchy's theorem?
– Matt Samuel
2 days ago
Yes I have, well, I read about the Cauchy theorem outside of class. But we did prove the Sylow theorems and the orbit-stabilizer theorem so I was interested in a proof using those. And it seems like Cauchy and Sylow are very similar
– John Cataldo
2 days ago
Yes I have, well, I read about the Cauchy theorem outside of class. But we did prove the Sylow theorems and the orbit-stabilizer theorem so I was interested in a proof using those. And it seems like Cauchy and Sylow are very similar
– John Cataldo
2 days ago
@John The strong version of Sylow's first theorem says that there is a subgroup of order $5$, and that is necessarily cyclic. That usually comes up in the proof. If you just use them out of the box, though, Sylow's theorems don't prove it. Cauchy's theorem is very basic and usually proved before Sylow's theorems.
– Matt Samuel
2 days ago
@John The strong version of Sylow's first theorem says that there is a subgroup of order $5$, and that is necessarily cyclic. That usually comes up in the proof. If you just use them out of the box, though, Sylow's theorems don't prove it. Cauchy's theorem is very basic and usually proved before Sylow's theorems.
– Matt Samuel
2 days ago
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%2f3063210%2fif-g-infty-acts-transitively-on-a-set-x-with-x-10-then-g-has-an-ele%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