If a tensor product of matrices is symmetric, are the underlying matrices also symmetric?

555 Views Asked by At

Let $A_{i\tilde i} \in \mathbb{R}^{d^2},B_{j\tilde j} \in \mathbb{R}^{n^2}$ be real invertible square matrices.

Define $$ C_{ij,\tilde i\tilde j}:=A_{i\tilde i} B_{j\tilde j}$$ and suppose that $C_{ij,\tilde i\tilde j}=C_{\tilde i\tilde j,ij}$, that is $$ A_{i\tilde i} B_{j\tilde j}=A_{\tilde i i} B_{\tilde j j},$$

for all $i,\tilde i,j,\tilde j$.

Is it true that $A,B$ are symmetric, that is $A_{\tilde i i}=A_{i\tilde i}, B_{j\tilde j}=B_{\tilde j j}$

(More abstractly, the question is the following: suppose a tensor product of two non-degenerate bilinear forms is symmetric. Is it true that the factros are symmetric?)

2

There are 2 best solutions below

0
On BEST ANSWER

Arthur has given half the answer, so I'll give the other half.

$$\newcommand{\bmat}{\begin{pmatrix}}\newcommand{\emat}{\end{pmatrix}} \bmat 0&-1\\1&0 \emat \otimes \bmat 0&-1 \\1 & 0 \emat = \bmat 0 & 0 & 0 & 1 \\ 0 & 0 & -1 & 0 \\ 0 & -1 & 0 & 0 \\ 1 & 0 & 0 & 0\emat, $$ which is symmetric.

The idea is that when $A_{\tilde{i}i}$ and $B_{j\tilde{j}}$ aren't zero, the equation $$A_{i\tilde{i}}B_{j\tilde{j}}=A_{\tilde{i}i}B_{\tilde{j}j}$$ can be rearranged to give $$\frac{A_{i\tilde{i}}}{A_{\tilde{i}i}}=\frac{B_{\tilde{j}j}}{B_{j\tilde{j}}},$$ then since we can vary $j$ and $\tilde{j}$ while fixing $\tilde{i}$ and $i$, and similarly for $i$ and $\tilde{i}$, there is some constant $C$ such that (relabeling) when $A_{i\tilde{i}}\ne 0$, $\frac{A_{\tilde{i}i}}{A_{i\tilde{i}}}=C$, and when $B_{j\tilde{j}}\ne 0$, $\frac{B_{\tilde{j}j}}{B_{j\tilde{j}}}=C$. Now if $C\ne 0$, then when $B_{j\tilde{j}}\ne 0$, $B_{\tilde{j}j}\ne 0$, so we get $C^{-1}=C$. Hence $C=\pm 1$. If $C=1$, the matrix is symmetric. If $C=-1$ the matrix is antisymmetric. The point though is that the case $C=-1$, the case where both matrices are antisymmetric is a valid solution. I'm not entirely sure what matrices with $C=0$ look like, but based on the simplest such matrix, $\bmat 0 & 1 \\ 0 & 0 \emat$, it looks like they don't give valid solutions. Probably they're not invertible for one thing.

So I guess, if you formalize my work here that I used to construct a counterexample, you can probably at least salvage: If $A\otimes B$ is symmetric, then either $A$ and $B$ are both symmetric or both antisymmetric. Which is still nice.

0
On

Partial answer: If $B$ has a diagonal element which is non-zero, say $B_{1,1}$, you can look at $A_{i\tilde i} B_{1, 1}$, and vice versa. More generally, if there is a single entry in one matrix that is equal to the transposed entry, while being non-zero, the other matrix must be symmetric. In general, however, I have no idea.