Cauchy-Binet for Pseudo-Determinants
Author:
- Oliver KnillOKOliver Knill
Preprint
Abstract
The pseudo-determinant Det(A) of a square matrix A is defined as the product of the non-zero eigenvalues of A. It is a basis-independent number which is up to a sign the first non-zero entry of the characteristic polynomial of A. We extend here the Cauchy-Binet formula to pseudo-determinants. More specifically, after proving some properties for pseudo-determinants, we show that for any two n times m matrices F,G, the formula Det(F^T G) = sum_P det(F_P) det(G_P) holds, where det(F_P) runs over all k times k minors of A with k=min(rank(F^TG),rank(G F^T)). A consequence is the following Pythagoras theorem: for any self-adjoint matrix A of rank k one has Det^2(A) = sum_P det^2(A_P), where the right hand side sums over the squares over all k times k minors of A.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Linear Algebra and Geometry2013
- Self-similarity and growth in Birkhoff sums for the golden rotationNonlinearity, 2011
- The coefficients of the characteristic polynomial in terms of the eigenvalues and the elements of an matrixApplied Mathematics Letters, 2006
- Invariant Subspaces of Matrices with Applications2006
- Outer inverses: Jacobi type identities and nullities of submatricesLinear Algebra and its Applications, 2003
- On the coefficients of the characteristic polynomial of a matrixDiscrete Mathematics, 1994
- Basic Operator Theory1981
- Elements d'Histoire de Mathematiques.The American Mathematical Monthly, 1971
- Beiträge zur Theorie der Determinanten
- Introduction to Linear AlgebraMathematics of Computation, 1966