Basis for set of vectors is wrong

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












Original matrix A is:



$$beginpmatrix
1 & 2 & 7& 1\
1 & 1 & 2& 0\
2&0&-6&-2 & \
1&1&2&0
endpmatrix$$



$w=(A*beginpmatrix
x1\
x2\
x3\
x4
endpmatrix=beginpmatrix
0\
0\
0\
0
endpmatrix)$
Find base set of vector for W.



Using Gaus method I get:



$$beginpmatrix
1 & 2 & 7&1\
0&-1&-5&-1 \
0 & 0 & 0&0\
0&0&0&0
endpmatrix$$ which has 2 leading elements. So the column of each elemnt suppose to be part of base, these are: $(1,1,2,1)$ , $(2,1,0,1)$ but seemingly it's wrong because the answer is written like this: $(3,-5,1,0),(1,-1,0,1)$



where is my mistake?







share|cite|improve this question



















  • I am puzzled as why you would say that because the reduced matrix has two non-zero rows, the first two columns of the original matrix form a basis!
    – user247327
    Aug 7 at 18:44










  • @user247327 It looks like you’re both confusing column space with null space. The problem asks about the null space, not the column space.
    – amd
    Aug 7 at 20:18















up vote
0
down vote

favorite












Original matrix A is:



$$beginpmatrix
1 & 2 & 7& 1\
1 & 1 & 2& 0\
2&0&-6&-2 & \
1&1&2&0
endpmatrix$$



$w=(A*beginpmatrix
x1\
x2\
x3\
x4
endpmatrix=beginpmatrix
0\
0\
0\
0
endpmatrix)$
Find base set of vector for W.



Using Gaus method I get:



$$beginpmatrix
1 & 2 & 7&1\
0&-1&-5&-1 \
0 & 0 & 0&0\
0&0&0&0
endpmatrix$$ which has 2 leading elements. So the column of each elemnt suppose to be part of base, these are: $(1,1,2,1)$ , $(2,1,0,1)$ but seemingly it's wrong because the answer is written like this: $(3,-5,1,0),(1,-1,0,1)$



where is my mistake?







share|cite|improve this question



















  • I am puzzled as why you would say that because the reduced matrix has two non-zero rows, the first two columns of the original matrix form a basis!
    – user247327
    Aug 7 at 18:44










  • @user247327 It looks like you’re both confusing column space with null space. The problem asks about the null space, not the column space.
    – amd
    Aug 7 at 20:18













up vote
0
down vote

favorite









up vote
0
down vote

favorite











Original matrix A is:



$$beginpmatrix
1 & 2 & 7& 1\
1 & 1 & 2& 0\
2&0&-6&-2 & \
1&1&2&0
endpmatrix$$



$w=(A*beginpmatrix
x1\
x2\
x3\
x4
endpmatrix=beginpmatrix
0\
0\
0\
0
endpmatrix)$
Find base set of vector for W.



Using Gaus method I get:



$$beginpmatrix
1 & 2 & 7&1\
0&-1&-5&-1 \
0 & 0 & 0&0\
0&0&0&0
endpmatrix$$ which has 2 leading elements. So the column of each elemnt suppose to be part of base, these are: $(1,1,2,1)$ , $(2,1,0,1)$ but seemingly it's wrong because the answer is written like this: $(3,-5,1,0),(1,-1,0,1)$



where is my mistake?







share|cite|improve this question











Original matrix A is:



$$beginpmatrix
1 & 2 & 7& 1\
1 & 1 & 2& 0\
2&0&-6&-2 & \
1&1&2&0
endpmatrix$$



$w=(A*beginpmatrix
x1\
x2\
x3\
x4
endpmatrix=beginpmatrix
0\
0\
0\
0
endpmatrix)$
Find base set of vector for W.



Using Gaus method I get:



$$beginpmatrix
1 & 2 & 7&1\
0&-1&-5&-1 \
0 & 0 & 0&0\
0&0&0&0
endpmatrix$$ which has 2 leading elements. So the column of each elemnt suppose to be part of base, these are: $(1,1,2,1)$ , $(2,1,0,1)$ but seemingly it's wrong because the answer is written like this: $(3,-5,1,0),(1,-1,0,1)$



where is my mistake?









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Aug 7 at 18:27









user6394019

30311




30311











  • I am puzzled as why you would say that because the reduced matrix has two non-zero rows, the first two columns of the original matrix form a basis!
    – user247327
    Aug 7 at 18:44










  • @user247327 It looks like you’re both confusing column space with null space. The problem asks about the null space, not the column space.
    – amd
    Aug 7 at 20:18

















  • I am puzzled as why you would say that because the reduced matrix has two non-zero rows, the first two columns of the original matrix form a basis!
    – user247327
    Aug 7 at 18:44










  • @user247327 It looks like you’re both confusing column space with null space. The problem asks about the null space, not the column space.
    – amd
    Aug 7 at 20:18
















I am puzzled as why you would say that because the reduced matrix has two non-zero rows, the first two columns of the original matrix form a basis!
– user247327
Aug 7 at 18:44




I am puzzled as why you would say that because the reduced matrix has two non-zero rows, the first two columns of the original matrix form a basis!
– user247327
Aug 7 at 18:44












@user247327 It looks like you’re both confusing column space with null space. The problem asks about the null space, not the column space.
– amd
Aug 7 at 20:18





@user247327 It looks like you’re both confusing column space with null space. The problem asks about the null space, not the column space.
– amd
Aug 7 at 20:18











2 Answers
2






active

oldest

votes

















up vote
1
down vote













Take your reduced system



$$beginpmatrix1 &2 &7& 1\0 &-1 &-5 &-1\ 0 &0 &0 &0\ 0 &0 &0 &0endpmatrixbeginpmatrixx\y\z\wendpmatrix=beginpmatrixx+2y+7z+w\-y-5z-w\0\0endpmatrix=beginpmatrix0\0\0\0endpmatrix$$



You now just have to solve the equation for $v=(x,y,z,w)^top$. Working with the method of back-substitution, we first assign all the non-pivots(the variables not leading any row) a real constant, as they may vary in their value arbitrarily and we then can determine the pivot variables in dependence on them.



Thus, let $w=c,z=c'$(for constants $c,c'$). Then, by the second row of the vector equation, we may determine the value of $y$ in terms of the constants $c,c'$(values of $z,w$):



$$-y-5z-w=0Leftrightarrow-y-5c'-c=0Leftrightarrow y=-5c'-c$$



Continuing back-substitution, we now derive from the first row the value of $x$ in dependence of $c,c'$:



$$x+2y+7z+w=0Leftrightarrow x=-2y-7z-wLeftrightarrow x=10c'+2c-7c'-cLeftrightarrow x=3c'+c$$



Thus, your solutions are any vectors of the following form



$$(3c'+c,-5c'-c,c',c)=c'(3,-5,1,0)+c(1,-1,0,1)$$



for arbitrary $c,c'inmathbbR$.




The solution set of $Av=mathbf0$, i.e. the set $S(A,mathbf0)=vinmathbbR^4mid Av=mathbf0$, for which you want to determine a basis, is commonly called the kernel of the matrix $A$, written $mathrmker(A)$.



By the above, we've found that any solution to $Av=mathbf0$, i.e. any $vinmathrmker(A)$, can be written as



$$v=c'(3,-5,1,0)+c(1,-1,0,1)$$



Thus, in other terminology, we say that any $vinmathrmker(A)$ is a linear combination of $(3,-5,1,0)$ and $(1,-1,0,1)$. The set of all linear combination for a set of vectors $S$ is called the span(or linear hull) of the set $S$ and I denote this with $mathrmspan(S)$.



We may thus rephrase our result about the solutions of $mathrmker(A)$ as such, that



$$mathrmker(A)=mathrmspan((3,-5,1,0),(1,-1,0,1))$$



A basis, for any space $V$, is defined as linearly independent set of vectors spanning $V$, i.e. a linearly independent set $B$, s.t. $mathrmspan(B)=V$.



Now, as $(3,-5,1,0),(1,-1,0,1)$ are linearly independent(check this yourself), it follows that they also constitute a basis for this set(space).




Maybe, on a last note, try to generalize the process I've just outline. Toying with these notions and especially with the connections between subspaces, linear systems of equation and matrices in combination is a great exercise. E.g. show that for any $ntimes n$ real matrix $A$, $mathrmker(A)$ always forms a subspace. Is this true for any solution set $S(A,b)$ for a vector equation $Av=b$?






share|cite|improve this answer






























    up vote
    1
    down vote













    There is a standard method for finding a basis for the null space of a matrix. Compute the reduced row echelon form (RREF):
    beginalign
    A=beginpmatrix
    1 & 2 & 7 & 1\
    1 & 1 & 2 & 0\
    2 & 0 &-6 &-2 \
    1 & 1 & 2 & 0
    endpmatrix
    &to
    beginpmatrix
    1 & 2 & 7 & 1\
    0 &-1 &-5 &-1\
    0 &-4 &-20 &-4 \
    0 &-1 &-5 & -1
    endpmatrix
    &&beginaligned R_2&gets R_2-R_1 \ R_3&gets R_3-2R_1 \ R_4&gets R_4-R_1endaligned
    \[6px]
    &to
    beginpmatrix
    1 & 2 & 7 & 1\
    0 & 1 & 5 & 1\
    0 &-4 &-20 &-4 \
    0 &-1 &-5 & -1
    endpmatrix
    && R_2gets -R_2
    \[6px]
    &to
    beginpmatrix
    1 & 2 & 7 & 1\
    0 & 1 & 5 & 1\
    0 & 0 & 0 & 0 \
    0 & 0 & 0 & 0
    endpmatrix
    &&beginaligned R_3&gets R_3+4R_2 \ R_4&gets R_4+R_2endaligned
    \[6px]
    &to
    beginpmatrix
    1 & 0 &-3 &-1\
    0 & 1 & 5 & 1\
    0 & 0 & 0 & 0 \
    0 & 0 & 0 & 0
    endpmatrix
    && R_1gets R_1-2R_2
    endalign
    The system $Ax=0$ is equivalent to the system $Ux=0$, where $U$ is the last matrix above (the RREF of $A$). This system can be rewritten as
    begincases
    x_1 = 3x_3+x_4 \[4px]
    x_2 = -5x_3-x_4
    endcases
    and a basis for the null space can be obtained by choosing first $x_3=1$ and $x_4=0$, then $x_3=0$ and $x_4=1$, yielding the vectors
    $$
    beginpmatrix 3 \ -5 \ 1 \ 0 endpmatrix
    qquadtextandqquad
    beginpmatrix 1 \ -1 \ 0 \ 1 endpmatrix
    $$






    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',
      convertImagesToLinks: true,
      noModals: false,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      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%2f2875237%2fbasis-for-set-of-vectors-is-wrong%23new-answer', 'question_page');

      );

      Post as a guest






























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      1
      down vote













      Take your reduced system



      $$beginpmatrix1 &2 &7& 1\0 &-1 &-5 &-1\ 0 &0 &0 &0\ 0 &0 &0 &0endpmatrixbeginpmatrixx\y\z\wendpmatrix=beginpmatrixx+2y+7z+w\-y-5z-w\0\0endpmatrix=beginpmatrix0\0\0\0endpmatrix$$



      You now just have to solve the equation for $v=(x,y,z,w)^top$. Working with the method of back-substitution, we first assign all the non-pivots(the variables not leading any row) a real constant, as they may vary in their value arbitrarily and we then can determine the pivot variables in dependence on them.



      Thus, let $w=c,z=c'$(for constants $c,c'$). Then, by the second row of the vector equation, we may determine the value of $y$ in terms of the constants $c,c'$(values of $z,w$):



      $$-y-5z-w=0Leftrightarrow-y-5c'-c=0Leftrightarrow y=-5c'-c$$



      Continuing back-substitution, we now derive from the first row the value of $x$ in dependence of $c,c'$:



      $$x+2y+7z+w=0Leftrightarrow x=-2y-7z-wLeftrightarrow x=10c'+2c-7c'-cLeftrightarrow x=3c'+c$$



      Thus, your solutions are any vectors of the following form



      $$(3c'+c,-5c'-c,c',c)=c'(3,-5,1,0)+c(1,-1,0,1)$$



      for arbitrary $c,c'inmathbbR$.




      The solution set of $Av=mathbf0$, i.e. the set $S(A,mathbf0)=vinmathbbR^4mid Av=mathbf0$, for which you want to determine a basis, is commonly called the kernel of the matrix $A$, written $mathrmker(A)$.



      By the above, we've found that any solution to $Av=mathbf0$, i.e. any $vinmathrmker(A)$, can be written as



      $$v=c'(3,-5,1,0)+c(1,-1,0,1)$$



      Thus, in other terminology, we say that any $vinmathrmker(A)$ is a linear combination of $(3,-5,1,0)$ and $(1,-1,0,1)$. The set of all linear combination for a set of vectors $S$ is called the span(or linear hull) of the set $S$ and I denote this with $mathrmspan(S)$.



      We may thus rephrase our result about the solutions of $mathrmker(A)$ as such, that



      $$mathrmker(A)=mathrmspan((3,-5,1,0),(1,-1,0,1))$$



      A basis, for any space $V$, is defined as linearly independent set of vectors spanning $V$, i.e. a linearly independent set $B$, s.t. $mathrmspan(B)=V$.



      Now, as $(3,-5,1,0),(1,-1,0,1)$ are linearly independent(check this yourself), it follows that they also constitute a basis for this set(space).




      Maybe, on a last note, try to generalize the process I've just outline. Toying with these notions and especially with the connections between subspaces, linear systems of equation and matrices in combination is a great exercise. E.g. show that for any $ntimes n$ real matrix $A$, $mathrmker(A)$ always forms a subspace. Is this true for any solution set $S(A,b)$ for a vector equation $Av=b$?






      share|cite|improve this answer



























        up vote
        1
        down vote













        Take your reduced system



        $$beginpmatrix1 &2 &7& 1\0 &-1 &-5 &-1\ 0 &0 &0 &0\ 0 &0 &0 &0endpmatrixbeginpmatrixx\y\z\wendpmatrix=beginpmatrixx+2y+7z+w\-y-5z-w\0\0endpmatrix=beginpmatrix0\0\0\0endpmatrix$$



        You now just have to solve the equation for $v=(x,y,z,w)^top$. Working with the method of back-substitution, we first assign all the non-pivots(the variables not leading any row) a real constant, as they may vary in their value arbitrarily and we then can determine the pivot variables in dependence on them.



        Thus, let $w=c,z=c'$(for constants $c,c'$). Then, by the second row of the vector equation, we may determine the value of $y$ in terms of the constants $c,c'$(values of $z,w$):



        $$-y-5z-w=0Leftrightarrow-y-5c'-c=0Leftrightarrow y=-5c'-c$$



        Continuing back-substitution, we now derive from the first row the value of $x$ in dependence of $c,c'$:



        $$x+2y+7z+w=0Leftrightarrow x=-2y-7z-wLeftrightarrow x=10c'+2c-7c'-cLeftrightarrow x=3c'+c$$



        Thus, your solutions are any vectors of the following form



        $$(3c'+c,-5c'-c,c',c)=c'(3,-5,1,0)+c(1,-1,0,1)$$



        for arbitrary $c,c'inmathbbR$.




        The solution set of $Av=mathbf0$, i.e. the set $S(A,mathbf0)=vinmathbbR^4mid Av=mathbf0$, for which you want to determine a basis, is commonly called the kernel of the matrix $A$, written $mathrmker(A)$.



        By the above, we've found that any solution to $Av=mathbf0$, i.e. any $vinmathrmker(A)$, can be written as



        $$v=c'(3,-5,1,0)+c(1,-1,0,1)$$



        Thus, in other terminology, we say that any $vinmathrmker(A)$ is a linear combination of $(3,-5,1,0)$ and $(1,-1,0,1)$. The set of all linear combination for a set of vectors $S$ is called the span(or linear hull) of the set $S$ and I denote this with $mathrmspan(S)$.



        We may thus rephrase our result about the solutions of $mathrmker(A)$ as such, that



        $$mathrmker(A)=mathrmspan((3,-5,1,0),(1,-1,0,1))$$



        A basis, for any space $V$, is defined as linearly independent set of vectors spanning $V$, i.e. a linearly independent set $B$, s.t. $mathrmspan(B)=V$.



        Now, as $(3,-5,1,0),(1,-1,0,1)$ are linearly independent(check this yourself), it follows that they also constitute a basis for this set(space).




        Maybe, on a last note, try to generalize the process I've just outline. Toying with these notions and especially with the connections between subspaces, linear systems of equation and matrices in combination is a great exercise. E.g. show that for any $ntimes n$ real matrix $A$, $mathrmker(A)$ always forms a subspace. Is this true for any solution set $S(A,b)$ for a vector equation $Av=b$?






        share|cite|improve this answer

























          up vote
          1
          down vote










          up vote
          1
          down vote









          Take your reduced system



          $$beginpmatrix1 &2 &7& 1\0 &-1 &-5 &-1\ 0 &0 &0 &0\ 0 &0 &0 &0endpmatrixbeginpmatrixx\y\z\wendpmatrix=beginpmatrixx+2y+7z+w\-y-5z-w\0\0endpmatrix=beginpmatrix0\0\0\0endpmatrix$$



          You now just have to solve the equation for $v=(x,y,z,w)^top$. Working with the method of back-substitution, we first assign all the non-pivots(the variables not leading any row) a real constant, as they may vary in their value arbitrarily and we then can determine the pivot variables in dependence on them.



          Thus, let $w=c,z=c'$(for constants $c,c'$). Then, by the second row of the vector equation, we may determine the value of $y$ in terms of the constants $c,c'$(values of $z,w$):



          $$-y-5z-w=0Leftrightarrow-y-5c'-c=0Leftrightarrow y=-5c'-c$$



          Continuing back-substitution, we now derive from the first row the value of $x$ in dependence of $c,c'$:



          $$x+2y+7z+w=0Leftrightarrow x=-2y-7z-wLeftrightarrow x=10c'+2c-7c'-cLeftrightarrow x=3c'+c$$



          Thus, your solutions are any vectors of the following form



          $$(3c'+c,-5c'-c,c',c)=c'(3,-5,1,0)+c(1,-1,0,1)$$



          for arbitrary $c,c'inmathbbR$.




          The solution set of $Av=mathbf0$, i.e. the set $S(A,mathbf0)=vinmathbbR^4mid Av=mathbf0$, for which you want to determine a basis, is commonly called the kernel of the matrix $A$, written $mathrmker(A)$.



          By the above, we've found that any solution to $Av=mathbf0$, i.e. any $vinmathrmker(A)$, can be written as



          $$v=c'(3,-5,1,0)+c(1,-1,0,1)$$



          Thus, in other terminology, we say that any $vinmathrmker(A)$ is a linear combination of $(3,-5,1,0)$ and $(1,-1,0,1)$. The set of all linear combination for a set of vectors $S$ is called the span(or linear hull) of the set $S$ and I denote this with $mathrmspan(S)$.



          We may thus rephrase our result about the solutions of $mathrmker(A)$ as such, that



          $$mathrmker(A)=mathrmspan((3,-5,1,0),(1,-1,0,1))$$



          A basis, for any space $V$, is defined as linearly independent set of vectors spanning $V$, i.e. a linearly independent set $B$, s.t. $mathrmspan(B)=V$.



          Now, as $(3,-5,1,0),(1,-1,0,1)$ are linearly independent(check this yourself), it follows that they also constitute a basis for this set(space).




          Maybe, on a last note, try to generalize the process I've just outline. Toying with these notions and especially with the connections between subspaces, linear systems of equation and matrices in combination is a great exercise. E.g. show that for any $ntimes n$ real matrix $A$, $mathrmker(A)$ always forms a subspace. Is this true for any solution set $S(A,b)$ for a vector equation $Av=b$?






          share|cite|improve this answer















          Take your reduced system



          $$beginpmatrix1 &2 &7& 1\0 &-1 &-5 &-1\ 0 &0 &0 &0\ 0 &0 &0 &0endpmatrixbeginpmatrixx\y\z\wendpmatrix=beginpmatrixx+2y+7z+w\-y-5z-w\0\0endpmatrix=beginpmatrix0\0\0\0endpmatrix$$



          You now just have to solve the equation for $v=(x,y,z,w)^top$. Working with the method of back-substitution, we first assign all the non-pivots(the variables not leading any row) a real constant, as they may vary in their value arbitrarily and we then can determine the pivot variables in dependence on them.



          Thus, let $w=c,z=c'$(for constants $c,c'$). Then, by the second row of the vector equation, we may determine the value of $y$ in terms of the constants $c,c'$(values of $z,w$):



          $$-y-5z-w=0Leftrightarrow-y-5c'-c=0Leftrightarrow y=-5c'-c$$



          Continuing back-substitution, we now derive from the first row the value of $x$ in dependence of $c,c'$:



          $$x+2y+7z+w=0Leftrightarrow x=-2y-7z-wLeftrightarrow x=10c'+2c-7c'-cLeftrightarrow x=3c'+c$$



          Thus, your solutions are any vectors of the following form



          $$(3c'+c,-5c'-c,c',c)=c'(3,-5,1,0)+c(1,-1,0,1)$$



          for arbitrary $c,c'inmathbbR$.




          The solution set of $Av=mathbf0$, i.e. the set $S(A,mathbf0)=vinmathbbR^4mid Av=mathbf0$, for which you want to determine a basis, is commonly called the kernel of the matrix $A$, written $mathrmker(A)$.



          By the above, we've found that any solution to $Av=mathbf0$, i.e. any $vinmathrmker(A)$, can be written as



          $$v=c'(3,-5,1,0)+c(1,-1,0,1)$$



          Thus, in other terminology, we say that any $vinmathrmker(A)$ is a linear combination of $(3,-5,1,0)$ and $(1,-1,0,1)$. The set of all linear combination for a set of vectors $S$ is called the span(or linear hull) of the set $S$ and I denote this with $mathrmspan(S)$.



          We may thus rephrase our result about the solutions of $mathrmker(A)$ as such, that



          $$mathrmker(A)=mathrmspan((3,-5,1,0),(1,-1,0,1))$$



          A basis, for any space $V$, is defined as linearly independent set of vectors spanning $V$, i.e. a linearly independent set $B$, s.t. $mathrmspan(B)=V$.



          Now, as $(3,-5,1,0),(1,-1,0,1)$ are linearly independent(check this yourself), it follows that they also constitute a basis for this set(space).




          Maybe, on a last note, try to generalize the process I've just outline. Toying with these notions and especially with the connections between subspaces, linear systems of equation and matrices in combination is a great exercise. E.g. show that for any $ntimes n$ real matrix $A$, $mathrmker(A)$ always forms a subspace. Is this true for any solution set $S(A,b)$ for a vector equation $Av=b$?







          share|cite|improve this answer















          share|cite|improve this answer



          share|cite|improve this answer








          edited Aug 9 at 19:41


























          answered Aug 7 at 18:46









          zzuussee

          1,639420




          1,639420




















              up vote
              1
              down vote













              There is a standard method for finding a basis for the null space of a matrix. Compute the reduced row echelon form (RREF):
              beginalign
              A=beginpmatrix
              1 & 2 & 7 & 1\
              1 & 1 & 2 & 0\
              2 & 0 &-6 &-2 \
              1 & 1 & 2 & 0
              endpmatrix
              &to
              beginpmatrix
              1 & 2 & 7 & 1\
              0 &-1 &-5 &-1\
              0 &-4 &-20 &-4 \
              0 &-1 &-5 & -1
              endpmatrix
              &&beginaligned R_2&gets R_2-R_1 \ R_3&gets R_3-2R_1 \ R_4&gets R_4-R_1endaligned
              \[6px]
              &to
              beginpmatrix
              1 & 2 & 7 & 1\
              0 & 1 & 5 & 1\
              0 &-4 &-20 &-4 \
              0 &-1 &-5 & -1
              endpmatrix
              && R_2gets -R_2
              \[6px]
              &to
              beginpmatrix
              1 & 2 & 7 & 1\
              0 & 1 & 5 & 1\
              0 & 0 & 0 & 0 \
              0 & 0 & 0 & 0
              endpmatrix
              &&beginaligned R_3&gets R_3+4R_2 \ R_4&gets R_4+R_2endaligned
              \[6px]
              &to
              beginpmatrix
              1 & 0 &-3 &-1\
              0 & 1 & 5 & 1\
              0 & 0 & 0 & 0 \
              0 & 0 & 0 & 0
              endpmatrix
              && R_1gets R_1-2R_2
              endalign
              The system $Ax=0$ is equivalent to the system $Ux=0$, where $U$ is the last matrix above (the RREF of $A$). This system can be rewritten as
              begincases
              x_1 = 3x_3+x_4 \[4px]
              x_2 = -5x_3-x_4
              endcases
              and a basis for the null space can be obtained by choosing first $x_3=1$ and $x_4=0$, then $x_3=0$ and $x_4=1$, yielding the vectors
              $$
              beginpmatrix 3 \ -5 \ 1 \ 0 endpmatrix
              qquadtextandqquad
              beginpmatrix 1 \ -1 \ 0 \ 1 endpmatrix
              $$






              share|cite|improve this answer

























                up vote
                1
                down vote













                There is a standard method for finding a basis for the null space of a matrix. Compute the reduced row echelon form (RREF):
                beginalign
                A=beginpmatrix
                1 & 2 & 7 & 1\
                1 & 1 & 2 & 0\
                2 & 0 &-6 &-2 \
                1 & 1 & 2 & 0
                endpmatrix
                &to
                beginpmatrix
                1 & 2 & 7 & 1\
                0 &-1 &-5 &-1\
                0 &-4 &-20 &-4 \
                0 &-1 &-5 & -1
                endpmatrix
                &&beginaligned R_2&gets R_2-R_1 \ R_3&gets R_3-2R_1 \ R_4&gets R_4-R_1endaligned
                \[6px]
                &to
                beginpmatrix
                1 & 2 & 7 & 1\
                0 & 1 & 5 & 1\
                0 &-4 &-20 &-4 \
                0 &-1 &-5 & -1
                endpmatrix
                && R_2gets -R_2
                \[6px]
                &to
                beginpmatrix
                1 & 2 & 7 & 1\
                0 & 1 & 5 & 1\
                0 & 0 & 0 & 0 \
                0 & 0 & 0 & 0
                endpmatrix
                &&beginaligned R_3&gets R_3+4R_2 \ R_4&gets R_4+R_2endaligned
                \[6px]
                &to
                beginpmatrix
                1 & 0 &-3 &-1\
                0 & 1 & 5 & 1\
                0 & 0 & 0 & 0 \
                0 & 0 & 0 & 0
                endpmatrix
                && R_1gets R_1-2R_2
                endalign
                The system $Ax=0$ is equivalent to the system $Ux=0$, where $U$ is the last matrix above (the RREF of $A$). This system can be rewritten as
                begincases
                x_1 = 3x_3+x_4 \[4px]
                x_2 = -5x_3-x_4
                endcases
                and a basis for the null space can be obtained by choosing first $x_3=1$ and $x_4=0$, then $x_3=0$ and $x_4=1$, yielding the vectors
                $$
                beginpmatrix 3 \ -5 \ 1 \ 0 endpmatrix
                qquadtextandqquad
                beginpmatrix 1 \ -1 \ 0 \ 1 endpmatrix
                $$






                share|cite|improve this answer























                  up vote
                  1
                  down vote










                  up vote
                  1
                  down vote









                  There is a standard method for finding a basis for the null space of a matrix. Compute the reduced row echelon form (RREF):
                  beginalign
                  A=beginpmatrix
                  1 & 2 & 7 & 1\
                  1 & 1 & 2 & 0\
                  2 & 0 &-6 &-2 \
                  1 & 1 & 2 & 0
                  endpmatrix
                  &to
                  beginpmatrix
                  1 & 2 & 7 & 1\
                  0 &-1 &-5 &-1\
                  0 &-4 &-20 &-4 \
                  0 &-1 &-5 & -1
                  endpmatrix
                  &&beginaligned R_2&gets R_2-R_1 \ R_3&gets R_3-2R_1 \ R_4&gets R_4-R_1endaligned
                  \[6px]
                  &to
                  beginpmatrix
                  1 & 2 & 7 & 1\
                  0 & 1 & 5 & 1\
                  0 &-4 &-20 &-4 \
                  0 &-1 &-5 & -1
                  endpmatrix
                  && R_2gets -R_2
                  \[6px]
                  &to
                  beginpmatrix
                  1 & 2 & 7 & 1\
                  0 & 1 & 5 & 1\
                  0 & 0 & 0 & 0 \
                  0 & 0 & 0 & 0
                  endpmatrix
                  &&beginaligned R_3&gets R_3+4R_2 \ R_4&gets R_4+R_2endaligned
                  \[6px]
                  &to
                  beginpmatrix
                  1 & 0 &-3 &-1\
                  0 & 1 & 5 & 1\
                  0 & 0 & 0 & 0 \
                  0 & 0 & 0 & 0
                  endpmatrix
                  && R_1gets R_1-2R_2
                  endalign
                  The system $Ax=0$ is equivalent to the system $Ux=0$, where $U$ is the last matrix above (the RREF of $A$). This system can be rewritten as
                  begincases
                  x_1 = 3x_3+x_4 \[4px]
                  x_2 = -5x_3-x_4
                  endcases
                  and a basis for the null space can be obtained by choosing first $x_3=1$ and $x_4=0$, then $x_3=0$ and $x_4=1$, yielding the vectors
                  $$
                  beginpmatrix 3 \ -5 \ 1 \ 0 endpmatrix
                  qquadtextandqquad
                  beginpmatrix 1 \ -1 \ 0 \ 1 endpmatrix
                  $$






                  share|cite|improve this answer













                  There is a standard method for finding a basis for the null space of a matrix. Compute the reduced row echelon form (RREF):
                  beginalign
                  A=beginpmatrix
                  1 & 2 & 7 & 1\
                  1 & 1 & 2 & 0\
                  2 & 0 &-6 &-2 \
                  1 & 1 & 2 & 0
                  endpmatrix
                  &to
                  beginpmatrix
                  1 & 2 & 7 & 1\
                  0 &-1 &-5 &-1\
                  0 &-4 &-20 &-4 \
                  0 &-1 &-5 & -1
                  endpmatrix
                  &&beginaligned R_2&gets R_2-R_1 \ R_3&gets R_3-2R_1 \ R_4&gets R_4-R_1endaligned
                  \[6px]
                  &to
                  beginpmatrix
                  1 & 2 & 7 & 1\
                  0 & 1 & 5 & 1\
                  0 &-4 &-20 &-4 \
                  0 &-1 &-5 & -1
                  endpmatrix
                  && R_2gets -R_2
                  \[6px]
                  &to
                  beginpmatrix
                  1 & 2 & 7 & 1\
                  0 & 1 & 5 & 1\
                  0 & 0 & 0 & 0 \
                  0 & 0 & 0 & 0
                  endpmatrix
                  &&beginaligned R_3&gets R_3+4R_2 \ R_4&gets R_4+R_2endaligned
                  \[6px]
                  &to
                  beginpmatrix
                  1 & 0 &-3 &-1\
                  0 & 1 & 5 & 1\
                  0 & 0 & 0 & 0 \
                  0 & 0 & 0 & 0
                  endpmatrix
                  && R_1gets R_1-2R_2
                  endalign
                  The system $Ax=0$ is equivalent to the system $Ux=0$, where $U$ is the last matrix above (the RREF of $A$). This system can be rewritten as
                  begincases
                  x_1 = 3x_3+x_4 \[4px]
                  x_2 = -5x_3-x_4
                  endcases
                  and a basis for the null space can be obtained by choosing first $x_3=1$ and $x_4=0$, then $x_3=0$ and $x_4=1$, yielding the vectors
                  $$
                  beginpmatrix 3 \ -5 \ 1 \ 0 endpmatrix
                  qquadtextandqquad
                  beginpmatrix 1 \ -1 \ 0 \ 1 endpmatrix
                  $$







                  share|cite|improve this answer













                  share|cite|improve this answer



                  share|cite|improve this answer











                  answered Aug 9 at 20:48









                  egreg

                  165k1180187




                  165k1180187






















                       

                      draft saved


                      draft discarded


























                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2875237%2fbasis-for-set-of-vectors-is-wrong%23new-answer', 'question_page');

                      );

                      Post as a guest













































































                      這個網誌中的熱門文章

                      How to combine Bézier curves to a surface?

                      Mutual Information Always Non-negative

                      Why am i infinitely getting the same tweet with the Twitter Search API?