2024-10-06

806: For Finite-Dimensional Vectors Space and Basis, Vectors Space Is 'Vectors Spaces - Linear Morphisms' Isomorphic to Components Vectors Space

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that for finite-dimensional vectors space and basis, vectors space is 'vectors spaces - linear morphisms' isomorphic to components vectors space

Topics


About: vectors space

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any finite-dimensional vectors space and any basis, the vectors space is 'vectors spaces - linear morphisms' isomorphic to the components vectors space with respect to the basis.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
F: { the fields }
V: { the d -dimensional F vectors spaces }
B: ={b1,...,bd}V, { the bases of V}
Fd: = the vectors space 
f: :VFd,v(v1,...,vd), where v=v1b1+...+vdbd
//

Statements:
f{ the 'vectors spaces - linear morphisms' isomorphisms }
//


2: Natural Language Description


For any field, F, any d-dimensional F vectors space, V, any basis, B={b1,...,bd}V, the vectors space, Fd, and f:VFd,v(v1,...,vd), where v=v1b1+...+vdbd, f is a 'vectors spaces - linear morphisms' isomorphism.


3: Note


F does not need to be R or C.

This proposition is usually regarded to be obvious intuitively, but let us be at ease with conscience that we have indeed proved it once and for all.


4: Proof


Whole Strategy: Step 1: see that Fd is indeed an F vectors space; Step 2: see that f is linear; Step 3: see that f is bijective; Step 4: conclude the proposition.

Step 1:

Let us see that Fd is indeed an F vectors space.

1) for any elements, v1,v2Fd, v1+v2Fd (closed-ness under addition); 2) for any elements, v1,v2Fd, v1+v2=v2+v1 (commutativity of addition); 3) for any elements, v1,v2,v3Fd, (v1+v2)+v3=v1+(v2+v3) (associativity of additions); 4) there is a 0 element, 0Fd, such that for any vFd, v+0=v (existence of 0 vector); 5) for any element, vFd, there is an inverse element, vFd, such that v+v=0 (existence of inverse vector); 6) for any element, vFd, and any scalar, rF, r.vFd (closed-ness under scalar multiplication); 7) for any element, vFd, and any scalars, r1,r2F, (r1+r2).v=r1.v+r2.v (scalar multiplication distributability for scalars addition); 8) for any elements, v1,v2Fd, and any scalar, rF, r.(v1+v2)=r.v1+r.v2 (scalar multiplication distributability for vectors addition); 9) for any element, vFd, and any scalars, r1,r2F, (r1r2).v=r1.(r2.v) (associativity of scalar multiplications); 10) for any element, vFd, 1.v=v (identity of 1 multiplication).

Step 2:

f is well-defined, because the decomposition of each vector with respect to any basis is unique: if v=v1b1+...+vdbd=v1b1+...+vdbd, (v1v1)b1+...+(vdvd)bd=0, which implies that vj=vj.

Let us see that f is linear.

Let v,vV and r,rF be any.

Let v=v1b1+...+vdbd and v=v1b1+...+vdbd.

f(rv+rv)=f(r(v1b1+...+vdbd)+r(v1b1+...+vdbd))=f((rv1+rv1)b1+...+(rvd+rvd)bd)=(rv1+rv1,...,rvd+rvd)=(rv1,...,rvd)+(rv1,...,rvd)=r(v1,...,vd)+r(v1,...,vd)=rf(v)+rf(v).

Step 3:

Let us see that f is bijective.

Let vvV be any.

f(v)f(v), because the decomposition of each vector with respect to any basis is unique: mentioned before.

So, f is injective.

Let (v1,...,vd)Fd be any.

For v:=v1b1+...+vdbdV, f(v)=f(v1b1+...+vdbd)=(v1,...,vd).

So, f is surjective.

Step 4:

By the proposition that any bijective linear map is a 'vectors spaces - linear morphisms' isomorphism, f is a 'vectors spaces - linear morphisms' isomorphism.


References


<The previous article in this series | The table of contents of this series | The next article in this series>