Proving the Existence of a Vector for a Matrix with Linearly Independent Rows

retspool
Messages
35
Reaction score
0
So i have a problem in front of me


Let A be a m x n matrix whose rows are linearly independent. Prove that there exists a vector p such taht Ap = e_1 where e_1 =( 1, 0 , 0, 0, 0,0 ,0 ... 0)T



i don't even know where to begin
 
Physics news on Phys.org


Is that the complete problem statement? As it is, it's easy to find a counterexample, e.g., the zero matrix.
 


Yeah that is the complete problem statement.

but it is a question from my Optimization class and not Linear Algebra

I don't understand how the zero matrix will fit the bill
 


Sorry, I misread "independent" as "dependent." Never mind.
 


Maybe you know something about surjectivity of linear maps and the properties of the matrices that represent them?
Since you don't have detailed information about A, you can't explicitly find p, but also it doesn't really matter whether it is e_1 or any other vector of the right dimension.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top