Can Eigenvalues and Determinants Determine the Elements of a Square Matrix?

  • Thread starter Thread starter Cygni
  • Start date Start date
  • Tags Tags
    Matrix Square
Cygni
Messages
38
Reaction score
0
Hello,

Given that we have some matrix M with unknown real elements a, b, c, d and we know its eigenvalues \lambda_{1} and \lambda_{1} (no eigenvectors though) and the value of the determinant is it possible to find the elements and hence the matrix M using this informaiton?

Thanks
 
Physics news on Phys.org
No, there are infinite matrices with the same eigenvalues, but different eigenvectors. For example

\left(\begin{array}{cc}1&2\\0&3\end{array}\right)\qquad\textrm{and}\qquad\left(\begin{array}{cc}3&4\\0&1\end{array}\right)

have the same eigenvalues, but are...different!

By the way, the determinant is just the product of the eigenvalues, so it doesn't give further information.
 
Last edited:
I think that the below is basically correct...

Provided you have n eigenvalues for the nxn matrix, then if you know the eigenvalues then you know the matrix up to a similarity transformation.

If you also know the eigenvectors then that gives you the similarity transformation and thus you know the matrix up to permutation of rows. (provided the eigenvectors are distinct)
 
Simon_Tyler said:
If you also know the eigenvectors then that gives you the similarity transformation and thus you know the matrix up to permutation of rows. (provided the eigenvectors are distinct)

Actually in this case you know the matrix exactly, without any possibility of interchanging rows or columns, because if you change the order of the eigenvalues you have to change the order of the eigenvectors as well, and the result is always the same matrix.
 
@Petr

I knew (and have taught) that!
That should teach me not to post whilst watching tv.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
Back
Top