According to Linearity of sum and scalar multiples of linear maps we can add linear maps from one vector space to another and multiply them by scalars. These operations comply with the rules for a vector space:
Let and be vector spaces. The set of linear images from to is a vector space with the known addition and scalar multiplication.
If has finite dimension and has finite dimension , then the vector space is isomorphic to the vector space of all -matrices. More precisely, if we choose a basis of and a basis of , then the map determined by is an isomorphism.
The fact that is a vector space is easy to verify, with the obvious zero vector and opposite.
Let , , lie in and let , be numbers. We run by the eight rules of a vector space:
- Commutativity: . This follows from the commutativity of addition in because, for in , we have
- Associativity of addition: . This follows from the associativity of the addition in :
- Zero vector: The function which assigns to each vector in the vector of satisfies the property .
- Opposite: the opposite of is the function that assigns to in the vector in .
- Scalar one: the number satisfies because if in , then
- Associativity of the scalar multiplication: . This follows from the associativity of the scalar multiplication in .
- Distributivity of scalar multiplication over scalar addition: . This follows from the distributivity of scalar multiplication over scalar addition in .
- Distributivity of scalar multiplication over vector addition: . This follows from the distributivity of scalar multiplication over vector addition in .
For proof of the second statement, we choose a basis of and a basis of . Let be an element of . Then is the linear map from to determined by the matrix in .
We prove that the map given by is an isomorphism.
First, is linear because, if and belong to and , are scalars , then
Second, is invertible because the map given by is the inverse of :
Since isomorphic vector spaces have the same dimension and , we have
if and .
A special case occurs if . We then speak of linear functions or linear functionals on . We now focus on the space of linear functions.
Let be a real vector space. The vector space of linear maps is called the dual space of . This vector space is denoted as .
The "sum of the first and second coordinate'' is a linear function , that is to say, an element of . In a formula, . The function given by is not linear, and so does not belong to .
- Let be the vector space of all functions from to itself. The image is linear because . So belongs to .
- Let be the space of infinitely often differentiable functions . The image is linear as well. As a consequence, belongs to .
By the above theorem The linear space of linear maps, the dimension of the dual space of is equal to that of as the dimension of is finite. In that case, is isomorphic to . This is not the case if is infinite-dimensional. To illustrate this, consider the infinite-dimensional vector space of all polynomials in . Let be the linear function that assigns the coefficient of to each polynomial, and consider the set of all infinite sums Here we allow for an infinite number of . Each element of can be seen as a function on because, for every polynomial the right hand side of the expression
is the sum of a finite number of real numbers. Moreover, is a vector space with the usual addition and scalar multiplication. We are not concerned about convergence; we just deal with abstract symbols. The newly defined function is a linear function on and thus an element of . Since the map that assigns to the function is injective, we can view as a linear subspace of . But the space is much larger than the space because it has the cardinality of all infinite sequences of real numbers , unlike , which has the cardinality of all finite sequences of real numbers.
In the case of a vector space of finite dimension, we can use an inner product to construct an isomorphism between the dual space and .
If is a real inner product space and , then the map , defined by , is a linear function.
The linear map that assigns to the element of , is injective. In particular, it is an isomorphism if is finite-dimensional.
This follows from the linearity in the second argument of the inner product: .
To prove the injectivity we assume that satisfies , the zero map . Then all , and so also for . This means that . The positivity condition of the inner product then yields . Therefore, the kernel of the linear map that assigns to the map , consists only of . From Criteria for injectivity and surjectivity it follows that the map is injective.
If , then by the above theorem. Consequenly, the first Invertability criteria for a linear mapping implies that the map is invertible, and thus is an isomorphism.
The null space of the map is exactly the orthoplement .
The image is if and if .
Let be the vector space with standard inner product. Furthermore, let be the standard basis of , and the basis of where is given by .
What is the matrix of the image with respect to the bases of and of that assigns to in the dual vector , given by ?
If , then
so
Therefore, the image of the basis vector under is , which implies that the requested matrix is equal to