2
$\begingroup$

I am trying to use this formula to find the inverse of a $3 \times 3$ matrix.

$$ \mathbf A^{-1} = \frac{1}{\det(\mathbf A)} \sum_{s=0}^{n-1}\mathbf A^{s} \sum_{k_{1}, k_{2},\dots,k_{n-1}} \prod_{l=1}^{n-1} \frac{(-1)^{k_{l}+1}}{l^{k_{l}} k_{l}!} \operatorname{tr}(\mathbf A^{l})^{k_{l}} $$

where $n$ is the size of $\bf A$, and $\operatorname{tr}({\bf A})$ is the trace of $\bf A$, and $\mathbf A^{s}$ are powers of $\bf A$. The sum is taken over $s$ and the sets of all $k_{l} \ge 0$ satisfying the following linear Diophantine equation

$$ s + \sum_{l=1}^{n-1}lk_{l} = n-1$$

where $k_{l}$ is an integer, starts at $k_{1}$ and can only go up to $k_{n-1}$. Take, for example, an invertible matrix $\bf A$, with $\det(\mathbf A) = 2$

$$\mathbf A = \begin{bmatrix}1 & 0 & 4\\0 & 1 & 2\\0 & -3 & -4\end{bmatrix}$$

The only possible $s$ and $k_{l}$ values are $s = 2, k_{l} = 0$ although I'm pretty sure $k_{l}$ cannot be 0 because $l$ starts at $l=1$. Can someone please explain to me $k_{l}$ and how to work this out? I've successfully done this for a $2 \times 2$ matrix, but have had no luck with $3 \times 3$. I've read the Wikipedia page and another paper (section 2), but have yet to successfully solve.

New contributor
jdavidbrandt is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
$\endgroup$

1 Answer 1

2
$\begingroup$

This follows from the inverse Girard-Waring formula and Cayley-Hamilton theorem.

Consider a polynomial $x^n+a_1x^{n-1}+\cdots+a_{n-1}x+a_n$. Let $\lambda_1,\ldots,\lambda_n$ be its zeroes and $s_k=\lambda_1^k+\cdots+\lambda_n^k$ be their $k$-th power sum. There are three well-known sets of identities relating the elementary symmetric polynomials to the power sums, namely, Newton’s identities, Girard-Waring formula, and the inverse Girard-Waring formula. In particular, the inverse Girard-Waring formula expresses each $a_j$ in terms of the $s_i$s: $$ a_j=\sum_{\substack{k_1,\ldots,k_j\ge0\\ k_1+2k_2+\cdots+jk_j=j}}(-1)^{k_1+\cdots+k_j}\frac{1}{k_1!\cdots k_n!}\left(\frac{s_1}{1}\right)^{k_1}\cdots \left(\frac{s_j}{j}\right)^{k_j}.\tag{1} $$ In case the polynomial is the characteristic polynomial of an $n\times n$ matrix $A$, Cayley-Hamilton theorem states that $A^n+a_1A^{n-1}+\cdots+a_{n-1}A+a_nI=0$. Therefore $A(A^{n-1}+a_1A^{n-2}+\cdots+a_{n-1}I)=-a_nI$ and $$ A^{-1}=-\frac{1}{a_n}(A^{n-1}+a_1A^{n-2}+\cdots+a_{n-1}I).\tag{2} $$ Substitute the RHS of $(1)$ into $(2)$ with $s_i=\operatorname{tr}(A^i)$, we obtain the inversion formula in your question.

E.g. when $n=3$, the constraint $s+\sum_{l=1}^{n-1}lk_{l}=n-1$ becomes $k_1+2k_2=n-1-s=2-s$. That is, \begin{cases} s=0: k_1+2k_2=2 \implies (k_1,k_2)=(0,1),(2,0);\\ s=1: k_1+2k_2=1 \implies (k_1,k_2)=(1,0);\\ s=2: k_1=k_2=0. \end{cases} In particular, for $s=0$, we have \begin{align*} &\sum_{\substack{k_1,\ldots,k_{n-1}\ge0\\ s+\sum_{l=1}^{n-1}lk_{l}=n-1}} \prod_{l=1}^{n-1} \frac{(-1)^{k_{l}+1}}{l^{k_{l}} k_{l}!}\operatorname{tr}(A^{l})^{k_{l}} =\sum_{(k_1,k_2)\in\{(0,1),(2,0)\}} \prod_{l=1}^{n-1} \frac{(-1)^{k_{l}+1}}{l^{k_{l}} k_{l}!}\operatorname{tr}(A^{l})^{k_{l}}\\ &= \left(\frac{(-1)^{0+1}}{1^{0} 0!}\operatorname{tr}(A^{1})^{0}\right) \left(\frac{(-1)^{1+1}}{2^{1} 1!}\operatorname{tr}(A^{2})^{1}\right) + \left(\frac{(-1)^{2+1}}{1^{2} 2!}\operatorname{tr}(A^{1})^{2}\right) \left(\frac{(-1)^{0+1}}{2^{0} 0!}\operatorname{tr}(A^{2})^{0}\right)\\ &=\frac{\operatorname{tr}(A)^2-\operatorname{tr}(A^2)}{2}. \end{align*} Ultimately, we get $$ A^{-1}=\frac{1}{\det A}\left( A^2-\operatorname{tr}(A)A+\frac{\operatorname{tr}(A)^2-\operatorname{tr}(A^2)}{2}I \right). $$ In your case, $$ A=\begin{bmatrix}1 & 0 & 4\\0 & 1 & 2\\0 & -3 & -4\end{bmatrix} \implies A^{-1}=\frac{1}{2}\left(A^2+2A-I\right) =\begin{bmatrix}1&-6&-2\\ 0&-2&-1\\ 0&\frac32&\frac12\end{bmatrix}. $$

$\endgroup$
5
  • $\begingroup$ Thank you so much @user1551 for your answer, you have really cleared up the summing over $k_{l}$ for me, I was completely lost! For the very last equation you wrote, regarding $A^{-1}$ in terms of it's determinant, powers of A, and traces, does this work for all invertible 3x3 matrices? Plugging in the all unknowns in the last equation, I do not get the inverse of A, some of the numbers I get for the inverse of A are slightly off. $det(A) = 2$, $tr(A) = -2$, $tr(A^{2}) = 6$, and so on, with A being the matrix, $A^{2}$ being the matrix squared, and $I$ as the identity matrix $\endgroup$ Commented yesterday
  • $\begingroup$ @jdavidbrandt Yes, if the matrix is $3\times3$ and invertible. It is just a special case of $(2)$. $\endgroup$ Commented yesterday
  • $\begingroup$ Gotcha! Thanks so much. As I want to do this for NxN matrices computationally, I will implement this the general way, thanks again for your help! $\endgroup$ Commented yesterday
  • $\begingroup$ also in your third term for your expanse of the product operator, I believe the $0!$ should read $2!$ :D $\endgroup$ Commented yesterday
  • 1
    $\begingroup$ @jdavidbrandt Yes. Thanks for the catch. $\endgroup$ Commented yesterday

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.