arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.0062math.RAmath.OAmath.RT
收藏

伪行列式的Cauchy-Binet

Cauchy-Binet for Pseudo-Determinants

Oliver Knill

摘要:

定义方阵A的伪行列式Det(A)为A的非零特征值之积。它是一个与基底无关的数,其符号达到A的特征多项式的第一个非零项。证明了对任意两个n × m矩阵F,G,Det(F^TG)= sum_P det(F_P)det(G_P).右边的和遍历A的所有k乘k次子式,其中k由F和G确定。如果F=G是一个图的关联矩阵,这直接意味着Kirchhoff树定理,因为L=F^T G是拉普拉斯算子,并且如果P是一个有根的生成树,则{0,1}中的det^2(F_P)等于1。一个推论是下面的勾股定理:对于任何秩为k的自伴随矩阵A,有Det^2(A)= sum_P det^2(A_P),其中det(A_P)遍历A的k乘k个子式。更一般地,我们证明了经典行列式det的多项式恒等式det(1+x F^T G)= sum_P x^{ |P| } det(F_P)det(G_P),它对任何两个n × m矩阵F,G都成立,其中右边的和是对所有子式P取的,如果|P| =0,则和为1。它意味着平方关系式det(1+F^T F)= sum_P det ^2(F_P),它对任何n乘m矩阵F成立,并对所有子式F_P再次求和。如果应用于有限单图的关联矩阵F,它产生Chebotarev-Shamis森林定理,告诉det(1+L)是具有Laplacian L的图中有根生成森林的数目。

英文摘要:

The pseudo-determinant Det(A) of a square matrix A is defined as the product of the nonzero eigenvalues of A. It is a basis-independent number which is up to a sign the first nonzero entry of the characteristic polynomial of A. We prove Det(F^T G) = sum_P det(F_P) det(G_P) for any two n times m matrices F,G. The sum to the right runs over all k times k minors of A, where k is determined by F and G. If F=G is the incidence matrix of a graph this directly implies the Kirchhoff tree theorem as L=F^T G is then the Laplacian and det^2(F_P) in {0,1} is equal to 1 if P is a rooted spanning tree. A consequence is the following Pythagorean theorem: for any self-adjoint matrix A of rank k, one has Det^2(A) = sum_P det^2(A_P), where det(A_P) runs over k times k minors of A. More generally, we prove the polynomial identity det(1+x F^T G) = sum_P x^{|P|} det(F_P) det(G_P) for classical determinants det, which holds for any two n times m matrices F,G and where the sum on the right is taken over all minors P, understanding the sum to be 1 if |P|=0. It implies the Pythagorean identity det(1+F^T F) = sum_P det^2(F_P) which holds for any n times m matrix F and sums again over all minors F_P. If applied to the incidence matrix F of a finite simple graph, it produces the Chebotarev-Shamis forest theorem telling that det(1+L) is the number of rooted spanning forests in the graph with Laplacian L.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑