## Jacobi’s equality between complementary minors of inverse matrices

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

What's a quick way to prove the following fact about adjugates of an invertible matrix $A$ and its inverse?

Let $A[I,J]$ denote the submatrix of an $n \times n$ matrix $A$ obtained by keeping only the rows indexed by $I$ and columns indexed by $J$. Then

$$|\det A[I,J]| = | (\det A)^{-1} \det A^{-1}[I^c,J^c]|,$$ where $I^c$ stands for $[n] \setminus I$, for $|I| = |J|$. It is trivial when $|I| = |J| = 1$ or $n-1$. This is apparently proved by Jacobi, but I couldn't find a proof anywhere in books or online. Horn and Johnson listed this as one of the advanced formulas in their preliminary chapter, but didn't give a proof. In general what's a reliable source to find proofs of all these little facts? I ran into this question while reading Macdonald's book on symmetric functions and Hall polynomials, in particular page 22 where he is explaining the determinantal relation between the elementary symmetric functions $e_\lambda$ and the complete symmetric functions $h_\lambda$.

I also spent 3 hours trying to crack this nut, but can only show it for diagonal matrices :(

Edit: It looks like Ferrar's book on Algebra subtitled determinant, matrices and algebraic forms, might carry a proof of this in chapter 5. Though the book seems to have a sexist bias.

-

2
Wow - I did not know that algebra proofs could have a "sexist bias". I am too curious to let it pass --- what do you mean exactly? – Federico Poloni Feb 8 2012 at 10:19

1
I was just referring to the preface, where he said the book is suitable for undergraduate students, or boys in their last years of school. Maybe the word "boy" has a gender neutral meaning back then? – John Jiang Feb 8 2012 at 19:39

## 2 Answers

The key word under which you will find this result in modern books is "Schur complement". Here is a self-contained proof. Assume $I$ and $J$ are $(1,2,\dots,k)$ for some $k$ without loss of generality (you may reorder rows/columns). Let the matrix be $$M=\begin{bmatrix}A & B\\ C & D\end{bmatrix},$$ where the blocks $A$ and $D$ are square. Assume for now that $A$ is invertible --- you may treat the general case with a continuity argument. Let $S=D-CA^{-1}B$ be the so-called Schur complement of $A$ in $M$.

You may verify the following identity ("magic wand Schur complement formula") $$\begin{bmatrix}A & B\\ C & D\end{bmatrix} = \begin{bmatrix}I & 0\\ CA^{-1} & I\end{bmatrix} \begin{bmatrix}A & 0\\ 0 & S\end{bmatrix} \begin{bmatrix}I & A^{-1}B\\ 0 & I\end{bmatrix}. \tag{1}$$ By taking determinants, $$\det M=\det A \det S. \tag{2}$$ Moreover, if you invert term-by-term the above formula you can see that the (2,2) block of $M^{-1}$ is $S^{-1}$. So your thesis is now (2).

Note that the "magic formula" (1) can be derived via block Gaussian elimination and is much less magic than it looks at first sight.

-

I guess for any thesis involving minors the Schur complement formula would be among the first things to try. – John Jiang Feb 8 2012 at 10:30

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

This is nothing but the Schur complement formula. See my book Matrices; Theory and Applications, 2nd ed., Springer-Verlag GTM 216, page 41.

Up to some permutation of rows and columns, we may assume that $I=J=[1,p]$. Let us write blockwise $$A=\begin{pmatrix} W & X \\ Y & Z \end{pmatrix}.$$ On the one hand, we have (Schur C.F) $$\det A=\det W\cdot\det(Z-YW^{-1}X).$$ Finally, we have $$A=\begin{pmatrix} \cdot & \cdot \\ \cdot & (Z-YW^{-1}X)^{-1} \end{pmatrix},$$which gives the desired result.

These formula are obtained by factorizing $A$ into $LU$.

-

Your answer is equally valid. Thanks! – John Jiang Feb 8 2012 at 10:27
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 28, "mathjax_display_tex": 7, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9421491026878357, "perplexity_flag": "head"}