Английская Википедия:Dodgson condensation
Шаблон:Short description Шаблон:More footnotes In mathematics, Dodgson condensation or method of contractants is a method of computing the determinants of square matrices. It is named for its inventor, Charles Lutwidge Dodgson (better known by his pseudonym, as Lewis Carroll, the popular author), who discovered it in 1866.[1] The method in the case of an n × n matrix is to construct an (n − 1) × (n − 1) matrix, an (n − 2) × (n − 2), and so on, finishing with a 1 × 1 matrix, which has one entry, the determinant of the original matrix.
General method
This algorithm can be described in the following four steps:
- Let A be the given n × n matrix. Arrange A so that no zeros occur in its interior. An explicit definition of interior would be all ai,j with <math>i,j\ne1,n</math>. One can do this using any operation that one could normally perform without changing the value of the determinant, such as adding a multiple of one row to another.
- Create an (n − 1) × (n − 1) matrix B, consisting of the determinants of every 2 × 2 submatrix of A. Explicitly, we write <math> b_{i,j}=\begin{vmatrix} a_{i, j} & a_{i, j + 1} \\ a_{i + 1, j} & a_{i + 1, j + 1} \end{vmatrix}. </math>
- Using this (n − 1) × (n − 1) matrix, perform step 2 to obtain an (n − 2) × (n − 2) matrix C. Divide each term in C by the corresponding term in the interior of A so <math> c_{i,j}=\begin{vmatrix} b_{i, j} & b_{i, j + 1} \\ b_{i + 1, j} & b_{i + 1, j + 1} \end{vmatrix} / a_{i + 1, j + 1} </math>.
- Let A = B, and B = C. Repeat step 3 as necessary until the 1 × 1 matrix is found; its only entry is the determinant.
Examples
Without zeros
One wishes to find
- <math>
\begin{vmatrix} -2 & -1 & -1 & -4 \\ -1 & -2 & -1 & -6 \\ -1 & -1 & 2 & 4 \\ 2 & 1 & -3 & -8 \end{vmatrix}. </math>
All of the interior elements are non-zero, so there is no need to re-arrange the matrix.
We make a matrix of its 2 × 2 submatrices.
- <math>
\begin{bmatrix} \begin{vmatrix} -2 & -1 \\ -1 & -2 \end{vmatrix} & \begin{vmatrix} -1 & -1 \\ -2 & -1 \end{vmatrix} & \begin{vmatrix} -1 & -4 \\ -1 & -6 \end{vmatrix} \\ \\ \begin{vmatrix} -1 & -2 \\ -1 & -1 \end{vmatrix} & \begin{vmatrix} -2 & -1 \\ -1 & 2 \end{vmatrix} & \begin{vmatrix} -1 & -6 \\ 2 & 4 \end{vmatrix} \\ \\ \begin{vmatrix} -1 & -1 \\ 2 & 1 \end{vmatrix} & \begin{vmatrix} -1 & 2 \\ 1 & -3 \end{vmatrix} & \begin{vmatrix} 2 & 4 \\ -3 & -8 \end{vmatrix} \end{bmatrix} = \begin{bmatrix} 3 & -1 & 2 \\ -1 & -5 & 8 \\ 1 & 1 & -4 \end{bmatrix}. </math>
We then find another matrix of determinants:
- <math>
\begin{bmatrix} \begin{vmatrix} 3 & -1 \\ -1 & -5 \end{vmatrix} & \begin{vmatrix} -1 & 2 \\ -5 & 8 \end{vmatrix} \\ \\ \begin{vmatrix} -1 & -5 \\ 1 & 1 \end{vmatrix} & \begin{vmatrix} -5 & 8 \\ 1 & -4 \end{vmatrix} \end{bmatrix} = \begin{bmatrix} -16 & 2 \\ 4 & 12 \end{bmatrix}. </math>
We must then divide each element by the corresponding element of our original matrix. The interior of the original matrix is <math> \begin{bmatrix} -2 & -1 \\ -1 & 2 \end{bmatrix} </math>, so after dividing we get <math> \begin{bmatrix} 8 & -2 \\ -4 & 6 \end{bmatrix} </math>. The process must be repeated to arrive at a 1 × 1 matrix. <math> \begin{bmatrix} \begin{vmatrix} 8 & -2 \\ -4 & 6 \end{vmatrix} \end{bmatrix} = \begin{bmatrix} 40 \end{bmatrix}. </math> Dividing by the interior of the 3 × 3 matrix, which is just −5, gives <math>\begin{bmatrix} -8 \end{bmatrix}</math> and −8 is indeed the determinant of the original matrix.
With zeros
Simply writing out the matrices:
- <math>
\begin{bmatrix} 2 & -1 & 2 & 1 & -3 \\ 1 & 2 & 1 & -1 & 2 \\ 1 & -1 & -2 & -1 & -1 \\ 2 & 1 & -1 & -2 & -1 \\ 1 & -2 & -1 & -1 & 2 \end{bmatrix} \to \begin{bmatrix} 5 & -5 & -3 & -1 \\ -3 & -3 & -3 & 3 \\ 3 & 3 & 3 & -1 \\ -5 & -3 & -1 & -5 \end{bmatrix} \to \begin{bmatrix} -15 & 6 & 12 \\ 0 & 0 & 6 \\ 6 & -6 & 8 \end{bmatrix}. </math>
Here we run into trouble. If we continue the process, we will eventually be dividing by 0. We can perform four row exchanges on the initial matrix to preserve the determinant and repeat the process, with most of the determinants precalculated:
- <math>
\begin{bmatrix} 1 & 2 & 1 & -1 & 2 \\ 1 & -1 & -2 & -1 & -1 \\ 2 & 1 & -1 & -2 & -1 \\ 1 & -2 & -1 & -1 & 2 \\ 2 & -1 & 2 & 1 & -3 \end{bmatrix} \to \begin{bmatrix} -3 & -3 & -3 & 3 \\ 3 & 3 & 3 & -1 \\ -5 & -3 & -1 & -5 \\ 3 & -5 & 1 & 1 \end{bmatrix} \to \begin{bmatrix} 0 & 0 & 6 \\ 6 & -6 & 8 \\ -17 & 8 & -4 \end{bmatrix} \to \begin{bmatrix} 0 & 12 \\ 18 & 40 \end{bmatrix} \to \begin{bmatrix} 36 \end{bmatrix}. </math>
Hence, we arrive at a determinant of 36.
Desnanot–Jacobi identity and proof of correctness of the condensation algorithm
The proof that the condensation method computes the determinant of the matrix if no divisions by zero are encountered is based on an identity known as the Desnanot–Jacobi identity (1841) or, more generally, the Sylvester determinant identity (1851).[2]
Let <math>M=(m_{i,j})_{i,j=1}^k</math> be a square matrix, and for each <math>1\le i, j\le k</math>, denote by <math>M_i^j</math> the matrix that results from <math>M</math> by deleting the <math>i</math>-th row and the <math>j</math>-th column. Similarly, for <math>1\le i, j, p,q\le k</math>, denote by <math>M_{i,j}^{p,q}</math> the matrix that results from <math>M</math> by deleting the <math>i</math>-th and <math>j</math>-th rows and the <math>p</math>-th and <math>q</math>-th columns.
Desnanot–Jacobi identity
- <math>\det(M) \det(M_{1,k}^{1,k}) = \det(M_1^1)\det(M_k^k) - \det(M_1^k) \det(M_k^1).</math>
Proof of the correctness of Dodgson condensation
Rewrite the identity as
- <math>\det(M) = \frac{\det(M_1^1)\det(M_k^k) - \det(M_1^k) \det(M_k^1)}{\det(M_{1,k}^{1,k})}.</math>
Now note that by induction it follows that when applying the Dodgson condensation procedure to a square matrix <math>A</math> of order <math>n</math>, the matrix in the <math>k</math>-th stage of the computation (where the first stage <math>k=1</math> corresponds to the matrix <math>A</math> itself) consists of all the connected minors of order <math>k</math> of <math>A</math>, where a connected minor is the determinant of a connected <math>k\times k</math> sub-block of adjacent entries of <math>A</math>. In particular, in the last stage <math>k=n</math>, one gets a matrix containing a single element equal to the unique connected minor of order <math>n</math>, namely the determinant of <math>A</math>.
Proof of the Desnanot-Jacobi identity
We follow the treatment in the book Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture;[3] an alternative combinatorial proof was given in a paper by Doron Zeilberger.[4]
Denote <math>a_{i,j} = (-1)^{i+j} \det(M_i^j)</math> (up to sign, the <math>(i,j)</math>-th minor of <math>M</math>), and define a <math>k\times k</math>
matrix <math>M'</math> by
- <math>
M' = \begin{pmatrix} a_{1,1} & 0 & 0 & 0 & \ldots & 0 & a_{k,1} \\
a_{1,2} & 1 & 0 & 0 & \ldots & 0 & a_{k,2} \\
a_{1,3} & 0 & 1 & 0 & \ldots & 0 & a_{k,3} \\
a_{1,4} & 0 & 0 & 1 & \ldots & 0 & a_{k,4} \\
\vdots & \vdots & \vdots & \vdots & & \vdots & \vdots \\
a_{1,k-1} & 0 & 0 & 0 & \ldots & 1 & a_{k,k-1} \\
a_{1,k} & 0 & 0 & 0 & \ldots & 0 & a_{k,k}
\end{pmatrix}.
</math>
(Note that the first and last column of <math>M'</math> are equal to those of the adjugate matrix of <math>A</math>). The identity is now obtained by computing <math>\det(M M')</math> in two ways. First, we can directly compute the matrix product <math>M M'</math> (using simple properties of the adjugate matrix, or alternatively using the formula for the expansion of a matrix determinant in terms of a row or a column)
to arrive at
- <math>
M M' = \begin{pmatrix}
\det(M) & m_{1,2} & m_{1,3} & \ldots & m_{1,k-1} & 0 \\
0 & m_{2,2} & m_{2,3} & \ldots & m_{2,k-1} & 0 \\
0 & m_{3,2} & m_{3,3} & \ldots & m_{3,k-1} & 0 \\
\vdots & \vdots & \vdots & & \vdots & \vdots & \vdots \\
0 & m_{k-1,2} & m_{k-1,3} & \ldots & m_{k-1,k-1} & 0 \\
0 & m_{k,2} & m_{k,3} & \ldots & m_{k,k-1} & \det(M)
\end{pmatrix}
</math>
where we use <math>m_{i,j}</math> to denote the <math>(i,j)</math>-th entry of <math>M</math>. The determinant of this matrix is <math>\det(M)^2 \cdot \det(M_{1,k}^{1,k})</math>.
Second, this is equal to the product of the determinants, <math>\det(M) \cdot \det(M')</math>. But clearly
<math>
\det(M') = a_{1,1} a_{k,k} - a_{k,1} a_{1,k} = \det(M_1^1)\det(M_k^k) - \det(M_1^k) \det(M_k^1),
</math>
so the identity follows from equating the two expressions we obtained for <math>\det(M M')</math> and dividing out by <math>\det(M)</math> (this is allowed if one thinks of the identities as polynomial identities over the ring of polynomials in the <math>k^2</math> indeterminate variables <math>(m_{i,j})_{i,j=1}^k</math>).
References
Further reading
- Bressoud, David M. and Propp, James, How the alternating sign matrix conjecture was solved, Notices of the American Mathematical Society, 46 (1999), 637-646.
- Knuth, Donald, Overlapping Pfaffians, Electronic Journal of Combinatorics, 3 no. 2 (1996).
- Шаблон:Cite journal
- Mills, William H., Robbins, David P., and Rumsey, Howard, Jr., Proof of the Macdonald conjecture, Inventiones Mathematicae, 66 (1982), 73-87.
- Mills, William H., Robbins, David P., and Rumsey, Howard, Jr., Alternating sign matrices and descending plane partitions, Journal of Combinatorial Theory, Series A, 34 (1983), 340-359.
- Robbins, David P., The story of <math>1, 2, 7, 42, 429, 7436, \cdots</math>, The Mathematical Intelligencer, 13 (1991), 12-19.
External links
