4.21 Coordinate isomorphisms

4.21.1 Vector space isomorphisms

Consider the real vector space of all height 3 column vectors, and the real vector space of all height 3 row vectors. These are different vector spaces but they are essentially the same: there’s no vector space property which one has but the other doesn’t.

A way to make this precise is to observe that there is a bijective linear map between them, namely the transpose which sends (xyz) to (x⁢y⁢z).

Definition 4.21.1.
  • •

    Linear maps which are bijections are called vector space isomorphisms, or just isomorphisms.

  • •

    If there is an isomorphism U→V, we say that U and V are isomorphic and write U≅V.

Isomorphic vector spaces share the same vector space properties — for example, they always have the same dimension.

Lemma 4.21.1.

If U≅V then dimU=dimV.

Proof.

There’s a linear bijection T:U→V. ker⁡T={𝟎U}, so applying the rank-nullity theorem dimU=dimker⁡T+dimim⁡T=dimim⁡T. Since ker⁡T={𝟎U} we get dimU=dimim⁡T, but T is onto so im⁡T=V and dimU=dimV. ∎

4.21.2 Coordinate isomorphisms

If V is a finite-dimensional 𝔽-vector space with a basis ℬ=𝐛1,…,𝐛n then every 𝐯∈V can be written uniquely as a1⁢𝐛1+⋯+an⁢𝐛n for some ai∈𝔽. The column vector

[𝐯]ℬ=(a1⋮an)

is called the coordinate vector of 𝐯 with respect to ℬ. We can use this idea to define an isomorphism between V and 𝔽n.

Proposition 4.21.2.

Let V be a 𝔽-vector space with basis ℬ=𝐛1,…,𝐛n. Define [−]ℬ:V→𝔽n to be the function that sends 𝐯∈V to its coordinate vector [𝐯]ℬ. Then [−]ℬ is a vector space isomorphism.

[−]ℬ is called the coordinate isomorphism with respect to ℬ.

Proof.

First we have to show it is linear.

  • •

    Let 𝐱,𝐲∈V and let 𝐱=∑ixi⁢𝐛i and 𝐲=∑iyi⁢𝐛i, so that [𝐱]ℬ=(x1,…,xn)T and [𝐲]=(y1,…,yn)T. Then 𝐱+𝐲=∑i(xi+yi)⁢𝐛i, so

    [𝐱+𝐲]ℬ =(x1+y1,…,xn+yn)T
    =(x1,…,xn)T+(y1,…,yn)T
    =[𝐱]ℬ+[𝐲]ℬ.
  • •

    Let 𝐱∈V and λ∈𝔽. If 𝐱=∑ixi⁢𝐛i so that [𝐱]ℬ=(x1,…,xn)T, then λ⁢𝐱=∑iλ⁢xi⁢𝐛i so [λ⁢𝐱]ℬ=(λ⁢x1,…,λ⁢xn)T=λ⁢(x1,…,xn)T=λ⁢[𝐱]ℬ.

Now we have to show it is injective and surjective.

  • •

    If [𝐯]ℬ=𝟎n then by definition 𝐯=0⁢𝐛1+⋯+0⁢𝐛n=𝟎V. Therefore ker[−]ℬ={𝟎V} and by Proposition 4.14.3, [−]ℬ is injective.

  • •

    Any vector (x1,…,xn)T in 𝔽n is the image of ∑ixi⁢𝐛i∈V under [−]ℬ.

∎

In particular, every finite-dimensional vector space is isomorphic to a space of column vectors.

4.21.3 Coordinate and matrices of linear maps

Suppose we have 𝔽-vector spaces U,V of dimensions n and m with bases ℬ=𝐛1,…,𝐛n,𝒞=𝐜1,…,𝐜m and a linear map T:U→V. We have coordinate isomorphisms [−]ℬ:U→𝔽n and [−]𝒞:V→𝔽m and a matrix [T]𝒞ℬ∈Mm×n⁢(𝔽). What is the relationship between T:U→V and the linear map 𝔽n→𝔽m given by left-multiplication by [T]𝒞ℬ?

Theorem 4.21.3.

In the notation above, for any 𝐮∈U we have [T]𝒞ℬ⁢[𝐮]ℬ=[T⁢(𝐮)]𝒞.

Proof.

Let [T]𝒞ℬ=(ai⁢j), so that T⁢(𝐛j)=∑i=1mai⁢j⁢𝐜j. Notice that this says [T⁢(𝐛j)]𝒞 is (a1⁢j,…,am⁢j)T, the jth column of [T]𝒞ℬ. The coordinate vector [𝐛j]ℬ is the jth standard basis vector 𝐞j, so [T]𝒞ℬ⁢[𝐛j]=[T]𝒞ℬ⁢𝐞j which equals the jth column of [T]𝒞ℬ. Therefore

[T]𝒞ℬ⁢[𝐛j]ℬ=[T⁢(𝐛j)]𝒞. (4.8)

Let 𝐮∈U and write 𝐮=∑juj⁢𝐛j so that [𝐮]ℬ=(u1,…,un)T. Then

[T⁢(𝐮)]𝒞 =[T⁢(∑juj⁢𝐛j)]
=[∑juj⁢T⁢(𝐛j)]𝒞 linearity of ⁢T
=∑juj⁢[T⁢(𝐛j)]𝒞 linearity of ⁢[−]𝒞
=∑juj⁢[T]𝒞ℬ⁢[𝐛j]ℬ (4.8)
=[T]𝒞ℬ⁢∑juj⁢[𝐛j]
=[T]𝒞ℬ⁢[∑juj⁢𝐛j]ℬ linearity of ⁢[−]ℬ
=[T]𝒞ℬ⁢[𝐮]ℬ.

∎

We can now answer the following natural question: if ℬ and 𝒞 are two bases of the finite-dimensional vector space V and 𝐯∈V, what is the relationship between [𝐯]ℬ and [𝐯]𝒞? Using the previous theorem applied to the identity map id:V→V,

[𝐯]𝒞 =[id⁡(𝐯)]𝒞
=[id]𝒞ℬ⁢[𝐯]ℬ.