Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Assume $A$ is a square invertible matrix and we have $A^{-1}$. If we know that $I+A$ is also invertible, do we have a close form for $(I+A)^{-1}$ in terms of $A^{-1}$ and $A$?

Does it make it any easier if we know that sum of all rows are equal?

share|cite|improve this question
By substituting $A'=A-I$, you are basically asking for the inverse of all matrices. – akkkk Feb 9 '13 at 9:29
And of course, it might well be that $A$ is invertible, while $I + A$ is not. – Andreas Caranti Feb 9 '13 at 9:33
equal row sum won't help either. Consider the 2x2 matrix obtained from I by interchanging its rows. – Ittay Weiss Feb 9 '13 at 9:37
What does "convertible" mean? – Chris Eagle Feb 9 '13 at 9:39
The identity $(A^{-1}+I)^{-1} = A - A \, (I+A)^{-1}A$ (consequence of Woodbury matrix identity) does not answer you question, but perhaps you find it useful. – leonbloy Feb 9 '13 at 14:12
up vote 4 down vote accepted

If the series $S = I - A + A^2 - A^3 + \dotsb$ converges, expand $S(I + A)$ to find that it is equal to the identity. See here for details on when $S$ converges.

$S$ clearly converges if $A^k = 0$ for some positive integer $k$ (nilpotency).

As for invertibility, if $A$ is diagonalizable, i.e. $A = PDP^{-1}$ for some diagonal matrix $D = \operatorname{diag}(e_1, e_2, \dotsc, e_n)$, then by Sylvester's Determinant Theorem, $$ \det(I + (PD)P^{-1}) = \det(P^{-1}(PD) + I) = \prod_{i = 1}^n(e_i + 1) $$

Hence, $I + A$ is invertible if no eigenvalue $e_i$ has a value of $-1$.

If $A$ is nilpotent, then its only eigenvalue is $0$, so $I + A$ is invertible.

Is there a closed-form solution?

I believe not. Basically, a closed-form expression of $(I + A)^{-1}$ using $A$ and $A^{-1}$ would amount to a closed-form expression of $(1 + x)^{-1}$ using $x$ and $x^{-1}$, where $x$ is real (or complex). A semi-rigorous articulation of this argument follows:

Proposition: There exists no family of matrices $\{X_{ij}\}_{m \times n}$, where every $X_{ij}$ is either equal to $A$, $A^{-1}$ or a constant dependent on the dimension of $A$, such that $(I + A)^{-1} = \sum_{i = 1}^m(\prod_{j = 1}^nX_{ij})$ for all values of $A$.


Assume there exists such a family. Let $A$ be the $1 \times 1$ matrix $x$. Note that $\sum_{i = 1}^m(\prod_{j = 1}^nX_{ij})$ is a polynomial $P(x)$, which apparently equals $(1 + x)^{-1}$ for all values of $x$. Hence, $P(x)$ must be the taylor series $1 - x + x^2 - x^3 + \dotsb$, which contradicts the fact that $P(x)$ has a finite number of terms.

share|cite|improve this answer
Herng, thanks for your comment. if we know that (I+A) is invertible and also we have $A^{-1}$. Then can we write a close form solution for $(I+A)^{-1}$? – user54626 Feb 9 '13 at 10:10
I doubt so. How can you express $\displaystyle\frac1{1+x}$ using only $\displaystyle\frac1x$ and $x$..? – Berci Feb 9 '13 at 14:18
haha I had the same idea as @Berci and edited it into the answer. – Herng Yi Feb 9 '13 at 14:30

Check this question. The first answer presents a recursive formula to retrieve the inverse of a generic sum of matrices. So yours should be a special case.

share|cite|improve this answer
In particular to answer the question on how to express $\frac{1}{1+x}$ using only $1,x$ and $1/x$ we have $$ \frac{1}{1+x}=\frac{1}{x}-\frac{1}{1+trace(1/x)} \frac{1}{x^2} $$ – Ferpect Feb 9 '13 at 23:58
Thanks for your answer. I have checked that question, but the first answer suggest recursive formula when rank of one of the matrices is 1. But rank of I is not 1. – user54626 Feb 10 '13 at 10:27
And after that Lemma, the autor states the theorem for rank>1 – Ferpect Feb 10 '13 at 15:08

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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