If $A$ is a symmetric matrix. Then all the eigenvalues of $A^2$ are nonnegative












4












$begingroup$


For the answer, we can get support from two claims:
Claim 1: If $A$ is real and symmetric, then it has real eigenvalues. Proof here
Claim 2: If $lambda$ is an eigenvalue of $A$, then $lambda^2$ is an Eigenvalue of $A^2$. Proof here



So by those two claims we can say that if $lambda$ is an eigenvalue of $A$, then the corresponding eigenvalue $lambda^2$ of $A^2$ is nonnegative. But my problem is how can we guarantee that it will cover all the possible eigenvalues of $A^2$?










share|cite|improve this question











$endgroup$

















    4












    $begingroup$


    For the answer, we can get support from two claims:
    Claim 1: If $A$ is real and symmetric, then it has real eigenvalues. Proof here
    Claim 2: If $lambda$ is an eigenvalue of $A$, then $lambda^2$ is an Eigenvalue of $A^2$. Proof here



    So by those two claims we can say that if $lambda$ is an eigenvalue of $A$, then the corresponding eigenvalue $lambda^2$ of $A^2$ is nonnegative. But my problem is how can we guarantee that it will cover all the possible eigenvalues of $A^2$?










    share|cite|improve this question











    $endgroup$















      4












      4








      4





      $begingroup$


      For the answer, we can get support from two claims:
      Claim 1: If $A$ is real and symmetric, then it has real eigenvalues. Proof here
      Claim 2: If $lambda$ is an eigenvalue of $A$, then $lambda^2$ is an Eigenvalue of $A^2$. Proof here



      So by those two claims we can say that if $lambda$ is an eigenvalue of $A$, then the corresponding eigenvalue $lambda^2$ of $A^2$ is nonnegative. But my problem is how can we guarantee that it will cover all the possible eigenvalues of $A^2$?










      share|cite|improve this question











      $endgroup$




      For the answer, we can get support from two claims:
      Claim 1: If $A$ is real and symmetric, then it has real eigenvalues. Proof here
      Claim 2: If $lambda$ is an eigenvalue of $A$, then $lambda^2$ is an Eigenvalue of $A^2$. Proof here



      So by those two claims we can say that if $lambda$ is an eigenvalue of $A$, then the corresponding eigenvalue $lambda^2$ of $A^2$ is nonnegative. But my problem is how can we guarantee that it will cover all the possible eigenvalues of $A^2$?







      linear-algebra eigenvalues-eigenvectors






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 31 '18 at 22:21









      Bernard

      123k741117




      123k741117










      asked Dec 31 '18 at 22:16









      DD90DD90

      2648




      2648






















          5 Answers
          5






          active

          oldest

          votes


















          6












          $begingroup$

          Begin with the diagonalization
          $$
          A=PDP^{-1}
          $$

          where $P$ is the matrix of eigenvectors and $D$ is the diagonal matrix with eigenvalues on the main diagonal. Then
          $$
          A^2=(PDP^{-1})(PDP^{-1})=PD^2P^{-1}
          $$

          from which the claim follows.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Ah. So that means with this way, we can even omit the claim two.. is it?
            $endgroup$
            – DD90
            Dec 31 '18 at 22:26










          • $begingroup$
            This allows us to show a slightly stronger version of claim two, namely that not only will $lamba^2$ be an eigenvalue for every $lambda$, but if $mu$ is an eigenvalue of $A^2$, then there is a $lambda$ such that $mu=lambda^2$. This actually holds without without diagonalizability.
            $endgroup$
            – Aaron
            Dec 31 '18 at 23:34



















          4












          $begingroup$

          A symmetric matrix is diagonalizable, $D=PAP^{-1}$ where $A$ is symmetric and $D$ diagonal. $D^2=PA^2P^{-1}$, this implies that the eigenvalues of $A^2$ are the square of the eigenvalues of $A$.






          share|cite|improve this answer









          $endgroup$





















            3












            $begingroup$

            More than this is true: if $B$ is any real matrix, then the eigenvalues of $B^TB$ are real and nonnegative.



            The fact that the eigenvalues are real follows from your claim 1.



            Suppose $lambda$ is an eigenvalue with eigenvector $v$; then
            $$
            lambda(v^Tv)=v^T(lambda v)=v^TB^TBv=(Bv)^T(Bv)ge0
            $$

            so $lambdage0$.



            In your case $A$ is symmetric, so $A^2=A^TA$.



            With diagonalization you can indeed prove that the eigenvalues of $A^2$ are the squares of the eigenvalues of $A$, but it is not necessary for proving the statement you have.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              Well, $B$ does not have to be square, but has to be real.
              $endgroup$
              – A.Γ.
              Dec 31 '18 at 22:32










            • $begingroup$
              @A.Γ. Yes, fixed
              $endgroup$
              – egreg
              Dec 31 '18 at 22:34










            • $begingroup$
              Small clarification.. Why did you say exactly that $(Bv)^T(Bv)$ is nonnegative?
              $endgroup$
              – DD90
              Dec 31 '18 at 22:38












            • $begingroup$
              @Dinesha Since $x^Tx=|x|^2$ we have $$lambda|v|^2=|Bv|^2.$$
              $endgroup$
              – A.Γ.
              Dec 31 '18 at 23:01










            • $begingroup$
              I think this is a better answer than the others, but on MSE better answers seem to get fewer upvotes.
              $endgroup$
              – user1551
              Jan 1 at 6:25



















            1












            $begingroup$

            Suppose $J$ is a Jordan form of $A$, then it should be clear that the diagonal elements of $J^2$ are the squares of the diagonal elements of $J$. In other words, the eigenvalues of
            $A^2$ are exactly the squares of the eigenvalues of $A$. This is true for any
            square matrix, and is true much more generally (that is, the eigenvalues of the function of a matrix are the functions of the eigenvalues of the matrix).



            Hence the eigenvalues are all of the form $x^2$ where $x$ is real.






            share|cite|improve this answer









            $endgroup$





















              0












              $begingroup$

              Let $lambda = a+ibin mathbb{C}setminus mathbb{R}$. For any $xinmathbb{C}^n$ we have



              begin{align}
              |(A^2-lambda I)x|^2|x|^2 &ge left|langle (A^2-lambda I)x,x rangleright|^2 \
              &= left|langle A^2x,xrangle - lambdalangle x,xrangleright|^2\
              &= left|left(|Ax|^2 - a|x|^2right) + ib|x|^2right|^2\
              &= left(|Ax|^2 - a|x|^2right)^2 + |b|^2|x|^2\
              &ge |b|^2|x|^4
              end{align}

              so $|(A^2-lambda I)x| ge |b||x|$. Since $bne 0$, we see that $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



              Now let $lambda < 0$. For any $xinmathbb{C}^n$ we have



              $$|(A^2-lambda I)x||x| ge langle (A^2-lambda I)x,xrangle = langle A^2x,xrangle - lambdalangle x,xrangle = |Ax|^2 - lambda |x|^2 ge -lambda |x|^2$$
              so again $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



              We conclude that the eigenvalues of $A^2$ are contained in $[0, +inftyrangle$.






              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%2f3058082%2fif-a-is-a-symmetric-matrix-then-all-the-eigenvalues-of-a2-are-nonnegative%23new-answer', 'question_page');
                }
                );

                Post as a guest















                Required, but never shown

























                5 Answers
                5






                active

                oldest

                votes








                5 Answers
                5






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes









                6












                $begingroup$

                Begin with the diagonalization
                $$
                A=PDP^{-1}
                $$

                where $P$ is the matrix of eigenvectors and $D$ is the diagonal matrix with eigenvalues on the main diagonal. Then
                $$
                A^2=(PDP^{-1})(PDP^{-1})=PD^2P^{-1}
                $$

                from which the claim follows.






                share|cite|improve this answer









                $endgroup$













                • $begingroup$
                  Ah. So that means with this way, we can even omit the claim two.. is it?
                  $endgroup$
                  – DD90
                  Dec 31 '18 at 22:26










                • $begingroup$
                  This allows us to show a slightly stronger version of claim two, namely that not only will $lamba^2$ be an eigenvalue for every $lambda$, but if $mu$ is an eigenvalue of $A^2$, then there is a $lambda$ such that $mu=lambda^2$. This actually holds without without diagonalizability.
                  $endgroup$
                  – Aaron
                  Dec 31 '18 at 23:34
















                6












                $begingroup$

                Begin with the diagonalization
                $$
                A=PDP^{-1}
                $$

                where $P$ is the matrix of eigenvectors and $D$ is the diagonal matrix with eigenvalues on the main diagonal. Then
                $$
                A^2=(PDP^{-1})(PDP^{-1})=PD^2P^{-1}
                $$

                from which the claim follows.






                share|cite|improve this answer









                $endgroup$













                • $begingroup$
                  Ah. So that means with this way, we can even omit the claim two.. is it?
                  $endgroup$
                  – DD90
                  Dec 31 '18 at 22:26










                • $begingroup$
                  This allows us to show a slightly stronger version of claim two, namely that not only will $lamba^2$ be an eigenvalue for every $lambda$, but if $mu$ is an eigenvalue of $A^2$, then there is a $lambda$ such that $mu=lambda^2$. This actually holds without without diagonalizability.
                  $endgroup$
                  – Aaron
                  Dec 31 '18 at 23:34














                6












                6








                6





                $begingroup$

                Begin with the diagonalization
                $$
                A=PDP^{-1}
                $$

                where $P$ is the matrix of eigenvectors and $D$ is the diagonal matrix with eigenvalues on the main diagonal. Then
                $$
                A^2=(PDP^{-1})(PDP^{-1})=PD^2P^{-1}
                $$

                from which the claim follows.






                share|cite|improve this answer









                $endgroup$



                Begin with the diagonalization
                $$
                A=PDP^{-1}
                $$

                where $P$ is the matrix of eigenvectors and $D$ is the diagonal matrix with eigenvalues on the main diagonal. Then
                $$
                A^2=(PDP^{-1})(PDP^{-1})=PD^2P^{-1}
                $$

                from which the claim follows.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 31 '18 at 22:20









                Foobaz JohnFoobaz John

                22.8k41452




                22.8k41452












                • $begingroup$
                  Ah. So that means with this way, we can even omit the claim two.. is it?
                  $endgroup$
                  – DD90
                  Dec 31 '18 at 22:26










                • $begingroup$
                  This allows us to show a slightly stronger version of claim two, namely that not only will $lamba^2$ be an eigenvalue for every $lambda$, but if $mu$ is an eigenvalue of $A^2$, then there is a $lambda$ such that $mu=lambda^2$. This actually holds without without diagonalizability.
                  $endgroup$
                  – Aaron
                  Dec 31 '18 at 23:34


















                • $begingroup$
                  Ah. So that means with this way, we can even omit the claim two.. is it?
                  $endgroup$
                  – DD90
                  Dec 31 '18 at 22:26










                • $begingroup$
                  This allows us to show a slightly stronger version of claim two, namely that not only will $lamba^2$ be an eigenvalue for every $lambda$, but if $mu$ is an eigenvalue of $A^2$, then there is a $lambda$ such that $mu=lambda^2$. This actually holds without without diagonalizability.
                  $endgroup$
                  – Aaron
                  Dec 31 '18 at 23:34
















                $begingroup$
                Ah. So that means with this way, we can even omit the claim two.. is it?
                $endgroup$
                – DD90
                Dec 31 '18 at 22:26




                $begingroup$
                Ah. So that means with this way, we can even omit the claim two.. is it?
                $endgroup$
                – DD90
                Dec 31 '18 at 22:26












                $begingroup$
                This allows us to show a slightly stronger version of claim two, namely that not only will $lamba^2$ be an eigenvalue for every $lambda$, but if $mu$ is an eigenvalue of $A^2$, then there is a $lambda$ such that $mu=lambda^2$. This actually holds without without diagonalizability.
                $endgroup$
                – Aaron
                Dec 31 '18 at 23:34




                $begingroup$
                This allows us to show a slightly stronger version of claim two, namely that not only will $lamba^2$ be an eigenvalue for every $lambda$, but if $mu$ is an eigenvalue of $A^2$, then there is a $lambda$ such that $mu=lambda^2$. This actually holds without without diagonalizability.
                $endgroup$
                – Aaron
                Dec 31 '18 at 23:34











                4












                $begingroup$

                A symmetric matrix is diagonalizable, $D=PAP^{-1}$ where $A$ is symmetric and $D$ diagonal. $D^2=PA^2P^{-1}$, this implies that the eigenvalues of $A^2$ are the square of the eigenvalues of $A$.






                share|cite|improve this answer









                $endgroup$


















                  4












                  $begingroup$

                  A symmetric matrix is diagonalizable, $D=PAP^{-1}$ where $A$ is symmetric and $D$ diagonal. $D^2=PA^2P^{-1}$, this implies that the eigenvalues of $A^2$ are the square of the eigenvalues of $A$.






                  share|cite|improve this answer









                  $endgroup$
















                    4












                    4








                    4





                    $begingroup$

                    A symmetric matrix is diagonalizable, $D=PAP^{-1}$ where $A$ is symmetric and $D$ diagonal. $D^2=PA^2P^{-1}$, this implies that the eigenvalues of $A^2$ are the square of the eigenvalues of $A$.






                    share|cite|improve this answer









                    $endgroup$



                    A symmetric matrix is diagonalizable, $D=PAP^{-1}$ where $A$ is symmetric and $D$ diagonal. $D^2=PA^2P^{-1}$, this implies that the eigenvalues of $A^2$ are the square of the eigenvalues of $A$.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Dec 31 '18 at 22:19









                    Tsemo AristideTsemo Aristide

                    59.9k11446




                    59.9k11446























                        3












                        $begingroup$

                        More than this is true: if $B$ is any real matrix, then the eigenvalues of $B^TB$ are real and nonnegative.



                        The fact that the eigenvalues are real follows from your claim 1.



                        Suppose $lambda$ is an eigenvalue with eigenvector $v$; then
                        $$
                        lambda(v^Tv)=v^T(lambda v)=v^TB^TBv=(Bv)^T(Bv)ge0
                        $$

                        so $lambdage0$.



                        In your case $A$ is symmetric, so $A^2=A^TA$.



                        With diagonalization you can indeed prove that the eigenvalues of $A^2$ are the squares of the eigenvalues of $A$, but it is not necessary for proving the statement you have.






                        share|cite|improve this answer











                        $endgroup$













                        • $begingroup$
                          Well, $B$ does not have to be square, but has to be real.
                          $endgroup$
                          – A.Γ.
                          Dec 31 '18 at 22:32










                        • $begingroup$
                          @A.Γ. Yes, fixed
                          $endgroup$
                          – egreg
                          Dec 31 '18 at 22:34










                        • $begingroup$
                          Small clarification.. Why did you say exactly that $(Bv)^T(Bv)$ is nonnegative?
                          $endgroup$
                          – DD90
                          Dec 31 '18 at 22:38












                        • $begingroup$
                          @Dinesha Since $x^Tx=|x|^2$ we have $$lambda|v|^2=|Bv|^2.$$
                          $endgroup$
                          – A.Γ.
                          Dec 31 '18 at 23:01










                        • $begingroup$
                          I think this is a better answer than the others, but on MSE better answers seem to get fewer upvotes.
                          $endgroup$
                          – user1551
                          Jan 1 at 6:25
















                        3












                        $begingroup$

                        More than this is true: if $B$ is any real matrix, then the eigenvalues of $B^TB$ are real and nonnegative.



                        The fact that the eigenvalues are real follows from your claim 1.



                        Suppose $lambda$ is an eigenvalue with eigenvector $v$; then
                        $$
                        lambda(v^Tv)=v^T(lambda v)=v^TB^TBv=(Bv)^T(Bv)ge0
                        $$

                        so $lambdage0$.



                        In your case $A$ is symmetric, so $A^2=A^TA$.



                        With diagonalization you can indeed prove that the eigenvalues of $A^2$ are the squares of the eigenvalues of $A$, but it is not necessary for proving the statement you have.






                        share|cite|improve this answer











                        $endgroup$













                        • $begingroup$
                          Well, $B$ does not have to be square, but has to be real.
                          $endgroup$
                          – A.Γ.
                          Dec 31 '18 at 22:32










                        • $begingroup$
                          @A.Γ. Yes, fixed
                          $endgroup$
                          – egreg
                          Dec 31 '18 at 22:34










                        • $begingroup$
                          Small clarification.. Why did you say exactly that $(Bv)^T(Bv)$ is nonnegative?
                          $endgroup$
                          – DD90
                          Dec 31 '18 at 22:38












                        • $begingroup$
                          @Dinesha Since $x^Tx=|x|^2$ we have $$lambda|v|^2=|Bv|^2.$$
                          $endgroup$
                          – A.Γ.
                          Dec 31 '18 at 23:01










                        • $begingroup$
                          I think this is a better answer than the others, but on MSE better answers seem to get fewer upvotes.
                          $endgroup$
                          – user1551
                          Jan 1 at 6:25














                        3












                        3








                        3





                        $begingroup$

                        More than this is true: if $B$ is any real matrix, then the eigenvalues of $B^TB$ are real and nonnegative.



                        The fact that the eigenvalues are real follows from your claim 1.



                        Suppose $lambda$ is an eigenvalue with eigenvector $v$; then
                        $$
                        lambda(v^Tv)=v^T(lambda v)=v^TB^TBv=(Bv)^T(Bv)ge0
                        $$

                        so $lambdage0$.



                        In your case $A$ is symmetric, so $A^2=A^TA$.



                        With diagonalization you can indeed prove that the eigenvalues of $A^2$ are the squares of the eigenvalues of $A$, but it is not necessary for proving the statement you have.






                        share|cite|improve this answer











                        $endgroup$



                        More than this is true: if $B$ is any real matrix, then the eigenvalues of $B^TB$ are real and nonnegative.



                        The fact that the eigenvalues are real follows from your claim 1.



                        Suppose $lambda$ is an eigenvalue with eigenvector $v$; then
                        $$
                        lambda(v^Tv)=v^T(lambda v)=v^TB^TBv=(Bv)^T(Bv)ge0
                        $$

                        so $lambdage0$.



                        In your case $A$ is symmetric, so $A^2=A^TA$.



                        With diagonalization you can indeed prove that the eigenvalues of $A^2$ are the squares of the eigenvalues of $A$, but it is not necessary for proving the statement you have.







                        share|cite|improve this answer














                        share|cite|improve this answer



                        share|cite|improve this answer








                        edited Dec 31 '18 at 22:33

























                        answered Dec 31 '18 at 22:29









                        egregegreg

                        185k1486206




                        185k1486206












                        • $begingroup$
                          Well, $B$ does not have to be square, but has to be real.
                          $endgroup$
                          – A.Γ.
                          Dec 31 '18 at 22:32










                        • $begingroup$
                          @A.Γ. Yes, fixed
                          $endgroup$
                          – egreg
                          Dec 31 '18 at 22:34










                        • $begingroup$
                          Small clarification.. Why did you say exactly that $(Bv)^T(Bv)$ is nonnegative?
                          $endgroup$
                          – DD90
                          Dec 31 '18 at 22:38












                        • $begingroup$
                          @Dinesha Since $x^Tx=|x|^2$ we have $$lambda|v|^2=|Bv|^2.$$
                          $endgroup$
                          – A.Γ.
                          Dec 31 '18 at 23:01










                        • $begingroup$
                          I think this is a better answer than the others, but on MSE better answers seem to get fewer upvotes.
                          $endgroup$
                          – user1551
                          Jan 1 at 6:25


















                        • $begingroup$
                          Well, $B$ does not have to be square, but has to be real.
                          $endgroup$
                          – A.Γ.
                          Dec 31 '18 at 22:32










                        • $begingroup$
                          @A.Γ. Yes, fixed
                          $endgroup$
                          – egreg
                          Dec 31 '18 at 22:34










                        • $begingroup$
                          Small clarification.. Why did you say exactly that $(Bv)^T(Bv)$ is nonnegative?
                          $endgroup$
                          – DD90
                          Dec 31 '18 at 22:38












                        • $begingroup$
                          @Dinesha Since $x^Tx=|x|^2$ we have $$lambda|v|^2=|Bv|^2.$$
                          $endgroup$
                          – A.Γ.
                          Dec 31 '18 at 23:01










                        • $begingroup$
                          I think this is a better answer than the others, but on MSE better answers seem to get fewer upvotes.
                          $endgroup$
                          – user1551
                          Jan 1 at 6:25
















                        $begingroup$
                        Well, $B$ does not have to be square, but has to be real.
                        $endgroup$
                        – A.Γ.
                        Dec 31 '18 at 22:32




                        $begingroup$
                        Well, $B$ does not have to be square, but has to be real.
                        $endgroup$
                        – A.Γ.
                        Dec 31 '18 at 22:32












                        $begingroup$
                        @A.Γ. Yes, fixed
                        $endgroup$
                        – egreg
                        Dec 31 '18 at 22:34




                        $begingroup$
                        @A.Γ. Yes, fixed
                        $endgroup$
                        – egreg
                        Dec 31 '18 at 22:34












                        $begingroup$
                        Small clarification.. Why did you say exactly that $(Bv)^T(Bv)$ is nonnegative?
                        $endgroup$
                        – DD90
                        Dec 31 '18 at 22:38






                        $begingroup$
                        Small clarification.. Why did you say exactly that $(Bv)^T(Bv)$ is nonnegative?
                        $endgroup$
                        – DD90
                        Dec 31 '18 at 22:38














                        $begingroup$
                        @Dinesha Since $x^Tx=|x|^2$ we have $$lambda|v|^2=|Bv|^2.$$
                        $endgroup$
                        – A.Γ.
                        Dec 31 '18 at 23:01




                        $begingroup$
                        @Dinesha Since $x^Tx=|x|^2$ we have $$lambda|v|^2=|Bv|^2.$$
                        $endgroup$
                        – A.Γ.
                        Dec 31 '18 at 23:01












                        $begingroup$
                        I think this is a better answer than the others, but on MSE better answers seem to get fewer upvotes.
                        $endgroup$
                        – user1551
                        Jan 1 at 6:25




                        $begingroup$
                        I think this is a better answer than the others, but on MSE better answers seem to get fewer upvotes.
                        $endgroup$
                        – user1551
                        Jan 1 at 6:25











                        1












                        $begingroup$

                        Suppose $J$ is a Jordan form of $A$, then it should be clear that the diagonal elements of $J^2$ are the squares of the diagonal elements of $J$. In other words, the eigenvalues of
                        $A^2$ are exactly the squares of the eigenvalues of $A$. This is true for any
                        square matrix, and is true much more generally (that is, the eigenvalues of the function of a matrix are the functions of the eigenvalues of the matrix).



                        Hence the eigenvalues are all of the form $x^2$ where $x$ is real.






                        share|cite|improve this answer









                        $endgroup$


















                          1












                          $begingroup$

                          Suppose $J$ is a Jordan form of $A$, then it should be clear that the diagonal elements of $J^2$ are the squares of the diagonal elements of $J$. In other words, the eigenvalues of
                          $A^2$ are exactly the squares of the eigenvalues of $A$. This is true for any
                          square matrix, and is true much more generally (that is, the eigenvalues of the function of a matrix are the functions of the eigenvalues of the matrix).



                          Hence the eigenvalues are all of the form $x^2$ where $x$ is real.






                          share|cite|improve this answer









                          $endgroup$
















                            1












                            1








                            1





                            $begingroup$

                            Suppose $J$ is a Jordan form of $A$, then it should be clear that the diagonal elements of $J^2$ are the squares of the diagonal elements of $J$. In other words, the eigenvalues of
                            $A^2$ are exactly the squares of the eigenvalues of $A$. This is true for any
                            square matrix, and is true much more generally (that is, the eigenvalues of the function of a matrix are the functions of the eigenvalues of the matrix).



                            Hence the eigenvalues are all of the form $x^2$ where $x$ is real.






                            share|cite|improve this answer









                            $endgroup$



                            Suppose $J$ is a Jordan form of $A$, then it should be clear that the diagonal elements of $J^2$ are the squares of the diagonal elements of $J$. In other words, the eigenvalues of
                            $A^2$ are exactly the squares of the eigenvalues of $A$. This is true for any
                            square matrix, and is true much more generally (that is, the eigenvalues of the function of a matrix are the functions of the eigenvalues of the matrix).



                            Hence the eigenvalues are all of the form $x^2$ where $x$ is real.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Dec 31 '18 at 22:28









                            copper.hatcopper.hat

                            128k559161




                            128k559161























                                0












                                $begingroup$

                                Let $lambda = a+ibin mathbb{C}setminus mathbb{R}$. For any $xinmathbb{C}^n$ we have



                                begin{align}
                                |(A^2-lambda I)x|^2|x|^2 &ge left|langle (A^2-lambda I)x,x rangleright|^2 \
                                &= left|langle A^2x,xrangle - lambdalangle x,xrangleright|^2\
                                &= left|left(|Ax|^2 - a|x|^2right) + ib|x|^2right|^2\
                                &= left(|Ax|^2 - a|x|^2right)^2 + |b|^2|x|^2\
                                &ge |b|^2|x|^4
                                end{align}

                                so $|(A^2-lambda I)x| ge |b||x|$. Since $bne 0$, we see that $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



                                Now let $lambda < 0$. For any $xinmathbb{C}^n$ we have



                                $$|(A^2-lambda I)x||x| ge langle (A^2-lambda I)x,xrangle = langle A^2x,xrangle - lambdalangle x,xrangle = |Ax|^2 - lambda |x|^2 ge -lambda |x|^2$$
                                so again $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



                                We conclude that the eigenvalues of $A^2$ are contained in $[0, +inftyrangle$.






                                share|cite|improve this answer









                                $endgroup$


















                                  0












                                  $begingroup$

                                  Let $lambda = a+ibin mathbb{C}setminus mathbb{R}$. For any $xinmathbb{C}^n$ we have



                                  begin{align}
                                  |(A^2-lambda I)x|^2|x|^2 &ge left|langle (A^2-lambda I)x,x rangleright|^2 \
                                  &= left|langle A^2x,xrangle - lambdalangle x,xrangleright|^2\
                                  &= left|left(|Ax|^2 - a|x|^2right) + ib|x|^2right|^2\
                                  &= left(|Ax|^2 - a|x|^2right)^2 + |b|^2|x|^2\
                                  &ge |b|^2|x|^4
                                  end{align}

                                  so $|(A^2-lambda I)x| ge |b||x|$. Since $bne 0$, we see that $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



                                  Now let $lambda < 0$. For any $xinmathbb{C}^n$ we have



                                  $$|(A^2-lambda I)x||x| ge langle (A^2-lambda I)x,xrangle = langle A^2x,xrangle - lambdalangle x,xrangle = |Ax|^2 - lambda |x|^2 ge -lambda |x|^2$$
                                  so again $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



                                  We conclude that the eigenvalues of $A^2$ are contained in $[0, +inftyrangle$.






                                  share|cite|improve this answer









                                  $endgroup$
















                                    0












                                    0








                                    0





                                    $begingroup$

                                    Let $lambda = a+ibin mathbb{C}setminus mathbb{R}$. For any $xinmathbb{C}^n$ we have



                                    begin{align}
                                    |(A^2-lambda I)x|^2|x|^2 &ge left|langle (A^2-lambda I)x,x rangleright|^2 \
                                    &= left|langle A^2x,xrangle - lambdalangle x,xrangleright|^2\
                                    &= left|left(|Ax|^2 - a|x|^2right) + ib|x|^2right|^2\
                                    &= left(|Ax|^2 - a|x|^2right)^2 + |b|^2|x|^2\
                                    &ge |b|^2|x|^4
                                    end{align}

                                    so $|(A^2-lambda I)x| ge |b||x|$. Since $bne 0$, we see that $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



                                    Now let $lambda < 0$. For any $xinmathbb{C}^n$ we have



                                    $$|(A^2-lambda I)x||x| ge langle (A^2-lambda I)x,xrangle = langle A^2x,xrangle - lambdalangle x,xrangle = |Ax|^2 - lambda |x|^2 ge -lambda |x|^2$$
                                    so again $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



                                    We conclude that the eigenvalues of $A^2$ are contained in $[0, +inftyrangle$.






                                    share|cite|improve this answer









                                    $endgroup$



                                    Let $lambda = a+ibin mathbb{C}setminus mathbb{R}$. For any $xinmathbb{C}^n$ we have



                                    begin{align}
                                    |(A^2-lambda I)x|^2|x|^2 &ge left|langle (A^2-lambda I)x,x rangleright|^2 \
                                    &= left|langle A^2x,xrangle - lambdalangle x,xrangleright|^2\
                                    &= left|left(|Ax|^2 - a|x|^2right) + ib|x|^2right|^2\
                                    &= left(|Ax|^2 - a|x|^2right)^2 + |b|^2|x|^2\
                                    &ge |b|^2|x|^4
                                    end{align}

                                    so $|(A^2-lambda I)x| ge |b||x|$. Since $bne 0$, we see that $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



                                    Now let $lambda < 0$. For any $xinmathbb{C}^n$ we have



                                    $$|(A^2-lambda I)x||x| ge langle (A^2-lambda I)x,xrangle = langle A^2x,xrangle - lambdalangle x,xrangle = |Ax|^2 - lambda |x|^2 ge -lambda |x|^2$$
                                    so again $A^2-lambda I$ is bounded from below and hence injective. Therefore $lambda$ is not an eigenvalue of $A^2$.



                                    We conclude that the eigenvalues of $A^2$ are contained in $[0, +inftyrangle$.







                                    share|cite|improve this answer












                                    share|cite|improve this answer



                                    share|cite|improve this answer










                                    answered Dec 31 '18 at 23:21









                                    mechanodroidmechanodroid

                                    29k62648




                                    29k62648






























                                        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%2f3058082%2fif-a-is-a-symmetric-matrix-then-all-the-eigenvalues-of-a2-are-nonnegative%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

                                        To store a contact into the json file from server.js file using a class in NodeJS

                                        Redirect URL with Chrome Remote Debugging Android Devices

                                        Dieringhausen