If A and B are invertible square matrices, there exists

  • Thread starter Thread starter AntiElephant
  • Start date Start date
  • Tags Tags
    Matrices Square
AntiElephant
Messages
25
Reaction score
0

Homework Statement



If A and B are invertible matrices over an algebraically closed field k, show there exists \lambda \in k such that det(\lambda A + B) = 0.

The Attempt at a Solution



Can anyone agree with the following short proof? I tried looking online for a confirmation, but I wasn't exactly sure how to search exactly for this problem.

Suppose det(\lambda A + B) \neq 0 ~~\forall \lambda \in k

Since det(A^{-1}) \neq 0, then

det(A^{-1}(\lambda A + B)) = det(\lambda I + A^{-1}B) = det(A^{-1}B - (-\lambda)I) \neq 0 ~~\forall \lambda \in kSo -\lambda is not an eigenvalue for A^{-1}B for all -\lambda \in k. i.e. \lambda is not an eigenvalue of A^{-1}B for all \lambda \in k. Since k is algebraically closed this cannot be the case.

Is this okay? I guess it is not necessarily true when k is not algebraically closed?
 
Last edited:
Physics news on Phys.org
AntiElephant said:

Homework Statement



If A and B are invertible matrices over an algebraically closed field k, show there exists \lambda \in k such that det(\lambda A + B).
? What are you asked to show about det(\lambda A+ B)? You have a subject with no verb!

The Attempt at a Solution



Can anyone agree with the following short proof? I tried looking online for a confirmation, but I wasn't exactly sure how to search exactly for this problem.

Suppose det(\lambda A + B) \neq 0 ~~\forall \lambda \in k

Since det(A^{-1}) \neq 0, then

det(A^{-1}(\lambda A + B)) = det(\lambda I + A^{-1}B) = det(A^{-1}B - (-\lambda)I) \neq 0 ~~\forall \lambda \in kSo -\lambda is not an eigenvalue for A^{-1}B for all -\lambda \in k. i.e. \lambda is not an eigenvalue of A^{-1}B for all \lambda \in k. Since k is algebraically closed this cannot be the case.

Is this okay? I guess it is not necessarily true when k is not algebraically closed?
 
My bad...early morning. Edited.
 
AntiElephant said:
I guess it is not necessarily true when k is not algebraically closed?

You bet it can fail. Take A=[[0,1],[1,0]] and B=[[2,0],[0,1]]. What goes wrong if k is the field of rationals?
 
I didn't see that last bit about what happens when k is not algebraically closed. It can also fail with the reals. Just construct your matrices so the eigenvalues of A-1B are complex.
 
D H said:
I didn't see that last bit about what happens when k is not algebraically closed. It can also fail with the reals. Just construct your matrices so the eigenvalues of A-1B are complex.

Sure. But that's because the reals aren't algebraically closed. The det gives you a real polynomial. If it has no real roots, you are out of luck.
 
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