Proving Linear Dependence in Complex Matrix Space

Monochrome
Messages
11
Reaction score
0

Homework Statement


If C is a n by n matrix with complex coefficient show that there is an integer k >0 that depends only on n such that C, C^2,C^3,...C^k are lin dependant.

The Attempt at a Solution



Its meant to be a full proof but the only idea I vaguely have is that i^4=i. I'm sure this is something standard to prove but I couldn't find it on google, so a link with an explanation would be appreciated.
 
Physics news on Phys.org
I can't remember much linear algebra but I would try considering the following. Suppose the dimension of a vector space is 6. Is it possible to extract 7 linearly independent vectors from that vector space?
 
Cayley-Hamilton tells us that C satisfies its own characteristic polynomial.
 
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