Welcome to MathOverflow

Question

2

If $A$ is an $n\times n$ integer matrix, then trivially $S=A+A^t$ and $P = AA^t$ where $t$ is ``transpose", are both symmetric.

Assume that $A$ is also a "$\lbrace -1,1 \rbrace$" matrix, i.e., the square of each entry in $A$ is equal to $1$.

Is there some rational-coefficient symmetric polynomial $P(x,y)$ (depending possibly on $A$ ?) such that $$ P(A,A^t) $$ is also a $\lbrace -1,1 \rbrace$ matrix?

edited Jan 4 2011 at 3:16

Wadim Zudilin
8,674●1●24●59

asked Jan 4 2011 at 1:09

Luis H Gallardo
1,253●3●7

Luis, what is $A^*$? – Andres Caicedo Jan 4 2011 at 1:26

I assume $A^t = A^*.$ – Igor Rivin Jan 4 2011 at 1:41

3

There are trivial solutions. E.g. $P(A, A^t) = I$. Or, if $P$ is allowed to depend on $A$, then choose $P_A(A, A^t)$ to be an arbitrary symmetric $\{-1,1\}$ matrix. Or to make it something less obvious, take the product of all characteristic polynomials of all such $n\times n$ matrices -- you don't need to use $A^t$, just $A$, and you'll get 0. Probably an interpolation could be used to make the function have more "interesting" values. You need a better criterion for this question to make the criterion clear --- perhaps the motivation would help. – Bill Thurston Jan 4 2011 at 3:35

1

@Bill: Re your last construction -- 0 is not actually $\pm 1,$ so that does not work, but I agree that allowing the polynomial to depend on $A$ is silly. Here is a more specific question (probably of no interest to the original poster): Is there a polynomial (possibly depending on $n$) so that $P(A, B) = A \circ B,$ where $\circ$ denotes the Hadamard (entriwise) product of $A$ and $B$ and $A, B$ are $n \times n.$ – Igor Rivin Jan 4 2011 at 4:47

@Igor, such $P(A,B)$ should have been $AB$ when restricted to the diagonal matrices, so it does not exist in general when $n\ge 2$. – Wadim Zudilin Jan 4 2011 at 6:52

show 2 more comments

Wadim Zudilin · Accepted Answer · 2011-01-04 10:05:56Z UTC

As already mentioned in the comments above, it's not a big deal to find such a polynomial for a particular $\pm1$ matrix. If the question is about a "universal" polynomial (that is, depending only on $n$), then I would expect the answer "no". For $n=2$, take the matrix $$ A=\left(\begin{matrix} 1 & -1 \cr 1 & 1 \end{matrix}\right). $$ Then $A+A^t=2I_2$ and $AA^t=2I_2$ where $I_2$ denotes the $2\times 2$ identity matrix. Because any symmetric polynomial with numerical (not matrix!) coefficients is a polynomial in $A+A^t$ and $AA^t$, its value will be always $cI_2$ for a certain numerical constant $c$. Therefore, the off-diagonal entries will be always zero.

Symmetric polynomials preserving $-1,1$ matrices

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

1 Answer

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.