Every solution of Ax=0 is thesolution to Bx=0, where B is row echelon form, j=rankA=rankB. For B we have n-j
last zero rows, and these corresponding x_i 's can be choosen linearly
independent, and other will be automatically computed, so there will be n-j linearly
independent solutions.
So, choosing last coordinate one will obtain nonzero solution.
Comments
Leave a comment