1
$\begingroup$

The following identity involving determinants essentially appears in E.L. Ince's book on Ordinary Differential Equations:

Let $A$ be an $n \times n$ matrix, $n \geq 3$. Denote by $A_{j_1,\ldots,j_r}^{k_1,\ldots,k_r}$ the $(n-r) \times (n-r)$ matrix obtained from $A$ by erasing the $j_1$-th, ..., $j_r$-th row and the $k_1$-th, ..., $k_r$-th column. Then, $$ \left|A \right| \left|A_{n-1,n}^{1,n} \right| = \left|A_{n-1}^1 \right|\left|A_n^n \right| - \left|A_{n-1}^n \right|\left|A_n^1 \right|. $$ Any ideas of how to prove it? Is this a special case of a more general identity?

$\endgroup$
4
  • 3
    $\begingroup$ Maybe this is the Desnanot-Jacobi identity ? I think I have read this in Zelevinsky. $\endgroup$
    – F. C.
    Nov 19, 2020 at 17:50
  • 4
    $\begingroup$ Also known as Lewis Carroll identity $\endgroup$ Nov 19, 2020 at 17:57
  • 2
    $\begingroup$ Desnanot–Jacobi identity, as referenced by @F.C. $\endgroup$
    – LSpice
    Nov 19, 2020 at 18:02
  • 1
    $\begingroup$ See the argument following the words "edited to add" in my answer here: mathoverflow.net/a/249558/10503 $\endgroup$ Nov 19, 2020 at 18:47

1 Answer 1

1
$\begingroup$

I'll repeat the argument cited in the comments, adjusted to fit your situation.

A polynomial identity holds in general if it holds on an open set. So it's enough to prove the identity for matrices $A$ in the open set where $A^{1,n}_{n-1,n}$ is invertible. That is, we can assume $A^{1,n}_{n-1,n}$ is invertible.

Now premultiply $A$ by the inverse of the matrix.

$$\pmatrix{0&1&0\cr A^{1,n}_{n-1,n}&0&0\cr 0&0&1\cr}$$ where the $1$s are $1\times 1$ matrices with entry $1$ and the $0's$ are row or column matrices of the appropriate sizes, filled with zeros.

This does not affect the truth of the theorem and allows us to assume $A^{1,n}_{n-1,n}$ is the identity, after which row and column operations render the desired equality trivial.

$\endgroup$
1

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.