How many diagonal matrices such that $A^k=I_n$?











up vote
0
down vote

favorite












How many diagonal matrices $A in mathbb{C}^{n,n}$ are there, such that $A^k=I_n$ for some $k in mathbb{N} = {1, 2, 3, ...}$?



Edit: I was thinking about $k$-th roots of 1 on the diagonal and then the answer would probably be $infty$. Does that make any sense?










share|cite|improve this question




























    up vote
    0
    down vote

    favorite












    How many diagonal matrices $A in mathbb{C}^{n,n}$ are there, such that $A^k=I_n$ for some $k in mathbb{N} = {1, 2, 3, ...}$?



    Edit: I was thinking about $k$-th roots of 1 on the diagonal and then the answer would probably be $infty$. Does that make any sense?










    share|cite|improve this question


























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      How many diagonal matrices $A in mathbb{C}^{n,n}$ are there, such that $A^k=I_n$ for some $k in mathbb{N} = {1, 2, 3, ...}$?



      Edit: I was thinking about $k$-th roots of 1 on the diagonal and then the answer would probably be $infty$. Does that make any sense?










      share|cite|improve this question















      How many diagonal matrices $A in mathbb{C}^{n,n}$ are there, such that $A^k=I_n$ for some $k in mathbb{N} = {1, 2, 3, ...}$?



      Edit: I was thinking about $k$-th roots of 1 on the diagonal and then the answer would probably be $infty$. Does that make any sense?







      linear-algebra matrices






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 18 at 11:12

























      asked Nov 18 at 11:07









      KacperR

      244




      244






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          1
          down vote



          accepted










          Hint: Suppose the diagonal elements are ${a_1,a_2,ldots,a_n}$. The determinant of $A$ is $a_1a_2dotsm a_n$. So the determinant of $A^k$ is $a_1^ka_2^kdotsm a_n^k$. But the determinant of $I$ is $1$, so $a_1^ka_2^kdotsm a_n^k=1$.






          share|cite|improve this answer





















          • And we can go even stronger than that: $a^k = 1$ for all $k$, since (if we denote by $D(b_1,ldots,b_n)$ the diagonal matrix with diagonal values $b_1,ldots,b_n$), $D(a_1,ldots,a_n)^k = D(a_1^k,ldots,a_n^k) = I_n = D(1,ldots,1)$.
            – user3482749
            Nov 18 at 11:16













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


          }
          });














           

          draft saved


          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003402%2fhow-many-diagonal-matrices-such-that-ak-i-n%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








          up vote
          1
          down vote



          accepted










          Hint: Suppose the diagonal elements are ${a_1,a_2,ldots,a_n}$. The determinant of $A$ is $a_1a_2dotsm a_n$. So the determinant of $A^k$ is $a_1^ka_2^kdotsm a_n^k$. But the determinant of $I$ is $1$, so $a_1^ka_2^kdotsm a_n^k=1$.






          share|cite|improve this answer





















          • And we can go even stronger than that: $a^k = 1$ for all $k$, since (if we denote by $D(b_1,ldots,b_n)$ the diagonal matrix with diagonal values $b_1,ldots,b_n$), $D(a_1,ldots,a_n)^k = D(a_1^k,ldots,a_n^k) = I_n = D(1,ldots,1)$.
            – user3482749
            Nov 18 at 11:16

















          up vote
          1
          down vote



          accepted










          Hint: Suppose the diagonal elements are ${a_1,a_2,ldots,a_n}$. The determinant of $A$ is $a_1a_2dotsm a_n$. So the determinant of $A^k$ is $a_1^ka_2^kdotsm a_n^k$. But the determinant of $I$ is $1$, so $a_1^ka_2^kdotsm a_n^k=1$.






          share|cite|improve this answer





















          • And we can go even stronger than that: $a^k = 1$ for all $k$, since (if we denote by $D(b_1,ldots,b_n)$ the diagonal matrix with diagonal values $b_1,ldots,b_n$), $D(a_1,ldots,a_n)^k = D(a_1^k,ldots,a_n^k) = I_n = D(1,ldots,1)$.
            – user3482749
            Nov 18 at 11:16















          up vote
          1
          down vote



          accepted







          up vote
          1
          down vote



          accepted






          Hint: Suppose the diagonal elements are ${a_1,a_2,ldots,a_n}$. The determinant of $A$ is $a_1a_2dotsm a_n$. So the determinant of $A^k$ is $a_1^ka_2^kdotsm a_n^k$. But the determinant of $I$ is $1$, so $a_1^ka_2^kdotsm a_n^k=1$.






          share|cite|improve this answer












          Hint: Suppose the diagonal elements are ${a_1,a_2,ldots,a_n}$. The determinant of $A$ is $a_1a_2dotsm a_n$. So the determinant of $A^k$ is $a_1^ka_2^kdotsm a_n^k$. But the determinant of $I$ is $1$, so $a_1^ka_2^kdotsm a_n^k=1$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 18 at 11:12









          YiFan

          1,5631312




          1,5631312












          • And we can go even stronger than that: $a^k = 1$ for all $k$, since (if we denote by $D(b_1,ldots,b_n)$ the diagonal matrix with diagonal values $b_1,ldots,b_n$), $D(a_1,ldots,a_n)^k = D(a_1^k,ldots,a_n^k) = I_n = D(1,ldots,1)$.
            – user3482749
            Nov 18 at 11:16




















          • And we can go even stronger than that: $a^k = 1$ for all $k$, since (if we denote by $D(b_1,ldots,b_n)$ the diagonal matrix with diagonal values $b_1,ldots,b_n$), $D(a_1,ldots,a_n)^k = D(a_1^k,ldots,a_n^k) = I_n = D(1,ldots,1)$.
            – user3482749
            Nov 18 at 11:16


















          And we can go even stronger than that: $a^k = 1$ for all $k$, since (if we denote by $D(b_1,ldots,b_n)$ the diagonal matrix with diagonal values $b_1,ldots,b_n$), $D(a_1,ldots,a_n)^k = D(a_1^k,ldots,a_n^k) = I_n = D(1,ldots,1)$.
          – user3482749
          Nov 18 at 11:16






          And we can go even stronger than that: $a^k = 1$ for all $k$, since (if we denote by $D(b_1,ldots,b_n)$ the diagonal matrix with diagonal values $b_1,ldots,b_n$), $D(a_1,ldots,a_n)^k = D(a_1^k,ldots,a_n^k) = I_n = D(1,ldots,1)$.
          – user3482749
          Nov 18 at 11:16




















           

          draft saved


          draft discarded



















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003402%2fhow-many-diagonal-matrices-such-that-ak-i-n%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

          Le Mesnil-Réaume

          Ida-Boy-Ed-Garten

          web3.py web3.isConnected() returns false always