Groups of order $p^2$ abelian












0












$begingroup$


I know that $|Z(G)|= p or p^2$ In the second case there's is nothing to do. And if $|Z(G)|=p$ then $G/Z(G)$is cyclic hence G abelian.



But my book has a different proof that I really want to understand.



Here it is:



If $|G|=p^2$ and $Z(G) neq G$, then let $a in G - Z (G)$. Then $C(a)$
is a subgroup containing both $a$ and $Z(G)$, with $| Z(G)| = p$. This shows that $C(a) = G$, a contradiction. Thus $Z(G) = G$, and so G is abelian.



I don't see why $Z(G) subseteq C(a)$



and I guess $C(a) = G$ implies $ain Z(G)$, a contradiction.










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    I know that $|Z(G)|= p or p^2$ In the second case there's is nothing to do. And if $|Z(G)|=p$ then $G/Z(G)$is cyclic hence G abelian.



    But my book has a different proof that I really want to understand.



    Here it is:



    If $|G|=p^2$ and $Z(G) neq G$, then let $a in G - Z (G)$. Then $C(a)$
    is a subgroup containing both $a$ and $Z(G)$, with $| Z(G)| = p$. This shows that $C(a) = G$, a contradiction. Thus $Z(G) = G$, and so G is abelian.



    I don't see why $Z(G) subseteq C(a)$



    and I guess $C(a) = G$ implies $ain Z(G)$, a contradiction.










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      I know that $|Z(G)|= p or p^2$ In the second case there's is nothing to do. And if $|Z(G)|=p$ then $G/Z(G)$is cyclic hence G abelian.



      But my book has a different proof that I really want to understand.



      Here it is:



      If $|G|=p^2$ and $Z(G) neq G$, then let $a in G - Z (G)$. Then $C(a)$
      is a subgroup containing both $a$ and $Z(G)$, with $| Z(G)| = p$. This shows that $C(a) = G$, a contradiction. Thus $Z(G) = G$, and so G is abelian.



      I don't see why $Z(G) subseteq C(a)$



      and I guess $C(a) = G$ implies $ain Z(G)$, a contradiction.










      share|cite|improve this question











      $endgroup$




      I know that $|Z(G)|= p or p^2$ In the second case there's is nothing to do. And if $|Z(G)|=p$ then $G/Z(G)$is cyclic hence G abelian.



      But my book has a different proof that I really want to understand.



      Here it is:



      If $|G|=p^2$ and $Z(G) neq G$, then let $a in G - Z (G)$. Then $C(a)$
      is a subgroup containing both $a$ and $Z(G)$, with $| Z(G)| = p$. This shows that $C(a) = G$, a contradiction. Thus $Z(G) = G$, and so G is abelian.



      I don't see why $Z(G) subseteq C(a)$



      and I guess $C(a) = G$ implies $ain Z(G)$, a contradiction.







      abstract-algebra group-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Apr 4 '14 at 21:33







      abe

















      asked Apr 4 '14 at 21:23









      abeabe

      594318




      594318






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          Well I'm assuming that $C(a)$ is the centralizer of the set ${a}$ i.e. the group consisting of all elements of $G$ commuting with $a$. Since elements of $Z(G)$ commute with $pmb{all}$ elements of $G$ they commute with $a$ in particular. Thus $Z(G)subset C(a)$. Also you state $|Z(G)|> p$, in the fourth paragraph, but do you mean $|Z(G)| = p$?



          Anyway, is it now clear how the result follows (given that the order of a subgroup must divide the order of the group?






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thanks :D, your wording made it easier to understand.
            $endgroup$
            – abe
            Apr 4 '14 at 21:49










          • $begingroup$
            Since $Z(G)=p$ and $a,Z(G)subset C(a) rightarrow C(a) geq p+1$ but since $|G|$divides$ | C(a)|$, $|C(a)|=p^2$, So from the class equation $p^2=|G|neq p +p^2 = |Z(G)|+ sum_{forall xin G-Z(G)}[G:C(x)]$ Contradiction
            $endgroup$
            – abe
            Apr 4 '14 at 21:53












          • $begingroup$
            Does it look good?
            $endgroup$
            – abe
            Apr 4 '14 at 21:55






          • 1




            $begingroup$
            Looks good, but you could make this shorter. By Lagrange's theorem $|C(a)| | |G| = p^{2}$ so $|C(a)| = 1,p$ or $p^{2}$ ($p$ is prime so these are the only factors of $p^{2}$). Since $|Z(G)| = p$, $anotin Z(G)$ and ${a}, Z(G)subset C(a)$ we must have $|C(a)| geq p+1$. But then by the first line $|C(a)| = p^{2}$, thus $C(a) = G$ implying that $a$ commutes with everything in $G$, contradicting the assumption that $anotin Z(G)$
            $endgroup$
            – Daniel Mckenzie
            Apr 5 '14 at 20:21














          Your Answer








          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%2f740052%2fgroups-of-order-p2-abelian%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









          1












          $begingroup$

          Well I'm assuming that $C(a)$ is the centralizer of the set ${a}$ i.e. the group consisting of all elements of $G$ commuting with $a$. Since elements of $Z(G)$ commute with $pmb{all}$ elements of $G$ they commute with $a$ in particular. Thus $Z(G)subset C(a)$. Also you state $|Z(G)|> p$, in the fourth paragraph, but do you mean $|Z(G)| = p$?



          Anyway, is it now clear how the result follows (given that the order of a subgroup must divide the order of the group?






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thanks :D, your wording made it easier to understand.
            $endgroup$
            – abe
            Apr 4 '14 at 21:49










          • $begingroup$
            Since $Z(G)=p$ and $a,Z(G)subset C(a) rightarrow C(a) geq p+1$ but since $|G|$divides$ | C(a)|$, $|C(a)|=p^2$, So from the class equation $p^2=|G|neq p +p^2 = |Z(G)|+ sum_{forall xin G-Z(G)}[G:C(x)]$ Contradiction
            $endgroup$
            – abe
            Apr 4 '14 at 21:53












          • $begingroup$
            Does it look good?
            $endgroup$
            – abe
            Apr 4 '14 at 21:55






          • 1




            $begingroup$
            Looks good, but you could make this shorter. By Lagrange's theorem $|C(a)| | |G| = p^{2}$ so $|C(a)| = 1,p$ or $p^{2}$ ($p$ is prime so these are the only factors of $p^{2}$). Since $|Z(G)| = p$, $anotin Z(G)$ and ${a}, Z(G)subset C(a)$ we must have $|C(a)| geq p+1$. But then by the first line $|C(a)| = p^{2}$, thus $C(a) = G$ implying that $a$ commutes with everything in $G$, contradicting the assumption that $anotin Z(G)$
            $endgroup$
            – Daniel Mckenzie
            Apr 5 '14 at 20:21


















          1












          $begingroup$

          Well I'm assuming that $C(a)$ is the centralizer of the set ${a}$ i.e. the group consisting of all elements of $G$ commuting with $a$. Since elements of $Z(G)$ commute with $pmb{all}$ elements of $G$ they commute with $a$ in particular. Thus $Z(G)subset C(a)$. Also you state $|Z(G)|> p$, in the fourth paragraph, but do you mean $|Z(G)| = p$?



          Anyway, is it now clear how the result follows (given that the order of a subgroup must divide the order of the group?






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thanks :D, your wording made it easier to understand.
            $endgroup$
            – abe
            Apr 4 '14 at 21:49










          • $begingroup$
            Since $Z(G)=p$ and $a,Z(G)subset C(a) rightarrow C(a) geq p+1$ but since $|G|$divides$ | C(a)|$, $|C(a)|=p^2$, So from the class equation $p^2=|G|neq p +p^2 = |Z(G)|+ sum_{forall xin G-Z(G)}[G:C(x)]$ Contradiction
            $endgroup$
            – abe
            Apr 4 '14 at 21:53












          • $begingroup$
            Does it look good?
            $endgroup$
            – abe
            Apr 4 '14 at 21:55






          • 1




            $begingroup$
            Looks good, but you could make this shorter. By Lagrange's theorem $|C(a)| | |G| = p^{2}$ so $|C(a)| = 1,p$ or $p^{2}$ ($p$ is prime so these are the only factors of $p^{2}$). Since $|Z(G)| = p$, $anotin Z(G)$ and ${a}, Z(G)subset C(a)$ we must have $|C(a)| geq p+1$. But then by the first line $|C(a)| = p^{2}$, thus $C(a) = G$ implying that $a$ commutes with everything in $G$, contradicting the assumption that $anotin Z(G)$
            $endgroup$
            – Daniel Mckenzie
            Apr 5 '14 at 20:21
















          1












          1








          1





          $begingroup$

          Well I'm assuming that $C(a)$ is the centralizer of the set ${a}$ i.e. the group consisting of all elements of $G$ commuting with $a$. Since elements of $Z(G)$ commute with $pmb{all}$ elements of $G$ they commute with $a$ in particular. Thus $Z(G)subset C(a)$. Also you state $|Z(G)|> p$, in the fourth paragraph, but do you mean $|Z(G)| = p$?



          Anyway, is it now clear how the result follows (given that the order of a subgroup must divide the order of the group?






          share|cite|improve this answer











          $endgroup$



          Well I'm assuming that $C(a)$ is the centralizer of the set ${a}$ i.e. the group consisting of all elements of $G$ commuting with $a$. Since elements of $Z(G)$ commute with $pmb{all}$ elements of $G$ they commute with $a$ in particular. Thus $Z(G)subset C(a)$. Also you state $|Z(G)|> p$, in the fourth paragraph, but do you mean $|Z(G)| = p$?



          Anyway, is it now clear how the result follows (given that the order of a subgroup must divide the order of the group?







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Jan 17 at 0:25









          J. W. Tanner

          4,7721420




          4,7721420










          answered Apr 4 '14 at 21:31









          Daniel MckenzieDaniel Mckenzie

          617512




          617512












          • $begingroup$
            Thanks :D, your wording made it easier to understand.
            $endgroup$
            – abe
            Apr 4 '14 at 21:49










          • $begingroup$
            Since $Z(G)=p$ and $a,Z(G)subset C(a) rightarrow C(a) geq p+1$ but since $|G|$divides$ | C(a)|$, $|C(a)|=p^2$, So from the class equation $p^2=|G|neq p +p^2 = |Z(G)|+ sum_{forall xin G-Z(G)}[G:C(x)]$ Contradiction
            $endgroup$
            – abe
            Apr 4 '14 at 21:53












          • $begingroup$
            Does it look good?
            $endgroup$
            – abe
            Apr 4 '14 at 21:55






          • 1




            $begingroup$
            Looks good, but you could make this shorter. By Lagrange's theorem $|C(a)| | |G| = p^{2}$ so $|C(a)| = 1,p$ or $p^{2}$ ($p$ is prime so these are the only factors of $p^{2}$). Since $|Z(G)| = p$, $anotin Z(G)$ and ${a}, Z(G)subset C(a)$ we must have $|C(a)| geq p+1$. But then by the first line $|C(a)| = p^{2}$, thus $C(a) = G$ implying that $a$ commutes with everything in $G$, contradicting the assumption that $anotin Z(G)$
            $endgroup$
            – Daniel Mckenzie
            Apr 5 '14 at 20:21




















          • $begingroup$
            Thanks :D, your wording made it easier to understand.
            $endgroup$
            – abe
            Apr 4 '14 at 21:49










          • $begingroup$
            Since $Z(G)=p$ and $a,Z(G)subset C(a) rightarrow C(a) geq p+1$ but since $|G|$divides$ | C(a)|$, $|C(a)|=p^2$, So from the class equation $p^2=|G|neq p +p^2 = |Z(G)|+ sum_{forall xin G-Z(G)}[G:C(x)]$ Contradiction
            $endgroup$
            – abe
            Apr 4 '14 at 21:53












          • $begingroup$
            Does it look good?
            $endgroup$
            – abe
            Apr 4 '14 at 21:55






          • 1




            $begingroup$
            Looks good, but you could make this shorter. By Lagrange's theorem $|C(a)| | |G| = p^{2}$ so $|C(a)| = 1,p$ or $p^{2}$ ($p$ is prime so these are the only factors of $p^{2}$). Since $|Z(G)| = p$, $anotin Z(G)$ and ${a}, Z(G)subset C(a)$ we must have $|C(a)| geq p+1$. But then by the first line $|C(a)| = p^{2}$, thus $C(a) = G$ implying that $a$ commutes with everything in $G$, contradicting the assumption that $anotin Z(G)$
            $endgroup$
            – Daniel Mckenzie
            Apr 5 '14 at 20:21


















          $begingroup$
          Thanks :D, your wording made it easier to understand.
          $endgroup$
          – abe
          Apr 4 '14 at 21:49




          $begingroup$
          Thanks :D, your wording made it easier to understand.
          $endgroup$
          – abe
          Apr 4 '14 at 21:49












          $begingroup$
          Since $Z(G)=p$ and $a,Z(G)subset C(a) rightarrow C(a) geq p+1$ but since $|G|$divides$ | C(a)|$, $|C(a)|=p^2$, So from the class equation $p^2=|G|neq p +p^2 = |Z(G)|+ sum_{forall xin G-Z(G)}[G:C(x)]$ Contradiction
          $endgroup$
          – abe
          Apr 4 '14 at 21:53






          $begingroup$
          Since $Z(G)=p$ and $a,Z(G)subset C(a) rightarrow C(a) geq p+1$ but since $|G|$divides$ | C(a)|$, $|C(a)|=p^2$, So from the class equation $p^2=|G|neq p +p^2 = |Z(G)|+ sum_{forall xin G-Z(G)}[G:C(x)]$ Contradiction
          $endgroup$
          – abe
          Apr 4 '14 at 21:53














          $begingroup$
          Does it look good?
          $endgroup$
          – abe
          Apr 4 '14 at 21:55




          $begingroup$
          Does it look good?
          $endgroup$
          – abe
          Apr 4 '14 at 21:55




          1




          1




          $begingroup$
          Looks good, but you could make this shorter. By Lagrange's theorem $|C(a)| | |G| = p^{2}$ so $|C(a)| = 1,p$ or $p^{2}$ ($p$ is prime so these are the only factors of $p^{2}$). Since $|Z(G)| = p$, $anotin Z(G)$ and ${a}, Z(G)subset C(a)$ we must have $|C(a)| geq p+1$. But then by the first line $|C(a)| = p^{2}$, thus $C(a) = G$ implying that $a$ commutes with everything in $G$, contradicting the assumption that $anotin Z(G)$
          $endgroup$
          – Daniel Mckenzie
          Apr 5 '14 at 20:21






          $begingroup$
          Looks good, but you could make this shorter. By Lagrange's theorem $|C(a)| | |G| = p^{2}$ so $|C(a)| = 1,p$ or $p^{2}$ ($p$ is prime so these are the only factors of $p^{2}$). Since $|Z(G)| = p$, $anotin Z(G)$ and ${a}, Z(G)subset C(a)$ we must have $|C(a)| geq p+1$. But then by the first line $|C(a)| = p^{2}$, thus $C(a) = G$ implying that $a$ commutes with everything in $G$, contradicting the assumption that $anotin Z(G)$
          $endgroup$
          – Daniel Mckenzie
          Apr 5 '14 at 20:21




















          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%2f740052%2fgroups-of-order-p2-abelian%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

          Human spaceflight

          Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

          張江高科駅