A matrix encoding a linear map relative to chosen bases.
The matrix representation of a linear mapT:V→W with respect to bases B={v1,…,vn} of V and C={w1,…,wm} of W is the m×nmatrix[T]BC whose columns are the coordinate vectors of T(vj) in the basis C.
That is, if T(vj)=∑i=1maijwi, then the (i,j) entry of the matrix is aij.
Writing F for the field of scalars, the matrix is defined so that the square below commutes, where the vertical maps take coordinate vectors in the bases B and C:
PropertiesOpen
Composition: [ST]BD=[S]CD[T]BC.
Change of basis: If P and Q satisfy [v]B=P[v]B′ and [w]C=Q[w]C′, then [T]B′C′=Q−1[T]BCP.
Similarity: Two matrices represent the same operator (different bases) iff they are similar.
Standard representationOpen
For T:Rn→Rm, the standard matrix is [T(e1)∣⋯∣T(en)].
InvariantsOpen
The rank is independent of both basis choices. For an endomorphism T:V→V, the determinant and eigenvalues are also independent of the basis used for both domain and codomain.
A linear map is a functionT:V→W between vector spaces over the same field F such that for all u,v∈V and a∈F,
An eigenvalue of a linear operatorT:V→V is a scalar λ∈F such that there exists a nonzero vector v∈V with
T(v)=λv.
A vector v=0 satisfying this equation is an eigenvector, and all such vectors (together with 0) form the eigenspace for λ. If V is finite-dimensional, the eigenvalues in F are precisely the roots in F of the characteristic polynomial.