## Projecting the unit cube onto a (very special) subspace

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

Let $n>1$ be an integer, and $a>1$ a real number. Consider the subspace `$L<R^{2^n}$` generated by the $n$ possible tensor products of the $n-1$ copies of the vector $(1,a)$ and one copy of $(a,-1)$. (The $n$ generators of $L$ correspond to the $n$ positions where the factor $(a,-1)$ can be inserted into the product. Say, if $n=2$, then $L$ is generated by the two vectors $(a,-1,a^2,-a)$ and $(a,a^2,-1,-a)$.) Now for a vector $l\in L$ and a positive integer `$k\le 2^n$`, choose arbitrarily $k$ coordinates of $l$ and let $\sigma$ denote their sum. Since $\sigma$ is the scalar product of $l$ and a vector of norm $\sqrt k$, we have $$|\sigma| \le \|l\| \sqrt k.$$

My question is whether this trivial estimate can be improved by a growing factor; say,

Is it true that for any $l\in L$ and `$k\le 2^n$`, the sum of any $k$ coordinates of $l$ is at most `$C_a\|l\| \sqrt k / \log\log n$` in absolute value, with a constant $C_a$ depending only on $a$?

-

1
What are the coordinates of a vector in $R^{2^n}$ (that should be defined uniformly in $n$, for your question to make sense), do you consider it as the $n$-th tensor power of $R^2$ and generated by the elements $e_{i_1}\otimes e_{i_2}\otimes \dots \otimes e_{i_n}$? – Maurizio Monge Apr 15 2011 at 12:03
@Maurizio: the vectors, generating $L$, are vectors of the form `$e_1\otimes\dots\otimes e_n$`, where $n-1$ of the vectors $e_i$ are equal to $(1,a)$, and one of these vectors is equal to $(a,-1)$. So, all vectors $e_i$ lie in $R^2$, and their product lies in `$R^{2^n}$`. – Seva Apr 15 2011 at 14:28

## 1 Answer

I don't think so. Each generator $l$ of $L$ is a vector of length $2^n$ with $\binom{n}{i}$ entries equal to $\pm a^i$ for $0\le i \le n.$ So $\|l\|=(a^2+1)^{n/2}$ and there is only one entry which is $a^n$. If $a$ is large enough, then wouldn't that $k=1$ entry be larger than $\|l\| \sqrt 1 / \log\log n ?$

-

Correct - but, in fact, I didn't mean uniformity in $a$ here. I have inserted a minor, but important refinement. – Seva Apr 17 2011 at 6:17
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 50, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9336177110671997, "perplexity_flag": "head"}