I hope this is not too elementary for this site, but I already asked something similar on MSE which has not received any attention whatsoever. I am extremely unfamiliar with the algebraic/representation theoretic area where Young tableaux are frequently used, so I am posting it here slightly rewritten as compared to the MSE question hoping someone can help me understand this without me having to learn an entire area from skratch just for this.
My motivation is that I want to understand a proof given by Krupka in a paper (page 77 at formula (8) ) regarding total divergence equations in the calculus of variations.
If I remove the algebraic problem from its context, there is a finite $m$ dimensional real vector space $V$ and a tensor $T\in \left(S^r V\right)^{\otimes m}\otimes V\subseteq V^{\otimes mr+1}$ given in index notation as $$ T^{I_1...I_mj}, $$with each multiindex $I_k=(i_{1,(k)},\dots,i_{r,(k)})$ standing for a block of $r$ indices in which $T$ is symmetric.
This tensor observes the additional symmetry $$ T^{I_1...(I_k|...I_m|j)}=0\qquad(\sharp), $$i.e. when symmetrized over $I_kj$ for any $k=1,2,\dots,m$, it gives zero.
Krupka now proves that $$ T^{I_1...I_mj}=0\qquad(\ast). $$ As the proof technique Krupka gives, verbatim
We prove $(\ast)$ by showing that all Young diagrams, defining the Young decomposition of the expression on the left of $(\ast)$, vanish.
I already have some trouble interpreting this sentence, but I'll ask about it later.
Then the proof proceeds as follows:
- Since $T$ is symmetric in each of the blocks $I_k$, only those Young tableaux contribute in which every element of each block $I_k$ lies on one row.
- If $j$ is in the same row as one of the $I_k$, then by $(\sharp)$, the tableau gives zero. Thus $j$ goes to the last box of the tableau.
- If any row contains at least two multiindices $I_k$ then by taking column permutations, it is possible to bring $j$ to be in one row with an intact multiindex $I_k$, and we again get zero by 2.
- Thus the only possible nonzero tableau is $$\begin{matrix} I_1 \\ I_2 \\ \vdots \\ I_m \\ j\end{matrix}, $$ but the first column of this tableau has $m+1$ boxes to antisymmetrize on and as $\dim V=m$, hence this also gives zero. Therefore $T=0$.
Due to my unfamiliarity with Young symmetrizers, Schur modules etc. although I understand the general thought behind this proof, I am having trouble getting a precise and complete understanding.
- Just the general method of attack. From that I know the relevant tensor spaces can be decomposed as $$ \left(S^rV\right)^{\otimes m}\otimes V=\bigoplus_\lambda S^\lambda(V), $$where the $\lambda$ are numbered Young tableaux with $mr+1$ boxes and the $S^\lambda(V)$ are the corresponding Schur modules. The sum is over an appropriate set of Young tableaux. $$\ $$As far as I am aware all tableaux of the same shape give isomorphic Schur modules, and this sum has multiplicities. But tableaux with the same shape but different numbering give subspaces of $V^{\otimes mr+1}$ that are not literally the same as point sets. $$\ $$If $c_\lambda:V^{\otimes mr+1}\rightarrow S^\lambda(V)$ is the corresponding Young symmetrizer (symmetrizes the rows first, then antisymmetrizes the columns), then a scalar multiple of $c_\lambda$ is a projection, hence we should have $$ T=\sum_\lambda n_\lambda c_\lambda T. $$ So I suppose the idea behind the proof is to show that all Young symmetrizers $c_\lambda$ give zero when applied to $T$ right?
- The first step 1. in the list above is somewhat problematic for me. At first I assumed that if there is a tensor symmetric in a number of indices, then any Young symmetrizer is zero on it whenever the symmetric indices are not in the same row of the tableau. But this is manifestly false, for example if the tensor $\phi^{ijk}$ is symmetric in $ij$ but the symmetrizer corresponding to the tableau $$\begin{matrix} i & k \\ j\end{matrix}$$ gives (up to a scalar multiple) $$ (c_\lambda\phi)^{ijk}=\phi^{kji}-\phi^{kij}, $$ which is nonzero in general. So why can we disregard every tableau in which a multiindex $I_k$ is spread over multiple rows?
If my concerns above are answered then I understand the rest of the proof. So my questions are as above. However basically any answer that helps me understand Krupka's proof is helpful to me.
One thing I'd like to remark is that with the first point 1. it would be helpful to use Young symmetrizers with the alternative convention, i.e. antisymmetrize first and then symmetrize last. However then Step 2. would be ruined. Also Krupka later on (page 79 at formula (11) ) deduces that an object is antisymmetric in a set of indices from a similar argument except where Step 4. does not give a zero symmetrizer. Hence, Krupka certainly uses the "antisymmetrize last" convention.
Edit: As mentioned in the comments, I'd prefer to learn how this proof works as opposed to providing some alternative proof for the same result, since I wish to explore some of its implications and also generalize it.
One thing I thought about is that there is a rule $$ S_\lambda V\otimes S^rV=\bigoplus_\mu S_\mu V $$where the $\mu$ are tableaux obtained from $\lambda$ by adding $r$ boxes such that no two added boxes are in the same column.
Hence we can exclude those tableaux in which different elements of $I_k$ are in the same column. I then thought we can make column permutations to only consider tableaux in which each $I_k$ is on one row.
But this is also false, at least without some further arguments, because one cannot make column permutations in a tableaux freely without changing the Young symmetrizer since $c_{\pi\cdot\lambda}=\pi\cdot c_\lambda\cdot\pi^{-1}$, and if $\pi$ is a column permutation then $\pi\cdot c_\lambda=\pm c_\lambda$ but the additional factor of $\pi^{-1}$ on the right still remains.
I thought the answer was something simple I missed, but I strongly think now Krupka's proof is flawed or at least incomplete. The results he derives in the linked paper are known to be correct however (there are alternative proofs), so I suspect there is a way to make this proof sound. I am still quite interested in that.