행렬의 adjoint는 원 행렬의 켤레 전치로 정의되었다. 유사하게 선형 변환의 adjoint를 정의하려고 한다. 어떤 선형 변환 TT에 대해 ([T]γβ)∗=[U]βγ([T]γβ)∗=[U]βγ를 만족하는 선형 변환 UU를 찾고, 그 UU를 TT의 adjoint라고 정의하는 것이 자연스러울 것이다.
Adjoint of Linear Transformation
Definition 1. Let T∈L(V,W)T∈L(V,W) where VV and WW are finite-dimensional inner product space with inner products ⟨⋅,⋅⟩1⟨⋅,⋅⟩1 and ⟨⋅,⋅⟩2⟨⋅,⋅⟩2, respectively. A function T∗:W⟶VT∗:W⟶V is called an adjoint of TT if ⟨T(x),y⟩2=⟨x,T∗(y)⟩1,∀x∈V,∀y∈W⟨T(x),y⟩2=⟨x,T∗(y)⟩1,∀x∈V,∀y∈W.
Theorem 1
Theorem 1. Let g∈V∗g∈V∗ where VV is a finite-dimensional inner product space over FF. Then !∃y∈V!∃y∈V such that g(x)=⟨x,y⟩,∀x∈Vg(x)=⟨x,y⟩,∀x∈V.
Proof. Let β={v1,...,vn}β={v1,...,vn} be an orthonormal basis for VV. Then define y=n∑i=1¯g(vi)vi.y=n∑i=1¯¯¯¯¯¯¯¯¯¯¯g(vi)vi. Then we have x=n∑i=1⟨x,vi⟩vix=n∑i=1⟨x,vi⟩vi and g(x)=g(n∑i=1⟨x,vi⟩vi)=n∑i=1⟨x,vi⟩g(vi)=⟨x,n∑i=1¯g(vi)vi⟩=⟨x,y⟩.g(x)=g(n∑i=1⟨x,vi⟩vi)=n∑i=1⟨x,vi⟩g(vi)=⟨x,n∑i=1¯¯¯¯¯¯¯¯¯¯¯g(vi)vi⟩=⟨x,y⟩. If g(x)=⟨x,z⟩,∀x∈Vg(x)=⟨x,z⟩,∀x∈V, for some z∈Vz∈V, then g(x)=⟨x,z⟩=⟨x,y⟩,∀x∈Vg(x)=⟨x,z⟩=⟨x,y⟩,∀x∈V. Thus z=yz=y. ◼
Theorem 2
Theorem 2. Let T∈L(V,W) where V and W are finite-dimensional inner product space with inner products ⟨⋅,⋅⟩1 and ⟨⋅,⋅⟩2, respectively. Then there exists a unique adjoint T∗ of T, and T∈L(W,V).
Proof. Note that ⟨y,T∗(cx+z)⟩1=⟨T(y),cx+z⟩2 = ¯c⟨T(y),x⟩2+⟨T(y),z⟩2 = ¯c⟨y,T∗(x)⟩1+⟨y,T∗(z)⟩1 = ⟨y,cT∗(x)+T∗(z)⟩ for all x,z∈W,y∈V, and c∈F. Then T∗(cx+z)=cT∗(x)+T∗(z).
Fix y∈W. Define g(x)=⟨T(x),y⟩2,∀x∈V. Since g∈V∗, by Theorem 1, !∃y′∈V such that g(x)=⟨x,y′⟩1,∀x∈V.
Then by defining T∗(y)=y′,∀y∈W, we have ⟨T(x),y⟩2=⟨x,T∗(y)⟩1,∀x∈V. Then T∗ is an adjoint of T.
Suppose that ∃U∈L(W,V) such that ⟨T(x),y⟩2=⟨x,U(y)⟩1,∀x∈V,y∈W. Then ⟨x,U(y)⟩1=⟨x,T∗(y)⟩1,∀x∈V, so we have U(y)=T∗(y),∀y∈W. ◼
Note
Note. ⟨x,T(y)⟩2=¯⟨T(y),x⟩2=¯⟨y,T∗(x)⟩1=⟨T∗(x),y⟩1,∀x∈W,∀y∈V.
Theorem 3
Theorem 3. Let T∈L(V,W), and let β and γ be orthonormal bases for V and W, where V and W are finite-dimensional inner product space with inner products ⟨⋅,⋅⟩1 and ⟨⋅,⋅⟩2, respectively. Then [T∗]βγ=([T]γβ)∗.
Proof. Let [T∗]βγ=A and ([T]γβ)∗=B. Then Aij=⟨T∗(wj),vi⟩1=⟨wj,T(vi)⟩2=¯⟨T(vi),wj⟩=¯Bij, where β={v1,...,vn} and γ={w1,...,wm}. ◼
Corollary 1
Corollary. Let A∈Mm×n(F). Then LA∗=(LA)∗.
Proof. Note that [LA∗]βγ=A∗=([LA]γβ)∗=[(LA)∗]βγ, where β and γ are the standard ordered bases for Fn and Fm, respectively. Thus we have LA∗=(LA)∗. ◼
Theorem 4
Theorem 4. Let T,U∈L(V,W), and let P∈L(W,Z), where V,W and Z are finite-dimensional inner product space. Then
(a) (T+U)∗=T∗+U∗.
(b) (cT)∗=¯cT∗,∀c∈F.
(c) (PT)∗=T∗P∗.
(d) T∗∗=T.
(e) I∗=I.
Proof. Let ⟨⋅,⋅⟩1,⟨⋅,⋅⟩2 and ⟨⋅,⋅⟩3 be inner products of V,W and Z, respectively. For all x∈V,y∈W and z∈Z,
(a) Note that ⟨(T∗+U∗)(y),x⟩1=⟨T∗(y),x⟩1+⟨U∗(y),x⟩1=⟨y,T(x)⟩2+⟨y,U(x)⟩2=⟨y,T(x)+U(x)⟩2=⟨(T+U)∗(y),x⟩1. Thus (T+U)∗=T∗+U∗.
(b) Note that ⟨(¯cT∗)(y),x⟩1=¯c⟨y,T(x)⟩2=⟨y,cT(x)⟩2=⟨(cT)∗(y),x⟩1. Thus (cT)∗=¯cT∗.
(c) Note that ⟨(T∗P∗)(z),x⟩1=⟨P∗(z),T(x)⟩2=⟨z,PT(x)⟩3=⟨(PT)∗(z),x⟩1. Thus (PT)∗=T∗P∗.
(d) Note that ⟨T(x),y⟩2=⟨x,T∗(y)⟩1=⟨T∗∗(x),y⟩2. Thus T∗∗=T.
(e) Note that ||x||2=⟨x,x⟩1=⟨I(x),x⟩1=⟨x,I∗(x)⟩1. Then ⟨x,I(x)−I∗(x)⟩1=0 for all x∈V. Thus I∗=I. ◼
Theorem 5
Theorem 5. Let T∈L(V,W) where V and W are finite-dimensional inner product space. Then rank(T∗) = rank(T∗T) = rank(TT∗) = rank(T).
Proof. Let A=[T]γβ where β and γ are orthonormal bases for V and W. Then by Theorem 1, rank(T) = rank(A) and rank(T∗) = rank(A∗). Then by Theorem 2, the result is clear. ◼
Theorem 6
Theorem 6. Let T∈L(V,W) where V and W are finite-dimensional inner product spaces with inner products ⟨⋅,⋅⟩1 and ⟨⋅,⋅⟩2, respectively. Then R(T∗)⊥=N(T).
Proof. Note that ∀y∈R(T∗), ∃s∈V such that T∗(s)=y.
Then ∀x∈R(T∗)⊥, we have ⟨x,y⟩1=⟨x,T∗(s)⟩1=⟨T(x),s⟩2=0. Since we choose s arbitrarily, T(x)=0. Thus R(T∗)⊥⊆N(T).
∀z∈N(T), we have ⟨z,y⟩1=⟨z,T∗(s)⟩1=⟨T(z),s⟩2=0. Thus x∈R(T∗)⊥. Hence R(T∗)⊥=N(T). ◼
Theorem 7
Theorem 7. Let T∈L(V,W) where V and W are finite-dimensional inner product spaces. If T is invertible, then T∗ is invertible and (T∗)−1=(T−1)∗.
Proof. Let A=[T]γβ where β and γ are ordered bases for V and W, respectively. Then we have AA−1=A−1A=I. Note that (AA−1)∗=(A−1)∗A∗=I and (A−1A)∗=A∗(A−1)∗=I. Thus (A∗)−1=(A−1)∗ and T∗ is invertible.
Since A∗=[T∗]βγ and A−1=[T−1]βγ, we have [(T∗)−1]γβ=(A∗)−1=(A−1)∗=[(T−1)∗]γβ. Thus (T∗)−1=(T−1)∗. ◼