0% found this document useful (0 votes)
82 views

Cauchy Binet

The document presents the Cauchy-Binet formula for calculating the determinant of the product of two matrices, A and B. The formula expresses the determinant of AB as the sum of the products of the determinants of submatrices of A and B, where the submatrices are indexed by the same set of indices. The proof avoids explicit matrix manipulations and uses ideas from linear algebra, such as representing matrices as linear maps and expressing their actions on bases of vector spaces.

Uploaded by

yacp16761
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
82 views

Cauchy Binet

The document presents the Cauchy-Binet formula for calculating the determinant of the product of two matrices, A and B. The formula expresses the determinant of AB as the sum of the products of the determinants of submatrices of A and B, where the submatrices are indexed by the same set of indices. The proof avoids explicit matrix manipulations and uses ideas from linear algebra, such as representing matrices as linear maps and expressing their actions on bases of vector spaces.

Uploaded by

yacp16761
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

The Cauchy–Binet formula

Andrew Putman

Abstract

We give a proof of the Cauchy–Binet formula for the determinant of the product of two
matrices that mostly avoids explicit matrix manipulations.

Let k be a field. All matrices in this note have entries in k. Let A be an n × m matrix and
let B be an m × n matrix. The product AB is thus an n × n matrix. The Cauchy–Binet
formula shows how to express the determinant of AB in terms of A and B. When n = m,
it reduces to the familiar fact that det(AB) = det(A) det(B).

Stating it requires introducing some notation. Let [m] = {1, . . . , m}. For I ⊂ [m], let AI
be the n × |I| submatrix of A consisting of the rows of A lying in I. Similarly, let I B be
the |I| × n submatrix of B consisting of the columns of B lying in I.
Theorem 0.1 (Cauchy–Binet formula). Let A be an n × m matrix and let B be an m × n
matrix. Then X
det(AB) = det(AI ) det(I B).
I⊂[m]
|I|=n

Proof. For an r × s matrix C, let φC : ks → kr be the associated linear map. Thus φAB
equals the composition
φB φA
kn −→ km −→ kn .
Letting {~e1 , . . . , ~en } be the standard basis for kn , we thus have that

φA ◦ φB (~e1 ∧ · · · ∧ ~en ) = det(AB)~e1 ∧ · · · ∧ ~en .

To express this in terms of A and B, we will have to first understand φB : ∧n kn → ∧n km .

Let {f~1 , . . . , f~n } be the standard basis km . The vector space ∧n km thus has a basis

{f~i1 ∧ · · · ∧ f~in | {i1 < · · · < in } ⊂ [m]}.

We claim that

det(I B)f~i1 ∧ · · · ∧ f~in .


X
φB (~e1 ∧ · · · ∧ ~en ) = (0.1)
I={i1 <···<in }⊂[m]

To see this, fix some I = {i1 < · · · < in } ⊂ [m]. Let VI = hf~i1 , . . . , f~in i ⊂ km and let
πI : km → VI be the projection whose kernel is generated by the f~j with j ∈ / I. Identifying
VI with kn via its natural basis, the composition
φ π
kn −→
B
km −→
I
VI

1
equals the linear map associated to I B. We thus have

(πI ◦ φB )∗ (~e1 ∧ · · · ∧ ~en ) = det(I B)f~i1 ∧ · · · ∧ f~in .

The equation (0.1) follows.

Fixing some I = {i1 < · · · < in } ⊂ [m] again, the next step is to observe that if we again
identify VI with kn via its natural basis, the composition
φ
VI ,→ km −→
A
kn

equals the linear map associated to AI . It follows that

φA (f~i1 ∧ · · · ∧ f~in ) = det(AI )~e1 ∧ · · · ∧ ~en .

Combining this with (0.1), we see that

det(I B)φA (f~i1 ∧ · · · ∧ f~in )


X
φA ◦ φB (~e1 ∧ · · · ∧ ~en ) =
I={i1 <···<in }⊂[m]
X
= det(I B) det(AI )~e1 ∧ · · · ∧ ~en .
I={i1 <···<in }⊂[m]

The theorem follows.

Andrew Putman
Department of Mathematics
University of Notre Dame
164 Hurley Hall
Notre Dame, IN 46556
andyp@nd.edu

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy