Does $exists$ a matrix $A$ so that ${A^p:pgeq 1}$ spans $M_n(mathbb R)?$












0












$begingroup$


The main question is :




(TRUE/FALSE)



For any $ngeq 2,$ there exists an $ntimes n$ real matrix $A$ such thatthe set ${A^p|pgeq 1}$ spans the $mathbb R$ vector space $M_n(mathbb R).$




I tried whether we can find such $A$ that the above set spans $left(begin{array}{cc} 1 & 0\ 0 & 0 end{array}right)$, $left(begin{array}{cc} 0 & 1\ 0 & 0 end{array}right)$, $left(begin{array}{cc} 0 & 0\ 1 & 0 end{array}right)$ and $left(begin{array}{cc} 0 & 0\ 0 & 1 end{array}right)$. But I could not go further.



Any help is appreciated. Thank you






linear-algebra matrices







share|cite|improve this question









$endgroup$








  • 4




    $begingroup$
    Hint: use the Cayley-Hamilton theorem.
    $endgroup$
    – Mindlack
    Jan 6 at 13:35






  • 2




    $begingroup$
    Show that $text{span}{A^k ;|;kge 0}$ is of dimension $le n$.
    $endgroup$
    – Song
    Jan 6 at 13:37












  • $begingroup$
    Yes we can't find $n^2$ linearly independent matrices.
    $endgroup$
    – nurun nesha
    Jan 6 at 13:38
















0












$begingroup$


The main question is :




(TRUE/FALSE)



For any $ngeq 2,$ there exists an $ntimes n$ real matrix $A$ such thatthe set ${A^p|pgeq 1}$ spans the $mathbb R$ vector space $M_n(mathbb R).$




I tried whether we can find such $A$ that the above set spans $left(begin{array}{cc} 1 & 0\ 0 & 0 end{array}right)$, $left(begin{array}{cc} 0 & 1\ 0 & 0 end{array}right)$, $left(begin{array}{cc} 0 & 0\ 1 & 0 end{array}right)$ and $left(begin{array}{cc} 0 & 0\ 0 & 1 end{array}right)$. But I could not go further.



Any help is appreciated. Thank you






linear-algebra matrices







share|cite|improve this question









$endgroup$








  • 4




    $begingroup$
    Hint: use the Cayley-Hamilton theorem.
    $endgroup$
    – Mindlack
    Jan 6 at 13:35






  • 2




    $begingroup$
    Show that $text{span}{A^k ;|;kge 0}$ is of dimension $le n$.
    $endgroup$
    – Song
    Jan 6 at 13:37












  • $begingroup$
    Yes we can't find $n^2$ linearly independent matrices.
    $endgroup$
    – nurun nesha
    Jan 6 at 13:38














0












0








0


1



$begingroup$


The main question is :




(TRUE/FALSE)



For any $ngeq 2,$ there exists an $ntimes n$ real matrix $A$ such thatthe set ${A^p|pgeq 1}$ spans the $mathbb R$ vector space $M_n(mathbb R).$




I tried whether we can find such $A$ that the above set spans $left(begin{array}{cc} 1 & 0\ 0 & 0 end{array}right)$, $left(begin{array}{cc} 0 & 1\ 0 & 0 end{array}right)$, $left(begin{array}{cc} 0 & 0\ 1 & 0 end{array}right)$ and $left(begin{array}{cc} 0 & 0\ 0 & 1 end{array}right)$. But I could not go further.



Any help is appreciated. Thank you






linear-algebra matrices







share|cite|improve this question









$endgroup$




The main question is :




(TRUE/FALSE)



For any $ngeq 2,$ there exists an $ntimes n$ real matrix $A$ such thatthe set ${A^p|pgeq 1}$ spans the $mathbb R$ vector space $M_n(mathbb R).$




I tried whether we can find such $A$ that the above set spans $left(begin{array}{cc} 1 & 0\ 0 & 0 end{array}right)$, $left(begin{array}{cc} 0 & 1\ 0 & 0 end{array}right)$, $left(begin{array}{cc} 0 & 0\ 1 & 0 end{array}right)$ and $left(begin{array}{cc} 0 & 0\ 0 & 1 end{array}right)$. But I could not go further.



Any help is appreciated. Thank you






linear-algebra matrices




linear-algebra matrices






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 6 at 13:28









nurun neshanurun nesha

9952623




9952623








  • 4




    $begingroup$
    Hint: use the Cayley-Hamilton theorem.
    $endgroup$
    – Mindlack
    Jan 6 at 13:35






  • 2




    $begingroup$
    Show that $text{span}{A^k ;|;kge 0}$ is of dimension $le n$.
    $endgroup$
    – Song
    Jan 6 at 13:37












  • $begingroup$
    Yes we can't find $n^2$ linearly independent matrices.
    $endgroup$
    – nurun nesha
    Jan 6 at 13:38














  • 4




    $begingroup$
    Hint: use the Cayley-Hamilton theorem.
    $endgroup$
    – Mindlack
    Jan 6 at 13:35






  • 2




    $begingroup$
    Show that $text{span}{A^k ;|;kge 0}$ is of dimension $le n$.
    $endgroup$
    – Song
    Jan 6 at 13:37












  • $begingroup$
    Yes we can't find $n^2$ linearly independent matrices.
    $endgroup$
    – nurun nesha
    Jan 6 at 13:38








4




4




$begingroup$
Hint: use the Cayley-Hamilton theorem.
$endgroup$
– Mindlack
Jan 6 at 13:35




$begingroup$
Hint: use the Cayley-Hamilton theorem.
$endgroup$
– Mindlack
Jan 6 at 13:35




2




2




$begingroup$
Show that $text{span}{A^k ;|;kge 0}$ is of dimension $le n$.
$endgroup$
– Song
Jan 6 at 13:37






$begingroup$
Show that $text{span}{A^k ;|;kge 0}$ is of dimension $le n$.
$endgroup$
– Song
Jan 6 at 13:37














$begingroup$
Yes we can't find $n^2$ linearly independent matrices.
$endgroup$
– nurun nesha
Jan 6 at 13:38




$begingroup$
Yes we can't find $n^2$ linearly independent matrices.
$endgroup$
– nurun nesha
Jan 6 at 13:38










3 Answers
3






active

oldest

votes


















7












$begingroup$

It is already false for $n=2$. By Cayley-Hamilton, $A^2-tr(A)A+det(A)I=0$ for all $Ain M_2(K)$, so that $I,A,A^2,ldots,$ do not span the $4$-dimensional vector space $M_2(K)$ for any $A$.






share|cite|improve this answer









$endgroup$





















    2












    $begingroup$

    In fact it is false for all $nge2$ (an even stronger statement).



    By the Cayley-Hamilton theorem, $A$ satisfies its characteristic polynomial. This is an $n$th degree polynomial, $C_A(x)=operatorname{det}(xI-A)=x^n+a_{n-1}A^{n-1}+dots +a_0$.



    So $C_A(A)=A^n+a_{n-1}A^{n-1}dots+a_0=0$.



    This shows that $A^ninoperatorname{span}{A,dots,A^{n-1}}$. Thus, $operatorname{span}{A^pmid pge1}=operatorname{span}{A,dots,A^{n-1}}$.



    So, $operatorname{dim}(operatorname{span}{A^pmid pge1})lt n$.



    But the dimension of $M_n(Bbb R)$ is $n^2$. Therefore the answer is no, since $nge2implies n^2gt n$.






    share|cite|improve this answer











    $endgroup$





















      2












      $begingroup$

      Here is another proof. If ${A^p: pge1}$ spans $M_n(mathbb R)$, then all matrices are polynomials in $A$ and hence they commute with $A$. Now it is a standard exercise to show that if $A$ that commutes with all matrices, $A$ must be a scalar matrix. Yet, clearly, when $nge2$, if $A$ is a scalar matrix, the linear span of ${A^p: pge1}$ is at most the set of all scalar matrices. It cannot possibly be the set of all square matrices.






      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%2f3063853%2fdoes-exists-a-matrix-a-so-that-app-geq-1-spans-m-n-mathbb-r%23new-answer', 'question_page');
        }
        );

        Post as a guest















        Required, but never shown

























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        7












        $begingroup$

        It is already false for $n=2$. By Cayley-Hamilton, $A^2-tr(A)A+det(A)I=0$ for all $Ain M_2(K)$, so that $I,A,A^2,ldots,$ do not span the $4$-dimensional vector space $M_2(K)$ for any $A$.






        share|cite|improve this answer









        $endgroup$


















          7












          $begingroup$

          It is already false for $n=2$. By Cayley-Hamilton, $A^2-tr(A)A+det(A)I=0$ for all $Ain M_2(K)$, so that $I,A,A^2,ldots,$ do not span the $4$-dimensional vector space $M_2(K)$ for any $A$.






          share|cite|improve this answer









          $endgroup$
















            7












            7








            7





            $begingroup$

            It is already false for $n=2$. By Cayley-Hamilton, $A^2-tr(A)A+det(A)I=0$ for all $Ain M_2(K)$, so that $I,A,A^2,ldots,$ do not span the $4$-dimensional vector space $M_2(K)$ for any $A$.






            share|cite|improve this answer









            $endgroup$



            It is already false for $n=2$. By Cayley-Hamilton, $A^2-tr(A)A+det(A)I=0$ for all $Ain M_2(K)$, so that $I,A,A^2,ldots,$ do not span the $4$-dimensional vector space $M_2(K)$ for any $A$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 6 at 13:44









            Dietrich BurdeDietrich Burde

            78.3k64386




            78.3k64386























                2












                $begingroup$

                In fact it is false for all $nge2$ (an even stronger statement).



                By the Cayley-Hamilton theorem, $A$ satisfies its characteristic polynomial. This is an $n$th degree polynomial, $C_A(x)=operatorname{det}(xI-A)=x^n+a_{n-1}A^{n-1}+dots +a_0$.



                So $C_A(A)=A^n+a_{n-1}A^{n-1}dots+a_0=0$.



                This shows that $A^ninoperatorname{span}{A,dots,A^{n-1}}$. Thus, $operatorname{span}{A^pmid pge1}=operatorname{span}{A,dots,A^{n-1}}$.



                So, $operatorname{dim}(operatorname{span}{A^pmid pge1})lt n$.



                But the dimension of $M_n(Bbb R)$ is $n^2$. Therefore the answer is no, since $nge2implies n^2gt n$.






                share|cite|improve this answer











                $endgroup$


















                  2












                  $begingroup$

                  In fact it is false for all $nge2$ (an even stronger statement).



                  By the Cayley-Hamilton theorem, $A$ satisfies its characteristic polynomial. This is an $n$th degree polynomial, $C_A(x)=operatorname{det}(xI-A)=x^n+a_{n-1}A^{n-1}+dots +a_0$.



                  So $C_A(A)=A^n+a_{n-1}A^{n-1}dots+a_0=0$.



                  This shows that $A^ninoperatorname{span}{A,dots,A^{n-1}}$. Thus, $operatorname{span}{A^pmid pge1}=operatorname{span}{A,dots,A^{n-1}}$.



                  So, $operatorname{dim}(operatorname{span}{A^pmid pge1})lt n$.



                  But the dimension of $M_n(Bbb R)$ is $n^2$. Therefore the answer is no, since $nge2implies n^2gt n$.






                  share|cite|improve this answer











                  $endgroup$
















                    2












                    2








                    2





                    $begingroup$

                    In fact it is false for all $nge2$ (an even stronger statement).



                    By the Cayley-Hamilton theorem, $A$ satisfies its characteristic polynomial. This is an $n$th degree polynomial, $C_A(x)=operatorname{det}(xI-A)=x^n+a_{n-1}A^{n-1}+dots +a_0$.



                    So $C_A(A)=A^n+a_{n-1}A^{n-1}dots+a_0=0$.



                    This shows that $A^ninoperatorname{span}{A,dots,A^{n-1}}$. Thus, $operatorname{span}{A^pmid pge1}=operatorname{span}{A,dots,A^{n-1}}$.



                    So, $operatorname{dim}(operatorname{span}{A^pmid pge1})lt n$.



                    But the dimension of $M_n(Bbb R)$ is $n^2$. Therefore the answer is no, since $nge2implies n^2gt n$.






                    share|cite|improve this answer











                    $endgroup$



                    In fact it is false for all $nge2$ (an even stronger statement).



                    By the Cayley-Hamilton theorem, $A$ satisfies its characteristic polynomial. This is an $n$th degree polynomial, $C_A(x)=operatorname{det}(xI-A)=x^n+a_{n-1}A^{n-1}+dots +a_0$.



                    So $C_A(A)=A^n+a_{n-1}A^{n-1}dots+a_0=0$.



                    This shows that $A^ninoperatorname{span}{A,dots,A^{n-1}}$. Thus, $operatorname{span}{A^pmid pge1}=operatorname{span}{A,dots,A^{n-1}}$.



                    So, $operatorname{dim}(operatorname{span}{A^pmid pge1})lt n$.



                    But the dimension of $M_n(Bbb R)$ is $n^2$. Therefore the answer is no, since $nge2implies n^2gt n$.







                    share|cite|improve this answer














                    share|cite|improve this answer



                    share|cite|improve this answer








                    edited Jan 6 at 15:47

























                    answered Jan 6 at 14:56









                    Chris CusterChris Custer

                    11.2k3824




                    11.2k3824























                        2












                        $begingroup$

                        Here is another proof. If ${A^p: pge1}$ spans $M_n(mathbb R)$, then all matrices are polynomials in $A$ and hence they commute with $A$. Now it is a standard exercise to show that if $A$ that commutes with all matrices, $A$ must be a scalar matrix. Yet, clearly, when $nge2$, if $A$ is a scalar matrix, the linear span of ${A^p: pge1}$ is at most the set of all scalar matrices. It cannot possibly be the set of all square matrices.






                        share|cite|improve this answer









                        $endgroup$


















                          2












                          $begingroup$

                          Here is another proof. If ${A^p: pge1}$ spans $M_n(mathbb R)$, then all matrices are polynomials in $A$ and hence they commute with $A$. Now it is a standard exercise to show that if $A$ that commutes with all matrices, $A$ must be a scalar matrix. Yet, clearly, when $nge2$, if $A$ is a scalar matrix, the linear span of ${A^p: pge1}$ is at most the set of all scalar matrices. It cannot possibly be the set of all square matrices.






                          share|cite|improve this answer









                          $endgroup$
















                            2












                            2








                            2





                            $begingroup$

                            Here is another proof. If ${A^p: pge1}$ spans $M_n(mathbb R)$, then all matrices are polynomials in $A$ and hence they commute with $A$. Now it is a standard exercise to show that if $A$ that commutes with all matrices, $A$ must be a scalar matrix. Yet, clearly, when $nge2$, if $A$ is a scalar matrix, the linear span of ${A^p: pge1}$ is at most the set of all scalar matrices. It cannot possibly be the set of all square matrices.






                            share|cite|improve this answer









                            $endgroup$



                            Here is another proof. If ${A^p: pge1}$ spans $M_n(mathbb R)$, then all matrices are polynomials in $A$ and hence they commute with $A$. Now it is a standard exercise to show that if $A$ that commutes with all matrices, $A$ must be a scalar matrix. Yet, clearly, when $nge2$, if $A$ is a scalar matrix, the linear span of ${A^p: pge1}$ is at most the set of all scalar matrices. It cannot possibly be the set of all square matrices.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Jan 7 at 16:20









                            user1551user1551

                            72.2k566127




                            72.2k566127






























                                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%2f3063853%2fdoes-exists-a-matrix-a-so-that-app-geq-1-spans-m-n-mathbb-r%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

                                An IMO inspired problem

                                Image
                                14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
                                Read more

                                Management

                                Image
                                Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
                                Read more

                                Has there ever been an instance of an active nuclear power plant within or near a war zone?

                                Image
                                36 3 The question Has there ever been a military combat going on around an active (running or in outage but not decommissioned) commercial nuclear power plant? Or dangerously near it? If yes, how did the plant and its personnel fare in such situation? Why I ask Let's assume for the scope of this question modern commercial nuclear power plants (CANDU, PWR, BWR of generation II plus all of gen III and newer) are usually reasonably safe to operate given that the engineering has been done right and there is a whole cohort of very well trained personnel on-site at all times, well rested and with considerable resources on their hands. Things hard to get with an armed conflict like the recent Syrian war raging around. I can't seem to find any reference or a comprehensive article about this, hence this question.
                                Read more