Limit of matrix $A$ raised to power of $n$, as $n$ approaches infinity.











up vote
7
down vote

favorite












I understand that the limit of n approaching infinity of a matrix $A^n$, can be computed, in some cases, by looking at the diagonalization of that matrix, and then looking at the limit of n going to infinity of the resulting diagonal matrix, $D$, whose elements are raised to the power n.



What I do not understand is when we do not raise the matrix, call it $P$, consisting of the eigenvectors of $A$, and its inverse, to the power of n as well?



So:



$ P^{-1}AP = D $



$A = PDP^{-1} $



$A^n = (PDP^{-1})^n$



$A^n = P^nD^n(P^{-1})^n$



Why do the matrices $P^n$ and $(P^{-1})^n$ not have to be taken into account when looking at the limit of n going to infinity?










share|cite|improve this question




























    up vote
    7
    down vote

    favorite












    I understand that the limit of n approaching infinity of a matrix $A^n$, can be computed, in some cases, by looking at the diagonalization of that matrix, and then looking at the limit of n going to infinity of the resulting diagonal matrix, $D$, whose elements are raised to the power n.



    What I do not understand is when we do not raise the matrix, call it $P$, consisting of the eigenvectors of $A$, and its inverse, to the power of n as well?



    So:



    $ P^{-1}AP = D $



    $A = PDP^{-1} $



    $A^n = (PDP^{-1})^n$



    $A^n = P^nD^n(P^{-1})^n$



    Why do the matrices $P^n$ and $(P^{-1})^n$ not have to be taken into account when looking at the limit of n going to infinity?










    share|cite|improve this question


























      up vote
      7
      down vote

      favorite









      up vote
      7
      down vote

      favorite











      I understand that the limit of n approaching infinity of a matrix $A^n$, can be computed, in some cases, by looking at the diagonalization of that matrix, and then looking at the limit of n going to infinity of the resulting diagonal matrix, $D$, whose elements are raised to the power n.



      What I do not understand is when we do not raise the matrix, call it $P$, consisting of the eigenvectors of $A$, and its inverse, to the power of n as well?



      So:



      $ P^{-1}AP = D $



      $A = PDP^{-1} $



      $A^n = (PDP^{-1})^n$



      $A^n = P^nD^n(P^{-1})^n$



      Why do the matrices $P^n$ and $(P^{-1})^n$ not have to be taken into account when looking at the limit of n going to infinity?










      share|cite|improve this question















      I understand that the limit of n approaching infinity of a matrix $A^n$, can be computed, in some cases, by looking at the diagonalization of that matrix, and then looking at the limit of n going to infinity of the resulting diagonal matrix, $D$, whose elements are raised to the power n.



      What I do not understand is when we do not raise the matrix, call it $P$, consisting of the eigenvectors of $A$, and its inverse, to the power of n as well?



      So:



      $ P^{-1}AP = D $



      $A = PDP^{-1} $



      $A^n = (PDP^{-1})^n$



      $A^n = P^nD^n(P^{-1})^n$



      Why do the matrices $P^n$ and $(P^{-1})^n$ not have to be taken into account when looking at the limit of n going to infinity?







      linear-algebra matrices limits






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited yesterday









      Xander Henderson

      13.7k93552




      13.7k93552










      asked 2 days ago









      Tyna

      826




      826






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          24
          down vote













          In general, the statement
          $$
          (AB)^n=A^nB^n
          $$

          is false for square matrices. So it's not true in general that, from $A=PDP^{-1}$ it follows that $A^n=P^nD^n(P^{-1})^n$.



          Rather you should note that
          $$
          A^2=(PDP^{-1})(PDP^{-1})=PDP^{-1}PDP^{-1}=PDDP^{-1}=PD^2P^{-1}
          $$

          and, by easy induction,
          $$
          A^n=PD^nP^{-1}
          $$

          for every $n$. Do you see the difference?



          Now, in order to compute the limit, it is sufficient to compute the limit of $D^n$, because matrix multiplication is continuous.






          share|cite|improve this answer























          • Perhaps it is worth remarking that we do still have $P$ and $P^-$ to take into account, but that is straightforward and we do not have to worry what $P^n$ might be.
            – PJTraill
            yesterday












          • @PJTraill Isn't the “Rather” part covering it?
            – egreg
            yesterday










          • Formally it certainly does, but given the level of the questioner I thought one might make that explicit (though an alternative would be to nudge them to chew on some thought inclining them in that direction).
            – PJTraill
            yesterday




















          up vote
          13
          down vote













          We have that



          $$A = PDP^{-1}implies A^2 = PDP^{-1} PDP^{-1}= PD(P^{-1}P)DP^{-1}= PD (I)DP^{-1}=PD^2P^{-1}$$



          and so on we can generalize the result rigorously for any $n$ by induction.






          share|cite|improve this answer



















          • 4




            thank you! the "inner" factors on $P$ and $P^{-1}$ will cancel and you'll only be left with the one $P$ and its inverse.
            – Tyna
            2 days ago








          • 2




            @Tyna Yes exactly and then we can generalize that for any $n$ (rigoursly by induction).
            – gimusi
            2 days ago











          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%2f3004222%2flimit-of-matrix-a-raised-to-power-of-n-as-n-approaches-infinity%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








          up vote
          24
          down vote













          In general, the statement
          $$
          (AB)^n=A^nB^n
          $$

          is false for square matrices. So it's not true in general that, from $A=PDP^{-1}$ it follows that $A^n=P^nD^n(P^{-1})^n$.



          Rather you should note that
          $$
          A^2=(PDP^{-1})(PDP^{-1})=PDP^{-1}PDP^{-1}=PDDP^{-1}=PD^2P^{-1}
          $$

          and, by easy induction,
          $$
          A^n=PD^nP^{-1}
          $$

          for every $n$. Do you see the difference?



          Now, in order to compute the limit, it is sufficient to compute the limit of $D^n$, because matrix multiplication is continuous.






          share|cite|improve this answer























          • Perhaps it is worth remarking that we do still have $P$ and $P^-$ to take into account, but that is straightforward and we do not have to worry what $P^n$ might be.
            – PJTraill
            yesterday












          • @PJTraill Isn't the “Rather” part covering it?
            – egreg
            yesterday










          • Formally it certainly does, but given the level of the questioner I thought one might make that explicit (though an alternative would be to nudge them to chew on some thought inclining them in that direction).
            – PJTraill
            yesterday

















          up vote
          24
          down vote













          In general, the statement
          $$
          (AB)^n=A^nB^n
          $$

          is false for square matrices. So it's not true in general that, from $A=PDP^{-1}$ it follows that $A^n=P^nD^n(P^{-1})^n$.



          Rather you should note that
          $$
          A^2=(PDP^{-1})(PDP^{-1})=PDP^{-1}PDP^{-1}=PDDP^{-1}=PD^2P^{-1}
          $$

          and, by easy induction,
          $$
          A^n=PD^nP^{-1}
          $$

          for every $n$. Do you see the difference?



          Now, in order to compute the limit, it is sufficient to compute the limit of $D^n$, because matrix multiplication is continuous.






          share|cite|improve this answer























          • Perhaps it is worth remarking that we do still have $P$ and $P^-$ to take into account, but that is straightforward and we do not have to worry what $P^n$ might be.
            – PJTraill
            yesterday












          • @PJTraill Isn't the “Rather” part covering it?
            – egreg
            yesterday










          • Formally it certainly does, but given the level of the questioner I thought one might make that explicit (though an alternative would be to nudge them to chew on some thought inclining them in that direction).
            – PJTraill
            yesterday















          up vote
          24
          down vote










          up vote
          24
          down vote









          In general, the statement
          $$
          (AB)^n=A^nB^n
          $$

          is false for square matrices. So it's not true in general that, from $A=PDP^{-1}$ it follows that $A^n=P^nD^n(P^{-1})^n$.



          Rather you should note that
          $$
          A^2=(PDP^{-1})(PDP^{-1})=PDP^{-1}PDP^{-1}=PDDP^{-1}=PD^2P^{-1}
          $$

          and, by easy induction,
          $$
          A^n=PD^nP^{-1}
          $$

          for every $n$. Do you see the difference?



          Now, in order to compute the limit, it is sufficient to compute the limit of $D^n$, because matrix multiplication is continuous.






          share|cite|improve this answer














          In general, the statement
          $$
          (AB)^n=A^nB^n
          $$

          is false for square matrices. So it's not true in general that, from $A=PDP^{-1}$ it follows that $A^n=P^nD^n(P^{-1})^n$.



          Rather you should note that
          $$
          A^2=(PDP^{-1})(PDP^{-1})=PDP^{-1}PDP^{-1}=PDDP^{-1}=PD^2P^{-1}
          $$

          and, by easy induction,
          $$
          A^n=PD^nP^{-1}
          $$

          for every $n$. Do you see the difference?



          Now, in order to compute the limit, it is sufficient to compute the limit of $D^n$, because matrix multiplication is continuous.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited yesterday

























          answered 2 days ago









          egreg

          173k1383198




          173k1383198












          • Perhaps it is worth remarking that we do still have $P$ and $P^-$ to take into account, but that is straightforward and we do not have to worry what $P^n$ might be.
            – PJTraill
            yesterday












          • @PJTraill Isn't the “Rather” part covering it?
            – egreg
            yesterday










          • Formally it certainly does, but given the level of the questioner I thought one might make that explicit (though an alternative would be to nudge them to chew on some thought inclining them in that direction).
            – PJTraill
            yesterday




















          • Perhaps it is worth remarking that we do still have $P$ and $P^-$ to take into account, but that is straightforward and we do not have to worry what $P^n$ might be.
            – PJTraill
            yesterday












          • @PJTraill Isn't the “Rather” part covering it?
            – egreg
            yesterday










          • Formally it certainly does, but given the level of the questioner I thought one might make that explicit (though an alternative would be to nudge them to chew on some thought inclining them in that direction).
            – PJTraill
            yesterday


















          Perhaps it is worth remarking that we do still have $P$ and $P^-$ to take into account, but that is straightforward and we do not have to worry what $P^n$ might be.
          – PJTraill
          yesterday






          Perhaps it is worth remarking that we do still have $P$ and $P^-$ to take into account, but that is straightforward and we do not have to worry what $P^n$ might be.
          – PJTraill
          yesterday














          @PJTraill Isn't the “Rather” part covering it?
          – egreg
          yesterday




          @PJTraill Isn't the “Rather” part covering it?
          – egreg
          yesterday












          Formally it certainly does, but given the level of the questioner I thought one might make that explicit (though an alternative would be to nudge them to chew on some thought inclining them in that direction).
          – PJTraill
          yesterday






          Formally it certainly does, but given the level of the questioner I thought one might make that explicit (though an alternative would be to nudge them to chew on some thought inclining them in that direction).
          – PJTraill
          yesterday












          up vote
          13
          down vote













          We have that



          $$A = PDP^{-1}implies A^2 = PDP^{-1} PDP^{-1}= PD(P^{-1}P)DP^{-1}= PD (I)DP^{-1}=PD^2P^{-1}$$



          and so on we can generalize the result rigorously for any $n$ by induction.






          share|cite|improve this answer



















          • 4




            thank you! the "inner" factors on $P$ and $P^{-1}$ will cancel and you'll only be left with the one $P$ and its inverse.
            – Tyna
            2 days ago








          • 2




            @Tyna Yes exactly and then we can generalize that for any $n$ (rigoursly by induction).
            – gimusi
            2 days ago















          up vote
          13
          down vote













          We have that



          $$A = PDP^{-1}implies A^2 = PDP^{-1} PDP^{-1}= PD(P^{-1}P)DP^{-1}= PD (I)DP^{-1}=PD^2P^{-1}$$



          and so on we can generalize the result rigorously for any $n$ by induction.






          share|cite|improve this answer



















          • 4




            thank you! the "inner" factors on $P$ and $P^{-1}$ will cancel and you'll only be left with the one $P$ and its inverse.
            – Tyna
            2 days ago








          • 2




            @Tyna Yes exactly and then we can generalize that for any $n$ (rigoursly by induction).
            – gimusi
            2 days ago













          up vote
          13
          down vote










          up vote
          13
          down vote









          We have that



          $$A = PDP^{-1}implies A^2 = PDP^{-1} PDP^{-1}= PD(P^{-1}P)DP^{-1}= PD (I)DP^{-1}=PD^2P^{-1}$$



          and so on we can generalize the result rigorously for any $n$ by induction.






          share|cite|improve this answer














          We have that



          $$A = PDP^{-1}implies A^2 = PDP^{-1} PDP^{-1}= PD(P^{-1}P)DP^{-1}= PD (I)DP^{-1}=PD^2P^{-1}$$



          and so on we can generalize the result rigorously for any $n$ by induction.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited yesterday

























          answered 2 days ago









          gimusi

          85.9k74294




          85.9k74294








          • 4




            thank you! the "inner" factors on $P$ and $P^{-1}$ will cancel and you'll only be left with the one $P$ and its inverse.
            – Tyna
            2 days ago








          • 2




            @Tyna Yes exactly and then we can generalize that for any $n$ (rigoursly by induction).
            – gimusi
            2 days ago














          • 4




            thank you! the "inner" factors on $P$ and $P^{-1}$ will cancel and you'll only be left with the one $P$ and its inverse.
            – Tyna
            2 days ago








          • 2




            @Tyna Yes exactly and then we can generalize that for any $n$ (rigoursly by induction).
            – gimusi
            2 days ago








          4




          4




          thank you! the "inner" factors on $P$ and $P^{-1}$ will cancel and you'll only be left with the one $P$ and its inverse.
          – Tyna
          2 days ago






          thank you! the "inner" factors on $P$ and $P^{-1}$ will cancel and you'll only be left with the one $P$ and its inverse.
          – Tyna
          2 days ago






          2




          2




          @Tyna Yes exactly and then we can generalize that for any $n$ (rigoursly by induction).
          – gimusi
          2 days ago




          @Tyna Yes exactly and then we can generalize that for any $n$ (rigoursly by induction).
          – gimusi
          2 days ago


















           

          draft saved


          draft discarded



















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004222%2flimit-of-matrix-a-raised-to-power-of-n-as-n-approaches-infinity%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

          數位音樂下載

          When can things happen in Etherscan, such as the picture below?

          格利澤436b