이 포스트에서 V,W는 모두 F-벡터공간으로 취급한다.
Inverse of a matrix
Definition 1. Let A∈Mn×n(F). Then A is invertible if ∃B∈Mn×n(F) such that AB=BA=In. The matrix B is called the inverse of A and is denoted by A−1.
Isomorphism
Definition 2. We say that V and W are isomorphic, denoted V≅W, if ∃T∈L(V,W) such that T is invertible. Such T is called an isomorphism from V onto W.
벡터공간 V와 W 사이에 전단사 선형 변환 T가 존재한다는 것은 두 공간의 벡터 사이에 어떤 대응이 존재한다는 뜻이고, 연산이 보존된다는 말과 같다. 따라서 두 공간은 수학적으로 동일한 성질을 가지는 것으로 간주할 수 있고, 이때 두 공간은 isomorphic하다고 부른다.
Theorem 1
Theorem 1. Let T∈L(V,W) be an isomorphism. Then T−1:W→V is linear.
Proof. Since T is invertible, T is surjective. Then for x,y∈V, ∃u,v∈W such that T(x)=u,T(y)=v⟺T−1(u)=x,T−1(v)=y. For a scalar c, cT(x)+T(y)=T(cx+y)=cu+v⟺T−1(cu+v)=cx+y=cT−1(u)+T−1(v). Hence T−1 is linear. ◼
두 공간이 isomorphic하면 isomorphism을 통해 두 공간 사이의 많은 수학적 대상들이 보존된다. 지금부터 보존하는 대상들을 하나씩 살펴보자.
Theorem 2
Theorem 2. V≅W ⟺ dim(V) = dim(W).
Proof. Let T be an isomorphism from V onto W. Then rank(T) = dim(W) = dim(V). by Theorem 2. ◼
Theorem 3
Theorem 3. Let T∈L(V,W) and let β,γ be finite ordered bases for V,W, respectively. Then T is invertible ⟺ [T]γβ is invertible. Furthermore, [T−1]βγ=([T]γβ)−1.
Proof.
(⟹)
[T]γβ[T−1]βγ=[TT−1]γ=[IW]γ=I. Similarlly, [T−1]βγ[T]γβ=I. Hence [T]γβ is invertible, and [T−1]βγ=([T]γβ)−1.
(⟸)
Since [T]γβ is invertible, ∃ a matrix A such that A[T]γβ=I, where A=([T]γβ)−1.
Suppose that T(x)=T(y) for x,y∈V. Then we have A[T]γβ[x]β=I[x]β=[IV]β[x]β=[x]β. On the other hand, A[T]γβ[x]β=A[T(x)]γ=A[T(y)]γ=A[T]γβ[y]β=[y]β. Thus [x]β=[y]β⟺x=y, i.e., T is injective.
Since [T]γβ is invertible, it is square. This means that β and γ contain the same number of vectors. Thus T is surjective. Hence T is bijective. ◼
Corollary 1. Let A∈Mn×n(F). Then A is invertible ⟺ LA is invertible. Furthermore, (LA)−1=LA−1.
Theorem 4
Theorem 4. Let T∈L(V,W), and let β={v1,...,vn} be an ordered basis for V. Then T is an isomorphism ⟺ T(β) is a basis for W.
Proof.
(⟹) Note that T(β) generates R(T)=W. Suppose that ∑ni=1aiT(vi)=0 for ai∈F(i=1,...,n). Then we have T(∑ni=1aivi)=0. Note that T is injective, so N(T)={0}. Thus ∑ni=1aivi=0⟹ai=0(i=1,...,n). Hence T(β) is a basis for W.
(⟸) Suppose that T(x)=T(y) for x,y∈V. Let denote x=∑aivi and y=∑bivi for ai,bi∈F. Then we have ∑aiT(vi)=biT(vi)⟹∑(ai−bi)T(vi)=0⟹ai=bi for all i. Thus x=y, so T is injective.
∀y∈W, let denote y=∑ciT(vi) for ci∈F. Then y=T(∑aivi). Thus y∈R(T). Since R(T)⊆W, R(T)=W, so T is surjective. This means that T is bijective, i.e., an isomorphism. ◼
Theorem 5
Theorem 5. Let T∈L(V,W) be an isomorphism, and let V0≤V. Then
(1) T(V0)≤W,
(2) dim(V0) = dim(T(V0)).
Proof.
(1) Let x,y∈T(V0). Then ∃a,b∈V0 such that T(a)=x,T(b)=y
⟹cx+y=cT(a)+T(b)=T(ca+b)∈T(V0). Thus T(V0)≤W.
(2) Define T′:V0⟶T(V0) by T′(v)=T(v),∀v∈V0. Then cleary T′ is an isomorphism. Thus dim(V0) = dim(T(V0)) by Theorem 2. ◼
이처럼 T가 isomorphism이면, T는 두 공간 사이의 차원(Theorem 2), 기저(Theorem 4), 부분공간(Theorem 5)을 보존한다는 사실을 알 수 있다.
Reference is here: https://product.kyobobook.co.kr/detail/S000003155051
Linear Algebra | Stephen Friedberg - 교보문고
Linear Algebra | For courses in Advanced Linear Algebra. This top-selling, theorem-proof text presents a careful treatment of the principle topics of linear algebra, and illustrates the power of the subject through a variety of applications. It emphasizes
product.kyobobook.co.kr