Assume that F is a field. Consider a matrix like A∈Mm,n(F).
If we look at each row of A, as a member of Fn, the subspace produced by rows of A is called the row-space of A.
a) Prove that elementary row operations on A don't change the row-space of A. Then, Conclude that foreach matrix like B, if A,B are row equivalent, then they have the same row-space.
b) Prove that A∈Mn(F) is invertible iff the row-space of it is Fn.
Note : I'm confused with the definitions ... I have no idea how to solve this problem.
Answer
Let v1,…,vn denote the rows of A, and let V be the row-space of A. In other words,
V=span{v1,…,vn}.
Elementary operations could consist of a permutation of rows, which amount to permuting some vj and vk above; such operation will not change the span of v1,…,vn. The same happens with multiplying by a nonzero number: v1,…,vn, and v1,…,λvk,…,vn span the same subspace.
The last kind of elementary operation consists of replacing vk with vk+λvj. In this case, we can write
α1v1+⋯+αnvn=α1v1+⋯+αk−1vk−1+αk(vk+λvj)+αk+1vk+1+⋯(αj−αkλ)vj+⋯+αnvn.
So every linear combination of v1,…,vn is also a linear combination of v1,…,vn with vk replaced by vk+λvj.
In summary, after doing any elementary operation to v1,…,vn, the span doesn't change. It follows directly that if A and B are row equivalent, since the rows of B can be obtained by elementary operations from the rows of A, the spans of their rows are equal.
If A is invertible, then it is row equivalent to I, and so its row space is Fn. Conversely, if the row space of A is Fn, then by writing each of v1,…,vn in terms of the canonical basis, we get a recipe to go from I to A by elementary operations, and so A is invertible.
No comments:
Post a Comment