Proof Verification: the orthogonal complement of the column space is the left nullspace












1












$begingroup$


Can someone please check my proof and my definitions.



Let $A in mathbb{R}^{n times m}$ be my matrix.



The left null space of $A$ is written as,



$mathcal{N}(A^top) = {x in mathbb{R}^n| A^top x = 0}$



The orthogonal complement of the column space $mathcal{C}(A)$ is written as,



$mathcal{C}(A)^perp = {x in mathbb{R}^n | x^top y = 0, forall y in mathcal{C}(A)}$




We want to show that $mathcal{N}(A^top) = mathcal{C}(A)^perp $




First, we show, $mathcal{N}(A^top) subseteq mathcal{C}(A)^perp$



Let $x in mathcal{N}(A^top)$, then $A^top x = 0 implies x^top A = 0^top implies x^top Av= 0^top v, forall v in mathcal{C}(A) implies x^top y = 0 , y = Av$, $implies x in C(A)^perp$.



Next, we show, $mathcal{N}(A^top) supseteq mathcal{C}(A)^perp$



Let $x in C(A)^perp$, then $x^top y = 0$, forall $y in C(A)$. But $y = Av, forall v in mathbb{R}^n$. Hence, $x^top y = x^top Av = v^top A^top x.$ For all $v neq 0, A^top x = 0$, hence $x in mathcal{N}(A^top)$.





I'm pretty confident about the first proof. But the second proof is a bit more rough. Can someone please check for me.










share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    Can someone please check my proof and my definitions.



    Let $A in mathbb{R}^{n times m}$ be my matrix.



    The left null space of $A$ is written as,



    $mathcal{N}(A^top) = {x in mathbb{R}^n| A^top x = 0}$



    The orthogonal complement of the column space $mathcal{C}(A)$ is written as,



    $mathcal{C}(A)^perp = {x in mathbb{R}^n | x^top y = 0, forall y in mathcal{C}(A)}$




    We want to show that $mathcal{N}(A^top) = mathcal{C}(A)^perp $




    First, we show, $mathcal{N}(A^top) subseteq mathcal{C}(A)^perp$



    Let $x in mathcal{N}(A^top)$, then $A^top x = 0 implies x^top A = 0^top implies x^top Av= 0^top v, forall v in mathcal{C}(A) implies x^top y = 0 , y = Av$, $implies x in C(A)^perp$.



    Next, we show, $mathcal{N}(A^top) supseteq mathcal{C}(A)^perp$



    Let $x in C(A)^perp$, then $x^top y = 0$, forall $y in C(A)$. But $y = Av, forall v in mathbb{R}^n$. Hence, $x^top y = x^top Av = v^top A^top x.$ For all $v neq 0, A^top x = 0$, hence $x in mathcal{N}(A^top)$.





    I'm pretty confident about the first proof. But the second proof is a bit more rough. Can someone please check for me.










    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$


      Can someone please check my proof and my definitions.



      Let $A in mathbb{R}^{n times m}$ be my matrix.



      The left null space of $A$ is written as,



      $mathcal{N}(A^top) = {x in mathbb{R}^n| A^top x = 0}$



      The orthogonal complement of the column space $mathcal{C}(A)$ is written as,



      $mathcal{C}(A)^perp = {x in mathbb{R}^n | x^top y = 0, forall y in mathcal{C}(A)}$




      We want to show that $mathcal{N}(A^top) = mathcal{C}(A)^perp $




      First, we show, $mathcal{N}(A^top) subseteq mathcal{C}(A)^perp$



      Let $x in mathcal{N}(A^top)$, then $A^top x = 0 implies x^top A = 0^top implies x^top Av= 0^top v, forall v in mathcal{C}(A) implies x^top y = 0 , y = Av$, $implies x in C(A)^perp$.



      Next, we show, $mathcal{N}(A^top) supseteq mathcal{C}(A)^perp$



      Let $x in C(A)^perp$, then $x^top y = 0$, forall $y in C(A)$. But $y = Av, forall v in mathbb{R}^n$. Hence, $x^top y = x^top Av = v^top A^top x.$ For all $v neq 0, A^top x = 0$, hence $x in mathcal{N}(A^top)$.





      I'm pretty confident about the first proof. But the second proof is a bit more rough. Can someone please check for me.










      share|cite|improve this question











      $endgroup$




      Can someone please check my proof and my definitions.



      Let $A in mathbb{R}^{n times m}$ be my matrix.



      The left null space of $A$ is written as,



      $mathcal{N}(A^top) = {x in mathbb{R}^n| A^top x = 0}$



      The orthogonal complement of the column space $mathcal{C}(A)$ is written as,



      $mathcal{C}(A)^perp = {x in mathbb{R}^n | x^top y = 0, forall y in mathcal{C}(A)}$




      We want to show that $mathcal{N}(A^top) = mathcal{C}(A)^perp $




      First, we show, $mathcal{N}(A^top) subseteq mathcal{C}(A)^perp$



      Let $x in mathcal{N}(A^top)$, then $A^top x = 0 implies x^top A = 0^top implies x^top Av= 0^top v, forall v in mathcal{C}(A) implies x^top y = 0 , y = Av$, $implies x in C(A)^perp$.



      Next, we show, $mathcal{N}(A^top) supseteq mathcal{C}(A)^perp$



      Let $x in C(A)^perp$, then $x^top y = 0$, forall $y in C(A)$. But $y = Av, forall v in mathbb{R}^n$. Hence, $x^top y = x^top Av = v^top A^top x.$ For all $v neq 0, A^top x = 0$, hence $x in mathcal{N}(A^top)$.





      I'm pretty confident about the first proof. But the second proof is a bit more rough. Can someone please check for me.







      linear-algebra matrices proof-verification vector-spaces linear-transformations






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 25 at 16:56







      Aåkon

















      asked Jan 25 at 16:13









      AåkonAåkon

      4,87131759




      4,87131759






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          $y in C(A)$ means that there exists (at least one) $v$ of appropriate dimension such that $y = Av$.



          So we can say: For $x in C(A)^{perp}$, then $x^T y = 0$ for every $y in C(A)$. For every $y in C(A)$, we can express $y = Av$ for some (nonzero) $v$. So we can always express $x^T y$ as $x^T Av$. So $$x^T y = x^T (A v) = (x^T A) v = (A^T x)^T v = 0^T v = 0$$ for $v neq 0$, so we must have $A^T x = 0$, i.e., $x in N(A^T)$.






          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%2f3087270%2fproof-verification-the-orthogonal-complement-of-the-column-space-is-the-left-nu%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            1












            $begingroup$

            $y in C(A)$ means that there exists (at least one) $v$ of appropriate dimension such that $y = Av$.



            So we can say: For $x in C(A)^{perp}$, then $x^T y = 0$ for every $y in C(A)$. For every $y in C(A)$, we can express $y = Av$ for some (nonzero) $v$. So we can always express $x^T y$ as $x^T Av$. So $$x^T y = x^T (A v) = (x^T A) v = (A^T x)^T v = 0^T v = 0$$ for $v neq 0$, so we must have $A^T x = 0$, i.e., $x in N(A^T)$.






            share|cite|improve this answer











            $endgroup$


















              1












              $begingroup$

              $y in C(A)$ means that there exists (at least one) $v$ of appropriate dimension such that $y = Av$.



              So we can say: For $x in C(A)^{perp}$, then $x^T y = 0$ for every $y in C(A)$. For every $y in C(A)$, we can express $y = Av$ for some (nonzero) $v$. So we can always express $x^T y$ as $x^T Av$. So $$x^T y = x^T (A v) = (x^T A) v = (A^T x)^T v = 0^T v = 0$$ for $v neq 0$, so we must have $A^T x = 0$, i.e., $x in N(A^T)$.






              share|cite|improve this answer











              $endgroup$
















                1












                1








                1





                $begingroup$

                $y in C(A)$ means that there exists (at least one) $v$ of appropriate dimension such that $y = Av$.



                So we can say: For $x in C(A)^{perp}$, then $x^T y = 0$ for every $y in C(A)$. For every $y in C(A)$, we can express $y = Av$ for some (nonzero) $v$. So we can always express $x^T y$ as $x^T Av$. So $$x^T y = x^T (A v) = (x^T A) v = (A^T x)^T v = 0^T v = 0$$ for $v neq 0$, so we must have $A^T x = 0$, i.e., $x in N(A^T)$.






                share|cite|improve this answer











                $endgroup$



                $y in C(A)$ means that there exists (at least one) $v$ of appropriate dimension such that $y = Av$.



                So we can say: For $x in C(A)^{perp}$, then $x^T y = 0$ for every $y in C(A)$. For every $y in C(A)$, we can express $y = Av$ for some (nonzero) $v$. So we can always express $x^T y$ as $x^T Av$. So $$x^T y = x^T (A v) = (x^T A) v = (A^T x)^T v = 0^T v = 0$$ for $v neq 0$, so we must have $A^T x = 0$, i.e., $x in N(A^T)$.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Jan 25 at 17:11

























                answered Jan 25 at 16:51









                jjjjjjjjjjjj

                1,204516




                1,204516






























                    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%2f3087270%2fproof-verification-the-orthogonal-complement-of-the-column-space-is-the-left-nu%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

                    Mario Kart Wii

                    What does “Dominus providebit” mean?

                    Antonio Litta Visconti Arese