Group of order $60$ with $20$ elements of order $3$
up vote
2
down vote
favorite
I am trying to show that a group $G$ of order $60$ with $20$ elements of order $3$ is isomorphic to $A_5$.
I know that $A_5$ is the unique simple group of order $60$. I can conclude if I show that $n_5 = 6$.
I know $n_3 = 10$. I have made multiple attempts, counting arguments don't seem to be working. Most successful so far I showed that if $H$ is a non trivial normal subgroup of $G$, if $3$ divides $|H|$ then $H$ must have order $30$.
I am out of ideas.
group-theory finite-groups
add a comment |
up vote
2
down vote
favorite
I am trying to show that a group $G$ of order $60$ with $20$ elements of order $3$ is isomorphic to $A_5$.
I know that $A_5$ is the unique simple group of order $60$. I can conclude if I show that $n_5 = 6$.
I know $n_3 = 10$. I have made multiple attempts, counting arguments don't seem to be working. Most successful so far I showed that if $H$ is a non trivial normal subgroup of $G$, if $3$ divides $|H|$ then $H$ must have order $30$.
I am out of ideas.
group-theory finite-groups
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
I am trying to show that a group $G$ of order $60$ with $20$ elements of order $3$ is isomorphic to $A_5$.
I know that $A_5$ is the unique simple group of order $60$. I can conclude if I show that $n_5 = 6$.
I know $n_3 = 10$. I have made multiple attempts, counting arguments don't seem to be working. Most successful so far I showed that if $H$ is a non trivial normal subgroup of $G$, if $3$ divides $|H|$ then $H$ must have order $30$.
I am out of ideas.
group-theory finite-groups
I am trying to show that a group $G$ of order $60$ with $20$ elements of order $3$ is isomorphic to $A_5$.
I know that $A_5$ is the unique simple group of order $60$. I can conclude if I show that $n_5 = 6$.
I know $n_3 = 10$. I have made multiple attempts, counting arguments don't seem to be working. Most successful so far I showed that if $H$ is a non trivial normal subgroup of $G$, if $3$ divides $|H|$ then $H$ must have order $30$.
I am out of ideas.
group-theory finite-groups
group-theory finite-groups
edited Nov 27 at 23:33
the_fox
2,3191430
2,3191430
asked Nov 27 at 17:45
pureundergrad
497110
497110
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
up vote
3
down vote
accepted
I think the following argument works.
Suppose that $n_5 neq 6$. The only other possible value is $1$, so $n_5=1$. Let $P$ be the unique (i.e. normal) Sylow $5$-subgroup of $G$, and let $Q$ be a Sylow $3$-subgroup of $G$. Since there are exactly $20$ elements of order $3$ in $G$, it follows that $|N_G(Q)|=6$.
But $P$ is normal in $G$, thus it permutes with every other subgroup. In particular, $PQ$ is a subgroup of $G$ and it has order $15$. Now every group of order $15$ is abelian, so $P$ centralises $Q$ and therefore $P leq N_G(Q)$. This implies that $|P| = 5 mid 6 = |N_G(Q)|$, a contradiction.
So we see that $n_5=6$, and from this it follows that $G cong A_5$. (I'm not providing a proof of this last claim because in your question you mention that you know this.)
add a comment |
up vote
2
down vote
Another approach is to use the counting portion of Philip Hall's generalization of Sylow's theorem to Hall subgroups of solvable groups.* That implies in particular that in any solvable group the number of $p$-Sylows is not only congruent to $1pmod p$ but also a product of prime powers each of which is congruent to $1 pmod p$. This shows immediately that no solvable group can have $n_3=10$. But since $A_5$ is the smallest non-abelian simple group, it is the only non-solvable group of order $60$.
- The full statement is that for any solvable finite group $G$ and set of primes $pi$, then
(1) There exist Hall-$pi$ subgroups (of order divisible only by primes in $pi$ and index relatively prime to all primes in $pi$)
(2) All Hall-$pi$ subgroups are conjugate
(3) The number of Hall-$pi$ subgroups is a product of prime powers that are orders of chief factors of $G$, each of which is congruent to $1$ modulo some prime in $pi$.
Here a chief factor is a factor group in chief series, which is just like a composition series except that all the groups in the series are normal in $G$, not just in the next group up. Chief factors are always direct products of one or more copies of the same simple group. For solvable groups, this means they are elementary abelian and therefore have prime power order.
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',
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%2f3016075%2fgroup-of-order-60-with-20-elements-of-order-3%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
up vote
3
down vote
accepted
I think the following argument works.
Suppose that $n_5 neq 6$. The only other possible value is $1$, so $n_5=1$. Let $P$ be the unique (i.e. normal) Sylow $5$-subgroup of $G$, and let $Q$ be a Sylow $3$-subgroup of $G$. Since there are exactly $20$ elements of order $3$ in $G$, it follows that $|N_G(Q)|=6$.
But $P$ is normal in $G$, thus it permutes with every other subgroup. In particular, $PQ$ is a subgroup of $G$ and it has order $15$. Now every group of order $15$ is abelian, so $P$ centralises $Q$ and therefore $P leq N_G(Q)$. This implies that $|P| = 5 mid 6 = |N_G(Q)|$, a contradiction.
So we see that $n_5=6$, and from this it follows that $G cong A_5$. (I'm not providing a proof of this last claim because in your question you mention that you know this.)
add a comment |
up vote
3
down vote
accepted
I think the following argument works.
Suppose that $n_5 neq 6$. The only other possible value is $1$, so $n_5=1$. Let $P$ be the unique (i.e. normal) Sylow $5$-subgroup of $G$, and let $Q$ be a Sylow $3$-subgroup of $G$. Since there are exactly $20$ elements of order $3$ in $G$, it follows that $|N_G(Q)|=6$.
But $P$ is normal in $G$, thus it permutes with every other subgroup. In particular, $PQ$ is a subgroup of $G$ and it has order $15$. Now every group of order $15$ is abelian, so $P$ centralises $Q$ and therefore $P leq N_G(Q)$. This implies that $|P| = 5 mid 6 = |N_G(Q)|$, a contradiction.
So we see that $n_5=6$, and from this it follows that $G cong A_5$. (I'm not providing a proof of this last claim because in your question you mention that you know this.)
add a comment |
up vote
3
down vote
accepted
up vote
3
down vote
accepted
I think the following argument works.
Suppose that $n_5 neq 6$. The only other possible value is $1$, so $n_5=1$. Let $P$ be the unique (i.e. normal) Sylow $5$-subgroup of $G$, and let $Q$ be a Sylow $3$-subgroup of $G$. Since there are exactly $20$ elements of order $3$ in $G$, it follows that $|N_G(Q)|=6$.
But $P$ is normal in $G$, thus it permutes with every other subgroup. In particular, $PQ$ is a subgroup of $G$ and it has order $15$. Now every group of order $15$ is abelian, so $P$ centralises $Q$ and therefore $P leq N_G(Q)$. This implies that $|P| = 5 mid 6 = |N_G(Q)|$, a contradiction.
So we see that $n_5=6$, and from this it follows that $G cong A_5$. (I'm not providing a proof of this last claim because in your question you mention that you know this.)
I think the following argument works.
Suppose that $n_5 neq 6$. The only other possible value is $1$, so $n_5=1$. Let $P$ be the unique (i.e. normal) Sylow $5$-subgroup of $G$, and let $Q$ be a Sylow $3$-subgroup of $G$. Since there are exactly $20$ elements of order $3$ in $G$, it follows that $|N_G(Q)|=6$.
But $P$ is normal in $G$, thus it permutes with every other subgroup. In particular, $PQ$ is a subgroup of $G$ and it has order $15$. Now every group of order $15$ is abelian, so $P$ centralises $Q$ and therefore $P leq N_G(Q)$. This implies that $|P| = 5 mid 6 = |N_G(Q)|$, a contradiction.
So we see that $n_5=6$, and from this it follows that $G cong A_5$. (I'm not providing a proof of this last claim because in your question you mention that you know this.)
edited Nov 29 at 10:56
answered Nov 27 at 23:24
the_fox
2,3191430
2,3191430
add a comment |
add a comment |
up vote
2
down vote
Another approach is to use the counting portion of Philip Hall's generalization of Sylow's theorem to Hall subgroups of solvable groups.* That implies in particular that in any solvable group the number of $p$-Sylows is not only congruent to $1pmod p$ but also a product of prime powers each of which is congruent to $1 pmod p$. This shows immediately that no solvable group can have $n_3=10$. But since $A_5$ is the smallest non-abelian simple group, it is the only non-solvable group of order $60$.
- The full statement is that for any solvable finite group $G$ and set of primes $pi$, then
(1) There exist Hall-$pi$ subgroups (of order divisible only by primes in $pi$ and index relatively prime to all primes in $pi$)
(2) All Hall-$pi$ subgroups are conjugate
(3) The number of Hall-$pi$ subgroups is a product of prime powers that are orders of chief factors of $G$, each of which is congruent to $1$ modulo some prime in $pi$.
Here a chief factor is a factor group in chief series, which is just like a composition series except that all the groups in the series are normal in $G$, not just in the next group up. Chief factors are always direct products of one or more copies of the same simple group. For solvable groups, this means they are elementary abelian and therefore have prime power order.
add a comment |
up vote
2
down vote
Another approach is to use the counting portion of Philip Hall's generalization of Sylow's theorem to Hall subgroups of solvable groups.* That implies in particular that in any solvable group the number of $p$-Sylows is not only congruent to $1pmod p$ but also a product of prime powers each of which is congruent to $1 pmod p$. This shows immediately that no solvable group can have $n_3=10$. But since $A_5$ is the smallest non-abelian simple group, it is the only non-solvable group of order $60$.
- The full statement is that for any solvable finite group $G$ and set of primes $pi$, then
(1) There exist Hall-$pi$ subgroups (of order divisible only by primes in $pi$ and index relatively prime to all primes in $pi$)
(2) All Hall-$pi$ subgroups are conjugate
(3) The number of Hall-$pi$ subgroups is a product of prime powers that are orders of chief factors of $G$, each of which is congruent to $1$ modulo some prime in $pi$.
Here a chief factor is a factor group in chief series, which is just like a composition series except that all the groups in the series are normal in $G$, not just in the next group up. Chief factors are always direct products of one or more copies of the same simple group. For solvable groups, this means they are elementary abelian and therefore have prime power order.
add a comment |
up vote
2
down vote
up vote
2
down vote
Another approach is to use the counting portion of Philip Hall's generalization of Sylow's theorem to Hall subgroups of solvable groups.* That implies in particular that in any solvable group the number of $p$-Sylows is not only congruent to $1pmod p$ but also a product of prime powers each of which is congruent to $1 pmod p$. This shows immediately that no solvable group can have $n_3=10$. But since $A_5$ is the smallest non-abelian simple group, it is the only non-solvable group of order $60$.
- The full statement is that for any solvable finite group $G$ and set of primes $pi$, then
(1) There exist Hall-$pi$ subgroups (of order divisible only by primes in $pi$ and index relatively prime to all primes in $pi$)
(2) All Hall-$pi$ subgroups are conjugate
(3) The number of Hall-$pi$ subgroups is a product of prime powers that are orders of chief factors of $G$, each of which is congruent to $1$ modulo some prime in $pi$.
Here a chief factor is a factor group in chief series, which is just like a composition series except that all the groups in the series are normal in $G$, not just in the next group up. Chief factors are always direct products of one or more copies of the same simple group. For solvable groups, this means they are elementary abelian and therefore have prime power order.
Another approach is to use the counting portion of Philip Hall's generalization of Sylow's theorem to Hall subgroups of solvable groups.* That implies in particular that in any solvable group the number of $p$-Sylows is not only congruent to $1pmod p$ but also a product of prime powers each of which is congruent to $1 pmod p$. This shows immediately that no solvable group can have $n_3=10$. But since $A_5$ is the smallest non-abelian simple group, it is the only non-solvable group of order $60$.
- The full statement is that for any solvable finite group $G$ and set of primes $pi$, then
(1) There exist Hall-$pi$ subgroups (of order divisible only by primes in $pi$ and index relatively prime to all primes in $pi$)
(2) All Hall-$pi$ subgroups are conjugate
(3) The number of Hall-$pi$ subgroups is a product of prime powers that are orders of chief factors of $G$, each of which is congruent to $1$ modulo some prime in $pi$.
Here a chief factor is a factor group in chief series, which is just like a composition series except that all the groups in the series are normal in $G$, not just in the next group up. Chief factors are always direct products of one or more copies of the same simple group. For solvable groups, this means they are elementary abelian and therefore have prime power order.
answered Nov 28 at 3:11
C Monsour
5,762224
5,762224
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%2f3016075%2fgroup-of-order-60-with-20-elements-of-order-3%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