• Aucun résultat trouvé

1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 19

N/A
N/A
Protected

Academic year: 2022

Partager "1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 19"

Copied!
2
0
0

Texte intégral

(1)

1111: Linear Algebra I

Dr. Vladimir Dotsenko (Vlad) Lecture 19

Linear maps

Definition 1. Suppose that V andW are two vector spaces. A function ϕ: V→W is said to be alinear map, or alinear operator, if

• forv1, v2∈V, we haveϕ(v1+v2) =ϕ(v1) +ϕ(v2),

• forc∈R,v∈V, we haveϕ(c·v) =c·ϕ(v).

Lemma 1. Suppose thatϕ is a linear map. Thenϕ(0) =0, andϕ(−v) = −ϕ(v).

Proof. This follows from0·v=0and(−1)·v= −v.

Definition 2. Letϕ: V→W be a linear operator, and lete1, . . . , en andf1, . . . , fm be bases ofV andW respectively. Let us compute coordinates of the vectorsϕ(ei)with respect to the basisf1, . . . , fm:

ϕ(e1) =a11f1+a21f2+· · ·+am1fm, ϕ(e2) =a12f1+a22f2+· · ·+am2fm,

. . .

ϕ(en) =a1nf1+a2nf2+· · ·+amnfm. The matrix

A=

a11 a12 . . . a1n

a21 a22 . . . a2n

... . . .. ... am1 am2 . . . amn

is calledthe matrix of the linear operatorϕ with respect to the given bases, and denotedAϕ,e,f. For eachk, itsk-th column is the column of coordinates of imagef(ek).

Similarly to how we proved it for transition matrices, we have the following result.

Lemma 2. Let ϕ: V → W be a linear operator, and let e1, . . . , en and f1, . . . , fm be bases of V and W respectively. Suppose that x1, . . . , xn are coordinates of some vectorv relative to the basis e1, . . . , en, and y1, . . . , ym are coordinates ofϕ(v)relative to the basisf1, . . . , fm. Then

 y1 y2 ... ym

=Aϕ,e,f

 x1 x2 ... xn

 ,

or, in other words,

(ϕ(v))f =Aϕ,e,fve.

1

(2)

Proof. The proof is indeed very analogous to the one for transition matrices: we have v=x1e1+· · ·+xnen,

so that

ϕ(v) =x1ϕ(e1) +· · ·+xnϕ(en).

Substituting the expansion off(ei)’s in terms offj’s, we get

ϕ(v) =x1(a11f1+a21f2+· · ·+am1fm) +· · ·+xn(a1nf1+a2nf2+· · ·+amnfm) =

= (a11x1+a12x2+· · ·+a1nxn)f1+· · ·+ (am1x1+am2x2+· · ·+amnxn)fn.

Since we know that coordinates are uniquely defined, we conclude that a11x1+a12x2+· · ·+a1nxn=y1,

. . .

am1x1+am2x2+· · ·+amnxn=yn,

which is what we want to prove.

The next statement is also similar to the corresponding one for transition matrices; it also generalises the statement that in the case of coordinate vector spaces product of matrices corresponds to composition of linear maps. In some sense, this is a central result about linear maps (which also justifies the definition of matrix products).

Theorem 1. Let U, V, and W be vector spaces, and let ψ:U → V and ϕ: V → W be linear operators.

Suppose thate1, . . . , en,f1, . . . , fm, and g1, . . . , gk are bases ofU,V, and W respectively. Let us consider the composite mapϕ◦ψ: U→W,ϕ◦ψ(u) =ϕ(ψ(u)). Then

1. ϕ◦ψis a linear map;

2. we have

Aϕ◦ψ,e,g=Aϕ,f,gAψ,e,f.

Proof. First, let us note that

(ϕ◦ψ)(u1+u2) =ϕ(ψ(u1+u2)) =ϕ(ψ(u1) +ψ(u2)) =ϕ(ψ(u1)) +ϕ(ψ(u2)) = (ϕ◦ψ)(u1) + (ϕ◦ψ)(u2), (ϕ◦ψ)(c·u) =ϕ(ψ(c·u)) =ϕ(cψ(u)) =cϕ(ψ(u)) =c(ϕ◦ψ)(u),

soϕ◦ψis a linear map.

Let us prove the second statement. We take a vectoru∈U, and apply the formula of Lemma 2. On the one hand, we have

(ϕ◦ψ(u))g=Aϕ◦ψ,e,gue. On the other hand, we obtain,

(ϕ◦ψ(u))g= (ϕ(ψ(u)))g=Aϕ,f,g(ψ(u)f) =Aϕ,f,g(Aψ,e,fue) = (Aϕ,f,gAψ,e,f)ue. Therefore

Aϕ◦ψ,e,gue= (Aϕ,f,gAψ,e,f)ue

for everyue. From our previous classes we know that knowingAv for all vectorsv completely determines the matrixA, so

Aϕ◦ψ,e,g=Aϕ,f,gAψ,e,f, as required.

2

Références

Documents relatifs

From our proof, one sees that for computing the Jordan normal form and a Jordan basis of a linear trans- formation ϕ on a vector space V, one can use the following plan:.. • Find

If we are given a point P belonging to the line `, and v is a nonzero vector parallel to `, then for each point X on `, the vector −→.. PX is parallel

Given 101 coins of various shapes and denominations, one knows that if you remove any one coin, the remaining 100 coins can be divided into two groups of 50 of equal total weight..

, f n the “new basis”, then this system tells us that the product of the transition matrix with the columns of new coordinates of a vector is equal to the column of old

I am fully aware that sometimes the amount of examples we do in class / in homeworks is not enough, so this book is a great source of exercises, and these exercises have answers

If A is invertible, then the last row of its reduced row echelon form must be non-zero, or we get a contradiction like in the previous argument.. Therefore, each row of the reduced

Recall that the coordinate vector space R n consists of all columns of height n with real entries, which we refer to as vectors.. Let v

Indeed, we can note that injectivity means that Ax = b has at most one solution for each b, which is equivalent to the absence of free variables, which is equivalent to the system Ax