10
$\begingroup$

I believe this may be a standard algebraic topology problem, so I apologize in advance if this belongs in stackexchange (it's not a homework problem, however, and came about in a research context). I've got a continuous map $f$ from the $n$-simplex to itself, such that the image of every strict sub-simplex is itself. So, each vertex gets mapped to itself, as does each edge, and so on and so forth. Does it follow that $f$ must be surjective?

Thank you!

$\endgroup$
2
  • 7
    $\begingroup$ Nice question, and nice solution by Neil Strickland. I don't recall seeing this in textbooks, but it clearly belongs there as a satisfying exercise. As the solution shows, one only needs to assume that each face of dimension $n-1$ is taken to itself. (But this implies that lower-dimensional faces are also preserved.) One can imagine generalizations to other polyhedra besides simplices. $\endgroup$ – Allen Hatcher Jun 9 '11 at 15:11
  • 1
    $\begingroup$ Perhaps one should add the tag "reference request" $\endgroup$ – Moritz Firsching Dec 30 '16 at 19:30
17
$\begingroup$

Given such a map $f:\Delta_n\to\Delta_n$, put $f_t(x)=(1-t)x+t f(x)$. This gives a homotopy between $f$ and the identity, and each map $f_t$ also sends every subsimplex to itself. In particular, each $f_t$ preserves $\partial(\Delta_n)$ and so induces a self-map $\overline{f}_t$ of the space $\Delta_n/\partial(\Delta_n)\simeq S^n$. It follows that $\overline{f}$ is homotopic to the identity, and so is not homotopic to a constant map. This means that $\overline{f}$ must be surjective (because any non-surjective map factors through a space $S^n\setminus\{a\}$, which is homeomorphic to $\mathbb{R}^n$ and so contractible). As $\Delta_n\setminus\partial(\Delta_n)$ is dense in $\Delta_n$, it follows that $f$ itself is also surjective.

$\endgroup$
5
$\begingroup$

Neil Strickland's answer is very nice. Let me add a slightly different answer, which might be useful in a similar situations, when a homotopy can't be given as easily.

Notice that the homotopy between $f$ and the identity implies that the map of $f: (\Delta_n,\partial\Delta_n)\to(\Delta_n,\partial\Delta_n)$ is of degree $1$, which then implies surjectivity. It is possible to show that $f$ is of degree $1$, whitout using the homotopy.

We proceed by induction, with $n=0$ being trivial. For a $(n-1)$-dimensional facet $\sigma$ in $\partial\Delta_n$, the map $f_{|\sigma}$ is of degree $1$ by induction. Hence the map $f_{|\partial\Delta_n}$ is also of degree $1$, i.e. $$(f_{|\partial\Delta_n})_*: H_{n-1}(\partial\Delta_n)\to H_{n-1}(\partial\Delta_n)$$ is the identity. A look at the long exact homology sequence $$\require{AMScd} \begin{CD} H_n(\Delta_n)@>{}>> H_n(\Delta_n,\partial\Delta_n) @>{\cong}>> H_{n-1}(\partial\Delta_n)@>{}>>H_{n-1}(\Delta_n)\\ @| @VV{f_*}V @V{\cong}V{(f_{|\partial\Delta_n})_*}V@|\\ 0 @. H_n(\Delta_n,\partial\Delta_n)@>{\cong}>>H_{n-1}(\partial\Delta_n)@.0 \end{CD}$$ gives that $f$ is also of degree $1$ as claimed.

$\endgroup$
2
$\begingroup$

Recently, in search for an early reference for this statement I came across this 2009 preprint by Roman Karasev: KKM-type theorems for products of simplices and cutting sets and measures by straight lines.

It has the statement as Lemma 1: Lemma 1

In the following pdf, also by Karasev: Geometry of measures: partitions and convex bodies, 2013, the statement appears as Lemma 9.2. There is a proof, very simliar to my other answer (and to the proof in the preprint from 2009): Lemma 9.2

Karasev also provides a very nice application: Brouwer's fixed-point theorem! enter image description here

I wonder whether 2009 is the first time this Lemma was written down somewhere, my feeling is that it should have been used by somebody before that time.

$\endgroup$
1
  • 2
    $\begingroup$ I just found a much earlier reference: it is Lemma 2.1 in: "Factoring Absolutely Convergent Series". William H. Ruckle; Robert E. Jamison. Mathematische Annalen (1976). Volume: 224, page 143-148. $\endgroup$ – J. Alejandro Chávez-Domínguez Mar 18 '17 at 1:50

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.