- 线性代数(全国中医药行业高等教育“十四五”规划教材)
- 李秀昌主编
- 813字
- 2024-10-30 08:51:27
1.3.2 余子式与代数余子式
一般地,低阶行列式比高阶行列式较易于计算,在把高阶行列式变成低阶行列式时,要把行列式按一行(列)展开,这样要用到代数余子式的概念.
由三阶行列式的对角线法则,得到
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_48.jpg?sign=1738890755-CAcNm1u9zWslnUJqx77YST0iTg8aeK9l-0-d6da5bbcdca87a22608cfaee2955a150)
=a11a22a33+a12a23a31+a13a21a32-a13a22a31-a12a21a33-a11a23a32
=a11(a22a33-a23a32)-a12(a21a33-a23a31)+a13(a21a32-a22a31)
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_49.jpg?sign=1738890755-zEIjh7AyyXKRQeHwPUUalOuKhFGSeLZh-0-a5612458df43b63c6c145f69edb25db2)
(1-13)
在式1-13中,二阶行列式
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_50.jpg?sign=1738890755-G8OBrAuk1wVLUDZmR0KpF3qlTnBZ2WKk-0-c823e9b6c20d99100966ee45cf3ce824)
就是在原行列式中将元素a11所在的行与列划去后,剩下的元素按原来的相对位置组成的低一阶的行列式.这样的行列式称为a11的余子式,记为M11.又如,a22,a32的余子式分别为
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_51.jpg?sign=1738890755-jgYE3JrEaNywoVOZXroPFP1sXrM1BlXc-0-28dc9cf8b52498c0f9a3aa3b95c9bbe8)
定义1 在n阶行列式中,划去元素aij所在的第i行和第j列后,余下的n-1阶行列式称为元素aij的余子式,记为Mij.元素aij的余子式Mij乘以(-1)i+j后得到的式子,称为aij的代数余子式,记为Aij,即
Aij=(-1)i+jMij
(1-14)
如,在上面的三阶行列式中,第一行元素的代数余子式为
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_52.jpg?sign=1738890755-onfnSdlTUCuBzjUDHVMAK5KVbLHzhUSb-0-e6a4221d3f652f1decbbe95ace8fc47f)
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_53.jpg?sign=1738890755-ebW2HmaCzAb9y7cGyyfjuEd5jlNZv4be-0-25d1e3fa5d363a50fcadfc5356acf9e8)
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_54.jpg?sign=1738890755-hqGtXWKvWNfUnAh6ZBWOz5W3ZIHQ3gnO-0-9041070c1e036f5c4dd4e5ad52ef4125)
这样,式1-13可以写成第一行元素与相应代数余子式乘积之和,即
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_55.jpg?sign=1738890755-CANE3qGAZjCdWldrxirRbLrZMR7F8j9c-0-64b9faa03595c67f351428cd95301331)
一般地,有如下的行列式展开定理.
定理1 n阶行列式等于其任一行(列)所有元素与相应代数余子式的乘积之和,即
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_56.jpg?sign=1738890755-Mx1gDWHlumTcgLpNJpSQeZaq4ReyxNfK-0-94d9494d4ee65461efa4702542799679)
(1-15)
其中,等号上方写(i),表示n阶行列式按第i行展开.
证明 (1)先证最特殊的情况,即第一行只有a11≠0,而其余元素均为零的情况.
由行列式的定义知,每一项都必须含有第一行的一个元素,但第一行只有a11≠0,所以一般项可写成
(-1)τ(1j2j3…jn)a11a2j2…anjn=a11[(-1)τ(j2j3…jn)a2j2…anjn]
上式等号右边括号内的式子正是M11的一般项,所以D=a11M11=a11(-1)1+1M11=a11A11.
(2)再证行列式D中第i行第j列元素aij≠0,其余元素均为零的情况.
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_57.jpg?sign=1738890755-fCZ6tu4vv95c1xU3S1G3pGce7cZrSMJz-0-dec6324025c5d698fb8da3e3a35a42c5)
先进行交换,将D中的第i行,经过i-1次交换到第1行;再进行列的交换,经过j-1次交换到第1列,共经过了i+j-2次交换,得行列式
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_58.jpg?sign=1738890755-DwRFtAmqkUKp4usdcsTH0rp9ffQYUCPA-0-da1acd8dbb27790971b264e265551a51)
(3)最后证一般情形,可把行列式D写成如下形式
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_59.jpg?sign=1738890755-el1NeMEGBWbGBQS0bUFHm0TVSQr4wgrf-0-86d5730f3c4464d43067d34ae2206f2c)
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_60.jpg?sign=1738890755-z47mQRgwD7K8Zm3Y0PU3NermZQY2ZsvU-0-6da395b49f479cfdc8e6305d385a775f)
=ai1Ai1+ai2Ai2+…+ainAin
定理得证.
例3 分别按第一行与第二列展开行列式.
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_61.jpg?sign=1738890755-ouTuX9u4ARHT2HQ3TwWyz3Z1nQkfnTst-0-d7c71fb648893c1dafa32662fea6c8f1)
解 ①按第一行展开,得到
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_62.jpg?sign=1738890755-sBP1XXLuLfctiKybllTIYIZ02LB3vrIS-0-72e8f8f3db3bae28f7688d694466ed01)
②按第二列展开
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_63.jpg?sign=1738890755-NBGJNKvQY5jY2dIzk9mwinplBrC5pgDN-0-6f7ed716ac7b959bfa588bd766827fe7)
定理2 n阶行列式D=det(aij)的某一行(列)的元素与另一行(列)的对应元素的代数余子式乘积之和等于零,即
ai1Aj1+ai2Aj2+…+ainAjn=0 (i≠j)
a1iA1j+a2iA2j+…+aniAnj=0 (i≠j)
(1-16)
证明 将行列式D按第j行展开有
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_64.jpg?sign=1738890755-R0SDypVWXUOwh26qa1C093D94ivXHKC8-0-a916b3558c1fd25f413b426c8e8026f7)
把上式中的ajk换成aik(k=1,2,…n),得到
![](https://epubservercos.yuewen.com/0D6C64/29738146003799206/epubprivate/OEBPS/Images/txt001_65.jpg?sign=1738890755-Ir7YAlzhYEredL8EhnRQ3HxtmCSv7i2w-0-0a24a841a2b0bea82f261224a7c929cd)
上式右端当i≠j时,有两行对应元素相同,其行列式的值为零,所以得
ai1Aj1+ai2Aj2+…+ainAjn=0
同理,将行列式D中第i列的元素换为第j列(i≠j)的对应元素,可证D按列展开的结论.