Homepage › Solution manuals › Sheldon Axler › Linear Algebra Done Right › Exercise 3.F.6
Exercise 3.F.6
Answers
Proof. _(a)_ Suppose spans . Let , such that . We need to prove that . By definition of , we have
Hence for . By 2.31, it follows that contains a basis and then, by the uniqueness part in 3.5, and are equal. Thus is injective.
Conversely, suppose is injective. Let and suppose by contradiction that . By _Exercise 4_, there is a _non-zero_ linear functional in such that for every . We have , hence . But (since is injective), we get a contradiction.
_(b)_ Suppose is linearly independent. We can extend it to a basis of . Let be any vector in . Define by
By 3.5 is a well defined linear map. And we have
Since was arbitrary, it follows that is surjective.
Conversely, suppose is surjective. Let . We need to prove that . We have
Where the first equation follows from 3.106, the second from 3.95, the third from the Fundamental Theorem of Linear Maps and the fourth because is surjective.
Now it suffices to show that .
Suppose . Clearly , thus . To show the inclusion in the other direction, suppose . Let . There are scalars such that . Thus,
Since was arbitrary, we have . Hence . Therefore and as desired. □