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.