EDITED FOR (hopeful) CLARITY:
For a simple Lie algebra $\mathfrak{g}$ (over $\mathbb{C}$) and its adjoint group G, the $G$-invariant polynomials on $\mathfrak{g}$ are linear combinations of products of traces, i.e. linear combinations of products of functions of the form $$P(X) = tr_V(\pi(X)^n)$$ for representations $(V,\pi)$, by the Chevalley Restriction theorem.
Is this also true for $G$-invariant tensors as well? AreIn the elementsfollowing sense:
We define functions
$$T_V(X_1,\ldots,X_n) = tr_V(\pi(X_1)\cdots\pi(X_n))$$
for representations $(V,\pi)$.
For an integer $n$, a permutation $\sigma \in S_n$, a sequence of integers $\bigotimes^* \mathfrak{g}^\vee$ also linear combinations$1 = k_0 < k_1 < \ldots k_m = n$, and a sequence of representations $(V_i,\pi_i)$, we define a tensor productsmonomial as
$$\prod_{i=1}^m T_{V_i}(X_{\sigma(k_{i-1}+1)},X_{\sigma(k_{i-1}+2)},\ldots,X_{\sigma(k_i}))$$
The purpose of the $\sigma$ is to distribute the variables across the various traces, i.e. functions of the formso that both
$$T(X_1,\ldots,X_n) = tr_V(\pi(X_1)\cdots\pi(X_n)),$$$$T(X_1,X_2)T(X_3,X_4,X_5)$$
along with rearrangementand
$$T(X_2,X_4)T(X_3,X_1,X_5)$$
are tensor monomials in this sense.
Question: Is it true that all of the $G$-invariant elements of $\bigotimes^* \mathfrak{g}^*$ are linear combinations of tensor indicesmonomials?
Note: I am only interested in tensor invariants of the adjoint representation; the tensor invariants of the minimal representations have been worked out to various extents, but those are not the ones I'm directly interested in.
I have managed to prove this for the classical Lie algebras, and indeed for $A_r, B_r$ and $C_r$ we can take the minimal representation for $(V,\sigma)$. For $D_r$ we need to do something for the Pfaffian, but once we have that we have everything. All of this follows from the invariant theory of these Lie algebras, which is fairly straightforward.
Unfortunately, the invariant theory of the exceptional Lie algebras is somewhat more complicated, and so I haven't been able to show this statement for them. I think it's true, and I have some little bits of computational evidence that we only have to use the minimal representations for these cases as well, but no proof. Is there any literature on this?