1
$\begingroup$

Since my intuition for high dimensional geometry is not always right:

Consider the unit cube in $\mathbb{R}^m$ and for $n\leq m$ denote by $F^n$ the union of the $n$-facets. For what numbers of $m$ and $n$ does any $n$-dimensional subspace of $\mathbb{R}^m$ intersect $F^n$?

Extra: Consider the same question for $G^n$ = $F^n\setminus F^{n-1}$.

(P.S: What kind geometry tag would be appropriate?)

$\endgroup$
4
$\begingroup$

The condition for the first question is: $2n \geq m.$

$\endgroup$
  • $\begingroup$ Oh, cool. Any reference? $\endgroup$ – Dirk Dec 7 '11 at 20:37
  • $\begingroup$ Not specifically for that fact, but you can check out my paper "Asymptotic geometry of convex sets in $H^n$ and $E^n,$ motivated by this very fact" (arxiv.org or Advances in Math, the latter has slightly fewer typos). $\endgroup$ – Igor Rivin Dec 7 '11 at 20:41
3
$\begingroup$

Here's a way of thinking about Igor's answer to the first part:

Consider first a "generic" $n-$dimensional subspace defined by a system of $m-n$ equations. For any particular $n-$facet, being on that facet means you only have $n$ free variables. So if $n< m-n$, there isn't really any hope to satisfy all the equations at once.

Conversely, if you have a subspace satisfying $m-n \leq n$, you can imagine the following process. We will refer to a variable as fixed if its value is equal to $1$ or $-1$, and free otherwise.

We start at the point $v=0$, at which point all variables are free. If at any point there are fewer than $m-n$ free variables, then there must be a $w \neq 0$ in the subspace which is equal to $0$ at all fixed variables (here we're using $m-n \leq n$). We can then replace $v$ by $v+\lambda w$, where $\lambda$ is chosen to be as large as possible subject to the constraint that we still lie in the hypercube. This new vector is still in the subspace, and has (at least) one more fixed variable than before.

$\endgroup$
  • $\begingroup$ Thanks! That even allows to calculate a sample point in the intersection fairly easy. May I ask: Can one gain more information about the intersection, e.g. enumerate the facets which lie in the intersection? Is that problem hard? $\endgroup$ – Dirk Dec 14 '11 at 14:58

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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