0
$\begingroup$

Consider an arbitrary simplex $\mathcal{S} \subseteq \mathbb{R}^n$ ($\mathcal{S}$ is a polytope in $\mathbb{R}^n$ with $n+1$ vertices and non-empty interior). Let ${\bf P} \in \mathbb{R}^{m \times n}, m<n$ be an orthogonal matrix (in the sense that ${\bf P} {\bf P}^T = {\bf I}$, where ${\bf I} \in \mathbb{R}^{m \times m}$ is the identity matrix) defining a projection over a subspace of dimension $m$ of $\mathbb{R}^n$. Let $\mathcal{P} = {\bf P} \mathcal{S}$ be the projection of the simplex over such subspace.

My question is: what is the maximum amounts of vertices of $\mathcal{P}$?.

I am specially interested in low-dimensional cases ($m = 2$, $3$ or $4$ for example). I am also interested in special cases like the maximum amount for regular simplices.

Thanks in advance.

$\endgroup$

1 Answer 1

1
$\begingroup$

For every simplex $\Delta\subset\Bbb R^n$ with $n+1$ vertices and every number $m\le n$ there is an $m$-dimensional subspace $W\subseteq\Bbb R^n$ so that the orthogonal projection of $\Delta$ onto $W$ has $n+1$ vertices.

Proof.

Fix a polytope $P\subset\Bbb R^m$ with $n+1$ vertices. First, we show that $P$ is the orthogonal projection of some simplex $\Delta_P \subset\Bbb R^n$: if $P$ has vertices $v_0,...,v_n\in\Bbb R^m$, then for $i\in\{0,...,n\}$ the

$$w_i:=\underset{\!\!\!\!\!\!\!\!\begin{array} .\uparrow\\ \!\!\!\!\!\!\!\!\text{at index $m$}\end{array}}{\begin{cases} (v_i,0,...,0) & \text{for $i\le m$} \\ (v_i,0,...,1,...,0) & \text{for $i > m$} \end{cases}}\quad\in\Bbb R^n$$

are $n+1$ points in $\Bbb R^n$ in convex position. They necessarily form the vertices of some simplex $\Delta_P$. Also, the projection onto the first $m$ coordinates (which is orthogonal) yields the initial polytope $P$. Alternatively, we can say that the intersection of the subspace $\Bbb R^m\subset\Bbb R^n$ with the cylinder $C:=P+\Bbb R e_{m+1}+...+\Bbb R e_n$ is $P$.

Now, any two simplices in $\Bbb R^n$ with $n+1$ vertices are affinely equivalent, and so we can choose an affine transformation $X$ with $X\Delta_P= \Delta$. Clearly, the intersection of the transformed cylinder $X C$ with the transformed subspace $W':=X\Bbb R^m$ is still a polytope with $n+1$ vertices. The same is true if you replace $W'$ by a subspace $W\subseteq\Bbb R^n$ orthogonal to $Xe_i,i\in\{m+1,...,n\}$, as all cross-sections of the cylinder are affinely equivalent. But this intersection can be interpreted as the orthogonal projection of $\Delta=X\Delta_P$ onto $W$, which then has $n+1$ vertices. $\quad$ $\square$

As a side note, the intersection $XC\cap W$ is an affine transformation of $P$. Thus, given any simplex $\Delta\subset\Bbb R^n$ and any polytope $P\subset\Bbb R^m$ with $n+1$ vertices, $P$ is affinely equivalent to an orthogonal projection of $\Delta$.

$\endgroup$
5
  • $\begingroup$ I am not considering affine transformations, only rotations. Maybe there exists a simplex shape whose projection always has a low amount of vertices, regardless of the rotation? $\endgroup$ Commented Oct 27, 2021 at 15:39
  • 1
    $\begingroup$ The part about affine transformation is not really important for your question, I just wanted to point out that you cannot get every polytope by projecting a certain simplex, but only a very similar polytope with the same number of vertices. So no matter what simplex you start with, there is always a way to project it into $m$-dimensional space (for all $2\le m\le n$) so that the projection has $n+1$ vertices. $\endgroup$
    – M. Winter
    Commented Oct 27, 2021 at 15:42
  • $\begingroup$ Can you point me to a reference where I can keep reading about this, please? I would like to understand how can I always find such projection. $\endgroup$ Commented Oct 27, 2021 at 15:46
  • 1
    $\begingroup$ @DanielTurizo I updated my answer to include a complete proof. I saw that you accepted the answer before my edit, so just let me know wether I should roll back the changes. $\endgroup$
    – M. Winter
    Commented Oct 28, 2021 at 17:19
  • $\begingroup$ Your proof is exactly what I needed, please keep it in your answer. Thank you so much! $\endgroup$ Commented Oct 28, 2021 at 20:19

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .