Existence of subgroup of order power of prime in a finite abelian group?












5












$begingroup$


Say I have a finite abelian group $G$ such that $left | G right |=p_1^{n_1}...p_m^{n_m}$ where the $p_i$'s are distinct. Can I say that $G$ must have a subgroup of order $p_1^{n_1}$? I'm thinking that I can use the structure theorem to write $G$ as $mathbb{Z}/p_1^{n_{1_{1}}}times ...times mathbb{Z}/p_1^{n_{1_{s_{1}}}}times...timesmathbb{Z}/p_m^{n_{m_{1}}}times ...times mathbb{Z}/p_m^{n_{m_{s_{m}}}}$ then just take $mathbb{Z}/p_1^{n_{1_{1}}}times ...times mathbb{Z}/p_1^{n_{1_{s_{1}}}}timesleft { 1 right }...timesleft { 1 right }$ where $sum_i n_{1_{i}}=n_1$.



Is my reasoning correct? I would like to avoid using Sylow theorems.



Thanks in advance.






group-theory finite-groups abelian-groups







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Yes, you're on the right track (though those $;n_{1_r};$ are weird...) . And fixing that a little, you can easily prove that a finite abelian group has a subgroup of any order dividing hte group's order.
    $endgroup$
    – DonAntonio
    Dec 20 '18 at 21:49












  • $begingroup$
    @DonAntonio Yes that's exactly what I'm considering actually. What would be a better way to indicate the decomposition of each maximal power $n_i$ in the prime decomposition of $G$ as a sum?
    $endgroup$
    – John11
    Dec 20 '18 at 21:56
















5












$begingroup$


Say I have a finite abelian group $G$ such that $left | G right |=p_1^{n_1}...p_m^{n_m}$ where the $p_i$'s are distinct. Can I say that $G$ must have a subgroup of order $p_1^{n_1}$? I'm thinking that I can use the structure theorem to write $G$ as $mathbb{Z}/p_1^{n_{1_{1}}}times ...times mathbb{Z}/p_1^{n_{1_{s_{1}}}}times...timesmathbb{Z}/p_m^{n_{m_{1}}}times ...times mathbb{Z}/p_m^{n_{m_{s_{m}}}}$ then just take $mathbb{Z}/p_1^{n_{1_{1}}}times ...times mathbb{Z}/p_1^{n_{1_{s_{1}}}}timesleft { 1 right }...timesleft { 1 right }$ where $sum_i n_{1_{i}}=n_1$.



Is my reasoning correct? I would like to avoid using Sylow theorems.



Thanks in advance.






group-theory finite-groups abelian-groups







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Yes, you're on the right track (though those $;n_{1_r};$ are weird...) . And fixing that a little, you can easily prove that a finite abelian group has a subgroup of any order dividing hte group's order.
    $endgroup$
    – DonAntonio
    Dec 20 '18 at 21:49












  • $begingroup$
    @DonAntonio Yes that's exactly what I'm considering actually. What would be a better way to indicate the decomposition of each maximal power $n_i$ in the prime decomposition of $G$ as a sum?
    $endgroup$
    – John11
    Dec 20 '18 at 21:56














5












5








5


1



$begingroup$


Say I have a finite abelian group $G$ such that $left | G right |=p_1^{n_1}...p_m^{n_m}$ where the $p_i$'s are distinct. Can I say that $G$ must have a subgroup of order $p_1^{n_1}$? I'm thinking that I can use the structure theorem to write $G$ as $mathbb{Z}/p_1^{n_{1_{1}}}times ...times mathbb{Z}/p_1^{n_{1_{s_{1}}}}times...timesmathbb{Z}/p_m^{n_{m_{1}}}times ...times mathbb{Z}/p_m^{n_{m_{s_{m}}}}$ then just take $mathbb{Z}/p_1^{n_{1_{1}}}times ...times mathbb{Z}/p_1^{n_{1_{s_{1}}}}timesleft { 1 right }...timesleft { 1 right }$ where $sum_i n_{1_{i}}=n_1$.



Is my reasoning correct? I would like to avoid using Sylow theorems.



Thanks in advance.






group-theory finite-groups abelian-groups







share|cite|improve this question











$endgroup$




Say I have a finite abelian group $G$ such that $left | G right |=p_1^{n_1}...p_m^{n_m}$ where the $p_i$'s are distinct. Can I say that $G$ must have a subgroup of order $p_1^{n_1}$? I'm thinking that I can use the structure theorem to write $G$ as $mathbb{Z}/p_1^{n_{1_{1}}}times ...times mathbb{Z}/p_1^{n_{1_{s_{1}}}}times...timesmathbb{Z}/p_m^{n_{m_{1}}}times ...times mathbb{Z}/p_m^{n_{m_{s_{m}}}}$ then just take $mathbb{Z}/p_1^{n_{1_{1}}}times ...times mathbb{Z}/p_1^{n_{1_{s_{1}}}}timesleft { 1 right }...timesleft { 1 right }$ where $sum_i n_{1_{i}}=n_1$.



Is my reasoning correct? I would like to avoid using Sylow theorems.



Thanks in advance.






group-theory finite-groups abelian-groups




group-theory finite-groups abelian-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 20 '18 at 22:05







John11

















asked Dec 20 '18 at 21:38









John11John11

1,0321821




1,0321821








  • 1




    $begingroup$
    Yes, you're on the right track (though those $;n_{1_r};$ are weird...) . And fixing that a little, you can easily prove that a finite abelian group has a subgroup of any order dividing hte group's order.
    $endgroup$
    – DonAntonio
    Dec 20 '18 at 21:49












  • $begingroup$
    @DonAntonio Yes that's exactly what I'm considering actually. What would be a better way to indicate the decomposition of each maximal power $n_i$ in the prime decomposition of $G$ as a sum?
    $endgroup$
    – John11
    Dec 20 '18 at 21:56














  • 1




    $begingroup$
    Yes, you're on the right track (though those $;n_{1_r};$ are weird...) . And fixing that a little, you can easily prove that a finite abelian group has a subgroup of any order dividing hte group's order.
    $endgroup$
    – DonAntonio
    Dec 20 '18 at 21:49












  • $begingroup$
    @DonAntonio Yes that's exactly what I'm considering actually. What would be a better way to indicate the decomposition of each maximal power $n_i$ in the prime decomposition of $G$ as a sum?
    $endgroup$
    – John11
    Dec 20 '18 at 21:56








1




1




$begingroup$
Yes, you're on the right track (though those $;n_{1_r};$ are weird...) . And fixing that a little, you can easily prove that a finite abelian group has a subgroup of any order dividing hte group's order.
$endgroup$
– DonAntonio
Dec 20 '18 at 21:49






$begingroup$
Yes, you're on the right track (though those $;n_{1_r};$ are weird...) . And fixing that a little, you can easily prove that a finite abelian group has a subgroup of any order dividing hte group's order.
$endgroup$
– DonAntonio
Dec 20 '18 at 21:49














$begingroup$
@DonAntonio Yes that's exactly what I'm considering actually. What would be a better way to indicate the decomposition of each maximal power $n_i$ in the prime decomposition of $G$ as a sum?
$endgroup$
– John11
Dec 20 '18 at 21:56




$begingroup$
@DonAntonio Yes that's exactly what I'm considering actually. What would be a better way to indicate the decomposition of each maximal power $n_i$ in the prime decomposition of $G$ as a sum?
$endgroup$
– John11
Dec 20 '18 at 21:56










2 Answers
2






active

oldest

votes


















3












$begingroup$

Some highlights:



First, you can take $;K:=Bbb Z/p_1^{n_1}Bbb Ztimes{1}timesldotstimes{1|];$ to get a subgroup of order $;p_1^{n_1};$ , and now you can generalize this to each prime $;p_1,..,p_m;$ and their powers.



Next, use the basic lemma that says that a finite $;p,-$ group of order $;p^n;$ has a (normal if you will, even when we're not in the abelian case!) subgroup of order $;p^k;$ , for any $;0le kle n;$ .



Finally, just use the direct product decomposition to get a subgroup of any order dividing the group's.






share|cite|improve this answer









$endgroup$





















    1












    $begingroup$

    Here is a roadmap.



    Let $p$ be a prime dividing the order of $G$.




    • Let $P = { g in G : ord(g) text{ is a power of $p$} }$.


    • Then $P$ is a subgroup of $G$ (because $G$ is abelian).


    • The order of $P$ is a power of $p$ (by Cauchy's theorem).


    • The order of $P$ is the largest power of $p$ that divides the order of $G$ (by Cauchy's theorem applied to $G/P$).







    share|cite|improve this answer









    $endgroup$













      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%2f3047992%2fexistence-of-subgroup-of-order-power-of-prime-in-a-finite-abelian-group%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









      3












      $begingroup$

      Some highlights:



      First, you can take $;K:=Bbb Z/p_1^{n_1}Bbb Ztimes{1}timesldotstimes{1|];$ to get a subgroup of order $;p_1^{n_1};$ , and now you can generalize this to each prime $;p_1,..,p_m;$ and their powers.



      Next, use the basic lemma that says that a finite $;p,-$ group of order $;p^n;$ has a (normal if you will, even when we're not in the abelian case!) subgroup of order $;p^k;$ , for any $;0le kle n;$ .



      Finally, just use the direct product decomposition to get a subgroup of any order dividing the group's.






      share|cite|improve this answer









      $endgroup$


















        3












        $begingroup$

        Some highlights:



        First, you can take $;K:=Bbb Z/p_1^{n_1}Bbb Ztimes{1}timesldotstimes{1|];$ to get a subgroup of order $;p_1^{n_1};$ , and now you can generalize this to each prime $;p_1,..,p_m;$ and their powers.



        Next, use the basic lemma that says that a finite $;p,-$ group of order $;p^n;$ has a (normal if you will, even when we're not in the abelian case!) subgroup of order $;p^k;$ , for any $;0le kle n;$ .



        Finally, just use the direct product decomposition to get a subgroup of any order dividing the group's.






        share|cite|improve this answer









        $endgroup$
















          3












          3








          3





          $begingroup$

          Some highlights:



          First, you can take $;K:=Bbb Z/p_1^{n_1}Bbb Ztimes{1}timesldotstimes{1|];$ to get a subgroup of order $;p_1^{n_1};$ , and now you can generalize this to each prime $;p_1,..,p_m;$ and their powers.



          Next, use the basic lemma that says that a finite $;p,-$ group of order $;p^n;$ has a (normal if you will, even when we're not in the abelian case!) subgroup of order $;p^k;$ , for any $;0le kle n;$ .



          Finally, just use the direct product decomposition to get a subgroup of any order dividing the group's.






          share|cite|improve this answer









          $endgroup$



          Some highlights:



          First, you can take $;K:=Bbb Z/p_1^{n_1}Bbb Ztimes{1}timesldotstimes{1|];$ to get a subgroup of order $;p_1^{n_1};$ , and now you can generalize this to each prime $;p_1,..,p_m;$ and their powers.



          Next, use the basic lemma that says that a finite $;p,-$ group of order $;p^n;$ has a (normal if you will, even when we're not in the abelian case!) subgroup of order $;p^k;$ , for any $;0le kle n;$ .



          Finally, just use the direct product decomposition to get a subgroup of any order dividing the group's.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 20 '18 at 23:00









          DonAntonioDonAntonio

          177k1492226




          177k1492226























              1












              $begingroup$

              Here is a roadmap.



              Let $p$ be a prime dividing the order of $G$.




              • Let $P = { g in G : ord(g) text{ is a power of $p$} }$.


              • Then $P$ is a subgroup of $G$ (because $G$ is abelian).


              • The order of $P$ is a power of $p$ (by Cauchy's theorem).


              • The order of $P$ is the largest power of $p$ that divides the order of $G$ (by Cauchy's theorem applied to $G/P$).







              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$

                Here is a roadmap.



                Let $p$ be a prime dividing the order of $G$.




                • Let $P = { g in G : ord(g) text{ is a power of $p$} }$.


                • Then $P$ is a subgroup of $G$ (because $G$ is abelian).


                • The order of $P$ is a power of $p$ (by Cauchy's theorem).


                • The order of $P$ is the largest power of $p$ that divides the order of $G$ (by Cauchy's theorem applied to $G/P$).







                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  Here is a roadmap.



                  Let $p$ be a prime dividing the order of $G$.




                  • Let $P = { g in G : ord(g) text{ is a power of $p$} }$.


                  • Then $P$ is a subgroup of $G$ (because $G$ is abelian).


                  • The order of $P$ is a power of $p$ (by Cauchy's theorem).


                  • The order of $P$ is the largest power of $p$ that divides the order of $G$ (by Cauchy's theorem applied to $G/P$).







                  share|cite|improve this answer









                  $endgroup$



                  Here is a roadmap.



                  Let $p$ be a prime dividing the order of $G$.




                  • Let $P = { g in G : ord(g) text{ is a power of $p$} }$.


                  • Then $P$ is a subgroup of $G$ (because $G$ is abelian).


                  • The order of $P$ is a power of $p$ (by Cauchy's theorem).


                  • The order of $P$ is the largest power of $p$ that divides the order of $G$ (by Cauchy's theorem applied to $G/P$).








                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 21 '18 at 0:33









                  lhflhf

                  163k10168392




                  163k10168392






























                      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%2f3047992%2fexistence-of-subgroup-of-order-power-of-prime-in-a-finite-abelian-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

                      If I really need a card on my start hand, how many mulligans make sense? [duplicate]

                      Image
                      5 This question already has an answer here: How do you calculate the likelihood of drawing certain cards in your opening hand? 3 answers There is a funny modern deck where you play Treasure Hunt, but you really need to have it on the starting hand. How many mulligans should I take, if my deck contains 60 cards and contains 4 copies of Treasure Hunt? magic-the-gathering probability share | improve this question asked Nov 23 '18 at 12:12 dan dan 152 4
                      Read more

                      Alcedinidae

                      Image
                      Alcedinidae Martin-pêcheur à dos bleu ( Alcedo azurea ) Classification (COI) Règne Animalia Embranchement Chordata Sous-embr. Vertebrata Classe Aves Ordre Coraciiformes Famille Alcedinidae Rafinesque, 1815 Les Alcédinidés ou Alcedinidae forment une famille d'oiseaux plus connus sous les noms de martins-pêcheurs et martins-chasseurs. Sommaire 1 Description 2 Répartition et habitat 3 Systématique 3.1 Liste alphabétique des genres 3.2 Liste des espèces 4 Chez les Anciens : l'alcyon 4.1 Étymologie (Littré) 4.2 Oiseau « fabuleux » ? 5 Notes 6 Articles connexes 7 Liens externes 7.1 Bibliographie Description | Ce sont des oiseaux compacts de taille petite à moyenne (10 à 46 cm), au bec droit et long, en forme de poignard. Leurs pattes sont courtes, et ils portent un plumage aux couleurs vives. Répartition et habitat | Cosmopolites, ils fréquentent surtout
                      Read more

                      Can an atomic nucleus contain both particles and antiparticles? [duplicate]

                      Image
                      9 $begingroup$ This question already has an answer here: What happens if we put together a proton and an antineutron? 2 answers Is it theoretically possible to make a "deuterium" atom containing a proton and an antineutron in its nucleus? Would the strong nuclear force cause attraction between a proton and an antineutron? Would such a nucleus be stable, or would the proton somehow annihilate the antineutron when close enough? nuclear-physics antimatter share | cite | improve this question asked yesterday
                      Read more