no. 13 · Wednesday 11 November 2026
Around Sperner's lemma
Abstract
Sperner's lemma guarantees a triangle with three different labels. How many such triangles must there be? We begin with the familiar proof by doors and rooms and show that orienting the doors gives an exact signed count. The boundary labeling then provides a lower bound even when the region has holes. With more than three labels, a small geometric construction supplies an additional factor: a boundary that winds $w$ times around a cycle of $n$ labels forces at least $(n-2)|w|$ colorful triangles. We connect the count to Brouwer's fixed point theorem and elementary winding arguments, derive a quantitative version of Tucker's lemma, and conclude with a higher-dimensional glimpse in which the Hopf invariant forces nine tetrahedra.
- comments
- 14 pages, 6 figures
- fields
- Combinatorics, Metric Geometry