Is the operator norm always attained on a $\{0,1\}$-vector? - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-24T08:58:20Z http://mathoverflow.net/feeds/question/41660 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/41660/is-the-operator-norm-always-attained-on-a-0-1-vector Is the operator norm always attained on a $\{0,1\}$-vector? Seva 2010-10-10T07:27:00Z 2010-10-12T12:00:48Z <p>Given an operator $f\colon R^m\to R^n$, can one always find a non-zero vector <code>$x\in \{ 0,1 \}^m$</code> such that $\|f(x)\|/\|x\|\ge0.01\|f\|$? (Here I denote by $\|\cdot\|$ both the Euclidean norms in $R^m$ and $R^n$ and the induced operator norm.) The answer may well be negative -- any examples?</p> <hr> <p>In case the answer to the question above is no'' (or unknown), would it help to assume that the matrix of $f$ with respect to the standard orthonormal bases of $R^m$ and $R^n$ has all its elements equal to $0$ or $1$?</p> <hr> <p>As I see it, this is basically a question in the geometry of numbers, and I would expect the answer should be known.</p> http://mathoverflow.net/questions/41660/is-the-operator-norm-always-attained-on-a-0-1-vector/41665#41665 Answer by Pietro Majer for Is the operator norm always attained on a $\{0,1\}$-vector? Pietro Majer 2010-10-10T08:45:23Z 2010-10-10T08:49:45Z <p>Of course no. Remember that the operator norm of $A$ wrto the Eucliedan norms is the attained at an eigenvector of $S:=A^TA.$ Try a suitable simple binary $2\times 2$ matrix and compare the values of $\|Ax\|$ on the eigenvectors of $S$ and in the three nonzero binary vectors $(01), (10), (11).$</p> <p>However, if instead you take in the domain $\mathbb{R}^n$ either the $l^1$ norm <code>$\|\cdot \|_1$</code> or the $l^\infty$ norm <code>$\|\cdot\|_\infty$</code> then, whatever norm you have in the target space $\mathbb{R}^m$, the operator norm of $A$ is attained in an extremal point of the unit ball of the domain, which is in both cases a binary vector.</p> http://mathoverflow.net/questions/41660/is-the-operator-norm-always-attained-on-a-0-1-vector/41669#41669 Answer by Greg Kuperberg for Is the operator norm always attained on a $\{0,1\}$-vector? Greg Kuperberg 2010-10-10T09:42:53Z 2010-10-12T12:00:48Z <p>The answer is no. First, to understand the question, WLOG $f$ is symmetric and positive definite; a general $f$ has a polar decomposition $f = os$ and the orthogonal factor $o$ has no effect on any of the norms in question. Then, WLOG $f$ is a rank 1 projection. The second and subsequent eigenvalues of $f$ do not increase $||f||$, but they could increase $||f(x)||$ for some specific $x$. So in summary, we can assume that $f = vv^T$ for some vector $v$. The question is whether $v$ must always make a small angle with some binary vector.</p> <p>Let $$v = (1,\frac{1}{\sqrt{2}},\frac{1}{\sqrt{3}},\ldots,\frac{1}{\sqrt{m}}).$$ If $w$ is a binary vector of weight $k$, then $|v \cdot w|$ is maximized when the non-zero entries of $w$ are at the beginning. However, $$||w|| = \sqrt{k} \qquad ||v|| = \Theta(\sqrt{\log m}) \qquad |v \cdot w| = O(\sqrt{k}).$$ This means that the angle between $w$ and $v$ is large, and therefore $||f(w)|| = ||v (v \cdot w)||$ is small compared to $||f||\;||w|| = ||v||^2 ||w||$.</p> <p>The same proof works if <code>$\{0,1\}$</code> is replaced by <code>$\{-1,0,1\}$</code>, or indeed by any finite subset of $\mathbb{R}$. On the other hand, there is a variation of the question with a positive answer.</p> <p>Similar to Pietro Majer's remark, you can interpret the question as a comparison between two norms on $\mathbb{R}^m$. One is the $\ell^2$ norm, and the other is the norm whose unit ball is a polytope whose vertices are at the points in <code>$S = \{0,1\}^m$</code> and its negative. By the theory of spherical packings on a sphere, for any $c &lt; 1$, there exists a set $S$ of exponential size in $m$ such that the two norms are equal up to a factor of $c$. This is then a positive answer for that sample set of vector, even for constants close to 1. But such a set (coming from the centers of a sphere covering of the sphere) has to be fairly complicated, and I don't know if there are explicit asymptotic examples.</p>