Why there are n-r dimensional set of vectors x for rank-deficient least square problem












0














I saw this theorem on the lecture slides (http://www2.aueb.gr/users/douros/docs_master/Least_Square_pr.pdf) with topic Rank-Deficient Least Squares Problem




Given $Ain R^{mtimes n}, m > n, , r = text{rank(A)}<n , text{and} , b in R^m$ and we want to find $x$ such that $min_x Vert Ax-b Vert_2$, then there are n-r dimensional set of vectors x that minimize $Vert Ax-b Vert_2$




What's the reason behind the "$n-r$" theorem?






linear-algebra optimization numerical-linear-algebra least-squares







share|cite|improve this question






















  • $n-r$ is the dimension of Nullity of $A$.
    – Yadati Kiran
    Nov 22 at 3:47












  • @YadatiKiran Why is the least square solution in the nullity of A?? I thought it will be in the nullity of $A^T$ so it will have a dimension of m-r?
    – WeiShan Ng
    Nov 22 at 4:50










  • Rank of $A^{T}$ is less than or equal to $n$ right since $m>n$?
    – Yadati Kiran
    Nov 22 at 4:55


















0














I saw this theorem on the lecture slides (http://www2.aueb.gr/users/douros/docs_master/Least_Square_pr.pdf) with topic Rank-Deficient Least Squares Problem




Given $Ain R^{mtimes n}, m > n, , r = text{rank(A)}<n , text{and} , b in R^m$ and we want to find $x$ such that $min_x Vert Ax-b Vert_2$, then there are n-r dimensional set of vectors x that minimize $Vert Ax-b Vert_2$




What's the reason behind the "$n-r$" theorem?






linear-algebra optimization numerical-linear-algebra least-squares







share|cite|improve this question






















  • $n-r$ is the dimension of Nullity of $A$.
    – Yadati Kiran
    Nov 22 at 3:47












  • @YadatiKiran Why is the least square solution in the nullity of A?? I thought it will be in the nullity of $A^T$ so it will have a dimension of m-r?
    – WeiShan Ng
    Nov 22 at 4:50










  • Rank of $A^{T}$ is less than or equal to $n$ right since $m>n$?
    – Yadati Kiran
    Nov 22 at 4:55
















0












0








0







I saw this theorem on the lecture slides (http://www2.aueb.gr/users/douros/docs_master/Least_Square_pr.pdf) with topic Rank-Deficient Least Squares Problem




Given $Ain R^{mtimes n}, m > n, , r = text{rank(A)}<n , text{and} , b in R^m$ and we want to find $x$ such that $min_x Vert Ax-b Vert_2$, then there are n-r dimensional set of vectors x that minimize $Vert Ax-b Vert_2$




What's the reason behind the "$n-r$" theorem?






linear-algebra optimization numerical-linear-algebra least-squares







share|cite|improve this question













I saw this theorem on the lecture slides (http://www2.aueb.gr/users/douros/docs_master/Least_Square_pr.pdf) with topic Rank-Deficient Least Squares Problem




Given $Ain R^{mtimes n}, m > n, , r = text{rank(A)}<n , text{and} , b in R^m$ and we want to find $x$ such that $min_x Vert Ax-b Vert_2$, then there are n-r dimensional set of vectors x that minimize $Vert Ax-b Vert_2$




What's the reason behind the "$n-r$" theorem?






linear-algebra optimization numerical-linear-algebra least-squares




linear-algebra optimization numerical-linear-algebra least-squares






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 22 at 3:04









WeiShan Ng

597




597












  • $n-r$ is the dimension of Nullity of $A$.
    – Yadati Kiran
    Nov 22 at 3:47












  • @YadatiKiran Why is the least square solution in the nullity of A?? I thought it will be in the nullity of $A^T$ so it will have a dimension of m-r?
    – WeiShan Ng
    Nov 22 at 4:50










  • Rank of $A^{T}$ is less than or equal to $n$ right since $m>n$?
    – Yadati Kiran
    Nov 22 at 4:55




















  • $n-r$ is the dimension of Nullity of $A$.
    – Yadati Kiran
    Nov 22 at 3:47












  • @YadatiKiran Why is the least square solution in the nullity of A?? I thought it will be in the nullity of $A^T$ so it will have a dimension of m-r?
    – WeiShan Ng
    Nov 22 at 4:50










  • Rank of $A^{T}$ is less than or equal to $n$ right since $m>n$?
    – Yadati Kiran
    Nov 22 at 4:55


















$n-r$ is the dimension of Nullity of $A$.
– Yadati Kiran
Nov 22 at 3:47






$n-r$ is the dimension of Nullity of $A$.
– Yadati Kiran
Nov 22 at 3:47














@YadatiKiran Why is the least square solution in the nullity of A?? I thought it will be in the nullity of $A^T$ so it will have a dimension of m-r?
– WeiShan Ng
Nov 22 at 4:50




@YadatiKiran Why is the least square solution in the nullity of A?? I thought it will be in the nullity of $A^T$ so it will have a dimension of m-r?
– WeiShan Ng
Nov 22 at 4:50












Rank of $A^{T}$ is less than or equal to $n$ right since $m>n$?
– Yadati Kiran
Nov 22 at 4:55






Rank of $A^{T}$ is less than or equal to $n$ right since $m>n$?
– Yadati Kiran
Nov 22 at 4:55












1 Answer
1






active

oldest

votes


















0














I think I get it now....Given a matrix $A in R^{mtimes n}, , m>n$ and $b in R^m$, if we want to find a least square solution $mathbf{hat{x}}$ for the system $Avec{x} = vec{b}$, we are actually trying to solve the normal equation
$$A^T A vec{x} = A^T vec{b}$$

And we also know that




$R(A^T)=R(A) = R(A^T A)$ and $N(A) = N(A^T A)$




So if the A is rank deficient, $r < n$ then the $nullity(A^T A)= n-r$, which means the the solution space of $A^T A vec{v}=0$ is non-trivial and of $n-r$ dimension. We will now have infinity solution for the normal equation $A^T A vec{x} = A^T vec{b}$



Let $vec{v} in N(A^T A)$, then $$vec{v} = sum_{i=1}^{n-r} alpha_i mathbf{n_i} $$ where $N(A^T A) = span {mathbf{n_1, cdots , n_{n-r}}}$



And let $vec{w} in R(A^T A)$. So the least square solution can now be written as
$$mathbf{hat{x}} = vec{w} + alpha_1 mathbf{n_1} + cdots + alpha_{n-r} mathbf{n_{n-r}}$$

which is of $n-r$ dimension






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%2f3008698%2fwhy-there-are-n-r-dimensional-set-of-vectors-x-for-rank-deficient-least-square-p%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









    0














    I think I get it now....Given a matrix $A in R^{mtimes n}, , m>n$ and $b in R^m$, if we want to find a least square solution $mathbf{hat{x}}$ for the system $Avec{x} = vec{b}$, we are actually trying to solve the normal equation
    $$A^T A vec{x} = A^T vec{b}$$

    And we also know that




    $R(A^T)=R(A) = R(A^T A)$ and $N(A) = N(A^T A)$




    So if the A is rank deficient, $r < n$ then the $nullity(A^T A)= n-r$, which means the the solution space of $A^T A vec{v}=0$ is non-trivial and of $n-r$ dimension. We will now have infinity solution for the normal equation $A^T A vec{x} = A^T vec{b}$



    Let $vec{v} in N(A^T A)$, then $$vec{v} = sum_{i=1}^{n-r} alpha_i mathbf{n_i} $$ where $N(A^T A) = span {mathbf{n_1, cdots , n_{n-r}}}$



    And let $vec{w} in R(A^T A)$. So the least square solution can now be written as
    $$mathbf{hat{x}} = vec{w} + alpha_1 mathbf{n_1} + cdots + alpha_{n-r} mathbf{n_{n-r}}$$

    which is of $n-r$ dimension






    share|cite|improve this answer


























      0














      I think I get it now....Given a matrix $A in R^{mtimes n}, , m>n$ and $b in R^m$, if we want to find a least square solution $mathbf{hat{x}}$ for the system $Avec{x} = vec{b}$, we are actually trying to solve the normal equation
      $$A^T A vec{x} = A^T vec{b}$$

      And we also know that




      $R(A^T)=R(A) = R(A^T A)$ and $N(A) = N(A^T A)$




      So if the A is rank deficient, $r < n$ then the $nullity(A^T A)= n-r$, which means the the solution space of $A^T A vec{v}=0$ is non-trivial and of $n-r$ dimension. We will now have infinity solution for the normal equation $A^T A vec{x} = A^T vec{b}$



      Let $vec{v} in N(A^T A)$, then $$vec{v} = sum_{i=1}^{n-r} alpha_i mathbf{n_i} $$ where $N(A^T A) = span {mathbf{n_1, cdots , n_{n-r}}}$



      And let $vec{w} in R(A^T A)$. So the least square solution can now be written as
      $$mathbf{hat{x}} = vec{w} + alpha_1 mathbf{n_1} + cdots + alpha_{n-r} mathbf{n_{n-r}}$$

      which is of $n-r$ dimension






      share|cite|improve this answer
























        0












        0








        0






        I think I get it now....Given a matrix $A in R^{mtimes n}, , m>n$ and $b in R^m$, if we want to find a least square solution $mathbf{hat{x}}$ for the system $Avec{x} = vec{b}$, we are actually trying to solve the normal equation
        $$A^T A vec{x} = A^T vec{b}$$

        And we also know that




        $R(A^T)=R(A) = R(A^T A)$ and $N(A) = N(A^T A)$




        So if the A is rank deficient, $r < n$ then the $nullity(A^T A)= n-r$, which means the the solution space of $A^T A vec{v}=0$ is non-trivial and of $n-r$ dimension. We will now have infinity solution for the normal equation $A^T A vec{x} = A^T vec{b}$



        Let $vec{v} in N(A^T A)$, then $$vec{v} = sum_{i=1}^{n-r} alpha_i mathbf{n_i} $$ where $N(A^T A) = span {mathbf{n_1, cdots , n_{n-r}}}$



        And let $vec{w} in R(A^T A)$. So the least square solution can now be written as
        $$mathbf{hat{x}} = vec{w} + alpha_1 mathbf{n_1} + cdots + alpha_{n-r} mathbf{n_{n-r}}$$

        which is of $n-r$ dimension






        share|cite|improve this answer












        I think I get it now....Given a matrix $A in R^{mtimes n}, , m>n$ and $b in R^m$, if we want to find a least square solution $mathbf{hat{x}}$ for the system $Avec{x} = vec{b}$, we are actually trying to solve the normal equation
        $$A^T A vec{x} = A^T vec{b}$$

        And we also know that




        $R(A^T)=R(A) = R(A^T A)$ and $N(A) = N(A^T A)$




        So if the A is rank deficient, $r < n$ then the $nullity(A^T A)= n-r$, which means the the solution space of $A^T A vec{v}=0$ is non-trivial and of $n-r$ dimension. We will now have infinity solution for the normal equation $A^T A vec{x} = A^T vec{b}$



        Let $vec{v} in N(A^T A)$, then $$vec{v} = sum_{i=1}^{n-r} alpha_i mathbf{n_i} $$ where $N(A^T A) = span {mathbf{n_1, cdots , n_{n-r}}}$



        And let $vec{w} in R(A^T A)$. So the least square solution can now be written as
        $$mathbf{hat{x}} = vec{w} + alpha_1 mathbf{n_1} + cdots + alpha_{n-r} mathbf{n_{n-r}}$$

        which is of $n-r$ dimension







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 24 at 5:13









        WeiShan Ng

        597




        597






























            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%2f3008698%2fwhy-there-are-n-r-dimensional-set-of-vectors-x-for-rank-deficient-least-square-p%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

            Plaza Victoria

            Image
            Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l
            Read more

            In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

            Image
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 2 OneNote has two useful keyboard shortcuts for bulleted and numbered lists, namely Ctrl + . and Ctrl + - . Is there something similar for PowerPoint where the work with lists is also very common? Haven't found anything here: Use keyboard shortcuts in PowerPoint. keyboard-shortcuts microsoft-powerpoint share | improve this question edited Aug 14 '14 at 14:49 Linger 2,826 10 28 40
            Read more

            How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...

            Image
            1 0 I want to put 3 images in LateX such as 2 figures are side by side horizotally and 3rd figure below these 2 side by side figures but in middle. I have following code: begin{figure}[H] centering begin{minipage}{.5textwidth} centering includegraphics[width=.50linewidth]{Text/Images/Genelec_8010_AP.jpg} captionof{figure}{Genelec 8010 AP} label{fig:Genelec 8010} end{minipage}% begin{minipage}{.5textwidth} centering includegraphics[width=.69linewidth]{Text/Images/Genelec_8020_CPM.jpg} captionof{figure}{Genelec 8020 CPM} label{fig:Genelec 8020} end{minipage}% end{figure} %%Here is my 3rd picture code begin{figure} centering includegraphics[width=5cm]{Text/Images/Genelec_8030_BPM.jpg} caption{Genelec 8030 BPM} label{fig:Genelec 8030} end{figure} I want to ask ho
            Read more