So I am self-learning Linear Algebra and I came across a proof and I need a little verification to see if I am on the right track because it varies significantly from the answer provided.
Question: Consider the linear systems Ax = b and Bx = c where both A and B are invertible. Show that (A + B)x = b + c may have an infinite number of solutions.
My proof:
- A & B are invertible, this means that they are square matrices
- A & B are of same size in order to carry out matrix addition
- Sum of two invertible matrices is not necessarily invertible
- In order to have a unique solution $\ x = A^{-1} b $ must hold in the form $\ x = A^{-1}b + B^{-1}c$
$$ (A+B)x = b + c $$ $$ (A^{-1} A + B^{-1}B) = A^{-1}b + B^{-1}c $$ $$ (I + I)x = A^{-1}b + B^{-1}c $$ $$ 2Ix = A^{-1}b + B^{-1}c $$ $$ 2Ix = A^{-1}b + B^{-1}c \neq x = A^{-1}b + B^{-1}c $$
Thefore, the system does not have a unique solution. It is possible that the system is either inconsistent or has infinite number solutions.
Book's proof:
Let the matrix $\\ A = -B \implies Ax = -Bx = -c $ $$ (A + B)x = (-B + B)x = Ox = -c + c = O$$ O matrix is not invertible so system has infinite number of solutions.
My question:
Is my proof a valid one or did I just come up with a bogus proof? If it is incorrect can someone clarify where I might have gone wrong? Help is much appreciated.