Generally, vector space is an algebraic structure specified by the set of vectors V and the set of scalars F. So we concern about the homomorphism between two vector spaces in the normal sense - operation preservation. Concretely, if f:V→W is a homomorphism, then it preserves vector addition and scalar multiplication.f(x+y)=f(x)+f(y),∀x,y∈Vf(ax)=af(x),∀x∈V,c∈FThe above properties are similar to that of linear function in analysis. So we use the term "linear transformation" interchangeably with "homomorphism" in the case of vector spaces.
Definition. A linear transformation between two vector spaces V and W is a mapping f:V→W satisfying
f(x+y)=f(x)+f(y),∀x,y∈Vf(ax)=af(x),∀x∈V,c∈F
For example, let P3[R] and P2[R] be R vector spaces of polynomials of degree not exceeding 3 and 2, repectively. The derivativedxd:P3[R]→P2[R] is a linear transformation. Let β={β1,...,βm} and γ={γ1,...,γn} are bases for V and W, respectively. Then each f(β1),...,f(βm)∈W can be express uniquely as linear combinations of γ1,...,γn, concretely f(βi)=j=1∑naijγi,j=1,...,n. In terms of matrix product,⎝⎛f(β1)⋮f(βn)⎠⎞=⎝⎛a11⋮am1⋯⋱⋯a1n⋮amn⎠⎞⎝⎛γ1⋮γn⎠⎞.
The matrix (aij) is called the matrix of f relative to bases β and γ, denoted by [f]βγ. If β=γ, we simply denote it [f]β.
For some vector v=bmβm+...+bmβm∈V, we have
f(v)=(b1...bm)⎝⎛f(β1)⋮f(βm)⎠⎞=(b1...bn)⎝⎛a11⋮am1⋯⋱⋯a1n⋮amn⎠⎞⎝⎛γ1⋮γn⎠⎞. Hence [f(v)]γ=[v]β[f]βγ.
Next, we will show that for given bases β for V and γ for W, for each linear transformation f, there is an m×n representation matrix for f and vice versa. This means there is a bijection from L(V,W) to Mm×nF. Moreover, the bijection is an isomorphism, meaning that almost all theorems on linear transformation have a matrix version and so far, we have formalized matrix by linear transformation, which is a more systematic approach.
Theorem. For given bases β for V and γ for W, the mapping
Φ:L(V,W)f→Mm×nF↦[f]βγ is an isomorphism.
Proof. For each transformation, the matrix has been constructed uniquely as shown above. Now for each matrix A=(aij)∈Mm×nF, define f such that f(βi)=j=1∑naijγj,1≤i≤m,1≤j≤n. We need to show that f is unique. Suppose that there is g such that g(βi)=j=1∑naijγj,1≤i≤m,1≤j≤n, we can easily see that f(v)=g(v),∀v∈V. Therefore, Φ is a bijection. To show that Φ is an isomorphism, we have to point out that Φ(cf+g)=c[f]βγ+[g]βγ. Indeed, since (cf+g)(v)=cf(v)+g(v), we have
[(cf+g)(v)]γ=c[f(v)]γ+[g(v)]γ=c[v]β[f]βγ+[v]β[g]βγ=[v]β[cf]βγ+[v]β[g]βγ=[v]β([cf]βγ+[g]βγ)=[v]β([cf+g])βγ. Hence [cf+g])βγ is the matrix of cf+g relative to bases β and γ.