Proving Invertibility of Matrix Sum: A+B

  • Thread starter Thread starter sweetiepi
  • Start date Start date
  • Tags Tags
    Matrix Sum
sweetiepi
Messages
22
Reaction score
0

Homework Statement


Let A and B be invertible matrices such that A^-1 + B^-1 is also invertible. Prove that A+B is invertible.


Homework Equations


A(A^-1) = I
B(B^-1) = I
(A^-1+B^-1)(A^-1+B^-1)^-1 = I

The Attempt at a Solution


I've been trying to manipulate these equations to make something work, but I just can't seem to find the right combination.
 
Physics news on Phys.org
Haha, me neither. I think we take the same class at the same school XD
 
sweetiepi said:

Homework Statement


Let A and B be invertible matrices such that A^-1 + B^-1 is also invertible. Prove that A+B is invertible.

Homework Equations


A(A^-1) = I
B(B^-1) = I
(A^-1+B^-1)(A^-1+B^-1)^-1 = I

The Attempt at a Solution


I've been trying to manipulate these equations to make something work, but I just can't seem to find the right combination.

Hint:Try to get A+B by multiplying the terms implied in the problem statement.
 
Last edited:
Thanks Scigatt. Your hint reminds me of a theorem that said "The product of invertible matrices is invertible." It's so simple when you put it like that.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top