Inverse of symmetric matrix $AA^top$ where $rank(A)=m leq n$?












0














Suppose I have a matrix $Ainmathbb{R^{mtimes n}}$ where $mleq n$ and $rank(A)=m$. Is the matrix $AA^top$ singular?



My hunch is that the matrix is only non-singular when $n=m$.






linear-algebra matrices linear-transformations matrix-rank







share|cite|improve this question





























    0














    Suppose I have a matrix $Ainmathbb{R^{mtimes n}}$ where $mleq n$ and $rank(A)=m$. Is the matrix $AA^top$ singular?



    My hunch is that the matrix is only non-singular when $n=m$.






    linear-algebra matrices linear-transformations matrix-rank







    share|cite|improve this question



























      0












      0








      0







      Suppose I have a matrix $Ainmathbb{R^{mtimes n}}$ where $mleq n$ and $rank(A)=m$. Is the matrix $AA^top$ singular?



      My hunch is that the matrix is only non-singular when $n=m$.






      linear-algebra matrices linear-transformations matrix-rank







      share|cite|improve this question















      Suppose I have a matrix $Ainmathbb{R^{mtimes n}}$ where $mleq n$ and $rank(A)=m$. Is the matrix $AA^top$ singular?



      My hunch is that the matrix is only non-singular when $n=m$.






      linear-algebra matrices linear-transformations matrix-rank




      linear-algebra matrices linear-transformations matrix-rank






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 4 '18 at 1:38







      UnchartedWaters

















      asked Dec 4 '18 at 1:31









      UnchartedWatersUnchartedWaters

      103




      103






















          3 Answers
          3






          active

          oldest

          votes


















          1














          Here's the proof that the $mtimes m$ matrix $AA^top$ is nonsingular. Suppose $AA^top x = 0$ for some vector $xinBbb R^m$. Then
          $$0=(AA^top x)cdot x = A^top xcdot A^top x$$
          by the fundamental property of transpose. This means that $A^top x = 0$. Since $A^top$ is an $ntimes m$ matrix with rank $m$, the only solution of this equation is $x=0$. (For example, the only linear combination of the columns of $A^top$ that gives the zero vector is the zero linear combination.) This means that $AA^top$ is in fact nonsingular.






          share|cite|improve this answer





















          • yeah, I was thinking of mentioning positive definite, with a comment that row rank equals column rank. At that point, I was taking a shower, and had not taken the keyboard with me.
            – Will Jagy
            Dec 4 '18 at 2:13






          • 1




            I'm sure your keyboard is grateful, @WillJagy!
            – Ted Shifrin
            Dec 4 '18 at 3:14



















          0














          Actually, with your symbols, $A A^T$ is non-singular, it is $m$ by $m.$



          The square $A^T A$ is a square matrix of size $n$ by $n$ but rank $m,$ therfore singular when $m < n$






          share|cite|improve this answer





















          • Thanks for your answer. But how do I prove that $AA^top$ is non-singular, in general? I'm from a CS background, not a maths background, so I might be missing some fundamental knowledge here.
            – UnchartedWaters
            Dec 4 '18 at 1:44





















          0














          Let $$A= begin{bmatrix}1 & 0 end{bmatrix}$$



          then we have $AA^T=1$.



          In general,
          $$rank(AA^T)=rank(A)=m,$$



          hence, it is nonsingular.






          share|cite|improve this answer























            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%2f3025002%2finverse-of-symmetric-matrix-aa-top-where-ranka-m-leq-n%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









            1














            Here's the proof that the $mtimes m$ matrix $AA^top$ is nonsingular. Suppose $AA^top x = 0$ for some vector $xinBbb R^m$. Then
            $$0=(AA^top x)cdot x = A^top xcdot A^top x$$
            by the fundamental property of transpose. This means that $A^top x = 0$. Since $A^top$ is an $ntimes m$ matrix with rank $m$, the only solution of this equation is $x=0$. (For example, the only linear combination of the columns of $A^top$ that gives the zero vector is the zero linear combination.) This means that $AA^top$ is in fact nonsingular.






            share|cite|improve this answer





















            • yeah, I was thinking of mentioning positive definite, with a comment that row rank equals column rank. At that point, I was taking a shower, and had not taken the keyboard with me.
              – Will Jagy
              Dec 4 '18 at 2:13






            • 1




              I'm sure your keyboard is grateful, @WillJagy!
              – Ted Shifrin
              Dec 4 '18 at 3:14
















            1














            Here's the proof that the $mtimes m$ matrix $AA^top$ is nonsingular. Suppose $AA^top x = 0$ for some vector $xinBbb R^m$. Then
            $$0=(AA^top x)cdot x = A^top xcdot A^top x$$
            by the fundamental property of transpose. This means that $A^top x = 0$. Since $A^top$ is an $ntimes m$ matrix with rank $m$, the only solution of this equation is $x=0$. (For example, the only linear combination of the columns of $A^top$ that gives the zero vector is the zero linear combination.) This means that $AA^top$ is in fact nonsingular.






            share|cite|improve this answer





















            • yeah, I was thinking of mentioning positive definite, with a comment that row rank equals column rank. At that point, I was taking a shower, and had not taken the keyboard with me.
              – Will Jagy
              Dec 4 '18 at 2:13






            • 1




              I'm sure your keyboard is grateful, @WillJagy!
              – Ted Shifrin
              Dec 4 '18 at 3:14














            1












            1








            1






            Here's the proof that the $mtimes m$ matrix $AA^top$ is nonsingular. Suppose $AA^top x = 0$ for some vector $xinBbb R^m$. Then
            $$0=(AA^top x)cdot x = A^top xcdot A^top x$$
            by the fundamental property of transpose. This means that $A^top x = 0$. Since $A^top$ is an $ntimes m$ matrix with rank $m$, the only solution of this equation is $x=0$. (For example, the only linear combination of the columns of $A^top$ that gives the zero vector is the zero linear combination.) This means that $AA^top$ is in fact nonsingular.






            share|cite|improve this answer












            Here's the proof that the $mtimes m$ matrix $AA^top$ is nonsingular. Suppose $AA^top x = 0$ for some vector $xinBbb R^m$. Then
            $$0=(AA^top x)cdot x = A^top xcdot A^top x$$
            by the fundamental property of transpose. This means that $A^top x = 0$. Since $A^top$ is an $ntimes m$ matrix with rank $m$, the only solution of this equation is $x=0$. (For example, the only linear combination of the columns of $A^top$ that gives the zero vector is the zero linear combination.) This means that $AA^top$ is in fact nonsingular.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 4 '18 at 2:04









            Ted ShifrinTed Shifrin

            63k44489




            63k44489












            • yeah, I was thinking of mentioning positive definite, with a comment that row rank equals column rank. At that point, I was taking a shower, and had not taken the keyboard with me.
              – Will Jagy
              Dec 4 '18 at 2:13






            • 1




              I'm sure your keyboard is grateful, @WillJagy!
              – Ted Shifrin
              Dec 4 '18 at 3:14


















            • yeah, I was thinking of mentioning positive definite, with a comment that row rank equals column rank. At that point, I was taking a shower, and had not taken the keyboard with me.
              – Will Jagy
              Dec 4 '18 at 2:13






            • 1




              I'm sure your keyboard is grateful, @WillJagy!
              – Ted Shifrin
              Dec 4 '18 at 3:14
















            yeah, I was thinking of mentioning positive definite, with a comment that row rank equals column rank. At that point, I was taking a shower, and had not taken the keyboard with me.
            – Will Jagy
            Dec 4 '18 at 2:13




            yeah, I was thinking of mentioning positive definite, with a comment that row rank equals column rank. At that point, I was taking a shower, and had not taken the keyboard with me.
            – Will Jagy
            Dec 4 '18 at 2:13




            1




            1




            I'm sure your keyboard is grateful, @WillJagy!
            – Ted Shifrin
            Dec 4 '18 at 3:14




            I'm sure your keyboard is grateful, @WillJagy!
            – Ted Shifrin
            Dec 4 '18 at 3:14











            0














            Actually, with your symbols, $A A^T$ is non-singular, it is $m$ by $m.$



            The square $A^T A$ is a square matrix of size $n$ by $n$ but rank $m,$ therfore singular when $m < n$






            share|cite|improve this answer





















            • Thanks for your answer. But how do I prove that $AA^top$ is non-singular, in general? I'm from a CS background, not a maths background, so I might be missing some fundamental knowledge here.
              – UnchartedWaters
              Dec 4 '18 at 1:44


















            0














            Actually, with your symbols, $A A^T$ is non-singular, it is $m$ by $m.$



            The square $A^T A$ is a square matrix of size $n$ by $n$ but rank $m,$ therfore singular when $m < n$






            share|cite|improve this answer





















            • Thanks for your answer. But how do I prove that $AA^top$ is non-singular, in general? I'm from a CS background, not a maths background, so I might be missing some fundamental knowledge here.
              – UnchartedWaters
              Dec 4 '18 at 1:44
















            0












            0








            0






            Actually, with your symbols, $A A^T$ is non-singular, it is $m$ by $m.$



            The square $A^T A$ is a square matrix of size $n$ by $n$ but rank $m,$ therfore singular when $m < n$






            share|cite|improve this answer












            Actually, with your symbols, $A A^T$ is non-singular, it is $m$ by $m.$



            The square $A^T A$ is a square matrix of size $n$ by $n$ but rank $m,$ therfore singular when $m < n$







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Dec 4 '18 at 1:42









            Will JagyWill Jagy

            102k5100199




            102k5100199












            • Thanks for your answer. But how do I prove that $AA^top$ is non-singular, in general? I'm from a CS background, not a maths background, so I might be missing some fundamental knowledge here.
              – UnchartedWaters
              Dec 4 '18 at 1:44




















            • Thanks for your answer. But how do I prove that $AA^top$ is non-singular, in general? I'm from a CS background, not a maths background, so I might be missing some fundamental knowledge here.
              – UnchartedWaters
              Dec 4 '18 at 1:44


















            Thanks for your answer. But how do I prove that $AA^top$ is non-singular, in general? I'm from a CS background, not a maths background, so I might be missing some fundamental knowledge here.
            – UnchartedWaters
            Dec 4 '18 at 1:44






            Thanks for your answer. But how do I prove that $AA^top$ is non-singular, in general? I'm from a CS background, not a maths background, so I might be missing some fundamental knowledge here.
            – UnchartedWaters
            Dec 4 '18 at 1:44













            0














            Let $$A= begin{bmatrix}1 & 0 end{bmatrix}$$



            then we have $AA^T=1$.



            In general,
            $$rank(AA^T)=rank(A)=m,$$



            hence, it is nonsingular.






            share|cite|improve this answer




























              0














              Let $$A= begin{bmatrix}1 & 0 end{bmatrix}$$



              then we have $AA^T=1$.



              In general,
              $$rank(AA^T)=rank(A)=m,$$



              hence, it is nonsingular.






              share|cite|improve this answer


























                0












                0








                0






                Let $$A= begin{bmatrix}1 & 0 end{bmatrix}$$



                then we have $AA^T=1$.



                In general,
                $$rank(AA^T)=rank(A)=m,$$



                hence, it is nonsingular.






                share|cite|improve this answer














                Let $$A= begin{bmatrix}1 & 0 end{bmatrix}$$



                then we have $AA^T=1$.



                In general,
                $$rank(AA^T)=rank(A)=m,$$



                hence, it is nonsingular.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Dec 4 '18 at 1:55

























                answered Dec 4 '18 at 1:41









                Siong Thye GohSiong Thye Goh

                99.9k1465117




                99.9k1465117






























                    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.





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • 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.


                    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%2f3025002%2finverse-of-symmetric-matrix-aa-top-where-ranka-m-leq-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

                    Wiesbaden

                    Image
                    Wappen Deutschlandkarte 50.0825 8.24 117 Koordinaten: 50° 5′  N , 8° 14′  O Basisdaten Bundesland: Hessen Regierungsbezirk: Darmstadt Höhe: 117 m ü. NHN Fläche: 203,93 km 2 Einwohner: 278.654 (31. Dez. 2017) [1] Bevölkerungsdichte: 1366 Einwohner je km 2 Postleitzahlen: 65183–65207, 55246, 55252 Vorlage:Infobox Gemeinde in Deutschland/Wartung/PLZ enthält Text Vorwahlen: 0611, 06122, 06127, 06134 Kfz-Kennzeichen: WI Gemeindeschlüssel: 06 4 14 000 LOCODE: DE WIB NUTS: DE714 Stadtgliederung: 26 Ortsbezirke Adresse der Stadtverwaltung: Schlossplatz 6 65183 Wiesbaden Webpräsenz: www.wiesbaden.de Oberbürgermeister: Sven Gerich (SPD) Lage der Landeshauptstadt Wiesbaden in Hessen und im Regierungsbezirk Darmstadt Offizielles Logo der Landeshauptstadt Wiesbaden Flagge der Landeshauptstadt Wiesbaden Wiesbaden is
                    Read more

                    Marschland

                    Image
                    Kilometerweite Marsch in den Vier- und Marschlanden am Elbdeich Die Wedeler Marschlandschaft in Schleswig-Holstein Der Hadelner Kanal zur Entwässerung der Marsch Die tief gelegene Marsch und ein Entwässerungskanal Das Schöpfwerk Otterndorf im Land Hadeln zur Entwässerung der Medem verfügte damals bereits über die größte Kreiselpumpe Europas. Das Schöpfwerk in Neuhaus für die Aue und des Neuhaus-Bülkauer Kanals Als Marsch(land) (v. niederdt., altsächs. mersc ) – auch Masch , Mersch oder Schwemmland genannt – bezeichnet man eine nacheiszeitlich entstandene geomorphologische Landform im Gebiet der nordwestdeutschen Küsten und Flüsse sowie vergleichbare Landformen weltweit. Inhaltsverzeichnis 1 Landschaft 2 Entstehung 3 Marschböden 4 Nutzung 5 Marschgebiete in Deutschland 6 Siehe auch 7 Literatur 8 Weblinks 9 Einzelnachweise Landschaft | Marschen sind generell flache Landstriche ohne natürliche Erhebungen. Si
                    Read more

                    Dieringhausen

                    Image
                    Dieringhausen Stadt Gummersbach 50.982777777778 7.5316666666667 165 Koordinaten: 50° 58′ 58″  N , 7° 31′ 54″  O Höhe: 165  (160–245)  m Einwohner: 5055  (30. Jun. 2016) Postleitzahl: 51645 Vorwahl: 02261 Lage von Dieringhausen in Gummersbach Im Hohl ca. 1927–1930 Ansicht von Südwesten bei Bünghausen Dieringhausen (im örtlichen Dialekt Dierkesen ) ist ein Ortsteil von Gummersbach im Oberbergischen Kreis, Regierungsbezirk Köln, Nordrhein-Westfalen (Deutschland). Inhaltsverzeichnis 1 Geographie 2 Geschichte 3 Kultur 3.1 Sehenswürdigkeiten 3.2 Regelmäßige Veranstaltungen 4 Infrastruktur und Wirtschaft 4.1 Verkehr 4.1.1 Schienen- und Busverkehr 4.1.2 Straßen 4.2 Öffentliche Einrichtungen 4.2.1 Schulen und Bildungseinrichtungen 4.2.2 Kirchliche Einrichtungen 5 Persönlichkeiten 5.1 In Dieringhausen geboren 5.2 In Dieringhausen gelebt 6 Einzelnachweise 7
                    Read more