(In words: different elements of X are mapped to different images in Y.)
Definition
A map f:X→Y is called surjective if
∀y∈Y∃x∈X:f(x)=y.
(In words: every element of Y is "hit" by f.)
Definition
A map f:X→Y is called bijective if
∀y∈Y∃!x∈X:f(x)=y.
(In words: every element of Y is "hit" by fexactly once.)
Definition
A map F:V→W between E-vector spaces V and W is called linear (more precisely a homomorphism of E-vector spaces) if ∀v,w∈V and ∀λ∈E:
L1F(v+w)=F(v)+F(w)
L2F(λv)=λF(v)
These two conditions can be combined into one:
LF(v+λw)=F(v)+λF(w).
Definitionnotation
For F:V→W linear, F∈Hom(V,W).
Remark
It is common to sharpen the notion of homomorphism:
F∈Hom(V,W) and bijective ⇔isomorphism (notation: V=W)
F∈Hom(V,W) and V=W⇔endomorphism (notation: F∈End(V))
F∈End(V) and bijective ⇔automorphism
Moreover: (i) ⇔∃G:W→V linear such that F∘G=idW, G∘F=idV, i.e.
∀w∈W:∀v∈V:F(G(w))=wG(F(v))=v
Remark
Let M(F),M(G) be the representation matrices of F:V→W isomorphic and its inverse map G=F−1:W→V and let V,W be finite-dimensional vector spaces, i.e. dim(V)<∞ and dim(W)<∞. Then bijectivity of F means that
dim(V)=dim(W)
M(F)⋅M(G)=M(G)⋅M(F)=𝟙dim(V)⇔M(F)=(M(G))−1
Definition
For every basis B={v1,...,vn} of V there is exactly one isomorphism:
ϕB:En→V,(x1,...,xn)↦ϕB(x1,...,xn)=k=1∑nxkvk=x1v1+...+xnvn with ϕB(ei)=vi.
(In words: ϕB assigns to x its coordinates with respect to the basis B.)
Definition
Let F∈Hom(V,W).
Im(F):=F(V)={F(v)∣v∈V}⊂W is a subspace of W and is called image(F) or Im(F).
ker(F):={v∈V∣F(v)=0}⊂V is a subspace of V and is called ker(F).
Satz
Let F:V→W be linear and V, W vector spaces. Then:
F(0)=0, zero is always mapped to zero
F surjective ⇔Im(F)=W⇔dim(Im(F))=dim(W)
F injective ⇔ker(F)={0}⇔dim(ker(F))=0
F is an isomorphism ⇔dim(V)=dim(W)=rank(F)
Satz
If f,g are linear maps ⇒f∘g is a linear map.
Satz
If f,g are linear maps, then the function F:=f±g arising from the linear combination of f,g is again a linear map.
Definition
The rank of the linear map F is defined as:
rank(F)=dim(Im(F)).
Remark
The rank of the linear map F equals the rank of its representation matrix M(F). We have: rank(F)=dim(Im(F))=rank(M(F))=rank(M(F)T)
Remark
Row rank = column rank: rank(M(F))=rank(M(F)T) Caution: in general: column space = row space
Satz
Let V and W be two finite-dimensional subspaces of a larger vector space (finite-dimensional ⇔dim(V)=n<∞ and dim(W)=k<∞) and let f:V→W be linear; then the following dimension formulas hold:
dim(V+W)=dim(V)+dim(W)−dim(V∩W)
n=dim(V)=dim(ker(f))+dim(Im(f))
Remarkproperties of linear maps
Let V,W be E-vector spaces and B={v1,...,vn} a basis of V. Let F:V→W be linear.
Im(F)=span(F(v1),...,F(vn)), i.e. F is uniquely defined by its values on the basis vectors
If F is injective and v1,...,vn∈V are linearly independent, then F(v1),...,F(vn)∈Im(F) are linearly independent
dim(V)=dim(W)<∞ and F injective ⇒F is bijective!
Example 1
Let F:R→R,x↦5x−1.
F is not linear, since F(0)=−1=0.
Remark
Let f∈Hom(V,W) and let the vector spaces V,W be finite-dimensional. The image of f is spanned by the columns of M(f), i.e. Im(f)=span{columns of M(f)}.
Remark
Let F∈Hom(V,W) with corresponding representation matrix M(F). Then:
We can read off dim(Im(F))=rank(F)=rank(M(F))=2 directly from M(F). Thanks to the dimension formula we know that the basis of the kernel of F contains one basis vector.
Below we compute the solution set of M(F) (or M(F)), which is at the same time ker(F)=ker(M(F))=ker(M(F)), since we are solving the linear system M(F)x=0.
(As you saw in the exercise session, we can also "guess" the vectors in the kernel with the help of M(F).)
M(F)M(F)M(F)⟹⇒row 3t:=x3,t∈Rfree parameter⇒row 2−2x2+5x3=0⇔t=x3−2x2+5t=0⇔2x2=5t⇔x2=25t⇒row 12x1+3x3=0⇔t=x32x1+3t=0⇔2x1=−3t⇔x1=−23tL=⎩⎨⎧x1x2x3−23251⋅t,t∈R⎭⎬⎫⇒ker(F)=ker(M(F))=⎩⎨⎧x1x2x3−23251⋅t,t∈R⎭⎬⎫=span⎩⎨⎧x1x2x3−23251⎭⎬⎫=span⎩⎨⎧x1x2x3−352⎭⎬⎫⇒A basis of ker(F) is for example:Bker(F)=⎩⎨⎧−352⎭⎬⎫
For the image Im(F) we know from the remark above:
Im(F)=span⎩⎨⎧132,110,−123⎭⎬⎫
From the columns of M(F) (a spanning set of Im(F)), choose two vectors as a basis of Im(F), namely those that have pivot elements in M(F):
⇒BIm(F)=⎩⎨⎧132,110⎭⎬⎫
Example 3
Given: F:R3→R2 is given by the following matrix:
M(F)=(142536)
Wanted: determine bases of ker(F) and Im(F).
Show solutionHide solutionM(F)=(142536)⇝(ii)−l21(i)(102−33−6)⇝(i)−−32(ii)(100−3−1−6)=:M(F)
To find dim(ker(F)) we use the rank-nullity theorem (dimension formula):
We can read off dim(Im(F))=rank(F)=rank(M(F))=2 directly from M(F). Thanks to the dimension formula we know that the basis of the kernel of F contains one basis vector.
⇒ker(F)=ker(M(F))=⎩⎨⎧x1x2x31−21⋅t,t∈R⎭⎬⎫=span⎩⎨⎧x1x2x31−21⎭⎬⎫⇒A basis of ker(F) is for example:Bker(F)=⎩⎨⎧1−21⎭⎬⎫
For the image Im(F) we know from the remark above:
Im(F)=span{(14),(25),(36)}
From the columns of M(F) (a spanning set of Im(F)), choose two vectors as a basis of Im(F), namely those that have pivot elements in M(F):
⇒BIm(F)={(14),(25)}
Remarkmatrix of a linear map (representation matrix; special case with standard basis)
Given: V,W vector spaces, F:(V,A)→(W,B),v↦F(v) and a basis of V with A={a1,...,an} and the standard basis of W with B={b1,...,bm}
Wanted: MBA(F)
Compute F(ai),i∈{1,...,n} for every basis vector
Build MBA(F)=(n columnsF(a1),...,F(an))}m rows.
We have obtained the matrix of F, where the domain is given with respect to A and the codomain with respect to B.
Example 4
Let F=dtd:P2→P1,p↦p˙=dtdp.
(i) To show: F is a linear map.
Show solutionHide solution
Proof:
∀a,b∈P2,λ∈E:
F(a+λb)=dtd(a+λb)=dtda+λdtdb=F(a)+λF(b)□
(ii) Find the matrix MBB(F) with respect to the monomial basis B={1,t,t2}.
Let A=(e1,...,en) be the canonical basis of the vector space V and B=(b1,...,bn) another basis of V, described in terms of the canonical basis. Then there exists a change-of-basis matrix with:
TAB=(b1∣⋯∣bn) with bi=TABei,i∈{1,...,n}.VATBAVB
Remark
The following calculation rule holds: TBA=(TAB)−1
With the definition above we therefore obtain: TBAbi=ei,i∈{1,...,n}.