Lecture 13
Chapter III Linear maps
Assumption: are vector spaces (over )
Matrices 3C
Theorem 3.63
A linear map is invertible if and only if it is injective and surjective.
Example
Consider ,
is injective but not surjective. Since you cannot get constant from multiply . So it is not invertible.
Theorem 3.65
Let and be finite-dimensional with the same dimension, and , then is invertible, if and only if is injective if and only if, is surjective.
Proof:
Suppose is injective, then , i.e , since , we have but , so . Thus . This shows that .
If is surjective, then but then , so is injective, .
Theorem 3.68
Suppose finite dimensional , then for and , then
Example 3.67
Show that for a polynomial with degree , there exists a unique polynomial of degree such that
Solution:
Let given by by is injective since has degree for , therefore, is surjective. (by Theorem 3.68)
Isomorphisms
Definition 3.69
An isomorphism of vector spaces is a invertible linear map. Two vector spaces are isomorphic if there exists an isomorphism between them.
Notation: means and are isomorphic. (Don't use very often, no map is included.)
Example:
and are isomorphic.
Theorem 3.70
Two finite dimensional vector spaces are isomorphic if and only if
Ideas of Proof:
use fundamental theorems of linear map
Let and be bases. Then define by for
Show is invertible by showing is injective and surjective.
Theorem 3.71
Let be finite dimensional, let and be bases. Then the map
or is an isomorphism ()
Sketch of Proof:
Need to show is surjective and injective.
- Injective: i.e need to show if , then .
- Surjective: i.e let define given by you cna check that
Corollary 3.72
Definition 3.73
a basis, then