Algebraic/Matrix Manipulation (linear algebra)

boings
Messages
18
Reaction score
0

Homework Statement



I have attached the relevant question as an image (for sake of ease)

Homework Equations





The Attempt at a Solution



Also attached, in blue.


Thanks a lot for any help at all!
 

Attachments

  • Matrixmanip.jpg
    Matrixmanip.jpg
    41.2 KB · Views: 412
Physics news on Phys.org
You could consider ##B^k Y = 0##. Which property does B need to get non-trivial solutions for Y? How is that related to a?
##Y=(B-I_2)X##. How do you get Y=0 (which is a solution to the equation above) with non-trivial X? How is that related to a?
 
Perhaps the very beginning is where I'm having trouble, I don't know what times a matrix would be equal to zero. Is it the transpose? Or perhaps a matrix whose determinant is zero?
 
If you have studied matrices at all then you should know this basic property: the equation Ax= y has a unique solution if and only if A is invertible: x= A^{-1}y. And that is only true if A has non-zero determinant.

The equation Ax= 0 always has the "trivial" solution, x= 0. It has other solutions if and only if its determinant is 0.
 
You're right, I should know that basic property :) I've been cramming too much this semester so I tend to forget.

Thanks a lot it makes good sense.
 
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