Existence of elements of order $p^k$ in a finite group












1














By Cauchy's theorem, if a prime number $p$ divides the order of a group $G$, then there is an element $g$ in $G$ whose order is $p$. In addition, if $|G|$ admits a prime decomposition with a factor $p^k$, then Sylow's theorem tells us that a subgroup of order $p^k$ must exist.



My question is the following. If $|G|$ admits a prime decomposition with a factor $p^k$, does this imply that an element of order $p^k$ must exist in $G$?



Update: As explained in Mindlack's answer (among others), the implication does not hold and simple counterexamples exist. In the comments, Mindlack discusses special cases where such an element exists.










share|cite|improve this question




















  • 2




    It's good to keep small examples of finite groups in mind. Here, the non-cyclic group of order $4$ is already a counterexample.
    – lulu
    Dec 13 '18 at 11:01
















1














By Cauchy's theorem, if a prime number $p$ divides the order of a group $G$, then there is an element $g$ in $G$ whose order is $p$. In addition, if $|G|$ admits a prime decomposition with a factor $p^k$, then Sylow's theorem tells us that a subgroup of order $p^k$ must exist.



My question is the following. If $|G|$ admits a prime decomposition with a factor $p^k$, does this imply that an element of order $p^k$ must exist in $G$?



Update: As explained in Mindlack's answer (among others), the implication does not hold and simple counterexamples exist. In the comments, Mindlack discusses special cases where such an element exists.










share|cite|improve this question




















  • 2




    It's good to keep small examples of finite groups in mind. Here, the non-cyclic group of order $4$ is already a counterexample.
    – lulu
    Dec 13 '18 at 11:01














1












1








1







By Cauchy's theorem, if a prime number $p$ divides the order of a group $G$, then there is an element $g$ in $G$ whose order is $p$. In addition, if $|G|$ admits a prime decomposition with a factor $p^k$, then Sylow's theorem tells us that a subgroup of order $p^k$ must exist.



My question is the following. If $|G|$ admits a prime decomposition with a factor $p^k$, does this imply that an element of order $p^k$ must exist in $G$?



Update: As explained in Mindlack's answer (among others), the implication does not hold and simple counterexamples exist. In the comments, Mindlack discusses special cases where such an element exists.










share|cite|improve this question















By Cauchy's theorem, if a prime number $p$ divides the order of a group $G$, then there is an element $g$ in $G$ whose order is $p$. In addition, if $|G|$ admits a prime decomposition with a factor $p^k$, then Sylow's theorem tells us that a subgroup of order $p^k$ must exist.



My question is the following. If $|G|$ admits a prime decomposition with a factor $p^k$, does this imply that an element of order $p^k$ must exist in $G$?



Update: As explained in Mindlack's answer (among others), the implication does not hold and simple counterexamples exist. In the comments, Mindlack discusses special cases where such an element exists.







group-theory finite-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 13 '18 at 20:04







Arnaud Casteigts

















asked Dec 13 '18 at 10:23









Arnaud CasteigtsArnaud Casteigts

83




83








  • 2




    It's good to keep small examples of finite groups in mind. Here, the non-cyclic group of order $4$ is already a counterexample.
    – lulu
    Dec 13 '18 at 11:01














  • 2




    It's good to keep small examples of finite groups in mind. Here, the non-cyclic group of order $4$ is already a counterexample.
    – lulu
    Dec 13 '18 at 11:01








2




2




It's good to keep small examples of finite groups in mind. Here, the non-cyclic group of order $4$ is already a counterexample.
– lulu
Dec 13 '18 at 11:01




It's good to keep small examples of finite groups in mind. Here, the non-cyclic group of order $4$ is already a counterexample.
– lulu
Dec 13 '18 at 11:01










3 Answers
3






active

oldest

votes


















5














No, because that would imply that $G$ has a cyclic Sylow subgroup, which is not always true. A simple example: $G=mathbb{F}_p^2$ for addition.






share|cite|improve this answer





















  • Your answer seem to suggest that such an element could however exist in some cases. If we restrict G to be the symmetric group (of any order), would your answer change? (If so, I'll update the question accordingly.) Thanks.
    – Arnaud Casteigts
    Dec 13 '18 at 11:00










  • if $n$ is large enough and $p$ is any prime factor of $n!$ (say, $p < n/2$), the corresponding $p$-Sylow has cardinality $p^k$, where $k>n/p -1$. To have an element of corresponding order, you need that $p^k leq n$. If this holds, then $k geq 2$ thus $n geq p^2$ hence by Legendre $k geq n/p$ and $n geq p^k > kp geq n$. Thus, in a symmetric group $S_n$, there is a cyclic $p$-Sylow iff $p > n/2$, when, say, $n geq 5$.
    – Mindlack
    Dec 13 '18 at 11:33



















2














No, $G= C_p times cdots times C_p$ ($k$ factors) has order $p^k$ but all nontrivial elements have order $p$.






share|cite|improve this answer





























    1














    No. $mathbb{Z}_2 oplus mathbb{Z}_2$ has order $2^2$ but no elements of order $2^2$.






    share|cite|improve this answer





















      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
      });


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037841%2fexistence-of-elements-of-order-pk-in-a-finite-group%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      5














      No, because that would imply that $G$ has a cyclic Sylow subgroup, which is not always true. A simple example: $G=mathbb{F}_p^2$ for addition.






      share|cite|improve this answer





















      • Your answer seem to suggest that such an element could however exist in some cases. If we restrict G to be the symmetric group (of any order), would your answer change? (If so, I'll update the question accordingly.) Thanks.
        – Arnaud Casteigts
        Dec 13 '18 at 11:00










      • if $n$ is large enough and $p$ is any prime factor of $n!$ (say, $p < n/2$), the corresponding $p$-Sylow has cardinality $p^k$, where $k>n/p -1$. To have an element of corresponding order, you need that $p^k leq n$. If this holds, then $k geq 2$ thus $n geq p^2$ hence by Legendre $k geq n/p$ and $n geq p^k > kp geq n$. Thus, in a symmetric group $S_n$, there is a cyclic $p$-Sylow iff $p > n/2$, when, say, $n geq 5$.
        – Mindlack
        Dec 13 '18 at 11:33
















      5














      No, because that would imply that $G$ has a cyclic Sylow subgroup, which is not always true. A simple example: $G=mathbb{F}_p^2$ for addition.






      share|cite|improve this answer





















      • Your answer seem to suggest that such an element could however exist in some cases. If we restrict G to be the symmetric group (of any order), would your answer change? (If so, I'll update the question accordingly.) Thanks.
        – Arnaud Casteigts
        Dec 13 '18 at 11:00










      • if $n$ is large enough and $p$ is any prime factor of $n!$ (say, $p < n/2$), the corresponding $p$-Sylow has cardinality $p^k$, where $k>n/p -1$. To have an element of corresponding order, you need that $p^k leq n$. If this holds, then $k geq 2$ thus $n geq p^2$ hence by Legendre $k geq n/p$ and $n geq p^k > kp geq n$. Thus, in a symmetric group $S_n$, there is a cyclic $p$-Sylow iff $p > n/2$, when, say, $n geq 5$.
        – Mindlack
        Dec 13 '18 at 11:33














      5












      5








      5






      No, because that would imply that $G$ has a cyclic Sylow subgroup, which is not always true. A simple example: $G=mathbb{F}_p^2$ for addition.






      share|cite|improve this answer












      No, because that would imply that $G$ has a cyclic Sylow subgroup, which is not always true. A simple example: $G=mathbb{F}_p^2$ for addition.







      share|cite|improve this answer












      share|cite|improve this answer



      share|cite|improve this answer










      answered Dec 13 '18 at 10:24









      MindlackMindlack

      2,59217




      2,59217












      • Your answer seem to suggest that such an element could however exist in some cases. If we restrict G to be the symmetric group (of any order), would your answer change? (If so, I'll update the question accordingly.) Thanks.
        – Arnaud Casteigts
        Dec 13 '18 at 11:00










      • if $n$ is large enough and $p$ is any prime factor of $n!$ (say, $p < n/2$), the corresponding $p$-Sylow has cardinality $p^k$, where $k>n/p -1$. To have an element of corresponding order, you need that $p^k leq n$. If this holds, then $k geq 2$ thus $n geq p^2$ hence by Legendre $k geq n/p$ and $n geq p^k > kp geq n$. Thus, in a symmetric group $S_n$, there is a cyclic $p$-Sylow iff $p > n/2$, when, say, $n geq 5$.
        – Mindlack
        Dec 13 '18 at 11:33


















      • Your answer seem to suggest that such an element could however exist in some cases. If we restrict G to be the symmetric group (of any order), would your answer change? (If so, I'll update the question accordingly.) Thanks.
        – Arnaud Casteigts
        Dec 13 '18 at 11:00










      • if $n$ is large enough and $p$ is any prime factor of $n!$ (say, $p < n/2$), the corresponding $p$-Sylow has cardinality $p^k$, where $k>n/p -1$. To have an element of corresponding order, you need that $p^k leq n$. If this holds, then $k geq 2$ thus $n geq p^2$ hence by Legendre $k geq n/p$ and $n geq p^k > kp geq n$. Thus, in a symmetric group $S_n$, there is a cyclic $p$-Sylow iff $p > n/2$, when, say, $n geq 5$.
        – Mindlack
        Dec 13 '18 at 11:33
















      Your answer seem to suggest that such an element could however exist in some cases. If we restrict G to be the symmetric group (of any order), would your answer change? (If so, I'll update the question accordingly.) Thanks.
      – Arnaud Casteigts
      Dec 13 '18 at 11:00




      Your answer seem to suggest that such an element could however exist in some cases. If we restrict G to be the symmetric group (of any order), would your answer change? (If so, I'll update the question accordingly.) Thanks.
      – Arnaud Casteigts
      Dec 13 '18 at 11:00












      if $n$ is large enough and $p$ is any prime factor of $n!$ (say, $p < n/2$), the corresponding $p$-Sylow has cardinality $p^k$, where $k>n/p -1$. To have an element of corresponding order, you need that $p^k leq n$. If this holds, then $k geq 2$ thus $n geq p^2$ hence by Legendre $k geq n/p$ and $n geq p^k > kp geq n$. Thus, in a symmetric group $S_n$, there is a cyclic $p$-Sylow iff $p > n/2$, when, say, $n geq 5$.
      – Mindlack
      Dec 13 '18 at 11:33




      if $n$ is large enough and $p$ is any prime factor of $n!$ (say, $p < n/2$), the corresponding $p$-Sylow has cardinality $p^k$, where $k>n/p -1$. To have an element of corresponding order, you need that $p^k leq n$. If this holds, then $k geq 2$ thus $n geq p^2$ hence by Legendre $k geq n/p$ and $n geq p^k > kp geq n$. Thus, in a symmetric group $S_n$, there is a cyclic $p$-Sylow iff $p > n/2$, when, say, $n geq 5$.
      – Mindlack
      Dec 13 '18 at 11:33











      2














      No, $G= C_p times cdots times C_p$ ($k$ factors) has order $p^k$ but all nontrivial elements have order $p$.






      share|cite|improve this answer


























        2














        No, $G= C_p times cdots times C_p$ ($k$ factors) has order $p^k$ but all nontrivial elements have order $p$.






        share|cite|improve this answer
























          2












          2








          2






          No, $G= C_p times cdots times C_p$ ($k$ factors) has order $p^k$ but all nontrivial elements have order $p$.






          share|cite|improve this answer












          No, $G= C_p times cdots times C_p$ ($k$ factors) has order $p^k$ but all nontrivial elements have order $p$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 13 '18 at 10:42









          lhflhf

          163k10168388




          163k10168388























              1














              No. $mathbb{Z}_2 oplus mathbb{Z}_2$ has order $2^2$ but no elements of order $2^2$.






              share|cite|improve this answer


























                1














                No. $mathbb{Z}_2 oplus mathbb{Z}_2$ has order $2^2$ but no elements of order $2^2$.






                share|cite|improve this answer
























                  1












                  1








                  1






                  No. $mathbb{Z}_2 oplus mathbb{Z}_2$ has order $2^2$ but no elements of order $2^2$.






                  share|cite|improve this answer












                  No. $mathbb{Z}_2 oplus mathbb{Z}_2$ has order $2^2$ but no elements of order $2^2$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 13 '18 at 10:25









                  MathematicsStudent1122MathematicsStudent1122

                  8,55122466




                  8,55122466






























                      draft saved

                      draft discarded




















































                      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.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3037841%2fexistence-of-elements-of-order-pk-in-a-finite-group%23new-answer', 'question_page');
                      }
                      );

                      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







                      Popular posts from this blog

                      Bressuire

                      Cabo Verde

                      Gyllenstierna