2
$\begingroup$

A complex $n\times n$ matrix $A=[a_{ij}]$ is called a Hadamard matrix if $A^{+}A=nI$ and $|a_{ij}|=1$ holds for all $i,j$, where $A^{+}$ denotes the conjugate transposed matrix of $A$, and a vector $x=(x_1,x_2.....x_n)\in \mathbb{C}^n$ is called unit if $|x_i|=1$ holds for all $i$.

For $n>5$, are there $d\times n$ matrix $F=[f_{ij}]$ which satisfies the following properties:

  1. $FF^{+}=dI$,

  2. $|f_{ij}|=1$ , holds for all $i,j$,

  3. there is no unit vector $x\in \mathbb{C}^n$ satisfies $F x^{+}=0$.

Which can be regarded as the difficulty of generate complex Hadamard matrix, actually, it is wanted to show the following method to find a complex Hadamard matrix does not always work:

Let $S$ be an empty set, choose a unit vector $x$ which is orthogonal to all the elements in $S$, and put $x$ in $S$, until there is no unit vector which orthogonal to all elements in $S$. Now what we ask can be regarded as is it possible that the algorithm stops but $|S|< n$.

$\endgroup$
10
  • 7
    $\begingroup$ What, exactly, is the question? $\endgroup$ Nov 5, 2010 at 6:17
  • 3
    $\begingroup$ My take: are there dxn matrices which look like submatrices of an nxn complex Hadamard matrix, but actually are not? Gerhard "Ask Me About System Design" Paseman, 2010.11.04 $\endgroup$ Nov 5, 2010 at 6:32
  • $\begingroup$ Exactly as what you said. $\endgroup$
    – gondolf
    Nov 5, 2010 at 6:34
  • 3
    $\begingroup$ Despite Gerhard's best efforts, I still don't understand what's being asked. Perhaps it's time for MO to hire a full-time mindreader, fluent in mathematics. $\endgroup$ Nov 5, 2010 at 10:37
  • $\begingroup$ The latest edit is helpful, but I wonder whether in condition 3 you really only want $x$ to be a unit vector, which just means a vector of length 1. In the previous edit, you asked for all the components of $x$ to have modulus 1, a very different thing. The way you have it now, I think it's trivial that there is no such $F$. $\endgroup$ Nov 5, 2010 at 13:15

1 Answer 1

0
$\begingroup$

The circulant matrix $G$ with $3$ rows, $8$ columns and with first row

\begin{equation*} G= \begin{bmatrix} -1 & -1 & 1 & -1 & 1 & 1 & 1 & 1\\ \end{bmatrix} \end{equation*} satisfies

(1) $$ GG^{T} = 8I, $$

(2)

All entries in $G$ are $-1$ or $1$,

(3)

The only solution to: $XG=0$ is $X=0.$

Thus, there is no unit vector with $XG=0.$

$\endgroup$
7
  • 1
    $\begingroup$ I am suspicious of the claim XG = 0. However, even if it holds, the problem is to show that one cannot find a complex unit vector X in C^8 with GX = 0. Given the degree of freedom in such a system, I suspect X exists. Gerhard "Ask Me About System Design" Paseman, 2011.01.17 $\endgroup$ Jan 17, 2011 at 22:52
  • 1
    $\begingroup$ excuse me, I need to clarify: I am suspicious of the claim XG =0 implies X = 0. Gerhard "Know What Your Suspicions Are" Paseman, 2011.01.17 $\endgroup$ Jan 17, 2011 at 22:54
  • $\begingroup$ Just do the computation ! Observe that we have only $3$ unknowns here (say $x,y,z$ ), we get quickly $x=0,y=0,z=0.$ $\endgroup$ Jan 18, 2011 at 0:14
  • $\begingroup$ $X$ is assumed above to be a matrix with $1$ line and $3$ columns only. $\endgroup$ Jan 18, 2011 at 0:19
  • $\begingroup$ Doesn't the OP really want that the only solution to $Gx=0$ is $x=0$, where $x$ is a vector with all unit entries? Matrices don't commute. $\endgroup$
    – Peter Shor
    Feb 14, 2011 at 23:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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