大學線性代數再探
大學數學
大 學 線性代數 .
linear operator . 線性代數 , 性 .
linear transformation 性 , 再 . 代數
field 性 over field polynomial ring 代數 (
).
, ,
代. , .
, . , 性
, . , .
, 大 . 大
, . ,
.
v
Chapter 2
Linear Transformations
學 數學 大 數 性. 數
, 數 數;
group homomorphisms ring homomorphisms. 線性代數 數
vector spaces , linear transformations.
2.1. Definition and Basic Properties
Definition 2.1.1. V,W over F vector spaces. V W 數
T : V → W, v1, v2∈ V r∈ F T (rv1+ v2) = rT (v1) + T (v2), T linear transformation ( linear mapping) from V to W .
T is F-linear. L (V,W) V W linear
transformations .
Question 2.1. T is F-linear v, v′∈ V r∈ F T (v + v′) = T (v) + T (v′) T (rv) = rT (v) ?
linear transformation 性 , linear transforma-
tion vector spaces, OV V .
Proposition 2.1.2. T : V → W linear transformation, (1) T (OV) = OW
(2) v∈ V T (−v) = −T(v).
Proof.
(1) T (OV) = T (OV+ OV) = T (OV) + T (OV), T (OV) = OW.
(2) v∈ V, OW = T (v + (−v)) = T(v) + T(−v) T (−v) = −T(v).
23
linear transformations linear transformation. T, T′
V W linear transformations, V W 數 T + T′: V → W
v∈ V, (T + T′)(v) = T (v) + T′(v). r∈ F , V W
數 rT : V → W v∈ V, (rT)(v) = rT(v). 數 linear
transformation.
Proposition 2.1.3. T, T′ V W F-linear transformations r∈ F , T + T′ rT V W F-linear transformations.
Proof. v1, v2∈ V s∈ F, (T + T′)(sv1+ v2) = T (sv11 + v2) + T′(sv1+ v2) T, T′ F-linear, T (sv1+ v2) + T′(sv1+ v2) = sT (v1) + T (v2) + sT′(v1) + T′(v2) = s(T (v1) + T′(v1)) + (T (v2) + T′(v2)). (T + T′)(sv1+ v2) = s(T + T′)(v1) + (T + T′)(v2).
(rT )(sv1+ v2) = rT (sv1+ v2) = rsT (v1) + rT (v2) = s(rT (v1)) + rT (v2) = s(rT )(v1) +
(rT )(v2).
Question 2.2. V W linear transformations L (V,W),
Proposition 2.1.3 L (V,W) vector space over F?
數 數 , 數.
Proposition linear transformations linear transformation.
Proposition 2.1.4. T1: V → W, T2 : W → U F-linear, T2◦ T1: V → U F-linear.
Proof. v, v′ ∈ V r∈ F, T2◦ T1(rv + v′) = T2(T1(rv + v′)). T1 F- linear, T1(rv + v′) = rT1(v) + T1(v′)再 T2 F-linear T2◦T1(rv + v′) = T + 2(rT1(v) + T1(v′)) = rT2(T1(v)) + T2(T1(v′)) = rT2◦ T1(v) + T2◦ T1(v′). Question 2.3. T, T′ V W F-linear transformations, T′′ W U F-linear transformation. T′′◦ (T + T′) = T′′◦ T + T′′◦ T′? r∈ F r(T′′◦ T) = (rT′′)◦ T = T′′◦ (rT)?
F-spaces V,W , V W linear transformation.
Theorem V W linear transformations .
Theorem 2.1.5. {v1, . . . , vn} V basis, w1, . . . , wn∈ W, F-linear transformation T : V → W T (vi) = wi, ∀i ∈ {1,...,n}.
Proof. 性: T ∈ L (V,W) T (vi) = wi. T : V →
W , v = c1v1+···+cnvn∈ V, T(v) = c1w1+···+cnwn. {v1, . . . , vn} V basis, T V W well-defined function. T T (vi) = wi,
T F-linear. v =∑ni=1civi, v′=∑ni=1divi∈ V r∈ F, T (rv + v′) =
2.2. Image and Kernel 25
T (∑ni=1(rci+ di)vi) =∑ni=1(rci+ di)wi; rT (v) + T (v′) = rT (∑ni=1civi) + T (∑ni=1divi) = r∑ni=1ciwi+∑ni=1diwi, vector space 性 , T (rv + v′) = rT (v) + T (v′).
性: T′: V → W F-linear T′(vi) = wi,∀i ∈ {1,...,n}, T = T′. T (v) = T′(v),∀v ∈ V. v =∑ni=1civi∈ V, T T (v) =
∑ni=1ciwi, T′ F-linear T′(v) ∑ni=1ciT (vi) =∑ni=1ciwi, T = T′. Theorem 2.1.5 , linear transformation T : V → W,
basis S u∈ S, T(u) , v∈ V, T (v) !
Tθ :R2 → R2 R2 (x, y) (0, 0) θ
. Tθ((x, y)) ? (1, 0) = (cos 0, sin 0) (0, 0) θ
(cosθ,sinθ), Tθ((1, 0)) = (cosθ,sinθ). (0, 1) = (cos(π/2),sin(π/2)), Tθ((0, 1)) = (cos((π/2)+θ),sin((π/2)+θ)) = (−sinθ,cosθ).
Tθ((x, y)) = Tθ(x(1, 0) + y(0, 1)) = xTθ((1, 0)) + yTθ((0, 1)) = x(cosθ,sinθ) + y(−sinθ,cosθ) = (x cosθ − ysinθ,xsinθ + ycosθ). , linear transformation ,
數 , 數 linear transformation .
, Tθ linear transformation ( ),
Tθ((x, y)) = (x cosθ − ysinθ,xsinθ + ycosθ).
Question 2.4. T :R2 → R2 linear transformation, T ((1, 2)) = (2, 1), T ((2, 4)) = (4, 2) T ((x, y)) = (y, x)? T′:R2→ R2 linear transfor- mation, T′((1, 2)) = (2, 1), T′((2, 1)) = (1, 2) T′((x, y)) = (y, x)?
2.2. Image and Kernel
Linear transformation vector spaces , “ ”
subspaces. , 數 f : S1→ S2. S′1⊆ S1,
f (S′1) ={ f (s) | s ∈ S′1}.
f (S′1) S2 subset, the image of S′1 under f ; S2′ ⊆ S2, f−1(S2′) ={s ∈ S1| f (s) ∈ S′2}.
f−1(S′2) S1 subset, the preimage of S′2 under f .
Question 2.5. Image preimage inclusion-preserving? 數 f : S1→ S2, S′′1⊆ S′1⊆ S1 f (S′′1)⊆ f (S′1)? S′′2⊆ S′2⊆ S2, f−1(S′′2)⊆ f−1(S′2)?
Question 2.6. f : S1→ S2 數, S′1, S′′1⊆ S1 S′2, S′′2⊆ S2.
?
(1) f (S′1∩ S′′1) = f (S′1)∩ f (S′′1).
(2) f (S′1∪ S′′1) = f (S′1)∪ f (S′′1).
(3) f−1(S′2∩ S′′2) = f−1(S′2)∩ f−1(S′′2).
(4) f−1(S′2∪ S′′2) = f−1(S′2)∪ f−1(S′′2).
linear transformation subspace 性 . Lemma 2.2.1. T : V → W linear transformation.
(1) V′ V subspace, T (V′) W subspace.
(2) W′ W subspace, T−1(W′) V subspace.
Proof. T (V′)⊆ W T−1(W′)⊆ V, Proposition 1.2.1 . (1) OV ∈ V′ ( V′ subspace), Proposition 2.1.2 (1) OW = T (OV)∈
T (V′). 再 w1, w2 ∈ T(V′) r, s∈ F , v1, v2∈ V′ w1= T (v1), w2= T (v2). v = rv1+ sv2∈ V′, rw1+ sw2= T (v)∈ T(V′),
T (V′) W subspace.
(2) OW ∈ W′ T (OV) = OW ∈ W′ OV ∈ T−1(W′). 再 v1, v2 ∈ T−1(W′) r, s∈ F, T (v1)∈ W′ T (v2)∈ W′ . W′ W subspace
T (rv1+ sv2) = rT (v1) + sT (v2)∈ W′, rv1+ sv2∈ T−1(W′), T−1(W′) V subspace.
, V′= V W′={OW} , .
Definition 2.2.2. T : V → W linear transformation.
(1) T (V ) the image (or range) of T , Im(T ) .
(2) T−1({OW}) the kernel (or null-space) of T , Ker(T ) . Lemma 2.2.1 Im(T ) W subspace, Ker(T ) V subspace.
Question 2.7. image preimage inclusion-preserving Im(T ) = T (V ) subspaces image 大 subspace, Ker(T ) = T−1({OW}) subspaces
preimage . 探 T ({OV}) T−1(W ) ?
數, 數 (onto) (one-to-one).
Im(T ) Ker(T ) T linear transformation , Im(T )
Ker(T ) T , .
Proposition 2.2.3. T : V → W linear transformation.
(1) T Im(T ) = W .
(2) T Ker(T ) ={OV}.
Proof. Im(T )⊆ W {OV} ⊆ Ker(T), (1) W⊆ Im(T)
, (2) Ker(T )⊆ {OV} .
2.2. Image and Kernel 27
(1) T onto, w∈ W, v∈ V T (v) = w, w∈ T(V) = Im(T).
W ⊆ Im(T), W = Im(T ). , W ⊆ Im(T) w∈ W
Im(T ) , v∈ V w = T (v), T onto.
(2) T one-to-one, V T (v) = OW v OV ( T (OV) =
OW). v∈ Ker(T), T (v) = OW, v = OV. Ker(T ) ={OV}.
, Ker(T ) ={OV}. v1, v2∈ V T (v1) = T (v2), T linear T (v1−v2) = OW, v1−v2∈ Ker(T) = {OV}. v1= v2, T one-to-one.
Proposition 2.2.3 , T linear T onto
Im(T ) = W ; T one-to-one Ker(T ) ={OV} T
linear . 數 f , f linear f−1({0}) = {0}
f one-to-one.
image kernel , . Lemma
image spanning set kernel linear independency .
Lemma 2.2.4. T : V → W linear transformation, S, S′ V subsets.
(1) S V spanning set, T (S) Im(T ) spanning set.
(2) S′ linearly independent Span(S′)∩ Ker(T) = {OV}, T (S′) linearly independent.
Proof.
(1) w∈ Im(T) v∈ V w = T (v), V = Span(S)
c1, . . . , cn∈ F v1, . . . , vn∈ S v = c1v1+···+cnvn. T (v1), . . . , T (vn)∈ T (S), T linear w = T (c1v1+··· + cnvn) = c1T (v1) +··· + cnT (vn)∈ Span(T (S)). Im(T )⊆ Span(T(S)). , w∈ Span(T(S)),
c1, . . . , cn∈ F w1, . . . , wn∈ T(S) w =∑ni=1ciwi. wi∈ T(S)
vi ∈ S wi= T (vi), w =∑ni=1ciT (vi) =∑ni=1T (civi)∈ T(Span(S)) = T (V ) = Im(T ), Span(T (S))⊆ Im(T).
(2) T (S′) . v, v′∈ S′ v, v′
T (v) = T (v′), T (v− v′) = OW, v− v′∈ Ker(T). v− v′∈ Span(S′), v− v′∈ Span(S′)∩ Ker(T) = {OV} v = v′ . T (S′) .
T (S′) linearly dependent, v1, . . . , vn∈ S′ c1, ..., cn∈ F 0 c1T (v1) +··· + cnT (vn) = OW. T linear T (c1v1+··· + cnvn) = OW, c1v1+··· + cnvn∈ Ker(T). c1v1+··· + cnvn∈ Span(S′), Span(S′)∩ Ker(T) = {OV}, c1v1+··· + cnvn= OV. S′ linearly independent , T (S′) linearly independent.
Lemma 2.2.4 (1) T : V → W linear transformation, V finite dimensional F-space, Im(T ) finite dimensional F-space.
Question 2.8. T : V→ W linear transformation. V finite dimensional F-space, dim(Im(T ))≤ dim(V)? dim(W ) > dim(V ) T
?
V basis Im(T ) basis.
Theorem 2.2.5. T : V → W linear transformation. S0 Ker(T ) basis S0∪ S V basis, T (S) Im(T ) basis.
Proof. T (S) Im(T ) spanning set: S0∪ S V spanning set, Lemma 2.2.4 (1) T (S0∪S) Im(T ) spanning set. S0∈ Ker(T) T (S0) ={OW}.
T (S0∪ S) = T(S0)∪ T(S) = {OW} ∪ T(S), {OW} ⊆ Span(T(S) ( Corollary 1.3.4) Span(T (S)) = Span({OW} ∪ T(S)) = Span(T(S0∪ S)) = Im(T).
T (S) linearly independent: S0∪ S linearly independent S0 linearly independent, Corollary 1.4.4 S linearly independent Span(S)∩Ker(T) = Span(S)∩
Span(S0) ={OV}. Lemma 2.2.4 (2) T (S) linearly independent. , V finite dimensional vector space, V , Ker(T ) Im(T )
dimension .
Corollary 2.2.6 (Dimension Theorem). V finite dimensional F-space T : V → W linear transformation,
dim(V ) = dim(Ker(T )) + dim(Im(T )).
Proof. Theorem 1.5.8 Ker(T ) basis S0 ={v1, . . . , vm}, 再 Theorem 1.5.9 S ={vm+1, . . . , vn} S0∪ S = {v1, . . . , vm, vm+1, . . . , vn} V
basis. Theorem 2.2.5 {T(vm+1), . . . , T (vn)} Im(T ) basis, n− m = dim(Im(T)), dim(V ) = n = m + (n− m) = dim(Ker(T)) + dim(Im(T)).
V finite dimensional vector space T : V → W linear transformation, dim(Im(T )) the rank of T , dim(Ker(T )) the nullity of T . Dimension Theorem Rank Theorem: rank of T + nullity of T = dim(V ).
Question 2.9. T : V→ W linear transformation. V finite dimensional
F-space, dim(W ) < dim(V ) T ?
2.3. Isomorphism 29
2.3. Isomorphism
Linear transformation vector spaces . vector spaces linear transformation, vector spaces
, isomorphic. 探 isomorphism 性
.
Definition 2.3.1. T : V→ W linear transformation. T one-to-one and
onto, T isomorphism. V W isomorphic V ≃ W .
Proposition 2.2.3 T : V → W isomorphism Im(T ) = W and
Ker(T ) ={OV}. T isomorphism , S V basis, T one-to-
one T (S) ( v, v′ ∈ S v̸= v′, T (v)̸= T(v′)), 再 Lemma
2.2.4 T (S) W basis. , T (S) T (S) W
basis, Span(T (S)) = W , Im(T ) = W . , v∈ Ker(T), S V basis, v1, . . . , vn∈ S , c1, . . . , cn∈ F v = c1v1+··· + cnvn. OW = T (c1v1+···+cnvn) = c1T (v1) +···+cn(T vn). T (S) basis T (v1), . . . , T (vn)∈ T(S) c1, . . . , cn 0, v = OV, Ker(T ) ={OV}. , . Proposition 2.3.2. T : V→ W linear transformation S V basis.
T isomorphism T (S) T (S) W basis.
Question 2.10. Proposition 2.3.2 T (S) ?
V finite dimensional vector space , .
Corollary 2.3.3. V,W F-spaces V finite dimensional F-space. V ≃ W dim(V ) = dim(W ).
Proof. V≃ W isomorphism T : V → W, Proposition 2.3.2 W finite dimensional F-space dim(W ) = dim(V ). , W finite dimensional F-space dim(W ) = dim(V ) = n, V basis{v1, . . . , vn} W basis{w1, . . . , wn},
Theorem 2.1.5 linear transformation T : V → W T (vi) = wi, ∀i ∈ {1,...,n}. {T(v1) . . . , T (vn)} = {w1, . . . , wn} W basis, Proposition 2.3.2
T isomorphism, V ≃ W.
Corollary 2.3.3 finite dimensional vector spaces isomorphic
, dimension . isomorphism
, finite dimension dimension .
, infinite dimensional vector space,
linear transformation 性 isomorphism vector spaces
, finite dimensional , dimension
( 大 dimension 性).
數 f , 數 f◦−1 , f linear transformation 數 f◦−1 linear transformation?
. , preimage , f◦−1 f
數.
Proposition 2.3.4. T : V → W isomorphism, T inverse ( 數) T◦−1: W→ V isomorphism.
Proof. T one-to-one and onto, inverse T◦−1 one-to-one and onto.
T◦−1 W V linear transformation . w, w′∈ W, T isomorphism v, v′ ∈ V T (v) = w T (v′) = w′. inverse T◦−1(w) = v T◦−1(w′) = v′. r∈ F, T◦−1 linear transformation,
T◦−1(rw + w′) = rT◦−1(w) + T◦−1(w′) = rv + v′. T linear, T (rv + v′) = rT (v) + T (v′) = rw + w′. 再 inverse T◦−1(rw + w′) = rv + v′, T◦−1: W→ V
linear transformation, isomorphism.
Question 2.11. Vector spaces isomorphic equivalent relation?
Question 2.12. V finite dimensional vector space, Theorem 2.1.5 Proposition 2.3.4 ?
大 學 代數 Isomorphism Theorems.
linear transformation linear transformation . T : V → W linear transformation U Ker(T ) subspace, T : V /U→ Im(T) T (v) = T (v),∀v ∈V/U. T well-defined function.
, v1= v2 in V /U, T (v1) = T (v2). v1= v2, v1− v2∈ U ⊆ Ker(T), T (v1− v2) = OW, T (v1) = T (v1) = T (v2) = T (v2). , v1, v2∈ V/U r∈ F,
T (rv1+ v2) = T (rv1+ v2) = T (rv1+ v2) = rT (v1) + T (v2) = rT (v1) + T (v2), T linear transformation.
Theorem 2.3.5. T : V→ W linear transformation U Ker(T ) sub- space, 數 T : V /U→ Im(T) T (v) = T (v),∀v ∈ V/U linear transformation
Ker(T ) = Ker(T )/U Im(T ) = Im(T ).
Proof. 前 , T linear transformation. v∈ Ker(T), OW = T (v) = T (v), v∈ Ker(T), v∈ Ker(T)/U. , v∈ Ker(T)/U, v∈ Ker(T), T (v) = T (v) = OW, v∈ Ker(T). Ker(T ) = Ker(T )/U . ,
w∈ Im(T) v∈ V/U w = T (v) = T (v) w∈ Im(T).
Im(T ) = Im(T ).
U = Ker(T ), .
2.3. Isomorphism 31
Corollary 2.3.6 (The First Isomorphism Theorem). T : V→ W linear trans- formation T : V /Ker(T )→ Im(T) T (v) = T (v), T isomorphism,
V /Ker(T )≃ Im(T).
Proof. T : V /Ker(T )→ Im(T) linear transformation Ker(T ) = Ker(T )/Ker(T ) = {OV} Im(T ) = Im(T ), T isomorphism V /Ker(T )≃ Im(T). Question 2.13. V finite dimensional vector space, quotient space dimension 性 Dimension Theorem V /Ker(T )≃ Im(T) ?
Theorem 2.3.6 The First Isomorphism Theorem, Isomorphism Theorems.
Corollary 2.3.7 (The Second Isomorphism Theorem). V vector space U,W V subspaces.
(U +W )/U ≃ W/U ∩W.
Proof. U U + W subspace, (U + W )/U vector space.
T : W→ (U +W)/U T (w) = w,∀w ∈ W. T linear transformation.
Im(T ) = (U + W )/U Ker(T ) = U∩W, Corollary 2.3.6 (U +W )/U≃ W/U ∩W.
Im(T )⊆ (U +W)/U, Im(T )⊇ (U +W)/U. v∈ (U +W)/U,
u∈ U,w ∈ W v = u + w. T (u) = u, u = v.
v− (u + w) ∈ W ( v = u + w) w∈ W, v− u = v − (u + w) + w ∈ W, v = u = T (u)∈ Im(T). Im(T ) = (U +W )/U .
u∈ Ker(T), T U , u∈ U. (U +W )/U
O, O V , O = T (u) = u. u = u−O ∈ W, u∈ U ∩W,
Ker(T )⊆ U ∩W. , u∈ U ∩W u∈ W, u = O. T (u) = u = O, u∈ Ker(T),
Ker(T ) = U∩W.
, linear transformation the First
Isomorphism Theorem, isomorphic 性 .
Corollary 2.3.8 (The Third Isomorphism Theorem). V vector space U,W V subspaces U⊆ W.
(V /U )/(W /U )≃ V/W.
Proof. , U⊆ W ⊆ V vector spaces, V /U V /W vector
spaces. T : V → V/W, T (v) = v, ∀v ∈ V. Ker(T ) = W
Im(T ) = V /W . U ⊆ Ker(T) = W, Theorem 2.3.5, T : V /U → V/W
linear transformation, Im(T ) = Im(T ) = V /W Ker(T ) = Ker(T )/U = W /U .
Corollary 2.3.6 (V /U )/Ker(T )≃ Im(T), (V /U )/(W /U )≃ V/W. Question 2.14. V finite dimensional vector space, dimension the Second and Third Isomorphism Theorems ?
Question 2.15. V finite dimensional vector space U,W V subspaces U⊆ W ⊆ V. dim(V /U ) = dim(V )− dim(U),dim(V/W) = dim(V) − dim(W) dim(W /U ) = dim(W )− dim(U). dim(V /U )− dim(V/W) = dim(W/U),
(V /U )/(V /W )≃ W/U?
2.4. The Matrix Connection
vector space V , basis , V basis
, V . , linear
transformation, vector space basis, .
linear transformation matrix . 大 前 over R over C
matrix. matrix 性 , over field ,
大 性 , 再 .
V finite dimensional vector space V basis{v1, . . . , vn},
vi , β = (v1, . . . , vn) basis, V
ordered basis. , basis , ordered basis,
, , ordered basis.
β = (v1, . . . , vn),β′= (v′1, . . . , v′n) V ordered bases, β = β′ vi= v′i,
∀i = 1,...,n.
dim(V ) = n, V ordered basisβ , V Fn
linear transformationτβ : V→ Fn, v∈ V, β v v = c1v1+···+cnvn,
τβ(v) =
c1
... cn
.
Fn column vector, (c1, . . . , cn)t (
row vector (c1, . . . , cn) ). Fn column vector 性 ,
. β ordered basis, τβ well-defined,
isomorphism. 言 , V , τβ Fn
column vector. Fn column vector, τβ◦−1 V
. ordered basis , ordered basis
V Fn column vector vector space .
, V Fn τβ(v) (
2.4. The Matrix Connection 33
), Fn column vector (c1, . . . , cn)t V τβ◦−1((c1, . . . , cn)t) , c1v1+··· + cnvn.
Example 2.4.1. P2(R) = {ax2+ bx + c| a,b,c ∈ R} R-space,
ordered basis β = (x2, x + 1,−1). ax2+ bx + c = a(x2) + b(x + 1) + (b− c)(−1), τβ(ax2+ bx + c) = (a, b, b− c)t. τβ(x2+ x + 1) = (1, 1, 0)t,
τβ◦−1((1, 1, 0)t) = 1(x2) + 1(x + 1) + 0(−1) = x2+ x + 1.
P1(R) = {ax + b | a,b ∈ R} R-space, ordered basis β′= (x− 1,x + 1). ax + b = r(x− 1) + s(x + 1), r = (a− b)/2,s = (a + b)/2, τβ′(ax + b) = ((a− b)/2,(a + b)/2)t.
Question 2.16. Example 2.4.1 β,β′ β = (−1,x + 1,x2),β′= (x + 1, x− 1), τβ(ax2+ bx + c),τβ′(ax + b) ?
linear transformation T : V → W, V,W ordered basis β = (v1, . . . , vn),β′= (w1, . . . , wm). β,β′, T over F m×n (m row,
n column) . column : i column
τβ′(T (vi)). T (vi) β′ ordered basis T (vi) = c1w1+···+cmwm,
i-th column
c1
... cm
. T β,β′ , β′[T ]β
,
β′[T ]β=
(τβ′(T (v1)), . . . ,τβ′(T (vn)) )
,
τβ′(T (vi))∈ Fm,∀i = 1,...,n m×1 column vector, β′[T ]β m× n over F matrix.
Example 2.4.2. Example 2.4.1, P2(R) ordered basisβ = (x2, x + 1,−1), P1(R) ordered basisβ′= (x− 1,x + 1). T : P2(R) → P1(R)
T (ax2+ bx + c) = 2ax + b,
T linear transformation. dim(P1(R)) = 2, dim(P2(R)) = 3
β′[T ]β 2× 3 matrix. T (x2) = 2x, T (x + 1) = 1, T (−1) = 0, Example 2.4.1
τβ′(T (x2)) = ( 1
1 )
,τβ′(T (x + 1)) = ( −1
21 2
)
,τβ′(T (−1)) = ( 0
0 )
,
β′[T ]β =
( 1 −12 0 1 12 0
) .
Question 2.17. Example 2.4.2 β,β′ β = (−1,x + 1,x2),β′= (x + 1, x− 1),
β′[T ]β ?
β′[T ]β ? the representative matrix of T with respect to
β,β′. β′[T ]β 代 T linear transformation. ,
m× n over F matrix A, Fn Fm 數 mA: Fn→ Fm,
Fn column vector x A m× n matrix, A· x Fm
column vector, mA(x) = A· x. 性 A· (rx + x′) = rA· x + A · x′,
mA: Fn→ Fm linear transformation. β′[T ]β, Fn
Fm linear transformation mβ′[T ]β : Fn→ Fm, T : V → W , :
V T -
W
v - T (v)
τβ(v)
? - β′[T ]β·τβ(v) 6
Fn τβ
?
mβ′[T ]β
- Fm τβ◦−1′
6
v∈ V τβ Fn column vector τβ(v), τβ(v)
m× n matrixβ′[T ]β, β′[T ]β·τβ(v) Fm column vector.
τβ′: W → Fm 數 τβ◦−1′ : Fm→ W β′[T ]β·τβ(v) W τβ◦−1′ (β′[T ]β·τβ(v)).
T (v). , T τβ◦−1′ ◦ mβ′[T ]β◦τβ 數,
, T (v) , .
Example 2.4.3. matmul Examples 2.4.1 2.4.2,
T (ax2+ bx + c) = 2ax + b. P2(R) ax2+ bx + c R3 τβ(ax2+ bx + c) = (a, b, b− c)t, 再 β′[T ]β
( 1 −12 0 1 12 0
)
·
a
b b− c
=(
a−12b a +12b
) .
R2 P1(R) (a− (b/2))(x − 1) + (a + (b/2))(x + 1) = 2ax + b T (ax2+ bx + c) .
T =τβ◦−1′ ◦ mβ′[T ]β◦τβ 前, .
m× n matrix A, Fn column vector x, A· x Fm column vector.
, A1, . . . , An A 1 n column ( A n column
2.4. The Matrix Connection 35
column Fm column vector), x = (x1, . . . , xn)t, A· x = x1A1+··· + xnAn.
T τβ◦−1′ ◦ mβ′[T ]β◦τβ V→ W linear transformation, Theorem 2.1.5,
, β basis vi, 代 .
τβ(vi) = (0, . . . , 1, . . . , 0)t, (0, . . . , 1, . . . , 0) i 1
0. 前 β′[T ]β·τβ(vi) =β′[T ]β· (0,...,1,...,0)t β′[T ]β i column, 前 column τβ′(T (vi)),
τβ◦−1′ ◦ mβ′[T ]β◦τβ(vi) =τβ◦−1′ (β′[T ]β·τβ(vi)) =τβ◦−1′ (τβ′(T (vi))) = T (vi),∀i = 1,...,n
T =τβ◦−1′ ◦ mβ′[T ]β◦τβ. (2.1)
V,W vector spaces, V W linear transformation
vector space, L (V,W) . Mm×n(F) over F m×n matrices.
性 , Mm×n(F) vector space. V ordered basis
β = (v1, . . . , vn) W ordered basis β′= (w1, . . . , wm), 前 linear transformation
matrix , L (V,W) Mm×n(F) 數 Φ,
linear transformation T : V→ W β′[T ]β m×n matrix, Φ(T) = β′[T ]β,∀T ∈
L (V,W). Φ linear transformation, T1, T2∈ L (V,W)
r∈ F, Φ(rT1+ T2) =β′[rT1+ T2]β rΦ(T1) +Φ(T2) = r(β′[T1]β) +β′[T2]β .
, β′[rT1+ T2]β i-th column τβ′((rT1+ T2)(vi)) =τβ′(rT1(vi) + T2(vi)), τβ′ linear, rτβ′(T1(vi)) +τβ′(T2(vi)). β′[T1]β,β′[T2]β i-th column
τβ′(T1(vi)),τβ′(T2(vi)), 數 r(β′[T1]β) +β′[T2]β i-th column rτβ′(T1(vi)) +τβ′(T2(vi)). β′[rT1+ T2]β r(β′[T1]β) +β′[T2]β , Φ linear transformation.
Φ : L (V,W) → Mm×n(F) isomorphism ( one-to-one and onto).
A∈ Mm×n(F), A i-th column Ai, τβ◦−1′ (Ai)∈ W. Theorem 2.1.5 linear transformation T : V → W T (vi) =τβ◦−1′ (Ai),∀i = 1,...,n. ,
β′[T ]β i-th row
τβ′(T (vi)) =τβ′(τβ◦−1′ (Ai)) = Ai,
β′[T ]β= A. T L (V,W) Φ(T) =β′[T ]β= A linear transformation,
Φ isomorphism. .
Theorem 2.4.4. V,W vector spaces dim(V ) = n, dim(W ) = m. V,W ordered basis β,β′. Φ : L (V,W) → Mm×n(F) Φ(T) =β′[T ]β,∀T ∈ L (V,W), Φ
isomorphism,
L (V,W) ≃ Mm×n(F).
Question 2.18. dim(V ) = n, dim(W ) = m, Theorem 2.4.4 dim(L (V,W)) = dim(Mm×n(F)) = mn, Mm×n(F) , L(V,W ) basis?
Question 2.19. A∈ Mm×n(F). mA : Fn→ Fm mA(x) = A· x,∀x ∈ Fn. Im(mA) ={A · x ∈ Fm| x ∈ Fn} A column space, C(A) , dim(C(A)) the rank of A. Ker(mA) ={x ∈ Fn| A · x = O} A null space, N(A) , dim(N(A)) the nullity of A. T : V→ W linear transformation Φ(T) = A, τβ,τβ′ isomorphism, Ker(T )≃ N(A) Im(T )≃ C(A).
rank of A + nullity of A = n?
前 linear transformation T matrix β′[T ]β .
V T -
W
Fn τβ
? τβ◦−1 6
mβ′[T ]β
- Fm τβ′
? τβ◦−1′
6
T =τβ◦−1′ ◦ mβ′[T ]β◦τβ, commutative diagram.
Commutative diagram , , 數
. V W : T ; V τβ Fn,
再 mβ′[T ]β Fm, τβ◦−1′ W . commutative diagram
T =τβ◦−1′ ◦ mβ′[T ]β◦τβ. 性, Fm W τβ◦−1′
isomorphism W Fm , 數 τβ′. V Fm
: T V W , 再 τβ′ Fm; τβ V Fn,
再 mβ′[T ]β Fm. τβ′◦ T = mβ′[T ]β◦τβ.
τβ′◦ T =τβ′◦ (τβ◦−1′ ◦ mβ′[T ]β◦τβ) = (τβ′◦τβ◦−1′ )◦ mβ′[T ]β◦τβ= m
β′[T ]β◦τβ,
commutative diagram 數 .
V Fn , T V W τβ′
Fm Fm Fn ( β′[T ]β invertible).
Question 2.20. Fn Fm ? 代 數 ?
commutative diagram 數 . V,W,U
vector spaces, dim(V ) = n, dim(W ) = m, dim(U ) = q β,β′β′′ ordered bases. T1: V → W, T2: V → W linear transformations commutative