If v =
| ( | v_{1} ... v_{n} | ) |
is a row of vectors, each from a vector space V, and if x is a column of scalars of length n, the product v x of the row of vectors with the column of scalars may be regarded as the pseudo matrix multiplication that evaluates to v_{1} x_{1} + ... + v_{n} x_{n}, which is an element of V.
The vectors in v span V if every vector in V may be written as v x for a least one column x. The vectors in v are linearly independent if a vector in V may be written in the form v x in at most one way. Finally, the vectors in v form a basis of V if and only if every vector in v may be written in the form v x in exactly one way. One calls x the column of coordinates of the vector v x relative to the basis v.
If v is a basis of V and v' is another basis of V, then one has v'_{j} = v a_{j} for exactly one column a_{j}, and the n \times n matrix a =
| ( | a_{1} ... a_{n} | ) |
is invertible. One may write the pseudo matrix relations
| v' = v A and v = v' A^{-1} . |
In this situation either A or its inverse may be referred to as a matrix of change of basis. Neither should be viewed as the matrix of a linear map. In this context the expressions v x and v' x' represent the same vector in V if and only if the columns x and x' are related by the formula x' = A^{-1} x.
These and similar pseudo matrix formulas are characterized by the property that if all abstract vectors are replaced by their columns of coordinates relative to some (related or not) basis, then the relation becomes a regular matrix formula.
If f is a linear map from a vector space V to a vector space W, v a basis of V, and w a basis of W, then one says that M is the matrix of f relative to v and w if one has y = M x whenever x is the column of coordinates of a vector v in V relative to the basis v and y is the column of coordinates of f(v) relative to the basis w.
There is a straightforward way of translating the previous description of the matrix of a linear map relative to given bases into the language of bases rather than, as above, the language of coordinates. For this one uses the notation f(v) to denote the row of vectors f(v_{j}) in W. The row f(v) need not be a basis of W. Since, however, w is a basis of W, one may write, for each subscript j, f(v_{j}) = w M_{j} for a unique column M_{j} of scalars. Then the matrix of f is the matrix M =
| ( | M_{1} ... M_{n} | ) |
, and, indeed, one has the equivalent pseudo matrix formula f(v) = w M.
What happens to the matrix of a linear map when the bases are changed? Suppose v' = v A, w' = w B, f(v) = w M, and f(v)' = w' M'. Since f is linear, one sees that the first of these formulas leads to the relation f(v') = f(v)A. It then follows by elementary matrix arithmetic that M' = B^{-1} M A.
When f is a linear map from a vector space to itself, one usually uses a single basis in the roles of both v and w above.
When f is a linear map from a vector space V to itself, M its matrix relative to a basis v, and M' its matrix relative to a basis v' consisting of characteristic vectors of f (if such a basis exists), then M' is a matrix whose diagonal entries are the proper values of f and one has M' = A^{-1} M A where v' = v A.
Matrices will be used in three ways in this course:
The matrix of a linear map relative to given bases of the domain and the target furnishes a definition of the linear map in terms of the given bases.
The matrix of change of basis for two given bases defines the relationship between the two bases.
The matrix of a bilinear form on the product of two vector spaces relative to given bases of those vector spaces characterizes the bilinear form relative to those bases. This use of matrices, combined with the Principal Axis Theorem, underlies the normal form of a conic section that is usually presented in a U.S. standard first year calculus sequence.