Linear Algebra Done Right
记录大致讲了什么
Book Edition 3
向量空间
我们定义向量空间
向量空间
向量空间定义在域F F F 上,要求支持:
加法
F F F 中数的数乘
加法单位元(0元)
加法逆元
加法交换结合
数乘结合
加法对数乘分配
对加法和数乘封闭
加粗部分用于判断子空间,根据F F F 区分是否是实向量空间/复向量空间
判定可以看上面
维数
向量空间还应该有维数.于是定义
线性无关组
Group v 1 … v n ∈ V is linear independet ⟺ ∀ { c n } , c i ∈ F , ∑ i = 1 n c i v i = 0 ⟺ ∀ i , c i = 0 \text{Group} v_1\ldots v_n \in V \text{is linear independet} \iff \\
\forall \{ c_n \} ,c_i \in F, \\
\sum _{i = 1} ^{n} c_iv_i = 0 \iff \forall i,c_i=0 Group v 1 … v n ∈ V is linear independet ⟺ ∀ { c n } , c i ∈ F , i = 1 ∑ n c i v i = 0 ⟺ ∀ i , c i = 0
张成,张成组
span ( v 1 … v n ) = { ∑ i = 1 n c i v i } \begin{gathered}
\operatorname{span}( v_1 \ldots v_n ) = \{ \sum _{i = 1} ^{n} c_iv_i \}
\end{gathered} span ( v 1 … v n ) = { i = 1 ∑ n c i v i }
张成V V V 的组简称张成组
则按照直觉的,维数应该是张成组长度的最小值,线性无关组长度的最大值,基的长度等等,下面讨论的是有限维线性空间 .
dim V \dim V dim V 是张成组最小长度
dim V \dim V dim V 是线性无关组组最大长度
dim V \dim V dim V 是任意一组基的长度
首先说明,对一个线性相关的组,我们一定可以去掉一个线性相关项保持张成空间不变(显然).
首先说明
任意一组线性无关组长度小于等于任意一组张成组长度:
Sol1
考虑一个线性无关组和一个张成组,将一个线性无关组的元素加入张成组,则形成的一定是线性相关组,删去一个张成组中的 元素则保持张成,不断重复这个操作,注意因为被加入的线性无关,所以你想相关一定得带张成组中的,于是可以一直操作.
直到线性无关组全部被加入,则因为每次删掉一个张成组元素,你一定有线性无关组长度不大于它.
Sol2
另一个是更常见的证法吧,就是直接用张成组去表示线性无关组的每个向量,列方程线性无关组的某个线性组合和为0 0 0 .
然后发现你列出的方程个数(张成组长度)若小于未知数个数(线性无关组长度),那么必有非零解,就证毕.
线性无关组可通过加元素扩展到基,张成组可通过删除元素到基
对线性无关组,每次加入一个不属于张成空间的,由于组的长度大小不断增加,而存在一个长度的基,所以你的过程会停止.
同理对张成组每次删掉一个线性相关项不影响张成空间.
每组基的长度都相当,具有恰当长度的线性无关组/张成组是基.
第一句用小于等于关系,后面两个通过基的长度相等+上一条可以变成基说明.
维数
维数就是这个长度为 dim V \dim V dim V
空间的运算
空间的和
U + V = { u + v ∣ u ∈ U , v ∈ V } \begin{gathered}
U+V = \{ u+v \vert u\in U,v\in V \}
\end{gathered} U + V = { u + v ∣ u ∈ U , v ∈ V }
加法实际上是并(包含子空间所有向量的最小空间).
并定义直和.
空间直和
W = U ⊕ V = U + V s . t . ∀ w ∈ W , ∃ ! u ∈ U , v ∈ V , u + v = w \begin{gathered}
W = U\oplus V = U + V \\ s.t.\\
\forall w \in W, \exists! u\in U,v\in V, u+v=w
\end{gathered} W = U ⊕ V = U + V s . t . ∀ w ∈ W , ∃ ! u ∈ U , v ∈ V , u + v = w
直和相当于不交并,是对空间进行一种分解.
然后直和的判定容易证明只要0 0 0 的表示满足唯一性,并推出当且仅当它们的交只有0 0 0
空间的积
就是笛卡尔积.
U × V = { ( u , v ) ∣ u ∈ U , v ∈ V } \begin{gathered}
U\times V=\{ (u,v) \vert u\in U,v\in V \}
\end{gathered} U × V = {( u , v ) ∣ u ∈ U , v ∈ V }
其实也可以先扩展一下直和 是等价的.
仿射空间
u + V = { u + v ∣ u + V } ( u + V ) + ( w + V ) = ( u + w ) + V λ ( u + V ) = λ u + V \begin{gathered}
u+V=\{ u+v \vert u+V \} \\
(u+V)+(w+V)=(u+w) + V \\
\lambda (u+V) = \lambda u + V
\end{gathered} u + V = { u + v ∣ u + V } ( u + V ) + ( w + V ) = ( u + w ) + V λ ( u + V ) = λ u + V
注意如果u ∈ V u\in V u ∈ V 则不变,u ∉ V u\not\in V u ∈ V 则是一个没有0 0 0 的空间,在此空间的线性组合变成了∑ i = 0 n c i v i s . t . ∑ i = 0 n c i = 1 \sum _{i = 0} ^{n} c_iv_i\ s.t.\ \sum_{i=0}^n c_i=1 ∑ i = 0 n c i v i s . t . ∑ i = 0 n c i = 1 .
然后仿射空间关于以上运算是线性空间,其中0 = V 0=V 0 = V
空间的商
U / V = { u + V ∣ u ∈ U } \begin{gathered}
U/V={\left\{ u+V \vert u\in U \right\}}
\end{gathered} U / V = { u + V ∣ u ∈ U }
可以理解成等价类分类.如果两个向量的差在V V V 中则认为他们等价.新的空间中每个元素都是一个等价类.而你仿射空间的变换也可以看成是对代表元做变换.
最后考虑它们的维数,有:
dim U × V = dim U ⊕ V = dim U + dim V dim U + V = dim U + dim V − dim U ∩ V dim U / V = dim U − dim V \begin{gathered}
\dim U\times V=\dim U\oplus V=\dim U+\dim V \\
\dim U+V = \dim U+\dim V-\dim U\cap V \\
\dim U/V=\dim U-\dim V
\end{gathered} dim U × V = dim U ⊕ V = dim U + dim V dim U + V = dim U + dim V − dim U ∩ V dim U / V = dim U − dim V
第一行是显然的.
第二行考虑取U ∪ V U\cup V U ∪ V 的一组基,再其中添加上U − V U-V U − V 的基和V − U V-U V − U 的基.
第三行需要线性映射.
线性映射
线性映射基本性质
线性映射
线性映射是映射满足:
齐性: λ v = λ T v \lambda v=\lambda Tv λ v = λ T v
加性: T ( u + v ) = T u + T v T(u+v)=Tu+Tv T ( u + v ) = T u + T v
线性变换的运算
( S + T ) u = S u + T u ( λ T ) u = λ ( T u ) ( S T ) u = S ( T ( u ) ) \begin{gathered}
(S+T)u=Su+Tu \\
(\lambda T)u=\lambda (Tu) \\
(ST)u=S(T(u))
\end{gathered} ( S + T ) u = S u + T u ( λ T ) u = λ ( T u ) ( S T ) u = S ( T ( u ))
符合直觉的.于是你可以说明L ( U , V ) \mathcal{L}(U,V) L ( U , V ) (由T : U → V T:U\to V T : U → V 组成的集合)是 dim U × dim V \dim U\times \dim V dim U × dim V 维的线性空间,他的标准基可以是所有把U U U 的一个基映到V V V 的一个基的映射.
值域,零空间
for linear map T : U → V range T = { v ∣ v = T u , u ∈ U } null T = { u ∣ T u = 0 , u ∈ U } \begin{gathered}
\text{for linear map } T:U\to V \\
\operatorname{range} T = \{ v \vert v=Tu,u\in U \} \\
\operatorname{null} T = \{ u \vert Tu=0,u \in U \}
\end{gathered} for linear map T : U → V range T = { v ∣ v = T u , u ∈ U } null T = { u ∣ T u = 0 , u ∈ U }
dim U = dim null T + dim range T \begin{gathered}
\dim U=\dim \operatorname{null} T+\dim \operatorname{range} T
\end{gathered} dim U = dim null T + dim range T
考虑 null T \operatorname{null} T null T 的基u 1 … u n u_1\ldots u_n u 1 … u n ,并添加v 1 … v m v_1\ldots v_m v 1 … v m 扩充到U U U 的基.
考虑T v 1 … T v m Tv_1\ldots Tv_m T v 1 … T v m 若线性相关,∑ i = 1 m c i T v i = 0 ⟹ T ∑ i = 1 m c i v i = 0 \sum _{i = 1} ^{m} c_iTv_i=0 \implies T\sum _{i = 1} ^{m} c_iv_i=0 ∑ i = 1 m c i T v i = 0 ⟹ T ∑ i = 1 m c i v i = 0 ,则 w = ∑ i = 1 m c i v i ∈ null T , w = ∑ i = 1 m c i v i = ∑ i = 1 n d i u i w=\sum _{i = 1} ^{m} c_iv_i\in \operatorname{null} T,w=\sum _{i = 1} ^{m} c_iv_i=\sum _{i = 1} ^{n} d_iu_i w = ∑ i = 1 m c i v i ∈ null T , w = ∑ i = 1 m c i v i = ∑ i = 1 n d i u i ,与u i , v i u_i,v_i u i , v i 构成一组基矛盾.
于是T v i Tv_i T v i 线性无关,且容易注意到任意w ∈ U , T w = ∑ i = 1 n c i T u i + ∑ i = 1 m d i T v i = ∑ i = 1 m d i T v i ∈ span ( T v 1 … T V m ) w\in U,Tw=\sum_{i=1}^n c_iTu_i+\sum_{i=1}^m d_iTv_i=\sum_{i=1}^md_iTv_i\in \operatorname{span} (Tv_1\ldots TV_m) w ∈ U , T w = ∑ i = 1 n c i T u i + ∑ i = 1 m d i T v i = ∑ i = 1 m d i T v i ∈ span ( T v 1 … T V m ) 故得证.
单射,满射,双射,可逆
单射:T x ≠ T y ⟹ x ≠ y Tx\ne Ty \implies x\ne y T x = T y ⟹ x = y
满射: ∀ v ∈ V , ∃ u ∈ U , T u = v \forall v\in V,\exists u\in U, Tu=v ∀ v ∈ V , ∃ u ∈ U , T u = v
双射就是同时有两条
对于双射T T T 的定义T − 1 T^{-1} T − 1 满足T T − 1 = T − 1 T = I TT^{-1}=T^{-1}T=I T T − 1 = T − 1 T = I
基本性质
单射等价于只把0 0 0 映射到0 0 0 .
存在U → V U\to V U → V 单射说明 dim U ≤ dim V \dim U\le \dim V dim U ≤ dim V .
U → V U\to V U → V 有单射说明V → U V\to U V → U 有满射.
U → V U \to V U → V 存在双射称为U , V U,V U , V 同构,可以证明任意向量空间同构于某个F n F^n F n .
dim U / V = dim U − dim V \begin{gathered}
\dim U/V=\dim U-\dim V
\end{gathered} dim U / V = dim U − dim V
定义 T ∈ L ( U , U / V ) T\in \mathcal{L}( U , U/V ) T ∈ L ( U , U / V ) 为商变换,把u u u 映射到u + V u+V u + V .
则
null T = V range T = U / V \begin{gathered}
\operatorname{null} T=V \\
\operatorname{range} T=U/V
\end{gathered} null T = V range T = U / V
套用上面值域和零空间的维数公式即可.
线性映射的矩阵
矩阵
选取U , V U,V U , V 分别一组基u 1 … u m u_1\ldots u_m u 1 … u m ,v 1 … v n v_1\ldots v_n v 1 … v n ,可以把线性变换T T T 写成n × m n\times m n × m 的矩阵M ( T , u 1 … u m , v 1 … v n ) = A n × m \mathcal{M}(T,u_1\ldots u_m,v_1\ldots v_n)=A_{n\times m} M ( T , u 1 … u m , v 1 … v n ) = A n × m 满足
T u i = ∑ j = 1 n A j , i v j \begin{gathered}
Tu_i=\sum_{j=1}^n A_{j,i}v_j
\end{gathered} T u i = j = 1 ∑ n A j , i v j
即每一列是一个基向量在像空间中的基的表示.然后有的时候也直接简写M ( T ) \mathcal M(T) M ( T ) .
矩阵可以这么定义因为线性变换的线性保证了你可以只用基的变换去描述它,同时基的这种变换也能唯一确定线性变换.
于是可以定义矩阵运算:
M ( S ) M ( T ) = M ( S T ) M ( S ) + M ( T ) = M ( S T ) λ M ( T ) = M ( λ T ) \begin{gathered}
\mathcal M( S ) \mathcal M( T ) = \mathcal M( ST ) \\
\mathcal M( S ) + \mathcal M( T ) = \mathcal M( ST ) \\
\mathcal \lambda\mathcal M( T ) = \mathcal M( \lambda T )
\end{gathered} M ( S ) M ( T ) = M ( S T ) M ( S ) + M ( T ) = M ( S T ) λ M ( T ) = M ( λ T )
其中第一行矩阵乘法用坐标写一下可以推出经典的矩阵乘法方式.
算子,不变子空间,商算子和限制算子
这些概念会在本征值那里用到 但从属性上讲和这里线性映射关系更大.
算子
T ∈ L ( V , V ) \begin{gathered}
T\in \mathcal L( V , V )
\end{gathered} T ∈ L ( V , V )
即映射到自身空间的线性变换.
不变子空间
即对算子T T T ,有∀ u ∈ U , T u ∈ U \forall u\in U, Tu\in U ∀ u ∈ U , T u ∈ U ,则U U U 为不变子空间.
商算子,限制算子
T / U ∈ L ( V / U , V / U ) , ( T / U ) ( v + U ) = ( T v + U ) T ∣ U ∈ L ( U , U ) , T ∣ U v = T v \begin{gathered}
T_{/U}\in \mathcal L( V/U , V/U ),(T_{/U})(v+U)=(Tv+U) \\
T\vert_U \in \mathcal L( U , U ), T\vert_U v=Tv
\end{gathered} T / U ∈ L ( V / U , V / U ) , ( T / U ) ( v + U ) = ( T v + U ) T ∣ U ∈ L ( U , U ) , T ∣ U v = T v
显然T ∣ U T\vert_U T ∣ U 要求了U U U 是不变子空间.
把算子放到更小的空间去研究的方式.
p ( x ) ∈ P ⟹ range p ( T ) , null p ( T ) is invariant for T \begin{gathered}
p(x)\in \mathcal{P} \\
\implies
\operatorname{range} p(T),\operatorname{null} p(T)\text{ is invariant for } T
\end{gathered} p ( x ) ∈ P ⟹ range p ( T ) , null p ( T ) is invariant for T
u ∈ range p ( T ) ⟹ ∃ v , p ( T ) v = u T u = T p ( T ) v = p ( T ) T v ∈ range p ( T ) u ∈ null p ( T ) ⟹ p ( T ) u = 0 p ( T ) T u = T p ( T ) u = T 0 = 0 \begin{gathered}
u\in \operatorname{range} p(T) \\
\implies \exists v,p(T)v=u \\
Tu=Tp(T)v=p(T)Tv\in \operatorname{range} p(T) \\
u\in \operatorname{null} p(T) \\
\implies p(T)u=0 \\
p(T)Tu=Tp(T)u=T0=0
\end{gathered} u ∈ range p ( T ) ⟹ ∃ v , p ( T ) v = u T u = T p ( T ) v = p ( T ) T v ∈ range p ( T ) u ∈ null p ( T ) ⟹ p ( T ) u = 0 p ( T ) T u = T p ( T ) u = T 0 = 0
对偶
线性泛函,对偶空间
线性泛函就是f ∈ L ( V , F ) f \in \mathcal L( V , F ) f ∈ L ( V , F ) ,所有这样的f f f 组成线线性空间V ′ V' V ′ 是V V V 的对偶空间.
线性泛函可以看成是向量/点的对偶.线性泛函 { φ ∣ φ i e j = [ i = j ] } \{ \varphi \vert \varphi_i e_j=[i=j] \} { φ ∣ φ i e j = [ i = j ]} 构成对偶空间的基.
对偶映射
若 T ∈ L ( U , V ) T\in\mathcal L( U , V ) T ∈ L ( U , V ) ,定义 T ′ ∈ L ( V ′ , U ′ ) T'\in \mathcal L( V' , U' ) T ′ ∈ L ( V ′ , U ′ ) 满足
∀ f ∈ V ′ , T ′ f = f T \begin{gathered}
\forall f \in V',T'f=fT
\end{gathered} ∀ f ∈ V ′ , T ′ f = f T
T ′ T' T ′ 是反的可以理解因为V ′ V' V ′ 的泛函的输入才是T T T 的输出.导致没法根据这几个东西定义一个正的出来.
然后对偶主要解释了:M ( T ′ ) = M ( T ) T \mathcal M( T' ) =\mathcal M( T )^{T} M ( T ′ ) = M ( T ) T (右上角的T T T 是转置的意思).
对偶映射的运算
( S T ) ′ = T ′ S ′ ( S + T ) ′ = S ′ + T ′ ( λ S ) ′ = λ S ′ \begin{gathered}
(ST)'=T'S' \\
(S+T)'=S'+T' \\
(\lambda S)'=\lambda S'
\end{gathered} ( S T ) ′ = T ′ S ′ ( S + T ) ′ = S ′ + T ′ ( λ S ) ′ = λ S ′
( S T ) ′ f = f S T = T ′ ( f S ) = T ′ ( S ′ f ) ( S + T ) ′ f = f ( S + T ) = f S + f T = S ′ f + T ′ f ( λ S ) ′ f = f λ S = λ f S = S ′ f \begin{gathered}
(ST)'f=fST=T'(fS)=T'(S'f) \\
(S+T)'f=f(S+T)=fS+fT=S'f+T'f \\
(\lambda S)'f=f\lambda S=\lambda fS=S'f \\
\end{gathered} ( S T ) ′ f = f S T = T ′ ( f S ) = T ′ ( S ′ f ) ( S + T ) ′ f = f ( S + T ) = f S + f T = S ′ f + T ′ f ( λ S ) ′ f = f λ S = λ f S = S ′ f
零化子
对线性空间V V V 来说,子空间U U U 的零化子 U 0 = { f ∣ f ∈ V ′ , ∀ u ∈ U , f u = 0 } U^0=\{ f \vert f\in V',\forall u\in U,fu=0 \} U 0 = { f ∣ f ∈ V ′ , ∀ u ∈ U , f u = 0 } .
注意U 0 U^0 U 0 同时依赖U U U 和V V V .
dim U + dim U 0 = dim V \begin{gathered}
\dim U+\dim U^0=\dim V
\end{gathered} dim U + dim U 0 = dim V
取U U U 的基u 1 … u n u_1\ldots u_n u 1 … u n 扩充到V V V 的基u 1 … u n , u n + 1 … u n + m u_1\ldots u_n,u_{n+1}\ldots u_{n+m} u 1 … u n , u n + 1 … u n + m .并取V ′ V' V ′ 的标准基φ i u j = [ i = j ] \varphi_i u_j =[i=j] φ i u j = [ i = j ] ,则显然f ∈ U 0 f\in U^0 f ∈ U 0 要求f f f 不能有φ i , i < n \varphi_i,i<n φ i , i < n 的分量,而任意i > n i>n i > n 的分量都可以有.于是得证.
null T ′ = ( range T ) 0 range T ′ = ( null T ) 0 \begin{gathered}
\operatorname{null} T'=(\operatorname{range} T)^0 \\
\operatorname{range} T'=(\operatorname{null} T)^0
\end{gathered} null T ′ = ( range T ) 0 range T ′ = ( null T ) 0
考虑T ′ f u = f T u = 0 T'fu=fTu=0 T ′ f u = f T u = 0 关于所有u u u 成立,则f f f 的范围是什么.看右侧显然是 ( range T ) 0 (\operatorname{range} T)^0 ( range T ) 0 看左侧则是 ( null T ′ ) 0 (\operatorname{null} T')^0 ( null T ′ ) 0 .于是得证.
对第二行,左边是任意T ′ g = g T T'g=gT T ′ g = g T ,右边说你这个线性泛函把所有T u = 0 Tu=0 T u = 0 的映到0 0 0 ,恰好是左边的g T gT g T 满足条件.于是得证.
然后还有一个问题是我们以为T ′ ′ = T T''=T T ′′ = T ,但实际上你甚至不能保证V V V 和V ′ ′ V'' V ′′ 是相同的.然后有个典范同构的概念形容他俩的关系就是存在一种不依赖于基的选取的同构(只要定义T ( u ) f = f u T(u)f=fu T ( u ) f = f u ,则u u u 到T ( u ) T(u) T ( u ) 是双射.)
本征值基础
本征值
本征值,本征向量
若对算子T T T ,∃ v ≠ 0 ∈ V , λ ∈ F s . t . T v = λ v \exists v\ne 0\in V,\lambda\in F\ s.t.\ Tv=\lambda v ∃ v = 0 ∈ V , λ ∈ F s . t . T v = λ v ,则λ , v \lambda,v λ , v 分别为本征值,本征向量.
就是说算子在这个方向上对变换只有伸缩.
一个本征值可能对应多个线性不相关的本征向量,它们构成本征空间E ( λ , T ) E(\lambda,T) E ( λ , T )
λ \lambda λ 是 T T T 的本征值等价于 T − λ I T-\lambda I T − λ I 不是双射,或不是单射/满射
首先注意到对算子来说 单射,满射双射等价
又因为单射等价于 null T = 0 \operatorname{null} T=0 null T = 0 所以 ( T − λ I ) v = 0 (T-\lambda I)v=0 ( T − λ I ) v = 0 和它不是单射等价.
反证,你要利用不同本征值这个性质,于是你设 v n ∈ span ( v 1 … v n − 1 ) v_n \in \operatorname{span}( v_1\ldots v_{n-1} ) v n ∈ span ( v 1 … v n − 1 ) 且n n n 为满足条件对最小的.
v n = ∑ i = 1 n − 1 c i v i T v n = ∑ i = 1 n − 1 T c i v i λ n ( ∑ i = 1 n − 1 c i v i ) = ∑ i = 1 n − 1 λ i c i v i 0 = ∑ i = 1 n − 1 ( λ i − λ n ) c i v i \begin{gathered}
v_n=\sum _{i = 1} ^{n-1} c_iv_i \\
Tv_n=\sum _{i = 1} ^{n-1} Tc_iv_i \\
\lambda_n (\sum _{i = 1} ^{n-1} c_iv_i)=\sum _{i = 1} ^{n-1} \lambda_i c_iv_i \\
0=\sum _{i = 1} ^{n-1} (\lambda_i-\lambda_n) c_iv_i
\end{gathered} v n = i = 1 ∑ n − 1 c i v i T v n = i = 1 ∑ n − 1 T c i v i λ n ( i = 1 ∑ n − 1 c i v i ) = i = 1 ∑ n − 1 λ i c i v i 0 = i = 1 ∑ n − 1 ( λ i − λ n ) c i v i
因为n n n 是最小的,所以v 1 … v n − 1 v_1\ldots v_{n-1} v 1 … v n − 1 线性无关,然后你就推出矛盾.
有此容易说明本征值个数不大于线性空间维数.
考虑
v ∈ V , dim V = n v , T v , T 2 v … T n V is dependent ∑ i = 0 n c i T i v = 0 ⟹ 代数基本定理 ( ∏ i = 1 n ( T − λ i I ) ) v = 0 ⟹ ∃ i , T − λ i I = 0 ⟹ λ i is a eigenvalue of T \begin{gathered}
v\in V,\dim V=n \\
v,Tv,T^2v\ldots T^{n}V \text{ is dependent} \\
\sum _{i = 0} ^{n} c_iT^iv =0 \\
\stackrel{\text{代数基本定理}}{\Longrightarrow}
(\prod _{i = 1} ^{n} (T-\lambda_i I))v=0
\implies \exists i,T-\lambda_i I=0 \\
\implies \lambda_i \text{is a eigenvalue of } T \\
\end{gathered} v ∈ V , dim V = n v , T v , T 2 v … T n V is dependent i = 0 ∑ n c i T i v = 0 ⟹ 代数基本定理 ( i = 1 ∏ n ( T − λ i I )) v = 0 ⟹ ∃ i , T − λ i I = 0 ⟹ λ i is a eigenvalue of T
上三角矩阵
按照上面基的理解,有
M ( T , u 1 … u n ) is upper triangular matrix ⟺ ∀ i , T u i ∈ span ( u 1 … u i ) ⟺ ∀ i , span ( u 1 … u i ) is invariant space \begin{gathered}
\mathcal M( T,u_1\ldots u_n ) \text{is upper triangular matrix} \\
\iff \forall i, Tu_i\in \operatorname{span}( u_1\ldots u_i ) \\
\iff \forall i, \operatorname{span}( u_1\ldots u_i ) \text{is invariant space}
\end{gathered} M ( T , u 1 … u n ) is upper triangular matrix ⟺ ∀ i , T u i ∈ span ( u 1 … u i ) ⟺ ∀ i , span ( u 1 … u i ) is invariant space
那么考虑什么样的线性映射T T T 有一组基u 1 … u n u_1\ldots u_n u 1 … u n 有上三角矩阵A n × n A_{n\times n} A n × n .
∀ T ∈ L ( V , V ) , V is complex vector space ⟹ ∃ u 1 … u n , M ( T , u 1 … u n ) is upper triangular matrix \begin{gathered}
\forall T\in \mathcal L( V , V ), V \text{ is complex vector space} \\
\implies \exists u_1\ldots u_n,\mathcal M( T,u_1\ldots u_n ) \text{ is upper triangular matrix}
\end{gathered} ∀ T ∈ L ( V , V ) , V is complex vector space ⟹ ∃ u 1 … u n , M ( T , u 1 … u n ) is upper triangular matrix
Proof 1
归纳,假设对任意维数小于dim V \dim V dim V 的空间成立,考虑取T T T 的任意本征值λ \lambda λ ,则 U : = range T − λ I U:=\operatorname{range} T-\lambda I U := range T − λ I ,则因为T T T 不是单的所以 dim U < dim V \dim U<\dim V dim U < dim V .且 ∀ u ∈ U , T u = ( T − λ I ) u + λ u ∈ U \forall u \in U,Tu=(T-\lambda I)u+\lambda u\in U ∀ u ∈ U , T u = ( T − λ I ) u + λ u ∈ U ,所以T T T 在U U U 不变.
于是可以应用归纳结假设,T ∣ U T\vert_U T ∣ U 在U U U 上有一组基u 1 … u n u_1\ldots u_n u 1 … u n 使得 M ( T ∣ U , u 1 … u n ) \mathcal M( T\vert_U,u_1\ldots u_n ) M ( T ∣ U , u 1 … u n ) 是上三角矩阵.
将这组基扩展到V V V 上成为u 1 … u n , v 1 … v m u_1\ldots u_n,v_1\ldots v_m u 1 … u n , v 1 … v m ,则对∀ i \forall i ∀ i ,T v i = ( T − λ I ) v i + λ v i ∈ span ( u 1 … u n ) + span ( v i ) ⊂ span ( u 1 … u n , v 1 … v i ) Tv_i=(T-\lambda I)v_i+\lambda v_i\in \operatorname{span}( u_1\ldots u_n ) +\operatorname{span}( v_i )\subset \operatorname{span}( u_1\ldots u_n,v_1\ldots v_i ) T v i = ( T − λ I ) v i + λ v i ∈ span ( u 1 … u n ) + span ( v i ) ⊂ span ( u 1 … u n , v 1 … v i ) ,于是是上三角矩阵.
Proof 2
同样归纳,取任意本征向量 u , U : = span ( u ) u,U:=\operatorname{span}( u ) u , U := span ( u ) ,考虑T / U T_{/U} T / U 是维数为 dim V − 1 \dim V-1 dim V − 1 的空间V / U V/U V / U 上算子.则它有上三角矩阵.于是存在v 1 + U … v n + U v_1+U\ldots v_n+U v 1 + U … v n + U ,使得 ∀ v + U ∈ V / U , T / U ( v + U ) ∈ span ( v 1 + U , … , v n + U ) \forall v+U\in V/U,T_{/U}(v+U)\in \operatorname{span}( v_1+U,\ldots,v_n+U ) ∀ v + U ∈ V / U , T / U ( v + U ) ∈ span ( v 1 + U , … , v n + U ) ,也就有T v ∈ span ( v 1 , … , v n ) Tv\in \operatorname{span}( v_1,\ldots,v_n ) T v ∈ span ( v 1 , … , v n ) .
然后现在把v 1 … v n , u v_1\ldots v_n,u v 1 … v n , u 作为新的基,容易发现 T u = λ u ∈ span ( v 1 , … , v n , u ) Tu=\lambda u\in \operatorname{span}( v_1,\ldots,v_n,u ) T u = λ u ∈ span ( v 1 , … , v n , u ) 满足条件.于是存在上三角矩阵.
都要从维度归纳,第二个自然一点吧:商空间就是抹去若干维度.
[think] 但是第一个从T − λ I T-\lambda I T − λ I 的值域出发是什么个意思?主要利用两个性质:是不变子空间,以及T v = ( T − λ I ) v + λ v Tv=(T-\lambda I)v+\lambda v T v = ( T − λ I ) v + λ v .是不是相当于把其他向量也拆的"像"本征向量了.
upd:第一个思路我们其实也是抹去特征向量所在的维度,而对其他向量T − λ I T-\lambda I T − λ I 是双射,所以可以还原.
T T T 有逆等价于T T T 的上三角矩阵对角线全部非0 0 0
先假设矩阵有逆,设空间V V V 基为v 1 … v n v_1\ldots v_n v 1 … v n .
T v 1 = A 1 , 1 v 1 ⟹ A 1 , 1 ≠ 0 T v k = u + A k , k v k , u ∈ span ( v 1 … v k − 1 ) if A k , k = 0 T v k ∈ span ( v 1 … v k − 1 ) ∵ v 1 … v k − 1 is independent ∴ T v 1 … T v k − 1 is independent, so it is a base ∴ T v k ∈ span ( T v 1 … T v k − 1 ) ∃ c s . t . ∑ i = 1 k c i T v i = 0 ⟹ T − 1 ∑ i = 1 k c i v i = 0 contradiction! \begin{gathered}
Tv_1=A_{1,1}v_1 \implies A_{1,1}\ne 0 \\
Tv_k=u+A_{k,k}v_k,u\in \operatorname{span}( v_1\ldots v_{k-1} ) \\
\text{if } A_{k,k}= 0 \\
Tv_k\in \operatorname{span}( v_1\ldots v_{k-1} ) \\
\because v_1\ldots v_{k-1} \text{ is independent
} \\
\therefore Tv_1\ldots Tv_{k-1} \text{ is independent, so it is a base} \\
\therefore Tv_k \in \operatorname{span}( Tv_1\ldots Tv_{k-1} ) \\
\exists c \ s.t.\
\sum _{i = 1} ^{k} c_iTv_i=0 \\
\stackrel{T^{-1}}{\Longrightarrow}\sum _{i = 1} ^{k} c_iv_i=0 \\
\text{contradiction!}
\end{gathered} T v 1 = A 1 , 1 v 1 ⟹ A 1 , 1 = 0 T v k = u + A k , k v k , u ∈ span ( v 1 … v k − 1 ) if A k , k = 0 T v k ∈ span ( v 1 … v k − 1 ) ∵ v 1 … v k − 1 is independent ∴ T v 1 … T v k − 1 is independent, so it is a base ∴ T v k ∈ span ( T v 1 … T v k − 1 ) ∃ c s . t . i = 1 ∑ k c i T v i = 0 ⟹ T − 1 i = 1 ∑ k c i v i = 0 contradiction!
再假设T T T 关于V V V 的基v 1 … v n v_1\ldots v_n v 1 … v n 的矩阵为上三角矩阵且对角线元素非0 0 0 .
那么我们知道T v i = A i , i v i + ∑ j = 1 i − 1 c j T v j − 1 Tv_i=A_{i,i}v_i+\sum_{j=1}^{i-1}c_jTv_{j-1} T v i = A i , i v i + ∑ j = 1 i − 1 c j T v j − 1 ,其中后一项属于 span ( v 1 … v i − 1 ) \operatorname{span}( v_1\ldots v_{i-1} ) span ( v 1 … v i − 1 ) ,于是容易发现T v 1 … T v n Tv_1\ldots Tv_n T v 1 … T v n 线性独立,是一组基,于是T T T 是满的,于是T T T 可逆.
T T T 的某个基下的上三角矩阵对角线元素是T T T 的本征值.
考虑( T − λ I ) v = 0 (T-\lambda I)v=0 ( T − λ I ) v = 0 ,则λ \lambda λ 是本征值等价于T − λ I T-\lambda I T − λ I 不是单的,也就不是可逆的,即用上面条件对角线存在0 0 0 ,即λ \lambda λ 等于对角线上的某个元素.
对角矩阵
本征空间
E ( λ , T ) = null T − λ I \begin{gathered}
E(\lambda,T)=\operatorname{null} T-\lambda I
\end{gathered} E ( λ , T ) = null T − λ I
T T T 在基v 1 … v n v_1\ldots v_n v 1 … v n 下为对角矩阵等价于
v 1 … v n v_1\ldots v_n v 1 … v n 是T T T 的n n n 个本征向量.
⊕ i E ( λ i , T ) = V \oplus_i E(\lambda_i,T)=V ⊕ i E ( λ i , T ) = V
存在n n n 个一维不变子空间直和为V V V
内积空间
内积
内积
二元函数<x,y>:(V , V → F V,V\to F V , V → F )满足:
正性: < v , v > ≥ 0 <v,v>\ge 0 < v , v >≥ 0
定性: < v , v > = 0 ⟺ v = 0 <v,v>=0 \iff v=0 < v , v >= 0 ⟺ v = 0
第二个位置的线性:< u , v > <u,v> < u , v > 关于v v v 是线性的
共轭对称性:< u , v > = < v , u > ‾ <u,v>=\overline{<v,u>} < u , v >= < v , u >
内积< u , v > <u,v> < u , v > 关于u u u 也是线性的.
< u , 0 > = < 0 , u > = 0 <u,0>=<0,u>=0 < u , 0 >=< 0 , u >= 0
第一条用共轭对称性换到后面再换回来:
a < u 1 , v > + b < u 2 , v > = a < v , u 1 > ‾ + b < v , u 2 > ‾ = < v , a u 1 + b u 2 > ‾ = < a u 1 + b u 2 , v > \begin{gathered}
a<u_1,v>+b<u_2,v>=a \overline{ <v,u_1> } +b \overline{ <v,u_2> } \\
=\overline{ <v,au_1+bu_2> } \\
=<au_1+bu_2,v>
\end{gathered} a < u 1 , v > + b < u 2 , v >= a < v , u 1 > + b < v , u 2 > = < v , a u 1 + b u 2 > =< a u 1 + b u 2 , v >
第二条考虑线性映射0 0 0 映到0 0 0 .
范数
∣ ∣ v ∣ ∣ = < v , v > \vert\vert v \vert\vert = \sqrt{<v,v>} ∣∣ v ∣∣ = < v , v > 定义为向量的范数.
对实向量空间:
< u , v > = ∣ ∣ u + v ∣ ∣ 2 − ∣ ∣ u − v ∣ ∣ 2 4 \begin{gathered}
<u,v>=\dfrac{\vert\vert u+v \vert\vert ^2-\vert\vert u-v \vert\vert ^2}{4}
\end{gathered} < u , v >= 4 ∣∣ u + v ∣ ∣ 2 − ∣∣ u − v ∣ ∣ 2
对复向量空间:
< u , v > = ∣ ∣ u + v ∣ ∣ 2 − ∣ ∣ u − v ∣ ∣ 2 4 + ∣ ∣ u + i v ∣ ∣ 2 − ∣ ∣ u − i v ∣ ∣ 2 4 i \begin{gathered}
<u,v>=\dfrac{\vert\vert u+v \vert\vert ^2-\vert\vert u-v \vert\vert ^2}{4} + \dfrac{\vert\vert u+iv \vert\vert ^2-\vert\vert u-iv \vert\vert ^2}{4}i
\end{gathered} < u , v >= 4 ∣∣ u + v ∣ ∣ 2 − ∣∣ u − v ∣ ∣ 2 + 4 ∣∣ u + i v ∣ ∣ 2 − ∣∣ u − i v ∣ ∣ 2 i
拆开验算显然是对的.
正交
u ⊥ v ⟺ < u , v > = 0 u\perp v \iff <u,v>=0 u ⊥ v ⟺ < u , v >= 0
正交分解
∀ u , v , v = u ∣ ∣ u ∣ ∣ 2 < u , v > + ( v − u ∣ ∣ u ∣ ∣ 2 < u , v > ) \forall u,v,v=\dfrac{u}{\vert\vert u \vert\vert^2 } <u,v>+(v-\dfrac{u}{\vert\vert u \vert\vert^2 } <u,v>) ∀ u , v , v = ∣∣ u ∣ ∣ 2 u < u , v > + ( v − ∣∣ u ∣ ∣ 2 u < u , v > )
< u , v > ≤ ∣ ∣ u ∣ ∣ ∣ ∣ v ∣ ∣ <u,v> {\ } \le {\ } \vert\vert u \vert\vert \vert\vert v \vert\vert < u , v > ≤ ∣∣ u ∣∣∣∣ v ∣∣
let w = u ∣ ∣ u ∣ ∣ 2 < u , v > v = w + ( v − w ) , w ⊥ v − w ⟹ v 2 = w 2 + ( v − w ) 2 ≤ w 2 = < u , v > 2 ∣ ∣ u ∣ ∣ 2 \begin{gathered}
\text{let} w=\dfrac{u}{\vert\vert u \vert\vert^2 }<u,v>\\
v=w+(v-w),w\perp v-w \\
\implies v^2=w^2+(v-w)^2\le w^2=\dfrac{<u,v>^2}{\vert\vert u \vert\vert ^2}
\end{gathered} let w = ∣∣ u ∣ ∣ 2 u < u , v > v = w + ( v − w ) , w ⊥ v − w ⟹ v 2 = w 2 + ( v − w ) 2 ≤ w 2 = ∣∣ u ∣ ∣ 2 < u , v > 2
正交基
正交基,规范正交基.
正交基是两两正交的基.规范正交基就是两两正交且范数均为1 1 1 的基.
格拉姆施密特过程
任意给定一组基u 1 … u n u_1\ldots u_n u 1 … u n ,可以构造规范正交基e 1 … e n e_1\ldots e_n e 1 … e n .
v i = u i − ∑ j = 1 i − 1 < u i , e j > e j e i = v i ∣ ∣ v i ∣ ∣ \begin{gathered}
v_i=u_i-\sum_{j=1}^{i-1}<u_i,e_j>e_j \\
e_i=\dfrac{v_i}{\vert\vert v_i \vert\vert }
\end{gathered} v i = u i − j = 1 ∑ i − 1 < u i , e j > e j e i = ∣∣ v i ∣∣ v i
其实构造是很好想的,就是对于前i − 1 i-1 i − 1 个正交基的空间,把第i i i 个去掉所有和某个基方向相同的分量,剩下的就是新的正交方向.
若T T T 关于V V V 上一组基v 1 … v n v_1\ldots v_n v 1 … v n 由上三角矩阵,则T T T 关于V V V 上一组规范正交基有上三角矩阵.
任意复向量空间上算子关于某个规范正交基有上三角矩阵.
考虑刚才的构建过程里,每个 span ( u 1 … u i ) \operatorname{span}( u_1\ldots u_i ) span ( u 1 … u i ) 都没有改变,所以是显然的.
而第二条可以由 复向量空间上算子关于某基有上三角矩阵 和 第一条显然推出.
单列第二条是因为它叫 舒尔定理.
里斯表示定理
对任意线性泛函f f f 存在u u u 使得f v = < u , v > fv=<u,v> f v =< u , v >
设e 1 … e n e_1\ldots e_n e 1 … e n 是一组规范正交基,则
f v = f ∑ i = 1 n < v , e i > e i = ∑ i = 1 n < v , e i > f e i = ∑ i = 1 n < v , f e i ⋅ e i > = < v , ∑ i = 1 n e i f e i > \begin{gathered}
fv=f\sum _{i = 1} ^{n} <v,e_i> e_i \\
=\sum _{i = 1} ^{n} <v,e_i> fe_i \\
=\sum _{i = 1} ^{n} <v,fe_i\cdot e_i> \\
=<v,\sum _{i = 1} ^{n} e_ife_i>
\end{gathered} f v = f i = 1 ∑ n < v , e i > e i = i = 1 ∑ n < v , e i > f e i = i = 1 ∑ n < v , f e i ⋅ e i > =< v , i = 1 ∑ n e i f e i >
正交补
正交补
U ⊥ = { v ∣ < u , v > = 0 , u ∈ U , v ∈ V } U^{\perp}=\{ v \vert <u,v>=0,u\in U,v\in V \} U ⊥ = { v ∣ < u , v >= 0 , u ∈ U , v ∈ V }
和U U U 中向量正交的向量们.
U ⊕ U ⊥ = V U\oplus U^{\perp}=V U ⊕ U ⊥ = V
( U ⊥ ) ⊥ = U (U^{\perp})^{\perp}=U ( U ⊥ ) ⊥ = U
取U U U 的一组规范正交基u 1 … u n u_1\ldots u_n u 1 … u n ,扩充到V V V 的一组规范正交基u 1 … u n , v 1 … v m u_1\ldots u_n,v_1\ldots v_m u 1 … u n , v 1 … v m .
则容易发现 U ⊥ = span ( v 1 … v m ) U^{\perp}=\operatorname{span}( v_1\ldots v_m ) U ⊥ = span ( v 1 … v m ) .
然后第一条是显然的.第二条的话你把U ⊥ U^{\perp} U ⊥ 的基扩充到V V V 的时候扩充u 1 … u n u_1\ldots u_n u 1 … u n 就也是显然的.
正交投影
let u = w 1 + w 2 , w 1 ∈ U , w 2 ∈ U ⊥ ⟹ P U = w 1 \begin{gathered}
\text{let } u=w_1+w_2,w_1\in U,w_2\in U^{\perp} \\
\implies P_U=w_1
\end{gathered} let u = w 1 + w 2 , w 1 ∈ U , w 2 ∈ U ⊥ ⟹ P U = w 1
即干掉垂直分量,投影到U U U 所在超平面上.
P U P_U P U 是线性变换.
对U U U 的一组规范正交基e 1 … e m e_1\ldots e_m e 1 … e m ,有P U v = ∑ i = 1 m < v , e i > e i P_Uv=\sum_{i=1}^m <v,e_i> e_i P U v = ∑ i = 1 m < v , e i > e i
以及一些很显然的性质.
第二条看起来很显然.那么有了第二条第一条也很显然.
∀ u ∈ U , ∣ ∣ u − v ∣ ∣ ≥ ∣ ∣ P U v − v ∣ ∣ \forall u\in U,\vert\vert u-v \vert\vert \ge \vert\vert P_Uv-v \vert\vert ∀ u ∈ U , ∣∣ u − v ∣∣ ≥ ∣∣ P U v − v ∣∣
分解! v = v 1 + v 2 , v 1 ∈ U , v 2 ∈ U ⊥ v=v_1+v_2,v_1\in U,v_2\in U^\perp v = v 1 + v 2 , v 1 ∈ U , v 2 ∈ U ⊥ .
∣ ∣ u − v 1 − v 2 ∣ ∣ 2 = ( u − v 1 ) 2 + v 2 2 \begin{gathered}
\vert\vert u-v_1-v_2 \vert\vert^2 =(u-v_1)^2+v_2^2
\end{gathered} ∣∣ u − v 1 − v 2 ∣ ∣ 2 = ( u − v 1 ) 2 + v 2 2
于是显然取u = v 1 u=v_1 u = v 1 最小,即证.
伴随,自伴算子,正规算子.
伴随
伴随
对于算子T T T ,若∀ u , v \forall u,v ∀ u , v ,< T u , v > = < u , T ∗ v > <Tu,v>=<u,T^*v> < T u , v >=< u , T ∗ v > ,则T ∗ T^* T ∗ 是T T T 的伴随.
( S + T ) ∗ = S ∗ + T ∗ (S+T)^*=S^*+T^* ( S + T ) ∗ = S ∗ + T ∗
( λ T ) ∗ = λ T ∗ (\lambda T)^*=\lambda T^* ( λ T ) ∗ = λ T ∗
( S T ) ∗ = T ∗ S ∗ (ST)^*=T^*S^* ( S T ) ∗ = T ∗ S ∗
( T ∗ ) ∗ = T (T^*)^*=T ( T ∗ ) ∗ = T
null T ∗ = ( range T ) ⊥ \operatorname{null} T^*=(\operatorname{range} T)^{\perp} null T ∗ = ( range T ) ⊥
前三个用定义带进去即可.
第四个,< u , ( T ∗ ) ∗ v > = < T ∗ u , v > = < v , T ∗ u > ‾ = < T v , u > ‾ = < u , T v > <u,(T^*)^*v>=<T^*u,v>=\overline{<v,T^*u>}=\overline{<Tv,u>}=<u,Tv> < u , ( T ∗ ) ∗ v >=< T ∗ u , v >= < v , T ∗ u > = < T v , u > =< u , T v >
第五个,考虑是右边对任意u u u ,< T u , w > = 0 <Tu,w>=0 < T u , w >= 0 的所有w w w ,< T u , w > = < u , T ∗ w > <Tu,w>=<u,T^*w> < T u , w >=< u , T ∗ w > ,故 w ∈ null T ∗ w\in \operatorname{null} T^* w ∈ null T ∗
M ( T ∗ , v 1 … v m , u 1 … u n ) = M ( T , u 1 … u n , v 1 … v m ) T ‾ ( v 1 … v m ) , ( u 1 … u n ) are regular orthogonal bases \begin{gathered}
\mathcal M( T^*, v_1\ldots v_m, u_1\ldots u_n) = \overline{ \mathcal M( T ,u_1\ldots u_n,v_1\ldots v_m)^T } \\
(v_1\ldots v_m),(u_1\ldots u_n) \text{ are regular orthogonal bases}
\end{gathered} M ( T ∗ , v 1 … v m , u 1 … u n ) = M ( T , u 1 … u n , v 1 … v m ) T ( v 1 … v m ) , ( u 1 … u n ) are regular orthogonal bases
右边说的是转置再把每一项共轭.
< T u , v > = < u , T ∗ v > T u = ∑ i = 1 m ∑ j = 1 n A j , i < u , u i > v j < T u , v > = < ∑ i = 1 m ∑ j = 1 n A j , i < u , u i > v j , v > = ∑ i = 1 m ∑ j = 1 n A j , i < u , u i > < v j , v > = < u , ∑ i = 1 m ∑ j = 1 n A j , i < v j , v > u i > = < u , T v > \begin{gathered}
<Tu,v>=<u,T^*v> \\
Tu=\sum _{i = 1} ^{m} \sum_{j=1}^n A_{j,i}<u,u_i>v_j \\
<Tu,v> \\
= <\sum _{i = 1} ^{m}\sum_{j=1}^n A_{j,i}<u,u_i>v_j,v> \\
=\sum _{i = 1} ^{m} \sum_{j=1}^n A_{j,i}<u,u_i><v_j,v> \\
=<u,\sum _{i = 1} ^{m} \sum_{j=1}^n A_{j,i}<v_j,v>u_i> \\
=<u,Tv>
\end{gathered} < T u , v >=< u , T ∗ v > T u = i = 1 ∑ m j = 1 ∑ n A j , i < u , u i > v j < T u , v > =< i = 1 ∑ m j = 1 ∑ n A j , i < u , u i > v j , v > = i = 1 ∑ m j = 1 ∑ n A j , i < u , u i >< v j , v > =< u , i = 1 ∑ m j = 1 ∑ n A j , i < v j , v > u i > =< u , T v >
其实就是直接用规范正交基写开直接做.
自伴算子
所以这个实空间下就是我们实对称矩阵啊.
T = T ∗ ⟹ T ’s eigenvalues ∈ R T = T ∗ ⟺ ∀ v , < v , T v > ∈ R T = T ∗ ⟺ ( < v , T v > = 0 ⟹ T = 0 ) \begin{gathered}
T=T^* \implies T\text{'s eigenvalues}\in R \\
T=T^* \iff \forall v,<v,Tv> \in R \\
T=T^* \iff (<v,Tv>=0 \implies T=0)
\end{gathered} T = T ∗ ⟹ T ’s eigenvalues ∈ R T = T ∗ ⟺ ∀ v , < v , T v >∈ R T = T ∗ ⟺ ( < v , T v >= 0 ⟹ T = 0 )
注意,前两条对复向量空间成立,最后一条是对实向量空间成立.
所以说书说伴随类比共轭,自伴算子类比实数啊.
第一行,根据舒尔定理,T T T 有关于规范正交基的上三角矩阵,然后因为矩阵等于共轭转置,于是对角线上对应相等,于是都是实数.
第二行,< v , T v > = < T v , v > ‾ = < v , T ∗ v > ‾ = < v , T v > ‾ <v,Tv>=\overline{ <Tv,v> } = \overline{ <v,T^*v> } =\overline{ <v,Tv> } < v , T v >= < T v , v > = < v , T ∗ v > = < v , T v > 可以正推.
反推的话
∀ v , 0 = < v , T v > − < v , T v > ‾ = < v , T v > − < v , T ∗ v > = < v , ( T − T ∗ ) v > = 0 \begin{gathered}
\forall v,0 \\
=<v,Tv>-\overline{ <v,Tv> } \\
=<v,Tv>-<v,T^*v> \\
=<v,(T-T^*)v>=0
\end{gathered} ∀ v , 0 =< v , T v > − < v , T v > =< v , T v > − < v , T ∗ v > =< v , ( T − T ∗ ) v >= 0
这里我们似乎需要点引理:
复向量空间下,只有T = 0 T=0 T = 0 可以保证∀ v , < v , T v > = 0 \forall v,<v,Tv>=0 ∀ v , < v , T v >= 0 .
也就是复向量空间下的性质3.
考虑T T T 变成规范正交基下的上三角矩阵,基是e 1 … e n e_1\ldots e_n e 1 … e n ,则T e 1 = λ 1 e 1 , < e 1 , T e 1 > = < e 1 , λ 1 e 1 > = 0 Te_1=\lambda_1e_1,<e_1,Te_1>=<e_1,\lambda_1 e_1>=0 T e 1 = λ 1 e 1 , < e 1 , T e 1 >=< e 1 , λ 1 e 1 >= 0 得λ 1 = 0 \lambda_1=0 λ 1 = 0 ,T e 1 = 0 Te_1=0 T e 1 = 0 .
然后你带入e 1 + e 2 e_1+e_2 e 1 + e 2 ,则T ( e 1 + e 2 ) = T e 2 = a e 1 + b e 2 , < e 1 + e 2 , T ( e 1 + e 2 ) > = 0 T(e_1+e_2)=Te_2=ae_1+be_2,<e_1+e_2,T(e_1+e_2)>=0 T ( e 1 + e 2 ) = T e 2 = a e 1 + b e 2 , < e 1 + e 2 , T ( e 1 + e 2 ) >= 0 得a = b = 0 a=b=0 a = b = 0 ,T e 2 = 0 Te_2=0 T e 2 = 0 .
反复重复就得到∀ i , T e i = 0 \forall i,Te_i=0 ∀ i , T e i = 0 ,于是T = 0 T=0 T = 0 .
这样我们就可以从< v , ( T − T ∗ ) v > = 0 <v,(T-T^*)v>=0 < v , ( T − T ∗ ) v >= 0 得到T = T ∗ T=T^* T = T ∗ 了.
第三行,考虑
∀ u , v , < u , T v > = < u + v , T u + T v > − < u − v , T u − T v > 4 \begin{gathered}
\forall u,v, \\
<u,Tv>=\dfrac{<u+v,Tu+Tv>-<u-v,Tu-Tv>}{4}
\end{gathered} ∀ u , v , < u , T v >= 4 < u + v , T u + T v > − < u − v , T u − T v >
于是任意< u , T v > = 0 <u,Tv>=0 < u , T v >= 0 ,T = 0 T=0 T = 0 .
< P U u , v > = < P U u , P U v + ( v − P U v ) > = < P U u , P U v > + < P U u , ( v − P U v ) > = < P U u , P U v > = < u , P U v > \begin{gathered}
<P_Uu,v>=<P_Uu,P_Uv+(v-P_Uv)>=<P_Uu,P_Uv>+<P_Uu,(v-P_Uv)>=<P_Uu,P_Uv>=<u,P_Uv>
\end{gathered} < P U u , v >=< P U u , P U v + ( v − P U v ) >=< P U u , P U v > + < P U u , ( v − P U v ) >=< P U u , P U v >=< u , P U v >
显然的啦.
正规算子
正规算子
T is normal ⟺ T T ∗ = T ∗ T \begin{gathered}
T \text{ is normal} \iff TT^*=T^*T
\end{gathered} T is normal ⟺ T T ∗ = T ∗ T
T is normal ⟺ ∀ v , ∣ ∣ T v ∣ ∣ = ∣ ∣ T ∗ v ∣ ∣ \begin{gathered}
T \text{ is normal} \iff \forall v,\vert\vert Tv \vert\vert = \vert\vert T^*v \vert\vert
\end{gathered} T is normal ⟺ ∀ v , ∣∣ T v ∣∣ = ∣∣ T ∗ v ∣∣
< T v , T v > = < T ∗ T v , v > = < T T ∗ v , v > = < T ∗ v , T ∗ v > \begin{gathered}
<Tv,Tv>=<T^*Tv,v>=<TT^*v,v>=<T^*v,T^*v>
\end{gathered} < T v , T v >=< T ∗ T v , v >=< T T ∗ v , v >=< T ∗ v , T ∗ v >
T is normal , λ is eigen value of T ⟹ T − λ I is normal \begin{gathered}
T \text{ is normal} ,\lambda \text{ is eigen value of } T \implies T-\lambda I \text{ is normal}
\end{gathered} T is normal , λ is eigen value of T ⟹ T − λ I is normal
( T − λ I ) ∗ = T ∗ − λ ‾ I ⟹ ( T − λ I ) ( T − λ I ) ∗ = T T ∗ − ( λ + λ ‾ ) T + λ λ ‾ = ( T − λ I ) ∗ ( T − λ I ) \begin{gathered}
(T-\lambda I)^*=T^*-\overline{ \lambda } I \\
\implies (T-\lambda I)(T-\lambda I)^* \\
=TT^*-(\lambda+\overline{ \lambda } )T+\lambda \overline{ \lambda } \\
=(T-\lambda I)^*(T-\lambda I)
\end{gathered} ( T − λ I ) ∗ = T ∗ − λ I ⟹ ( T − λ I ) ( T − λ I ) ∗ = T T ∗ − ( λ + λ ) T + λ λ = ( T − λ I ) ∗ ( T − λ I )
T is normal , T v = λ v ⟹ T ∗ v = λ ‾ v \begin{gathered}
T \text{ is normal}, Tv=\lambda v \implies T^*v=\overline{ \lambda } v
\end{gathered} T is normal , T v = λ v ⟹ T ∗ v = λ v
( T − λ I ) v = 0 ⟹ ∣ ∣ ( T − λ I ) v ∣ ∣ = 0 ⟹ ∣ ∣ ( T − λ I ) ∗ v ∣ ∣ = 0 T ∗ v = λ ‾ v \begin{gathered}
(T-\lambda I)v=0 \\
\implies \vert\vert (T-\lambda I)v \vert\vert =0 \\
\implies \vert\vert (T-\lambda I)^*v \vert\vert =0 \\
T^*v=\overline{\lambda}v
\end{gathered} ( T − λ I ) v = 0 ⟹ ∣∣ ( T − λ I ) v ∣∣ = 0 ⟹ ∣∣ ( T − λ I ) ∗ v ∣∣ = 0 T ∗ v = λ v
T is normal ⟹ eigen vectors of T are orthogonal \begin{gathered}
T \text{ is normal} \implies \text{eigen vectors of } T \text{ are orthogonal}
\end{gathered} T is normal ⟹ eigen vectors of T are orthogonal
let T u = λ 1 u , T v = λ 2 v ( λ 2 − λ 1 ) < u , v > = < u , λ 2 v > − < λ 1 ‾ u , v > = < u , T v > − < T ∗ u , v > = 0 \begin{gathered}
\text{let } Tu=\lambda_1 u,Tv=\lambda_2 v \\
(\lambda_2-\lambda_1)<u,v> \\
=<u,\lambda_2 v>-<\overline{ \lambda_1 } u,v> \\
=<u,Tv>-<T^*u,v> \\
=0
\end{gathered} let T u = λ 1 u , T v = λ 2 v ( λ 2 − λ 1 ) < u , v > =< u , λ 2 v > − < λ 1 u , v > =< u , T v > − < T ∗ u , v > = 0
谱定理
复谱定理
复向量空间上,算子正规等价于存在一组由本征向量组成的规范正交基
反向推是显然的:对角矩阵之间乘法是交换的.
正向推:
首先舒尔定理得到一个规范正交基使得矩阵 M ( T ) = M \mathcal M( T ) =M M ( T ) = M 是上三角的.
现在利用A = M M ∗ = M ∗ M A=MM^*=M^*M A = M M ∗ = M ∗ M .
考虑 ∑ i = 1 n ∣ M i , i ∣ 2 = < M 1 , . , M 1 , . ‾ > = < M . , 1 , M . , 1 ‾ > = ∣ M 1 , 1 ∣ 2 \sum_{i=1}^n \vert M_{i,i} \vert ^2=<M_{1,.},\overline{M_{1,.}}>=<M_{.,1},\overline{M_{.,1}}>=\vert M_{1,1} \vert ^2 ∑ i = 1 n ∣ M i , i ∣ 2 =< M 1 , . , M 1 , . >=< M . , 1 , M . , 1 >= ∣ M 1 , 1 ∣ 2
于是直接说明了M 1 , i = 0 , i > 1 M_{1,i}=0,i>1 M 1 , i = 0 , i > 1 .
然后再考虑A 2 , 2 A_{2,2} A 2 , 2 是第二行第二列,可以同理得到< M 2 , i = 0 , i > 2 <M_{2,i}=0,i>2 < M 2 , i = 0 , i > 2
于是重复上述过程可以证明M M M 是对角矩阵,得证.
实谱定理
实向量空间上,算子自伴等价于存在一组本征向量组成的规范正交基
反向推依然是显然的,考虑正向.
考虑归纳,先假设对所有小于n n n 维命题成立.1 1 1 维显然成立.
取一个规范的本征向量,把它作为基的第一个向量n 1 n_1 n 1 ,设 U = span ( n 1 ) U=\operatorname{span}( n_1 ) U = span ( n 1 ) ,则T T T 在U U U 上不变.
注意到
u ∈ U ⟹ T u ∈ U ⟺ v ∈ U ⊥ , T v ∈ U ⊥ \begin{gathered}
u\in U \implies Tu\in U \\
\iff v\in U^{\perp},Tv\in U^\perp
\end{gathered} u ∈ U ⟹ T u ∈ U ⟺ v ∈ U ⊥ , T v ∈ U ⊥
u ∈ U , v ∈ U ⊥ ⟹ < T u , v > = 0 ⟹ < u , T v > = 0 ⟹ T v ∈ U ⊥ \begin{gathered}
u\in U,v\in U^{\perp} \\
\implies <Tu,v>=0 \\
\implies <u,Tv>=0 \\
\implies Tv\in U^{\perp}
\end{gathered} u ∈ U , v ∈ U ⊥ ⟹ < T u , v >= 0 ⟹ < u , T v >= 0 ⟹ T v ∈ U ⊥
于是T T T 在U ⊥ U^{\perp} U ⊥ 上不变,那么对T ∣ U ⊥ T\vert_{U^{\perp}} T ∣ U ⊥ 应用归纳假设,它存在一个由本征向量构成的规范正交基.
现在直接把n 1 n_1 n 1 加入进去,显然这是一组本征向量构成的规范正交基.
然后我们发现自己忽略了一件事:我们没有证明这个本征向量是能取出来的.
考虑经典技巧,对任意v ∈ V v\in V v ∈ V ,v , T v , T 2 v … T n v v,Tv,T^2v\ldots T^nv v , T v , T 2 v … T n v 线性相关,存在f ( x ) ∈ P n s . t . f ( T ) v = 0 f(x)\in \mathcal{P}_n \ s.t.\ f(T)v=0 f ( x ) ∈ P n s . t . f ( T ) v = 0
将f f f 质因式分解,
f ( x ) = a ∏ i ( x − λ i ) ∏ i ( x 2 + b i x + c i ) f ( T ) v = a ∏ i ( T − λ i I ) ∏ i ( T 2 + b i T + c i I ) v = 0 \begin{gathered}
f(x)=a\prod_i (x-\lambda_i)\prod_i (x^2+b_ix+c_i) \\
f(T)v=a\prod_i (T-\lambda_i I)\prod_i (T^2+b_iT+c_iI)v=0
\end{gathered} f ( x ) = a i ∏ ( x − λ i ) i ∏ ( x 2 + b i x + c i ) f ( T ) v = a i ∏ ( T − λ i I ) i ∏ ( T 2 + b i T + c i I ) v = 0
由于T 2 + b i T + c i T^2+b_iT+c_i T 2 + b i T + c i 不可分解,有b i 2 − 4 c < 0 b_i^2-4c<0 b i 2 − 4 c < 0
我们假设T T T 没有本征值,则T − λ i I T-\lambda_i I T − λ i I 是单的.
而
< ( T 2 + b i T + c i ) v , v > = < ( ( T + b i 2 I ) 2 + ( c − b 2 4 ) ) v , v > = < ( T + b i 2 I ) 2 v , v > + ( c − b 2 4 ) v 2 = ( T v + b i v 2 ) 2 + ( c − b 2 4 ) v 2 > 0 \begin{gathered}
<(T^2+b_iT+c_i)v,v> \\
=<((T+\dfrac{b_i}{2}I )^2+(c-\dfrac{b^2}{4}))v,v> \\
=<(T+\dfrac{b_i}{2} I)^2v,v>+(c-\dfrac{b^2}{4})v^2 \\
=(Tv+\dfrac{b_iv}{2} )^2+(c-\dfrac{b^2}{4} )v^2 \\
>0
\end{gathered} < ( T 2 + b i T + c i ) v , v > =< (( T + 2 b i I ) 2 + ( c − 4 b 2 )) v , v > =< ( T + 2 b i I ) 2 v , v > + ( c − 4 b 2 ) v 2 = ( T v + 2 b i v ) 2 + ( c − 4 b 2 ) v 2 > 0
于是它也是单的,则f ( T ) f(T) f ( T ) 是单的,和f ( T ) v = 0 f(T)v=0 f ( T ) v = 0 矛盾
所以其实T T T 有本征值是某个λ i \lambda_i λ i
正算子,平方根,等距同构
正算子
T is positive ⟺ { ∀ v , < v , T v > ≥ 0 T is self-adjoint \begin{gathered}
T \text{ is positive} \iff
\begin{cases}
\forall v,<v,Tv>\ge 0 \\
T \text{ is self-adjoint}
\end{cases}
\end{gathered} T is positive ⟺ { ∀ v , < v , T v >≥ 0 T is self-adjoint
你会发现正算子其实对应了矩阵中的半正定矩阵.
平方根
T = R 2 ⟺ R is squre root of T \begin{gathered}
T=R^2 \iff R \text{ is squre root of T}
\end{gathered} T = R 2 ⟺ R is squre root of T
下列条件等价:
T is positive T is self-adjoint and each T’s eigenvalues is not negative T has positive squre root T has adjoint squre root ∃ R , T = R ∗ R \begin{gathered}
T \text{ is positive} \\
T \text{ is self-adjoint and each T's eigenvalues is not negative} \\
T \text{ has positive squre root} \\
T \text{ has adjoint squre root} \\
\exists R,T=R^*R
\end{gathered} T is positive T is self-adjoint and each T’s eigenvalues is not negative T has positive squre root T has adjoint squre root ∃ R , T = R ∗ R
由第一行推第二行:显然自伴,只要说明本征值非负.
由刚才谱定理,作为自伴矩阵它有规范正交基下的对角形式.而对角形式下,取一个本征向量v v v 乘它,如果对应本征值λ < 0 \lambda<0 λ < 0 则< v , T v > = λ v 2 < 0 <v,Tv>=\lambda v^2<0 < v , T v >= λ v 2 < 0 ,矛盾.于是得证.
第二行推第三行:仍然在对角形式下操作,把对角线每个元素算术平方根,容易发现你得到一个正平方根.
第三行推四行是显然.
第四行推第五行显然,因为对自伴算子R R R 满足T = R 2 T=R^2 T = R 2 且R = R ∗ R=R^* R = R ∗
第五行推第一行,首先容易验证( R ∗ R ) ∗ = R ∗ ( R ∗ ) ∗ = R ∗ R (R^*R)^*=R^*(R^*)^*=R^*R ( R ∗ R ) ∗ = R ∗ ( R ∗ ) ∗ = R ∗ R ,T T T 是自伴.再考虑< v , R ∗ R v > = < R v , R v > ≥ 0 <v,R^*Rv>=<Rv,Rv>\ge 0 < v , R ∗ R v >=< R v , R v >≥ 0 于是得证.
于是可以记T T T 的唯一正平方根为T \sqrt T T
首先由之前从 T is positive ⟹ T = S 2 , S is positive T \text{ is positive} \implies T=S^2,S \text{ is positive} T is positive ⟹ T = S 2 , S is positive 中我们会证存在性(对角矩阵然后给每个本征值开根).
现在考虑已经有一个正平方根S S S ,取S S S 的本征向量构成的规范正交基e 1 … e n e_1\ldots e_n e 1 … e n ,再取T T T 的本征向量v v v ,有
{ T v = λ v v = ∑ i = 1 n < v , e i > e i ⟹ T v = ∑ i = 1 n λ < v , e i > R 2 v = ∑ i = 1 n λ i 2 < v , e i > e i = T v = ∑ i = 1 n λ < v , e i > ⟹ ∑ i = 1 n ( λ i 2 − λ ) < v , e i > e i = 0 ⟹ ∀ i , < v , e i > ≠ 0 : λ i 2 = λ ⟹ R v = λ i v = λ v \begin{gathered}
\begin{cases}
Tv=\lambda v \\
v=\sum _{i = 1} ^{n} <v,e_i>e_i
\end{cases} \\
\implies
Tv=\sum _{i = 1} ^{n} \lambda <v,e_i> \\
R^2v=\sum _{i = 1} ^{n} \lambda_i^2 <v,e_i>e_i=Tv=\sum _{i = 1} ^{n} \lambda <v,e_i> \\
\implies \sum _{i = 1} ^{n} (\lambda_i^2-\lambda)<v,e_i>e_i=0 \\
\implies \forall i,<v,e_i>\ne 0:\lambda_i^2=\lambda \\
\implies Rv=\lambda_i v=\sqrt{\lambda} v
\end{gathered} { T v = λ v v = ∑ i = 1 n < v , e i > e i ⟹ T v = i = 1 ∑ n λ < v , e i > R 2 v = i = 1 ∑ n λ i 2 < v , e i > e i = T v = i = 1 ∑ n λ < v , e i > ⟹ i = 1 ∑ n ( λ i 2 − λ ) < v , e i > e i = 0 ⟹ ∀ i , < v , e i > = 0 : λ i 2 = λ ⟹ R v = λ i v = λ v
于是可以证明R R R 对T T T 的每个本征向量的作用都与前面通过对角线直接取平方根构造出的R 0 R_0 R 0 相同,故R = R 0 R=R_0 R = R 0
等距同构
T is an isometry ⟺ ∀ v , ∣ ∣ T v ∣ ∣ = ∣ ∣ v ∣ ∣ \begin{gathered}
T \text{ is an isometry} \iff \forall v,\vert\vert Tv \vert\vert =\vert\vert v \vert\vert
\end{gathered} T is an isometry ⟺ ∀ v , ∣∣ T v ∣∣ = ∣∣ v ∣∣
下列条件等价:
T is an isometry ∀ u , v , < T u , T v > = < u , v > ∀ orthonormal base e , T e 1 … T e n is orthonormal ∃ orthonormal base e , T e 1 … T e n is orthonormal T T ∗ = I T ∗ T = I T ∗ = T − 1 \begin{gathered}
T \text{ is an isometry} \\
\forall u,v,<Tu,Tv>=<u,v> \\
\forall \text{orthonormal base } e, Te_1\ldots Te_n \text{ is orthonormal} \\
\exists \text{orthonormal base } e, Te_1\ldots Te_n \text{ is orthonormal} \\
TT^*=I \\
T^*T=I \\
T^*=T^{-1}
\end{gathered} T is an isometry ∀ u , v , < T u , T v >=< u , v > ∀ orthonormal base e , T e 1 … T e n is orthonormal ∃ orthonormal base e , T e 1 … T e n is orthonormal T T ∗ = I T ∗ T = I T ∗ = T − 1
第一行等价第二行:我们之前证过可以由范数计算内积,于是保范数和保内积等价.
前两行推第三行是显然的:< T e i , T e j > = < e i , e j > = 0 <Te_i,Te_j>=<e_i,e_j>=0 < T e i , T e j >=< e i , e j >= 0 ,同时长度显然也不变.
第三行推第四行是显然的.
第四行推第五行:考虑∀ u , v : < u , T v > = < T ∗ u , v > = < T T ∗ u , T v > \forall u,v:<u,Tv>=<T^*u,v>=<TT^*u,Tv> ∀ u , v :< u , T v >=< T ∗ u , v >=< T T ∗ u , T v > ,于是< ( T T ∗ − I ) u , v > = 0 <(TT^*-I)u,v>=0 < ( T T ∗ − I ) u , v >= 0 ,可以说明T T ∗ = I TT^*=I T T ∗ = I
于是T ∗ = T − 1 T^*=T^{-1} T ∗ = T − 1 ,而证明群里的逆元是交换的是经典的,于是后三条是一起的.
最后,如果T ∗ = T − 1 T^*=T^{-1} T ∗ = T − 1 ,∣ ∣ T v ∣ ∣ 2 = < T v , T v > = < T ∗ T v , v > = ∣ ∣ v ∣ ∣ \vert\vert Tv \vert\vert^2=\sqrt{<Tv,Tv>}=\sqrt{<T^*Tv,v>}=\vert \vert v\vert \vert ∣∣ T v ∣ ∣ 2 = < T v , T v > = < T ∗ T v , v > = ∣∣ v ∣∣ ,得证.
复向量空间下
T is an isometry ⟺ ∃ orthonormal base e , ∀ i , T e i = λ i e i , ∣ λ i ∣ = 1 \begin{gathered}
T \text{ is an isometry} \\
\iff \exists \text{orthonormal base }e, \\
\forall i, Te_i=\lambda_i e_i,\vert \lambda_i \vert =1
\end{gathered} T is an isometry ⟺ ∃ orthonormal base e , ∀ i , T e i = λ i e i , ∣ λ i ∣ = 1
首先证明逆向,则在基e e e 下T T T 是对角矩阵且对角线元素模长为1 1 1 ,容易验证T T ∗ = I TT^*=I T T ∗ = I ,说明T T T 是等距同构.或者你慢慢写验证保持范数也是简单的.
然后正向:取T T T 的本征向量构成的规范正交基,于是T T T 是对角矩阵且T T ∗ = I TT^*=I T T ∗ = I ,也是显然的.
极分解,奇异值分解
极分解
T = S T ∗ T , S is isometry \begin{gathered}
T=S\sqrt{T^*T},S \text{ is isometry}
\end{gathered} T = S T ∗ T , S is isometry
首先我们之前说明过T ∗ T T^*T T ∗ T 是正的,于是这个平凡根存在.且
∣ ∣ T v ∣ ∣ = < T v , T v > = < T ∗ T v , v > = < T ∗ T v , T ∗ T v > = ∣ ∣ T ∗ T v ∣ ∣ \begin{gathered}
\vert\vert Tv \vert\vert =\sqrt{<Tv,Tv>}=\sqrt{<T^*Tv,v>} \\
=\sqrt{<\sqrt{T^*Tv},\sqrt{T^*T}v>}=\vert\vert \sqrt{T^*T}v \vert\vert
\end{gathered} ∣∣ T v ∣∣ = < T v , T v > = < T ∗ T v , v > = < T ∗ T v , T ∗ T v > = ∣∣ T ∗ T v ∣∣
于是S S S 可以是等距同构的,在 range T ∗ T → range T \operatorname{range} \sqrt{T^*T} \to \operatorname{range} T range T ∗ T → range T 上我们定义:
S 1 T ∗ T v = T v \begin{gathered}
S_1\sqrt{T^*T}v=Tv
\end{gathered} S 1 T ∗ T v = T v
S 1 T ∗ T ( v 1 + v 2 ) = T ( v 1 + v 2 ) ⟹ S 1 ( T ∗ T v 1 ) + S 1 ( T ∗ T v 2 ) = T v 1 + T v 2 S 1 T ∗ T k v 1 = k T v 1 \begin{gathered}
S_1\sqrt{T^*T}(v_1+v_2)=T(v_1+v_2) \\
\implies S_1(\sqrt{T^*T}v_1)+S_1(\sqrt{T^*T}v_2)=Tv_1+Tv_2 \\
S_1\sqrt{T^*T}kv_1=kTv_1
\end{gathered} S 1 T ∗ T ( v 1 + v 2 ) = T ( v 1 + v 2 ) ⟹ S 1 ( T ∗ T v 1 ) + S 1 ( T ∗ T v 2 ) = T v 1 + T v 2 S 1 T ∗ T k v 1 = k T v 1
这样可以说明S 1 S_1 S 1 是线性变换.
并且
T ∗ T v 1 = T ∗ T v 2 ⟺ ∣ ∣ T ∗ T ( v 1 − v 2 ) ∣ ∣ = 0 ⟺ ∣ ∣ T ( v 1 − v 2 ) ∣ ∣ = 0 ⟺ T v 1 = T v 2 \begin{gathered}
\sqrt{T^*T}v_1= \sqrt{T^*T}v_2 \\
\iff \vert\vert \sqrt{T^*T}(v_1-v_2) \vert\vert =0 \\
\iff \vert\vert T(v_1-v_2) \vert\vert =0 \\
\iff Tv_1=Tv_2
\end{gathered} T ∗ T v 1 = T ∗ T v 2 ⟺ ∣∣ T ∗ T ( v 1 − v 2 ) ∣∣ = 0 ⟺ ∣∣ T ( v 1 − v 2 ) ∣∣ = 0 ⟺ T v 1 = T v 2
于是S 1 S_1 S 1 是单射.显然也是满射.于是S 1 S_1 S 1 是双射.
于是
dim range T ∗ T = dim range T ⟹ dim ( range T ∗ T ) ⊥ = dim ( range T ) ⊥ \begin{gathered}
\dim \operatorname{range} \sqrt{T^*T}=\dim \operatorname{range} T \\
\implies \dim (\operatorname{range} \sqrt{T^*T})^\perp=\dim (\operatorname{range} T)^\perp
\end{gathered} dim range T ∗ T = dim range T ⟹ dim ( range T ∗ T ) ⊥ = dim ( range T ) ⊥
于是可以从 ( range T ∗ T ) ⊥ (\operatorname{range} \sqrt{T^*T})^\perp ( range T ∗ T ) ⊥ 和( range T ) ⊥ (\operatorname{range} T)^\perp ( range T ) ⊥ 中分别取一组规范正交基e 1 … e n e_1\ldots e_n e 1 … e n ,f 1 … f n f_1\ldots f_n f 1 … f n ,那么只要让
S 2 ∈ L ( ( range T ∗ T ) ⊥ , ( range T ) ⊥ ) S 2 ( ∑ i c i e i ) = ∑ i c i f i \begin{gathered}
S_2\in \mathcal L( (\operatorname{range} \sqrt{T^*T})^\perp , (\operatorname{range} T)^\perp ) \\
S_2(\sum_i c_ie_i)=\sum_i c_if_i
\end{gathered} S 2 ∈ L (( range T ∗ T ) ⊥ , ( range T ) ⊥ ) S 2 ( i ∑ c i e i ) = i ∑ c i f i
并最后让S = S 1 + S 2 S=S_1+S_2 S = S 1 + S 2 即可.
Q.E.D \begin{gathered}
\text{Q.E.D}
\end{gathered} Q.E.D
奇异值
T T T 的奇异值即T ∗ T \sqrt{T^* T} T ∗ T 的本征值,且每个值λ \lambda λ 重复dim E ( λ , T ∗ T ) \dim E(\lambda,\sqrt{T^ *T}) dim E ( λ , T ∗ T ) 次.
奇异值分解
对算子T T T 设s 1 … s n s_1\ldots s_n s 1 … s n 是T T T 的奇异值,则存在两组规范正交基e 1 … e n e_1\ldots e_n e 1 … e n ,f 1 … f n f_1\ldots f_n f 1 … f n ,使得T v = ∑ i s i < v , e i > f i Tv=\sum_i s_i<v,e_i>f_i T v = ∑ i s i < v , e i > f i .
哦T ∗ T \sqrt{T^*T} T ∗ T 好在它是正的,于是谱定理可以找到一组基e e e 使得T ∗ T e i = s i e i , T ∗ T v = ∑ i s i < v , e i > e i \sqrt{T^*T}e_i=s_ie_i,\sqrt{T^*T}v=\sum_i s_i<v,e_i>e_i T ∗ T e i = s i e i , T ∗ T v = ∑ i s i < v , e i > e i .
那么极分解T = S T ∗ T T=S\sqrt{T^*T} T = S T ∗ T ,于是
T v = S T ∗ T v = S ∑ i s i < v , e i > e i = ∑ i s i < v , e i > S e i = ∑ i s i < v , e i > f i \begin{gathered}
Tv=S\sqrt{T^*T}v \\
=S\sum_i s_i<v,e_i>e_i \\
=\sum_i s_i<v,e_i>Se_i \\
=\sum_i s_i<v,e_i>f_i
\end{gathered} T v = S T ∗ T v = S i ∑ s i < v , e i > e i = i ∑ s i < v , e i > S e i = i ∑ s i < v , e i > f i
因为S S S 是等距同构所以把规范正交基变换成规范正交基.
零空间链,幂零算子,广义本征空间
0 = null T 0 , null T i ⊂ null T i + 1 null T i = null T i + 1 ⟹ ∀ j > i , null T j = null T i null T dim V = null T dim V + 1 \begin{gathered}
{0}=\operatorname{null} T^0,\operatorname{null} T^i \subset \operatorname{null} T^{i+1} \\
\operatorname{null} T^i= \operatorname{null} T^{i+1} \implies \forall j>i,\operatorname{null} T^j=\operatorname{null} T^i \\
\operatorname{null} T^{\dim V}=\operatorname{null} T^{\dim V+1} \\
\end{gathered} 0 = null T 0 , null T i ⊂ null T i + 1 null T i = null T i + 1 ⟹ ∀ j > i , null T j = null T i null T d i m V = null T d i m V + 1
前两行是显然的
第三行也是显然的:U U U 的真子空间的维数必须小于U U U .
V = null T dim V ⊕ range T dim V \begin{gathered}
V=\operatorname{null} T^{\dim V} \oplus \operatorname{range} T^{\dim V}
\end{gathered} V = null T d i m V ⊕ range T d i m V
首先维数满足条件,并且交是 { 0 } \{ 0 \} { 0 } ,所以成立.
幂零算子
即T T T 满足∃ n , T n = 0 \exists n,T^n=0 ∃ n , T n = 0 (显然可以让n = dim V n=\dim V n = dim V )
先取 null T \operatorname{null} T null T 的基,不够就加入 null T 2 \operatorname{null} T^2 null T 2 零空间的基扩充,然后加 null T 3 \operatorname{null} T^3 null T 3 的,直到加到n n n 个.
注意到对来自 null T k \operatorname{null} T^k null T k 的基e e e ,T e ∈ null T k − 1 Te\in \operatorname{null} T^{k-1} T e ∈ null T k − 1 ,于是是严格上三角矩阵.
广义本征向量
∃ n , ( T − λ I ) n v = 0 ⟺ v is generalized eigen vector of T . \begin{gathered}
\exists n,(T-\lambda I)^nv=0 \\
\iff v \text{ is generalized eigen vector of } T.
\end{gathered} ∃ n , ( T − λ I ) n v = 0 ⟺ v is generalized eigen vector of T .
( T − λ I ) n v = 0 ⟹ λ is eigenvalue of T \begin{gathered}
(T-\lambda I)^n v=0 \implies \lambda \text{ is eigenvalue of } T
\end{gathered} ( T − λ I ) n v = 0 ⟹ λ is eigenvalue of T
因为显然T − λ I T-\lambda I T − λ I 不是单的.
广义本征空间
G ( λ , T ) = null ( T − λ I ) dim V \begin{gathered}
G(\lambda,T)=\operatorname{null} (T-\lambda I)^{\dim V}
\end{gathered} G ( λ , T ) = null ( T − λ I ) d i m V
就是广义本征向量的张成空间.
不同广义本征空间中的向量线性无关.
v i ∈ G ( λ i , T ) ⟹ { v n } is linear independent \begin{gathered}
v_i\in G(\lambda_i,T) \\
\implies \{ v_n \} \text{ is linear independent}
\end{gathered} v i ∈ G ( λ i , T ) ⟹ { v n } is linear independent
let k = max i ∣ ( T − λ 1 I ) i v 1 ≠ 0 let w = ( T − λ 1 I ) k v 1 ⟹ T w = λ 1 w let F = ( T − λ 1 I ) k ∏ i ( T − λ i I ) n ∑ i = 1 n c i v i = 0 ⟹ F ∑ i = 1 n c i v i = 0 ⟹ F c 1 v 1 = 0 ⟹ c 1 w = 0 ⟹ c 1 = 0 \begin{gathered}
\text{let } k=\max {i\vert (T-\lambda_1 I)^i v_1\ne 0} \\
\text{let } w=(T-\lambda_1 I)^k v_1 \\
\implies Tw=\lambda_1w \\
\text{let } F=(T-\lambda_1I)^k\prod_i (T-\lambda_iI)^n \\
\sum _{i = 1} ^{n} c_iv_i=0 \\
\implies F\sum _{i = 1} ^{n} c_iv_i=0 \\
\implies Fc_1v_1=0 \\
\implies c_1w=0 \\
\implies c_1=0
\end{gathered} let k = max i ∣ ( T − λ 1 I ) i v 1 = 0 let w = ( T − λ 1 I ) k v 1 ⟹ T w = λ 1 w let F = ( T − λ 1 I ) k i ∏ ( T − λ i I ) n i = 1 ∑ n c i v i = 0 ⟹ F i = 1 ∑ n c i v i = 0 ⟹ F c 1 v 1 = 0 ⟹ c 1 w = 0 ⟹ c 1 = 0
于是对所有v i v_i v i 做一遍可以得到c c c 全是0 0 0 ,得证.
任意复向量空间上的算子T T T 的所有本征值λ 1 … λ k \lambda_1\ldots \lambda_k λ 1 … λ k 满足
⨁ i G ( λ i , T ) = V ∑ i dim G ( λ i , T ) = dim V ∃ e 1 … e n , e i is generalized eigenvector , { e n } is basis of V ( T − λ i I ) ∣ G ( λ i , T ) is nilpotent \begin{gathered}
\bigoplus_i G(\lambda_i,T)=V \\
\sum_i \dim G(\lambda_i,T)=\dim V \\
\exists e_1\ldots e_n,e_i \text{ is generalized eigenvector} ,\{ e_n \} \text{ is basis of } V \\
(T-\lambda_iI)\vert_{G(\lambda_i,T)} \text{is nilpotent}
\end{gathered} i ⨁ G ( λ i , T ) = V i ∑ dim G ( λ i , T ) = dim V ∃ e 1 … e n , e i is generalized eigenvector , { e n } is basis of V ( T − λ i I ) ∣ G ( λ i , T ) is nilpotent
先证第一行.
归纳,因为T T T 有本征值,取一本征值λ \lambda λ ,则 V = G + range ( T − λ I ) V=G+\operatorname{range} (T-\lambda I) V = G + range ( T − λ I ) , U = range T − λ I U=\operatorname{range} T-\lambda I U = range T − λ I 在T T T 下不变,于是对T ∣ U T\vert_U T ∣ U 给出U U U 的分解再加上G ( λ , T ) G(\lambda,T) G ( λ , T ) 即可.
显然T ∣ U T\vert_U T ∣ U 不会有λ \lambda λ 作为本征值.证明是成立的.
第一行成立后第二行第三行是显然的.第四行不需要第一行就是显然的.
为什么你不能对普通本征空间这么干而必须广义呢?因为普通本征空间没有 null T − λ I ⊕ range T − λ I = V \operatorname{null} T-\lambda I\oplus \operatorname{range} T-\lambda I=V null T − λ I ⊕ range T − λ I = V 的性质,你分解的时候递归不下去(去掉E ( λ , I ) E(\lambda,I) E ( λ , I ) 剩下的不是不变子空间)
代数重数,几何重数
代数重数 = dim G ( λ , T ) 几何重数 = dim E ( λ , T ) \begin{gathered}
\text{代数重数} =\dim G(\lambda,T) \\
\text{几何重数} =\dim E(\lambda,T)
\end{gathered} 代数重数 = dim G ( λ , T ) 几何重数 = dim E ( λ , T )
若T T T 有本征值λ 1 … λ m \lambda_1\ldots \lambda_m λ 1 … λ m ,则存在一组基使得 M ( T ) = Diag ( A 1 , … , A m ) \mathcal M( T ) =\operatorname{Diag}(A_1,\ldots,A_m) M ( T ) = Diag ( A 1 , … , A m ) 其中每个A A A 为对角线上全为λ \lambda λ 的上三角矩阵.
我们已经说明了V = ⨁ i G ( λ i , T ) V=\bigoplus_i G(\lambda_i,T) V = ⨁ i G ( λ i , T ) ,则取所有广义本征向量做基就有 A i = M ( T ∣ G ( λ i , T ) ) A_i=\mathcal M( T\vert_{G(\lambda_i,T)} ) A i = M ( T ∣ G ( λ i , T ) ) ,又因为
我们知道T ∣ G ( λ i , T ) − λ i I T\vert_{G(\lambda_i,T)}-\lambda_i I T ∣ G ( λ i , T ) − λ i I 是幂零的,于是它有一个严格上三角,那么你再加回去λ i I \lambda_i I λ i I 就满足条件了.
我们希望进一步改进这个结果,就要改进幂零算子的结构:
幂零算子N N N 满足,存在v 1 … v k ∈ V , m 1 … m k ∈ N v_1\ldots v_k\in V,m_1\ldots m_k\in N v 1 … v k ∈ V , m 1 … m k ∈ N 使得:
v 1 , N v 1 , … , N m 1 v 1 , v 2 , N v 2 , … , N m 2 v 2 , … , N v n , … N m k v n v_1,Nv_1,\ldots, N^{m_1}v_1,v_2,Nv_2,\ldots, N^{m_2}v_2,\ldots,Nv_n,\ldots N^{m_k}v_n v 1 , N v 1 , … , N m 1 v 1 , v 2 , N v 2 , … , N m 2 v 2 , … , N v n , … N m k v n 是V V V 的基.
∀ i , N m i + 1 v i = 0 \forall i,N^{m_i+1}v_i=0 ∀ i , N m i + 1 v i = 0
你可以发现,在这组基下,幂零算子被干成了分块对角矩阵,且每个块内只有对角线上面一条对角线是1 1 1 ,其余位置是0 0 0 .
考虑归纳法,归纳就要找不变子空间,比如找到 range N \operatorname{range} N range N ,显然 dim range N < dim V \dim \operatorname{range} N<\dim V dim range N < dim V ,于是 N ∣ range N N\vert_{\operatorname{range} N} N ∣ range N 有这样一组基 v 1 … v k ∈ range N , m 1 … m k ∈ N v_1\ldots v_k\in \operatorname{range} N,m_1\ldots m_k\in N v 1 … v k ∈ range N , m 1 … m k ∈ N 满足基的条件.
v i ∈ range N ⟹ ∃ u i , N u i = v i \begin{gathered}
v_i\in\operatorname{range} N \\
\implies \exists u_i,Nu_i=v_i
\end{gathered} v i ∈ range N ⟹ ∃ u i , N u i = v i
于是用u 1 … u k u_1\ldots u_k u 1 … u k 替换v 1 … v k v_1\ldots v_k v 1 … v k 并加入他们自己,得到 N m 1 u 1 , … , u 1 , … , N m k u k , … , u k = { e n } N^{m_1}u_1,\ldots, u_1,\ldots, N^{m_k}u_k,\ldots, u_k = \{ e_n \} N m 1 u 1 , … , u 1 , … , N m k u k , … , u k = { e n } .
考虑若 ∑ i = 1 n c i e i = 0 \sum _{i = 1} ^{n} c_ie_i=0 ∑ i = 1 n c i e i = 0 ,则 0 = ∑ i = 1 n c i N e i 0=\sum _{i = 1} ^{n} c_iNe_i 0 = ∑ i = 1 n c i N e i ,但N e i Ne_i N e i 是 range V \operatorname{range} V range V 的基是不相关的.于是e e e 线性无关.
那么考虑又添加 w 1 … w l w_1\ldots w_l w 1 … w l 扩充得 e 1 … e n , w 1 … w l e_1\ldots e_n,w_1\ldots w_l e 1 … e n , w 1 … w l 是基.对任意w w w ,一定有 w ∉ range N w\notin \operatorname{range} N w ∈ / range N ,而现在的唯一问题是N w Nw N w 可能不为0 0 0 ,注意到因为 span ( { N e i } ) = range N \operatorname{span}( \{ Ne_i \} ) =\operatorname{range} N span ({ N e i }) = range N ,于是 ∃ x ∈ span ( { e i } ) , N x = N w \exists x\in \operatorname{span}( \{ e_i \} ) ,Nx=Nw ∃ x ∈ span ({ e i }) , N x = N w ,于是取e n + i = w i − x i e_{n+i}=w_i-x_i e n + i = w i − x i 即可.
于是你构造出了N N N 的基,归纳得证.
[think] 归纳解决存在基满足xx的问题是有效的(复向量的上三角,两种谱定理,到这个Jordan分解等等),要有条件构造不变子空间.
同时这个是在说,幂零矩阵满足存在一组基使得它的矩阵是分块对角矩阵,且每个块只有对角线上方的一行斜线元素都是1 1 1 ,其他都是0 0 0 .
Jordan分解
存在一组基e e e 满足
M ( T , e ) = Diag ( A i … A k ) , A i = λ i I + [ 0 , 1 , 0 … , 0 0 , 0 , 1 , … , 0 … 0 , 0 , … , 0 , 1 0 , 0 , … , 0 , 0 ] \begin{gathered}
\mathcal M( T,e ) =\operatorname{Diag}(A_i\ldots A_k), \\
A_i=\lambda_i I+
\begin{bmatrix}
0,1,0\ldots,0 \\
0,0,1,\ldots,0 \\
\ldots \\
0,0,\ldots,0,1 \\
0,0,\ldots,0,0
\end{bmatrix}
\end{gathered} M ( T , e ) = Diag ( A i … A k ) , A i = λ i I + 0 , 1 , 0 … , 0 0 , 0 , 1 , … , 0 … 0 , 0 , … , 0 , 1 0 , 0 , … , 0 , 0
水到渠成了.
每组λ \lambda λ 相同的块A i A_i A i 对应了一个T ∣ G ( λ i , T ) T\vert_{G(\lambda_i,T)} T ∣ G ( λ i , T ) ,而已知T ∣ G ( λ i , T ) − λ I T\vert_{G(\lambda_i,T)}-\lambda I T ∣ G ( λ i , T ) − λ I 是幂零的,而刚才说过幂零矩阵有由只有对角线上方一斜线是1 1 1 的块构成的分块对角矩阵,再加上λ I \lambda I λ I 就是这样了.
平方根
( 1 + x ) 1 2 = ∑ i = 0 ∞ ( 1 2 i ) x i let S n ( x ) = ∑ i = 0 2 ( 1 2 i ) x i ∀ k < n , [ x k ] S n 2 ( x ) = ∑ i = 0 k ( 1 2 i ) ( 1 2 k − i ) = ( 1 k ) = [ k ≤ 1 ] \begin{gathered}
(1+x)^{\frac{1}2}=\sum _{i = 0} ^{\infty} \binom{\frac12}{i}x^i \\
\text{let } S_n(x)=\sum _{i = 0} ^{2} \binom{\frac12}{i}x^i \\
\forall k<n,[x^k]S_n^2(x)=
\sum _{i = 0} ^{k} \binom{\frac12}{i}\binom{\frac12}{k-i} =\binom{1}{k}=[k\le 1]
\end{gathered} ( 1 + x ) 2 1 = i = 0 ∑ ∞ ( i 2 1 ) x i let S n ( x ) = i = 0 ∑ 2 ( i 2 1 ) x i ∀ k < n , [ x k ] S n 2 ( x ) = i = 0 ∑ k ( i 2 1 ) ( k − i 2 1 ) = ( k 1 ) = [ k ≤ 1 ]
于是S n ( x ) S_n(x) S n ( x ) 和1 + x \sqrt{1+x} 1 + x 的前k k k 项一样,而N N N 是幂零的保证了它没有某项以后的,于是只要取一个S n ( N ) S_n(N) S n ( N ) 就是I + N \sqrt{I+N} I + N .
约旦分解,给每个λ I + N \lambda I+N λ I + N 形式找一个平方根,再拼回来.
特征多项式和极小多项式
特征多项式
p ( z ) = ∏ i = 1 k ( z − λ i ) c i c i = dim E ( λ i , T ) \begin{gathered}
p(z)=\prod _{i = 1} ^{k} (z-\lambda_i)^{c_i} \\
c_i=\dim E(\lambda_i,T)
\end{gathered} p ( z ) = i = 1 ∏ k ( z − λ i ) c i c i = dim E ( λ i , T )
特征多项式的次数和零点
deg p ( z ) = dim V p ( z ) = 0 ⟺ z is eigenvalue of T \begin{gathered}
\deg p(z)=\dim V \\
p(z)=0 \iff z \text{ is eigenvalue of } T
\end{gathered} deg p ( z ) = dim V p ( z ) = 0 ⟺ z is eigenvalue of T
Caylay-Hamilton Theorem
T T T 的特征多项式p ( z ) p(z) p ( z ) 满足p ( T ) = 0 p(T)=0 p ( T ) = 0
因为T T T 可以拆成广义本征空间直和上的T ∣ G ( λ i , T ) T\vert_{G(\lambda_i,T)} T ∣ G ( λ i , T ) ,而T ∣ G ( λ i , T ) T\vert_{G(\lambda_i,T)} T ∣ G ( λ i , T ) 是幂零的,于是( T ∣ G ( λ i , T ) − λ i I ) dim G ( λ i , T ) = 0 (T\vert_{G(\lambda_i,T)}-\lambda_iI)^{\dim G(\lambda_i,T)}=0 ( T ∣ G ( λ i , T ) − λ i I ) d i m G ( λ i , T ) = 0 .
而p ( T ) p(T) p ( T ) 显然包含这个因子,于是每个G ( λ i , T ) G(\lambda_i,T) G ( λ i , T ) 上都有p ( T ∣ G λ i , T ) = 0 p(T\vert_{G\lambda_i,T})=0 p ( T ∣ G λ i , T ) = 0 ,于是p ( T ) = 0 p(T)=0 p ( T ) = 0
极小多项式
对于T T T ,p ( z ) p(z) p ( z ) 是满足最高次项为1 1 1 且p ( T ) = 0 p(T)=0 p ( T ) = 0 的多项式中次数最小的一个.
assume p , q is minimal polynomial p ( T ) = 0 , q ( T ) = 0 , deg p = deg q ⟹ ( p − q ) ( T ) = 0 , deg p − q < min ( deg p , deg q ) \begin{gathered}
\text{assume }p,q \text{ is minimal polynomial} \\
p(T)=0,q(T)=0,\deg p=\deg q \\
\implies (p-q)(T)=0,\deg p-q<\min(\deg p,\deg q)
\end{gathered} assume p , q is minimal polynomial p ( T ) = 0 , q ( T ) = 0 , deg p = deg q ⟹ ( p − q ) ( T ) = 0 , deg p − q < min ( deg p , deg q )
于是和p , q p,q p , q 极小矛盾,得证.
任意满足q ( T ) = 0 q(T)=0 q ( T ) = 0 的多项式是极小多项式p ( z ) p(z) p ( z ) 的倍式.
考虑q m o d p = f , f ≠ 0 q \bmod p=f,f\ne 0 q mod p = f , f = 0 ,则f ( T ) = q ( T ) − k p ( T ) = 0 f(T)=q(T)-kp(T)=0 f ( T ) = q ( T ) − k p ( T ) = 0 且deg f < deg p \deg f<\deg p deg f < deg p ,则与p p p 极小矛盾.得证.
T T T 的本征值是其极小多项式p ( z ) p(z) p ( z ) 的零点
若T v = λ v Tv=\lambda v T v = λ v ,p ( T ) = 0 p(T)=0 p ( T ) = 0 ,则p ( T ) v = p ( λ ) v = 0 p(T)v=p(\lambda)v=0 p ( T ) v = p ( λ ) v = 0 ,于是p ( λ ) = 0 p(\lambda)=0 p ( λ ) = 0 .
若p ( λ ) = 0 p(\lambda)=0 p ( λ ) = 0 且λ \lambda λ 不是本征值,则T − λ I T-\lambda I T − λ I 是满秩的,则设p ( T ) = ( T − λ I ) q ( T ) p(T)=(T-\lambda I)q(T) p ( T ) = ( T − λ I ) q ( T ) ,p ( T ) = 0 ⟺ q ( T ) = 0 p(T)=0 \iff q(T)=0 p ( T ) = 0 ⟺ q ( T ) = 0 ,与p p p 极小矛盾.
得证.
实向量空间复化
复化
V V V 的复化是V C = V × V V_C=V\times V V C = V × V ,但是把( u , v ) (u,v) ( u , v ) 写作u + i v u+iv u + i v .
T T T 的复化是T C ( u + i v ) = T u + i T v T_C(u+iv)=Tu+iTv T C ( u + i v ) = T u + i T v
共轭
u + i v ‾ = u − i v \overline{ u+iv } =u-iv u + i v = u − i v
T ‾ v = T ( v ‾ ) ‾ \overline{ T } v=\overline{ T(\overline{ v } ) } T v = T ( v )
容易验证 T ‾ \overline{ T } T 之间的加法,数乘,复合( S ‾ ∘ T ‾ = S T ‾ \overline{ S } \circ \overline{T}=\overline{ST} S ∘ T = S T )运算是有共轭的性质的.
知乎老哥提醒大家, 复向量空间取共轭的操作是依赖额外结构的,不是所有复向量空间都是某个实向量空间的复化.
考虑它的复化T C T_C T C 一定有本征值,设为λ = a + b i \lambda=a+bi λ = a + bi .
那么对任意u + v i u+vi u + v i ,T ( u + v i ) = ( a + b i ) ( u + v i ) = a u − b v + i ( a v + b u ) T(u+vi)=(a+bi)(u+vi)=au-bv + i(av+bu) T ( u + v i ) = ( a + bi ) ( u + v i ) = a u − b v + i ( a v + b u )
于是u , v u,v u , v 张成的二维不变子空间在T T T 下不变.
复化保持基不变
复化保持矩阵不变
复化保持极小多项式不变
复化后的实本征值是复化前的本征值
复本征值以共轭的形式成对出现,重数相等
第一条,对一组基e 1 … e n e_1\ldots e_n e 1 … e n ,有 u ∈ span ( e ) , v ∈ span ( i e 1 , … , i e n ) u\in \operatorname{span}( e ) ,v\in \operatorname{span}( ie_1,\ldots,ie_n ) u ∈ span ( e ) , v ∈ span ( i e 1 , … , i e n ) ,得证.
第二条,因为基不变所以矩阵不变.
第三条,考虑p ( T ) = 0 p(T)=0 p ( T ) = 0 显然有p ( T C ) = 0 p(T_C)=0 p ( T C ) = 0 .而若q ( T C ) = 0 q(T_C)=0 q ( T C ) = 0 ,取每个系数的实部得到新的多项式r ( T C ) r(T_C) r ( T C ) 一定有r ( T C ) v = 0 , ∀ v ∈ V r(T_C)v=0,\forall v\in V r ( T C ) v = 0 , ∀ v ∈ V .于是若p p p 是T T T 的极小多项式,那么不能存在q ( T C ) = 0 q(T_C)=0 q ( T C ) = 0 且deg q < deg p \deg q<\deg p deg q < deg p ,于是p p p 也是T C T_C T C 的极小多项式.
这也保证了复化出来的变换的极小多项式系数都是实数.
第四条,本征值是极小多项式的零点,极小多项式不变故本征值不变.
第五条,极小多项式系数都是实数于是在实数下可以分解成若干一次项和二次函数的乘积,分别对应了单独出现的实本征值和成对出现的复本征值.
T T T 的特征多项式定义为T C T_C T C 的特征多项式.
我们要说明这个定义的合理性:
考虑:
λ \lambda λ 与 λ ‾ \overline{ \lambda } λ 重数相同.
( T − λ I ) k v = 0 ⟹ ( T − λ I ) k v ‾ = 0 ( T − λ ‾ I ) k v ‾ = 0 \begin{gathered}
(T-\lambda I)^kv=0 \\
\implies \overline{ (T-\lambda I)^k v } =0 \\
(T-\overline{\lambda}I)^k \overline{ v }=0
\end{gathered} ( T − λ I ) k v = 0 ⟹ ( T − λ I ) k v = 0 ( T − λ I ) k v = 0
于是若v 1 … v k v_1\ldots v_k v 1 … v k 是G ( λ , T ) G(\lambda,T) G ( λ , T ) 的基,那么 v 1 ‾ , … , v n ‾ \overline{ v_1 } ,\ldots, \overline{v_n} v 1 , … , v n 是G ( λ ‾ , T ) G(\overline{\lambda},T) G ( λ , T ) 的基,得证.
于是你只要把成对出现的( x − λ ) ( x − λ ‾ ) (x-\lambda)(x-\overline{\lambda}) ( x − λ ) ( x − λ ) 合成一个就可以得到实系数二次式.
于是系数全是实的.
实空间的正规算子
我们定义
内积的复化
< a + b i , c + d i > = < a + b i , c > + i < a + b i , d > = < c , a + b i > ‾ + i < d , a + b i > ‾ = < a , c > − < b , c > i + i < a , d > + < b , d > = ( < a , c > + < b , d > ) + i ( < a , d > − < b , c > ) \begin{gathered}
<a+bi,c+di> \\
=<a+bi,c>+i<a+bi,d>
=\overline{ <c,a+bi> } +i \overline{ <d,a+bi> } \\
=<a,c>-<b,c>i+i<a,d>+<b,d> \\
=(<a,c>+<b,d>) + i(<a,d>-<b,c>)
\end{gathered} < a + bi , c + d i > =< a + bi , c > + i < a + bi , d >= < c , a + bi > + i < d , a + bi > =< a , c > − < b , c > i + i < a , d > + < b , d > = ( < a , c > + < b , d > ) + i ( < a , d > − < b , c > )
我们定义的复化的内积也满足内积的定义.
( T C ) ∗ = ( T ∗ ) C (T_C)^*=(T^*)_C ( T C ) ∗ = ( T ∗ ) C
正规算子的复化还是正规算子.
第一条容易验证是对的.
第二条考虑
< T ( a + b i ) , c + d i > = ( < T a , c > + < T b , d > + i ( < T a , d > − < T b , c > ) ) = ( < a , T ∗ c > + < b , T ∗ d > + i ( < a , T ∗ d > − < b , T ∗ c > ) ) = < a + b i , T ∗ ( c + d i ) > \begin{gathered}
<T(a+bi),c+di> \\
=(<Ta,c>+<Tb,d>+i(<Ta,d>-<Tb,c>)) \\
=(<a,T^*c>+<b,T^*d>+i(<a,T^*d>-<b,T^*c>)) \\
=<a+bi,T^*(c+di)>
\end{gathered} < T ( a + bi ) , c + d i > = ( < T a , c > + < T b , d > + i ( < T a , d > − < T b , c > )) = ( < a , T ∗ c > + < b , T ∗ d > + i ( < a , T ∗ d > − < b , T ∗ c > )) =< a + bi , T ∗ ( c + d i ) >
第三条考虑T T ∗ = T ∗ T , T C ( T C ) ∗ = T C ( T ∗ ) C = ( T T ∗ ) C = ( T ∗ T ) C = T C ( T C ) ∗ TT^*=T^*T,T_C(T_C)^*=T_C(T^*)_C=(TT^*)_C=(T^*T)_C=T_C(T_C)^* T T ∗ = T ∗ T , T C ( T C ) ∗ = T C ( T ∗ ) C = ( T T ∗ ) C = ( T ∗ T ) C = T C ( T C ) ∗
T is normal ⟺ ∃ e 1 … e n is orthonormal basis , M ( T , e ) = Diag ( A 1 … A k ) , A k = [ x ] or A = [ a − b b a ] \begin{gathered}
T \text{ is normal} \\
\iff \exists e_1\ldots e_n \text{ is orthonormal basis }, \\
\mathcal M( T,e ) = \operatorname{Diag}(A_1\ldots A_k) , \\
A_k= [x] \text{ or } A=\begin{bmatrix}
a\ -b \\
b\ a
\end{bmatrix}
\end{gathered} T is normal ⟺ ∃ e 1 … e n is orthonormal basis , M ( T , e ) = Diag ( A 1 … A k ) , A k = [ x ] or A = [ a − b b a ]
于是我们复化得到T C T_C T C ,T C T_C T C 是正规的,有谱定理,存在一组本征向量构成的规范正交基.
考虑规范正交基的每个本征值λ i \lambda_i λ i
若λ i ∈ R , ( a + b i ) ∈ E ( λ i , T C ) \lambda_i\in R,(a+bi)\in E(\lambda_i,T_C) λ i ∈ R , ( a + bi ) ∈ E ( λ i , T C ) ,则T ( a + b i ) = λ i a + λ i b i T(a+bi)=\lambda_i a+\lambda_i bi T ( a + bi ) = λ i a + λ i bi ,于是可以分离实部虚部,则a , b ∈ E ( λ i , T ) a,b\in E(\lambda_i,T) a , b ∈ E ( λ i , T ) .
若λ i = a + b i ∉ R \lambda_i=a+bi\not\in R λ i = a + bi ∈ R ,有a − b i a-bi a − bi 也是重数相等的本征值,从两个对应的本征空间中分别取一个向量c + d i , c − d i c+di,c-di c + d i , c − d i .
{ T ( c + d i ) = ( a + b i ) ( c + d i ) T ( c − d i ) = ( a − b i ) ( c − d i ) ⟹ { T c = a c − b d T d = b c + a d \begin{gathered}
\begin{cases}
T(c+di)=(a+bi)(c+di) \\
T(c-di)=(a-bi)(c-di)
\end{cases} \\
\implies
\begin{cases}
Tc=ac-bd \\
Td=bc+ad
\end{cases} \\
\end{gathered} { T ( c + d i ) = ( a + bi ) ( c + d i ) T ( c − d i ) = ( a − bi ) ( c − d i ) ⟹ { T c = a c − b d T d = b c + a d
于是T T T 在c , d c,d c , d 长成的二维子空间不变.
因为你复的情况是有n n n 个本征值的,于是你这么做能得到V V V 的子空间分解U 1 … U k U_1\ldots U_k U 1 … U k ,dim U k ≤ 2 \dim U_k\le 2 dim U k ≤ 2 .
且对于dim U k = 2 \dim U_k=2 dim U k = 2 ,就用d , c d,c d , c 做基它的矩阵看起来是
[ b , a − a , b ] \begin{gathered}
\begin{bmatrix}
b, a \\
-a, b
\end{bmatrix}
\end{gathered} [ b , a − a , b ]
即为所证.
T is isometry ⟺ ∃ e 1 … e n is orthonormal basis M ( T , e ) = Diag ( A 1 … A k ) , A k = [ x ] or A = [ cos θ − sin θ sin θ cos θ ] \begin{gathered}
T \text{ is isometry} \\
\iff \exists e_1\ldots e_n \text{ is orthonormal basis} \\
\mathcal M( T,e ) =\operatorname{Diag}(A_1\ldots A_k), \\
A_k=[x] \text{ or } A=\begin{bmatrix}
\cos\theta\ -\sin\theta \\
\sin\theta\ \cos\theta
\end{bmatrix}
\end{gathered} T is isometry ⟺ ∃ e 1 … e n is orthonormal basis M ( T , e ) = Diag ( A 1 … A k ) , A k = [ x ] or A = [ cos θ − sin θ sin θ cos θ ]
整个证明流程与正规完全一致.只不过最后那个矩阵中 ∣ a + b i ∣ = 1 \vert a +bi\vert=1 ∣ a + bi ∣ = 1 ,所以能化出来cos , sin \cos,\sin cos , sin 形式.
矩阵
基变更公式
设两组基e 1 … e n e_1\dots e_n e 1 … e n ,f 1 … f n f_1\ldots f_n f 1 … f n ,M M M 是T T T 在f f f 下的矩阵,有矩阵A A A 满足
A f i = ∑ j = 1 n A j , i e j \begin{gathered}
Af_i=\sum _{j = 1} ^{n} A_{j,i}e_j
\end{gathered} A f i = j = 1 ∑ n A j , i e j
则A M A − 1 AMA^{-1} A M A − 1 是T T T 在e e e 下的变换矩阵.
你直接尝试理解就好了:A v Av A v 就是把f f f 表示下的向量变成了e e e 表示的向量.
另外,我们设E = [ e 1 … e n ] E=[e_1\ldots e_n] E = [ e 1 … e n ] ,F = [ f 1 … f n ] F=[f_1\ldots f_n] F = [ f 1 … f n ] ,则A = F − 1 E A=F^{-1}E A = F − 1 E .(其实就是到标准基的基变换).
迹
trace T = ∑ i = 1 n λ i trace M ( T ) = ∑ i = 1 n M ( T ) i , i \begin{gathered}
\operatorname{trace} T=\sum _{i = 1} ^{n} \lambda_i
\operatorname{trace} \mathcal M( T ) =\sum _{i = 1} ^{n} \mathcal M( T ) _{i,i}
\end{gathered} trace T = i = 1 ∑ n λ i trace M ( T ) = i = 1 ∑ n M ( T ) i , i
注意λ \lambda λ 按代数重数重复.实向量空间的先复化.
trace A B = trace B A \begin{gathered}
\operatorname{trace} AB=\operatorname{trace} BA
\end{gathered} trace A B = trace B A
∑ i = 1 n ( A B ) i , i = ∑ i = 1 n ∑ j = 1 n A i , j B j , i ∑ i = 1 n ( B A ) i , i = ∑ i = 1 n ∑ j = 1 n B i , j A j , i \begin{gathered}
\sum _{i = 1} ^{n} (AB)_{i,i}=\sum _{i = 1} ^{n} \sum _{j = 1} ^{n} A_{i,j}B_{j,i} \\
\sum _{i = 1} ^{n} (BA)_{i,i}=\sum _{i = 1} ^{n} \sum _{j = 1} ^{n} B_{i,j}A_{j,i}
\end{gathered} i = 1 ∑ n ( A B ) i , i = i = 1 ∑ n j = 1 ∑ n A i , j B j , i i = 1 ∑ n ( B A ) i , i = i = 1 ∑ n j = 1 ∑ n B i , j A j , i
交换求和号显然相等.
trace T = trace M ( T ) \begin{gathered}
\operatorname{trace} T=\operatorname{trace} \mathcal M( T )
\end{gathered} trace T = trace M ( T )
实空间先复化.考虑复空间.
那么有一组基使得 M ( T ) \mathcal M( T ) M ( T ) 是上三角矩阵A A A ,此时显然成立.
而根据基变换公式,任意一组基下的 M ( T ) = Q A Q − 1 \mathcal M( T ) =QAQ^{-1} M ( T ) = Q A Q − 1 .
trace Q A Q − 1 = trace A Q Q − 1 = trace A = trace T \begin{gathered}
\operatorname{trace} QAQ{-1}=\operatorname{trace} AQQ^{-1}=\operatorname{trace} A=\operatorname{trace} T
\end{gathered} trace Q A Q − 1 = trace A Q Q − 1 = trace A = trace T
行列式
定义为∏ i λ i \prod_i \lambda_i ∏ i λ i .同样按重数重复.同样复化.
T T T 的特征多项式等于det ( z I − T ) \det(zI-T) det ( z I − T )
考虑在T T T 有一组基是上三角矩阵,此时容易看出z I − T zI-T z I − T 的特征值就是所有z − λ i z-\lambda_i z − λ i ,结束.
det M = ∑ p ∏ i = 1 n M i , p i ( − 1 ) rev ( p ) \begin{gathered}
\det M=\sum _{p} \prod _{i = 1} ^{n} M_{i,p_i}(-1)^{\operatorname{rev}(p)}
\end{gathered} det M = p ∑ i = 1 ∏ n M i , p i ( − 1 ) rev ( p )
很难的啊
证明路径大概是,我们先说明行列式的det ( A B ) = det A det B \det(AB)=\det A\det B det ( A B ) = det A det B ,然后通过分解M = L U M=LU M = LU 算出是特征值之积这样.
而这个公式是怎么来的呢,大概是我们先规定有:
多重线性:对每一行线性(齐性和加性)
交替:交换两行,行列式取反
单位:det I = 1 \det I=1 det I = 1
通过这三条可以容易的算出来行列式的这个表示,每行线性你就把一行拆成对n n n 个这一行只有一个元素其余都是0 0 0 的矩阵累加,再把这个非零元提到矩阵外面变成常数,每一行都这么干,则问题就变成了若干个全1 1 1 的置换矩阵乘上系数,你再发现置换矩阵的行列式根据第二条第三条性质会写成排列逆序对就做完了.
那怎么说明矩阵乘积的行列式不变呢?
这里gemini用的方法是定义函数 F ( A ) = A B det B ) F(A)=\dfrac{AB}{\det B} ) F ( A ) = det B A B ) ,证明它满足行列式的三条规定,而三条规定等价于行列式,于是F ( A ) = det A F(A)=\det A F ( A ) = det A .
第三条显然,第一条第二条考虑A B AB A B 本来就是B B B 乘上A A A 的每一行拼起来所以也显然.
然后你就可以推出这种定义和特征根乘积定义的等价性了.
第三版的内容到此结束.剩下的随缘更.
补充
Gershgorin
矩阵A A A 的所有特征值λ \lambda λ 都满足存在k k k 使得
∣ λ − A k , k ∣ ≤ ∑ i ≠ k ∣ A i , k ∣ \begin{gathered}
\vert \lambda-A_{k,k} \vert \le \sum_{i\ne k} \vert A_{i,k} \vert
\end{gathered} ∣ λ − A k , k ∣ ≤ i = k ∑ ∣ A i , k ∣
考虑一组A v = λ v Av=\lambda v A v = λ v
则选取v v v 绝对值最大的分量v k v_k v k ,那么它满足:
∑ i A k , i v i = λ v k ⟹ ( λ − A k , k ) v k = ∑ i ≠ k A k , i v i ⟹ ∣ ( λ − A k , k ) v k ∣ = ∣ ∑ i ≠ k A k , i v i ∣ ⟹ ∣ λ − A k , k ∣ ∣ v k ∣ ≤ ∑ i ≠ k ∣ A k , i ∣ ∣ v k ∣ \begin{gathered}
\sum_i A_{k,i}v_i=\lambda v_k \\
\implies (\lambda-A_{k,k})v_k=\sum_{i\ne k}A_{k,i}v_i \\
\implies \vert (\lambda-A_{k,k})v_k \vert =\vert \sum_{i\ne k}A_{k,i}v_i \vert \\
\implies \vert \lambda-A_{k,k} \vert \vert v_k \vert \le \sum_{i\ne k} \vert A_{k,i} \vert \vert v_k \vert
\end{gathered} i ∑ A k , i v i = λ v k ⟹ ( λ − A k , k ) v k = i = k ∑ A k , i v i ⟹ ∣ ( λ − A k , k ) v k ∣ = ∣ i = k ∑ A k , i v i ∣ ⟹ ∣ λ − A k , k ∣∣ v k ∣ ≤ i = k ∑ ∣ A k , i ∣∣ v k ∣
除过去即证.
关于交换矩阵
A B = B A ⟹ E ( λ , A ) is invariant to B \begin{gathered}
AB=BA \implies E(\lambda,A) \text{ is invariant to } B
\end{gathered} A B = B A ⟹ E ( λ , A ) is invariant to B
A B v = B A V ⟹ A ( B v ) = λ ( B v ) \begin{gathered}
ABv=BAV \\
\implies A(Bv)=\lambda (Bv)
\end{gathered} A B v = B A V ⟹ A ( B v ) = λ ( B v )
从同时对角化推交换是显然的.
考虑现在A B = B A AB=BA A B = B A ,那由上面的不变性可以考虑B ∣ E ( λ , A ) B\vert_{E(\lambda,A)} B ∣ E ( λ , A ) ,注意到它一定也是可对角化的(为什么呢,考虑可对角化等价于极小多项式无重根,而B ∣ E ( λ , A ) B\vert_{E(\lambda,A)} B ∣ E ( λ , A ) 的的极小多项式是B B B 的因数).那么你可以在这一小块把B ∣ E ( λ , A ) B\vert_{E(\lambda,A)} B ∣ E ( λ , A ) 对角化,而A ∣ E ( λ , A ) A\vert_{E(\lambda,A)} A ∣ E ( λ , A ) 一定是对角阵,每块都这么做一下就好了.
感觉把舒尔定理取一个特征向量那步改成取公共特征向量是不是就行了.