The trace of a matrix is the sum of the eigenvalues and the determinant is the product of the eigenvalues. The fundamental theorem of symmetric polynomials says that we can write any symmetric polynomial of the roots of a polynomial as a polynomial of its coefficients. We can apply this to the characteristic polynomial of a matrix $A$ to write any symmetric polynomial of eigenvalues as a polynomial in the entries of $A$.


I stumbled upon an explicit formula for this. Let $A$ be an $n \times n$ matrix and $a\_1, \dots, a\_n$ be its eigenvalues. Then we have the following identity, provided the left hand side is a symmetric polynomial:


$$
\sum\_{i \in \mathbb{N}^n} p\_i a\_1^{i\_1} \cdots a\_n^{i\_n} = \sum\_{i \in \mathbb{N}^n} p\_i \det(A\_1^{i\_1}, \dots, A\_n^{i\_n})
$$


The determinant $\det(A\_1^{i\_1}, \dots, A\_n^{i\_n})$ on the right hand side is the determinant of a matrix with those column vectors, where $A\_i^k$ is the $i$-th column of the $k$-th power of $A$. The left hand side is a symmetric polynomial of the eigenvalues of $A$, and the right hand side is a polynomial of the entries of $A$.


Example: if $A$ is a $2\times 2$ matrix, then $$a\_1 a\_2^2 + a\_1^2 a\_2 = \det(A\_1, A\_2^2) + \det(A\_1^2, A\_2)$$


Proof. Let $p(A) \in End(\bigwedge^n V^\*)$ be given by $p(A)f(v\_1,\dots,v\_n) = \sum\_{i\in \mathbb{N}^n}f(A^{i\_1}v\_1,\dots,A^{i\_n}v\_n)$. We have $End(\bigwedge^n V^\*) \simeq \mathbb{R}$ and $p(A)$ is the right hand side of the identity under this isomorphism. Since $p(A)$ was defined basis independently, the right hand side is basis independent, and we get the left hand side in the eigenbasis. $\Box$


[Link to detailed proof and slight generalization to an identity on several commuting matrices.](http://julesjacobs.github.io/pdf/sympoly.pdf) E.g. for commuting $2\times 2$ matrices $A,B$:


$$a\_1 b\_1 a\_2^2 + a\_1^2 a\_2 b\_2 = \det(AB\_1, A\_2^2) + \det(A\_1^2, AB\_2)$$


This identity looks like it should be a few hundred years old, especially since the proof is quite simple, but I have not seen this in linear algebra courses. Is this a well known identity? Where should I look to learn more about these types of identities? Or, maybe I am mistaken and the identity is false? (though I have also empirically tested it with a [computer program](https://pastebin.com/raw/wFGJ54WZ)) I apologize if this question is too basic for mathoverflow; I am only doing pure mathematics for fun. I initially asked elsewhere but was advised to ask here. Thanks!



Formula expressing symmetric polynomials of eigenvalues as sum of determinants
This is not a reference, but a short proof.


We use the following (probably known, but see later) lemma on representing a symmetric tensor as a linear combination of rank-1 symmetric tensors.


**Lemma.** Let $A$ be a finite set, $K$ an infinite field. Denote by $\mathcal S$ the set of symmetric functions $p:A^n\to K$. Then $\mathcal S$ is the $K$-span of rank-one functions, that is, the functions of the type $h(x\_1)h(x\_2)\ldots h(x\_n)$, where $h:A\to K$.


**Proof.** Note that the product of two rank-one functions is a rank-one function. Thus the linear space $\mathcal T$, generated by rank-one functions, coincides with the $K$-algebra generated by them.


We may suppose that $A\subset K$. For $k=0,1,\ldots,n$ denote $e\_k(x\_1,\ldots,x\_n)$ the elementary symmetric polynomial, that is, $\varphi\_t(x\_1,\ldots,x\_n):=\prod(1+tx\_i)=\sum\_{k=0}^n t^ke\_k$. We identify $e\_k$ and the corresponding element of $\mathcal S$. Choosing $n+1$ distinct values $t\_1,\ldots,t\_{n+1}\in K$ and solving the corresponding (Vandermonde's) linear system of equations we represent each $e\_k$ as a linear combinations of $\varphi\_{t\_i}\in \mathcal T$. Thus $e\_k\in \mathcal S$ for all $k=0,1,\ldots,n$. It is well known that $e\_k$'s generate the algebra of symmetric polynomials (over any field). Thus any symmetric polynomial function belongs to $\mathcal T$. It remains to note that any symmetric function $f\in \mathcal S$ may be represented by a symmetric polynomial. Indeed, a symmetric function $f$ may be represented as $F(e\_1,e\_2,\ldots,e\_n)$ for certain function function $F$ defined on the corresponding finite set (because the values of $e\_1,\ldots,e\_n$ determine the values of $x\_1,\ldots,x\_n$ up to permutation). $F$ in turn coincides with a polynomial function on this finite set. $\square$


Now we may prove your theorem for finitely supported function $i\mapsto p\_i$. Due to Lemma it may be supposed to have the form $p\_i=\prod\_{k=1}^n H(i\_k)$ for a certain finitely supported function $H$ on $\mathbb{N}$ (as OP, I denote here $\mathbb{N}=\{0,1,\ldots\}$). In this case both parts of your identity are equal to $\det (\sum\_m H(m)A^m)$.


**Comment.** Lemma does not hold for finite fields. For example, if $A=K=\{0,1\}$. Then the function $x+y+z$ is not a linear combination of rank-one functions 1, $xyz$, $(x+1)(y+1)(z+1)$: if $x+y+z=a+bxyz+c(x+1)(y+1)(z+1)$, then for $y=0,z=1,x=a$ we get $0=1$. I must make a warning that in the subject-related paper "Symmetric tensors and symmetric tensor rank" by Pierre Comon, Gene Golub, Lek-Heng Lim, Bernard Mourrain (SIAM Journal on Matrix Analysis and Applications, 2008, 30 (3), pp.1254-1279) this statement, after equation (1.1), is stated for any field, although proved for complex numbers, and the proof uses that a non-zero polynomial has non-zero values.


In any case, you may always enlarge the ground field and safely think that it is infinite.


