Lookup table

In linear algebra, the Cauchy–Binet formula, named after Augustin-Louis Cauchy and Jacques Philippe Marie Binet, is an identity for the determinant of the product of two rectangular matrices of transpose shapes (so that the product is well-defined and square). It generalizes the statement that the determinant of a product of square matrices is equal to the product of their determinants. The formula is valid for matrices with entries from any commutative ring.

Statement

Let A be an m×n matrix and B an n×m matrix. Write [n] for the set { 1, ..., n }, and $(\genfrac{}{}{0ex}{}{[n]}{m})$ for the set of m-combinations of [n] (i.e., subsets of size m; there are $(\genfrac{}{}{0ex}{}{n}{m})$ of them). For $S\in (\genfrac{}{}{0ex}{}{[n]}{m})$, write A_[m],S for the m×m matrix whose columns are the columns of A at indices from S, and B_S,[m] for the m×m matrix whose rows are the rows of B at indices from S. The Cauchy–Binet formula then states

$\det (AB)=\sum _{S\in (\genfrac{}{}{0ex}{}{[n]}{m})}\det (A_{[m],S})\det (B_{S,[m]}).$

Example: taking m = 2 and n = 3, and matrices $A=\left(\begin{array}{ccc}1& 1& 2\\ 3& 1& -1\\ \end{array}\right)$ and $B=\left(\begin{array}{cc}1& 1\\ 3& 1\\ 0& 2\end{array}\right)$, the Cauchy–Binet formula gives the determinant:

$\det (AB)=\left|\begin{array}{cc}1& 1\\ 3& 1\end{array}\right|\cdot \left|\begin{array}{cc}1& 1\\ 3& 1\end{array}\right|+\left|\begin{array}{cc}1& 2\\ 1& -1\end{array}\right|\cdot \left|\begin{array}{cc}3& 1\\ 0& 2\end{array}\right|+\left|\begin{array}{cc}1& 2\\ 3& -1\end{array}\right|\cdot \left|\begin{array}{cc}1& 1\\ 0& 2\end{array}\right|.$

Indeed $AB=\left(\begin{array}{cc}4& 6\\ 6& 2\end{array}\right)$, and its determinant is −28, which is also the value $-2\times -2+-3\times 6+-7\times 2$ given by the right hand side of the formula.

Special cases

If n < m then $(\genfrac{}{}{0ex}{}{[n]}{m})$ is the empty set, and the formula says that det(AB) = 0 (its right hand side is an empty sum); indeed in this case the rank of the m×m matrix AB is at most n, which implies that its determinant is zero. If n = m, the case where A and B are square matrices, $(\genfrac{}{}{0ex}{}{[n]}{m})=\{[n]\}$ (a singleton set), so the sum only involves S = [n], and the formula states that det(AB) = det(A)det(B).

For m = 0, A and B are empty matrices (but of different shapes if n > 0), as is their product AB; the summation involves a single term S = Ø, and the formula states 1 = 1, with both sides given by the determinant of the 0×0 matrix. For m = 1, the summation ranges over the collection $(\genfrac{}{}{0ex}{}{[n]}{1})$ of the n different singletons taken from [n], and both sides of the formula give ${\sum }_{j=1}^n{A}_{1,j}{B}_{j,1}$, the dot product of the pair of vectors represented by the matrices. The smallest value of m for which the formula states a non-trivial equality is m = 2; it is discussed in the article on the Binet–Cauchy identity.

Proof

There are various kinds of proofs that can be given for the Cauchy−Binet formula. The proof below is based on formal manipulations only, and avoids using any particular interpretation of determinants, which may be taken to be defined by the Leibniz formula. Only their multilinearity with respect to rows and columns, and their alternating property (vanishing in the presence of equal rows or columns) are used; in particular the multiplicative property of determinants for square matrices is not used, but is rather established (the case n = m). The proof is valid for arbitrary commutative coefficient rings.

The formula can be proved in two steps:

1. use the fact that both sides are multilinear (more precisely 2m-linear) in the rows of A and the columns of B, to reduce to the case that each row of A and each column of B has only one non-zero entry, which is 1.
2. handle that case using the functions [m]→[n] that map respectively the row numbers of A to the column number of their nonzero entry, and the column numbers of B to the row number of their nonzero entry.

For step 1, observe that for each row of A or column of B, and for each m-combination S, the values of det(AB) and det(A_[m],S)det(B_S,[m]) indeed depend linearly on the row or column. For the latter this is immediate from the multilinear property of the determinant; for the former one must in addition check that taking a linear combination for the row of A or column of B while leaving the rest unchanged only affects the corresponding row or column of the product AB, and by the same linear combination. Thus one can work out both sides of the Cauchy−Binet formula by linearity for every row of A and then also every column of B, writing each of the rows and columns as a linear combination of standard basis vectors. The resulting multiple summations are huge, but they have the same form for both sides: corresponding terms involve the same scalar factor (each is a product of entries of A and of B), and these terms only differ by involving two different expressions in terms of constant matrices of the kind described above, which expressions should be equal according to the Cauchy−Binet formula. This achieves the reduction of the first step.

Concretely, the multiple summations can be grouped into two summations, one over all functions f:[m] → [n] that for each row index of A gives a corresponding column index, and one over all functions g:[m] → [n] that for each column index of B gives a corresponding row index. The matrices associated to f and g are

$L_f=(({\delta }_{f(i),j}{)}_{i\in [m],j\in [n]})\text{and}{R}_g=(({\delta }_{j,g(k)}{)}_{j\in [n],k\in [m]})$

where "$\delta$" is the Kronecker delta, and the Cauchy−Binet formula to prove has been rewritten as

$\sum _{f:[m]\to [n]}\sum _{g:[m]\to [n]}p(f,g)\det (L_f{R}_g)=\sum _{f:[m]\to [n]}\sum _{g:[m]\to [n]}p(f,g)\sum _{S\in (\genfrac{}{}{0ex}{}{[n]}{m})}\det ((L_f{)}_{[m],S})\det (R_g{)}_{S,[m]}),$

where p(f,g) denotes the scalar factor $({\prod }_{i=1}^m{A}_{i,f(i)})({\prod }_{k=1}^m{B}_{g(k),k})$. It remains to prove the Cauchy−Binet formula for A = L_f and B = R_g, for all f,g:[m] → [n].

For this step 2, if f fails to be injective then L_f and L_fR_g both have two identical rows, and if g fails to be injective then R_g and L_fR_g both have two identical columns; in either case both sides of the identity are zero. Supposing now that both f and g are injective maps [m] → [n], the factor $\det ((L_f{)}_{[m],S})$ on the right is zero unless S = f([m]), while the factor $\det ((R_g{)}_{S,[m]})$ is zero unless S = g([m]). So if the images of f and g are different, the right hand side has only null terms, and the left hand side is zero as well since L_fR_g has a null row (for i with $f(i)\notin g([m])$). In the remaining case where the images of f and g are the same, say f([m]) = S = g([m]), we need to prove that

$\det (L_f{R}_g)=\det ((L_f{)}_{[m],S})\det (R_g{)}_{S,[m]}).$

Let h be the unique increasing bijection [m] → S, and π,σ the permutations of [m] such that $f=h\circ {\pi }^{-1}$ and $g=h\circ \sigma$; then $(L_f{)}_{[m],S}$ is the permutation matrix for π, $(R_g{)}_{S,[m]}$ is the permutation matrix for σ, and L_fR_g is the permutation matrix for $\pi \circ \sigma$, and since the determinant of a permutation matrix equals the signature of the permutation, the identity follows from the fact that signatures are multiplicative.

Using multi-linearity with respect to both the rows of A and the columns of B in the proof is not necessary; one could use just one of them, say the former, and use that a matrix product L_fB either consists of a permutation of the rows of B_f([m]),[m] (if f is injective), or has at least two equal rows.

Relation to the generalized Kronecker delta

As we have seen, the Cauchy–Binet formula is equivalent to the following:

$\det (L_f{R}_g)=\sum _{S\in (\genfrac{}{}{0ex}{}{[n]}{m})}\det ((L_f{)}_{[m],S})\det ((R_g{)}_{S,[m]}),$

where

$L_f=(({\delta }_{f(i),j}{)}_{i\in [m],j\in [n]})\text{and}{R}_g=(({\delta }_{j,g(k)}{)}_{j\in [n],k\in [m]}).$

In terms of generalized Kronecker delta, we can derive the formula equivalent to the Cauchy–Binet formula:

${\delta }_{g(1)\dots g(m)}^{f(1)\dots f(m)}=\sum _{\genfrac{}{}{0ex}{}{k:[m]\to [n]}{k(1)<\dots <k(m)}}{\delta }_{k(1)\dots k(m)}^{f(1)\dots f(m)}{\delta }_{g(1)\dots g(m)}^{k(1)\dots k(m)}.$

Geometric interpretations

If A is a real m×n matrix, then det(A A^T) is equal to the square of the m-dimensional volume of the parallelotope spanned in Rⁿ by the m rows of A. Binet's formula states that this is equal to the sum of the squares of the volumes that arise if the parallelepiped is orthogonally projected onto the m-dimensional coordinate planes (of which there are $(\genfrac{}{}{0ex}{}{n}{m})$).

In the case m = 1 the parallelotope is reduced to a single vector and its volume its length. The above statement then states that the square of the length of a vector is the sum of the squares of its coordinates; this is indeed the case by the definition of that length, which is based on the Pythagorean theorem.

Generalization

The Cauchy–Binet formula can be extended in a straightforward way to a general formula for the minors of the product of two matrices. That formula is given in the article on minors.

References

• Joel G. Broida & S. Gill Williamson (1989) A Comprehensive Introduction to Linear Algebra, §4.6 Cauchy-Binet theorem, pp 208–14, Addison-Wesley ISBN 0-201-50065-5.
• Jin Ho Kwak & Sungpyo Hong (2004) Linear Algebra 2nd edition, Example 2.15 Binet-Cauchy formula, pp 66,7, Birkhäuser ISBN 0-8176-4294-3.
• I. R. Shafarevich & A. O. Remizov (2012) Linear Algebra and Geometry, §2.9 (p. 68) & §10.5 (p. 377), Springer ISBN 978-3-642-30993-9.

External links

• Aaron Lauve (2004) A short combinatoric proof of Cauchy–Binet formula from Université du Québec à Montréal.