Determining $\mbox{tr}(A)$ and $\det(A)$ as functions of the eigenvalues of a matrix So if I have an $n\times n$ matrix $A$ that is diagonalizable then how do I determine $\mbox{tr}(A)$ and  $\det(A)$ as functions of the eigenvalues of the matrix? 
For  $\det(A)$, I know the formula for eigenvalues is $\det(A−tI)$ which would be 
$$(-1)^n(t-\lambda_1)\dots (t-\lambda_n)$$
where $\lambda_i$ are the eigenvalues of $A$. 
For $\mbox{tr}(A)$ could I also do something similar to that? I'm just not sure how this question works. 
 A: If we write the Jordan Normal Form for the matrix $A$ we get:
$$A=P^{-1}JP$$
and $J$ has all eigenvalues on the diagonal but $J$ not necessearily is a diagonal matrix.
So $\det(A)=\det(J)$ and $\det(J)$ is the product of the eigenvalues. 
Now using the known relation $\mbox{tr} (AB)=\mbox{tr} (BA)$ we have:
$$\mbox{tr} (A)=\mbox{tr} (P^{-1}JP)=\mbox{tr} (JPP^{-1})=\mbox{tr} (J)$$
and $\mbox{tr} (J)$ is the sum of eigenvalues.
A: If A is diagonalizable, $A=UDU^{-1}$, with $D$ diagonal matrix with the eigenvalues in the diagonal ($D=diag(\{\lambda\}_{i=1}^{n})$), and $U$ invertible. The determinant does not vary when multiplying by invertible matrices.
A: It is not difficult to show that the coefficient of the term $\lambda^{n-1}$ of the characteristic equation $(A-\lambda I)=0$ of an $n \times n$ matrix $A$ is exactliy $ a_{n-1}=\mbox{tr} (A)$.  
Now remember that the eigenvalues are the roots $\lambda_i$ of this polynomial, so that $$(A-\lambda I)=0 \quad \iff \quad (\lambda -\lambda_1)(\lambda- \lambda_2)\cdots(\lambda-\lambda_n)=0$$ so, from the Vieta's formulas, the coefficient of $\lambda^{n-1}$ is the sum of the $n$ eigenvalues (counted with their multiplicity). 
Note that this result does not depend on the fact that the matrix $A$ is diagonalizable or not.
In an analogous way  we can proof that the term $a_0$ is the determinant of the matrix $A$ and it is the product of the eigenvalues.
