Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $T$ be a covariant $k$-tensor on a finite dimensional vector space $V$. I want to prove that the symmetrization of $T$ is the unique symmetric $k$-tensor satisfying the following condition:

$(\operatorname{Sym} T)(A,\ldots,A)=T(A,\ldots,A)$ for all $A \in V$.

Definition. Symmetrization of $T$ is defined as $$(\operatorname{Sym}T)(A_1,\ldots,A_k)=\frac{1}{k!} \sum_{\sigma \in S_k} T(A_{\sigma(1)},\ldots,A_{\sigma(k)})$$ where $S_k$ is the symmetric group on $k$ letters.

I assumed that there exists another symmetric $k$-tensor $\tilde{T}$ which satisfies the condition. Since $\tilde{T}$ is symmetric, it is equal to its symmetrization $\operatorname{Sym} \tilde{T}$. Then I tried to show that $(\operatorname{Sym}T)(A_1,\ldots,A_k)=\tilde{T}(A_1,\ldots,A_k)$, or equivalently, $(\operatorname{Sym}T)(A_1,\ldots,A_k)=(\operatorname{Sym}\tilde{T})(A_1,\ldots,A_k)$ but I couldn't.

Thanks in advance.

share|cite|improve this question
up vote 5 down vote accepted

Here's an analysis of the case $k=2$. Suppose $\bar T$ is another symmetric tensor satisfying $\bar T(A,A)= T(A,A)$ for all $A$.

Now $$T(x+y,x+y)=\bar T(x+y,x+y)= \bar T(x,x)+\bar T(x,y)+\bar T(y,x)+\bar T(y,y).$$ This equals $T(x,x)+2\bar T(x,y)+T(y,y)$. Thus $$\bar T(x,y)=\frac{1}{2}(T(x+y,x+y)-T(x,x)-T(y,y)).$$ So $\bar T$ is uniquely determined by $T$. Since $Sym(T)$ is symmetric and also satisfies the formula $Sym(T)(A,A)=T(A,A)$, $\bar T$ and $Sym(T)$ must be equal.

A similar, but more complicated, argument works in the case of $k>2$.

share|cite|improve this answer
A keyword to search for this is polarization. – Mariano Suárez-Alvarez Jan 9 '12 at 22:09

A symmetric tensor $T:V^n\to k$ descends to a linear functional $\tilde{T}:\mathrm{Sym}^nV\to k$ on the symmetric algebra. Denote the diagonal $V^{[n]}=\{v^n:v\in V\}$. As illustrated in the other answer, when $n=2$,

$$xy=\frac{(x+y)^2-(x^2+ y^2)}{2},$$

demonstrating that every element in $\mathrm{Sym}^2(V)$ can be written as a combination of elements from our set of squares $V^{[2]}$. Similarly, for arbitrary $n$, it suffices for our purposes to show that $\langle V^{[n]}\rangle$ is always $\mathrm{Sym}^nV$, because then every element is a linear combination of the $n$th powers, and so $\tilde{T}$ is uniquely determined by its values on $V^{[n]}$.

Equivalently, we seek to prove that in the polynomial ring $k[x_1,\cdots,x_n]$, the elementary symmetric polynomial $e_n$ can be written as a sum of $n$th powers of degree $1$ homogeneous (but not necessarily symmetric!) polynomials. If we can do this, we can write $x_1\cdots x_n$ as a linear combination of terms from $V^{[n]}$ by mimicking the formula for the polynomial ring.

This is an incomplete answer. I'm not sure if the above thoughts make this question (in the general case) easier, or harder, but it seems like a natural route to follow. I will ask a follow-up question...

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.