If a prime $p$ divides the order of a group $G$ and $p^2 > |G|$, then there is a normal subgroup of order...
$begingroup$
I was wondering if there were a way to prove this without invoking the full force of the Sylow theorems. Here is my attempt:
Suppose $G$ is a group, a $p$ prime divides its order, and $p^2 > |G|$. By Cauchy's theorem, there exists a subgroup $H$ such that $|H| = p$. Suppose there exists another subgroup $K$, $|K| = p$, $K neq H$. Since $H$ and $K$ are of prime order, any nontrivial element in each generates the entire subgroup, so we must have $H cap K = {e}$. By counting argument, we have $$ |HK| = frac{|H| |K|}{|H cap K|} = p^2 > |G|,$$ contradicting $HK subseteq G$. Therefore, such a $K$ does not exist, and we conclude $H$ is the unique subgroup of $G$ of order $p$.
This uniqueness implies $H triangleleft G$: for all $g in G$, $gHg^{-1}$ is a subgroup of order $p$, so we must have $gHg^{-1} = H, forall g in G$.
Is there anything inconsistent in this proof? If not, are there even more elementary proofs?
abstract-algebra group-theory proof-verification
$endgroup$
add a comment |
$begingroup$
I was wondering if there were a way to prove this without invoking the full force of the Sylow theorems. Here is my attempt:
Suppose $G$ is a group, a $p$ prime divides its order, and $p^2 > |G|$. By Cauchy's theorem, there exists a subgroup $H$ such that $|H| = p$. Suppose there exists another subgroup $K$, $|K| = p$, $K neq H$. Since $H$ and $K$ are of prime order, any nontrivial element in each generates the entire subgroup, so we must have $H cap K = {e}$. By counting argument, we have $$ |HK| = frac{|H| |K|}{|H cap K|} = p^2 > |G|,$$ contradicting $HK subseteq G$. Therefore, such a $K$ does not exist, and we conclude $H$ is the unique subgroup of $G$ of order $p$.
This uniqueness implies $H triangleleft G$: for all $g in G$, $gHg^{-1}$ is a subgroup of order $p$, so we must have $gHg^{-1} = H, forall g in G$.
Is there anything inconsistent in this proof? If not, are there even more elementary proofs?
abstract-algebra group-theory proof-verification
$endgroup$
add a comment |
$begingroup$
I was wondering if there were a way to prove this without invoking the full force of the Sylow theorems. Here is my attempt:
Suppose $G$ is a group, a $p$ prime divides its order, and $p^2 > |G|$. By Cauchy's theorem, there exists a subgroup $H$ such that $|H| = p$. Suppose there exists another subgroup $K$, $|K| = p$, $K neq H$. Since $H$ and $K$ are of prime order, any nontrivial element in each generates the entire subgroup, so we must have $H cap K = {e}$. By counting argument, we have $$ |HK| = frac{|H| |K|}{|H cap K|} = p^2 > |G|,$$ contradicting $HK subseteq G$. Therefore, such a $K$ does not exist, and we conclude $H$ is the unique subgroup of $G$ of order $p$.
This uniqueness implies $H triangleleft G$: for all $g in G$, $gHg^{-1}$ is a subgroup of order $p$, so we must have $gHg^{-1} = H, forall g in G$.
Is there anything inconsistent in this proof? If not, are there even more elementary proofs?
abstract-algebra group-theory proof-verification
$endgroup$
I was wondering if there were a way to prove this without invoking the full force of the Sylow theorems. Here is my attempt:
Suppose $G$ is a group, a $p$ prime divides its order, and $p^2 > |G|$. By Cauchy's theorem, there exists a subgroup $H$ such that $|H| = p$. Suppose there exists another subgroup $K$, $|K| = p$, $K neq H$. Since $H$ and $K$ are of prime order, any nontrivial element in each generates the entire subgroup, so we must have $H cap K = {e}$. By counting argument, we have $$ |HK| = frac{|H| |K|}{|H cap K|} = p^2 > |G|,$$ contradicting $HK subseteq G$. Therefore, such a $K$ does not exist, and we conclude $H$ is the unique subgroup of $G$ of order $p$.
This uniqueness implies $H triangleleft G$: for all $g in G$, $gHg^{-1}$ is a subgroup of order $p$, so we must have $gHg^{-1} = H, forall g in G$.
Is there anything inconsistent in this proof? If not, are there even more elementary proofs?
abstract-algebra group-theory proof-verification
abstract-algebra group-theory proof-verification
asked Jan 21 at 0:22
t.yt.y
427
427
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, that argument is correct.
Another way to prove it: Let $|G|=pm$ and $H$ be an order p subgroup. Then the action of $G$ on the cosets of $H$ gives a homomorphism from $G$ to $S_m$. The action is transitive on the $m$ cosets of $H$. Also, $H$ is in the kernel since p does not divide $|S_m|$. Since $H$ has index m, it must be the entire kernel, and thus normal
$endgroup$
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%2f3081315%2fif-a-prime-p-divides-the-order-of-a-group-g-and-p2-g-then-there-is-a%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$
Yes, that argument is correct.
Another way to prove it: Let $|G|=pm$ and $H$ be an order p subgroup. Then the action of $G$ on the cosets of $H$ gives a homomorphism from $G$ to $S_m$. The action is transitive on the $m$ cosets of $H$. Also, $H$ is in the kernel since p does not divide $|S_m|$. Since $H$ has index m, it must be the entire kernel, and thus normal
$endgroup$
add a comment |
$begingroup$
Yes, that argument is correct.
Another way to prove it: Let $|G|=pm$ and $H$ be an order p subgroup. Then the action of $G$ on the cosets of $H$ gives a homomorphism from $G$ to $S_m$. The action is transitive on the $m$ cosets of $H$. Also, $H$ is in the kernel since p does not divide $|S_m|$. Since $H$ has index m, it must be the entire kernel, and thus normal
$endgroup$
add a comment |
$begingroup$
Yes, that argument is correct.
Another way to prove it: Let $|G|=pm$ and $H$ be an order p subgroup. Then the action of $G$ on the cosets of $H$ gives a homomorphism from $G$ to $S_m$. The action is transitive on the $m$ cosets of $H$. Also, $H$ is in the kernel since p does not divide $|S_m|$. Since $H$ has index m, it must be the entire kernel, and thus normal
$endgroup$
Yes, that argument is correct.
Another way to prove it: Let $|G|=pm$ and $H$ be an order p subgroup. Then the action of $G$ on the cosets of $H$ gives a homomorphism from $G$ to $S_m$. The action is transitive on the $m$ cosets of $H$. Also, $H$ is in the kernel since p does not divide $|S_m|$. Since $H$ has index m, it must be the entire kernel, and thus normal
edited Jan 21 at 0:48
answered Jan 21 at 0:33
C MonsourC Monsour
6,2541325
6,2541325
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.
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%2f3081315%2fif-a-prime-p-divides-the-order-of-a-group-g-and-p2-g-then-there-is-a%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