Proving C(AB) = C(A) with Orthogonal Complement and Matrix Multiplication

samuelr0750
Messages
3
Reaction score
0

Homework Statement


R(M) and C(M) are the row and column spaces of M.
Let A be an nxp matrix, and B be a bxq matrix.
Show that C(AB) = C(A) when the orthogonal complement of R(A) + C(B) = R^p (i.e. the orthogonal complement of R(A) and C(B) span R^p).


Homework Equations


I know that the orthogonal complement of R(A) is the null spaceo f A.
I also know that C(X'X) = C(X') but that doesn't help


The Attempt at a Solution


Not sure where to go... thanks.
 
Physics news on Phys.org
samuelr0750 said:

Homework Statement


R(M) and C(M) are the row and column spaces of M.
Let A be an nxp matrix, and B be a bxq matrix.
Show that C(AB) = C(A) when the orthogonal complement of R(A) + C(B) = R^p (i.e. the orthogonal complement of R(A) and C(B) span R^p).
Are you sure you stated the question correctly? If ##A## is ##n \times p## and ##B## is ##b \times q##, then the product ##AB## isn't even defined unless ##p = b##.
 
I"m sorry, i meant A is nxp and B is p xq.
 
By "orthogonal complement of R(A) + C(B)" do you mean ##R(A)^{\perp} + C(B)##, or something else?
 
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