Binet-Cauchy公式

前置知识

设$\left|A\right|$是一个$n$阶行列式,$k<n$
$$\begin{gathered} 1\le i_1<i_2<\cdots <i_k\le n \\ 1\le j_1<j_2<\cdots <j_k\le n \end{gathered}$$
取$\left|\mathbf{A}\right|$中第$i_1,\dots ,i_k$行以及第$j_1,\dots ,j_k$列交点上的元素,按原来$\left|\mathbf{A}\right|$中的相对位置构成一个$k$阶行列式，
我们称为$\mathbf{A}$的$k$阶子式，记为
$$\mathbf{A}\left(\begin{array}{c}{i}_1,\dots ,i_k\\ j_1,\dots ,j_k\end{array}\right)$$

在$\left|\mathbf{A}\right|$中去掉第$i_1,\dots ,i_k$行以及第$j_1,\dots ,j_k$列以后，
剩下的元素，按原来$\left|\mathbf{A}\right|$中的相对位置构成一个$n-k$阶行列式。
这个行列式称为余子式，记为
$$\mathbf{M}\left(\begin{array}{c}{i}_1,\dots ,i_k\\ j_1,\dots ,j_k\end{array}\right)$$
若令$p=i_1+\cdots +i_k,q=j_1+\cdots +j_k$,记
$$\hat{\mathbf{A}}\left(\begin{array}{c}{i}_1,\dots ,i_k\\ j_1,\dots ,j_k\end{array}\right)=(-1{)}^{p+q}\mathbf{M}\left(\begin{array}{c}{i}_1,\dots ,i_k\\ j_1,\dots ,j_k\end{array}\right)$$
称为代数余子式

Laplace展开

设$\left|\mathbf{A}\right|$是一个$n$阶行列式,在$\left|\mathbf{A}\right|$中任取$k$行(列),
那么含于这$k$行（列）的$k$阶子式与它们对应的代数余子式的乘积之和等于$\left|\mathbf{A}\right|$,
即若取定k个行:$1\le i_1<i_2<\cdots <i_k\le n$,则
$$\left|\mathbf{A}\right|=\sum _{1\le j_1<j_2<\cdots <j_k\le n}\mathbf{A}\left(\begin{array}{c}{i}_1,\dots ,i_k\\ j_1,\dots ,j_k\end{array}\right)\hat{\mathbf{A}}\left(\begin{array}{c}{i}_1,\dots ,i_k\\ j_1,\dots ,j_k\end{array}\right)$$
同样的，若取定$k$个列:$1\le j_1<i_2<\cdots <j_k\le n$,则
$$\left|\mathbf{A}\right|=\sum _{1\le i_1<i_2<\cdots <i_k\le n}\mathbf{A}\left(\begin{array}{c}{i}_1,\dots ,i_k\\ j_1,\dots ,j_k\end{array}\right)\hat{\mathbf{A}}\left(\begin{array}{c}{i}_1,\dots ,i_k\\ j_1,\dots ,j_k\end{array}\right)$$

Binet-Cauchy公式

设矩阵${\mathbf{A}}_{n\times m},{\mathbf{B}}_{m\times n}$，则
$$\left|\mathbf{AB}\right|=\{\begin{array}{ll}0,& n>m\\ \left|\mathbf{A}\right|\left|\mathbf{B}\right|,& n=m\\ {\sum }_{1\le j_1<j_2<\cdots <j_n\le m}\mathbf{A}\left(\begin{array}{c}1,\dots ,n\\ j_1,\dots ,j_n\end{array}\right)\mathbf{B}\left(\begin{array}{c}{j}_1,\dots ,j_n\\ 1,\dots ,n\end{array}\right),& n<m\end{array}$$

证明:
$\left(\begin{array}{cc}{\mathbf{I}}_n& -\mathbf{A}\\ 0& {\mathbf{I}}_m\end{array}\right)\left(\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right)=\left(\begin{array}{cc}0& -\mathbf{AB}\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right)$
两边同取行列式
$$\begin{array}{rl}\left|\begin{array}{cc}{\mathbf{I}}_n& -\mathbf{A}\\ 0& {\mathbf{I}}_m\end{array}\right|\left|\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|& =\left|\begin{array}{cc}0& -\mathbf{AB}\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|\\ \left|{\mathbf{I}}_n\right|\left|{\mathbf{I}}_m\right|\left|\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|& =(-1{)}^{mn}\left|-\mathbf{AB}\right|\left|{\mathbf{I}}_m\right|\\ \left|\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|& =(-1{)}^{mn+n}\left|\mathbf{AB}\right|\end{array}$$
$$\Rightarrow \left|\mathbf{AB}\right|=(-1{)}^{mn+n}\left|\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|$$
$$\left(\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right)=\left(\begin{array}{ccccccc}{a}_{11}& a_{1_2}& \cdots & a_{1_m}& 0& 0& \cdots 0\\ a_{21}& a_{2_2}& \cdots & a_{2_m}& 0& 0& \cdots 0\\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ a_{n1}& a_{n2}& \cdots & a_{nm}& 0& 0& \cdots 0\\ 1& 0& \cdots & 0& b_{11}& b_{12}& \cdots b_{1_n}\\ 0& 1& \cdots & 0& b_{21}& b_{22}& \cdots b_{2_n}\\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ 0& 0& \cdots & 1& b_{m1}& b_{m_2}& \cdots b_{m_n}\end{array}\right)$$
使用拉普拉斯
展开前$n$行,只需要取前$m$列，因为前$n$行的其余的列均为$0$
当$n>m$时，$n$阶子式至少有一列$0$，所以
$$\left|\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|=0\Rightarrow \left|\mathbf{AB}\right|=0$$
当$n=m$时
$nm+n=n(n+1)$为偶数
$$\left|\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|=\left|\mathbf{A}\right|\left|\mathbf{B}\right|=(-1{)}^{mn+n}\left|\mathbf{AB}\right|\Rightarrow \left|\mathbf{AB}\right|=\left|\mathbf{A}\right|\left|\mathbf{B}\right|$$
当$n<m$时
$$\left(\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right)=\left(\begin{array}{ccccccc}{a}_{11}& a_{1_2}& \cdots & a_{1_m}& 0& 0& \cdots 0\\ a_{21}& a_{2_2}& \cdots & a_{2_m}& 0& 0& \cdots 0\\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ a_{n1}& a_{n2}& \cdots & a_{nm}& 0& 0& \cdots 0\\ 1& 0& \cdots & 0& b_{11}& b_{12}& \cdots b_{1_n}\\ 0& 1& \cdots & 0& b_{21}& b_{22}& \cdots b_{2_n}\\ \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots \\ 0& 0& \cdots & 1& b_{m1}& b_{m_2}& \cdots b_{m_n}\end{array}\right)$$
设${\mathbf{e}}_i$为第$i$个元素为$1$，其余元素为$0$的向量
设$u_1,u_2,\dots ,u_{m-n}$为$1,2,\dots ,m$去掉$j_1,j_2,\dots ,j_n$后剩下的列

$$\left|\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|=\sum _{1\le j_1<j_2<\cdots <j_n\le m}\mathbf{A}\left(\begin{array}{c}1,\dots ,n\\ j_1,\dots ,j_n\end{array}\right)(-1{)}^{{\sum }_{i=1}^{n}i+{\sum }_{i=1}^n{j}_i}\left|C\right|$$
其中
$$\mathbf{C}=({\mathbf{e}}_{u_1},{\mathbf{e}}_{u_2},\dots ,{\mathbf{e}}_{u_{m-n}},\mathbf{B})$$
然后再展开前$m-n$列
$$\left|\mathbf{C}\right|=\left|{\mathbf{I}}_{m-n}\right|(-1{)}^{{\sum }_{i=1}^{m-n}i+{\sum }_{i=1}^{m-n}{u}_i}\mathbf{B}\left(\begin{array}{c}{j}_1,\dots ,j_n\\ 1,\dots ,n\end{array}\right)$$

至于为什么$B$中也是$j_1,\cdots ,j_n$
红色为$j$，蓝色为$u$
可以看出第二次展开$u$之后，剩下的就是$j$

两个式子合在一起
接着我们重点看$-1$的次幂
$$\begin{array}{rl}& (-1{)}^{{\sum }_{i=1}^{m-n}i+{\sum }_{i=1}^{m-n}{u}_i}(-1{)}^{{\sum }_{i=1}^{n}i+{\sum }_{i=1}^n{j}_i}\\ & =(-1{)}^{\frac{(1+n)n}{2}+\frac{(1+m-n)(m-n)}{2}+{\sum }_{i=1}^{m-n}{u}_i+{\sum }_{i=1}^n{j}_i}\\ & =(-1{)}^{\frac{(1+n)n}{2}+\frac{(1+m-n)(m-n)}{2}+\frac{(1+m)m}{2}}\\ & =(-1{)}^{n^2+m^2+m-mn}\end{array}$$

$$\begin{array}{rl}\left|\mathbf{AB}\right|& =(-1{)}^{mn+n}\left|\begin{array}{cc}\mathbf{A}& 0\\ {\mathbf{I}}_m& \mathbf{B}\end{array}\right|\\ & =(-1{)}^{mn+n}(-1{)}^{n^2+m^2+m-mn}\\ & \sum _{1\le j_1<j_2<\cdots <j_n\le m}\mathbf{A}\left(\begin{array}{c}1,\dots ,n\\ j_1,\dots ,j_n\end{array}\right)\mathbf{B}\left(\begin{array}{c}{j}_1,\dots ,j_n\\ 1,\dots ,n\end{array}\right)\\ & =(-1{)}^{n(n+1)+m(m+1)}\\ & \sum _{1\le j_1<j_2<\cdots <j_n\le m}\mathbf{A}\left(\begin{array}{c}1,\dots ,n\\ j_1,\dots ,j_n\end{array}\right)\mathbf{B}\left(\begin{array}{c}{j}_1,\dots ,j_n\\ 1,\dots ,n\end{array}\right)\\ & =\sum _{1\le j_1<j_2<\cdots <j_n\le m}\mathbf{A}\left(\begin{array}{c}1,\dots ,n\\ j_1,\dots ,j_n\end{array}\right)\mathbf{B}\left(\begin{array}{c}{j}_1,\dots ,j_n\\ 1,\dots ,n\end{array}\right)\end{array}$$
所以结论成立