Problems

Sperner’s lemma in dimension \(2\).
Subdivide a triangle \(ABC\) arbitrarily into a triangulation consisting of smaller triangles meeting edge to edge. Define Sperner coloring of the triangulation as an assignment of three colors to the vertices of the triangulation such that:

• Each of the three vertices \(A, B,\) and \(C\) of the initial triangle has a distinct color

• The vertices that lie along any edge of triangle \(ABC\) have only two colors, the two colors at the endpoints of the edge. For example, each vertex on \(AC\) must have the same color as \(A\) or \(C.\)

Here is an example of Sperner’s triangulation

Prove that every Sperner coloring of every triangulation has at least one "rainbow triangle", a smaller triangle in the triangulation that has its vertices colored with all three different colors. More precisely, there must be an odd number of rainbow triangles.

Prove the general version of Sperner’s lemma: Consider an \(n\)-dimensional simplex \(\mathcal{A} = A_1A_2...A_{n+1}\). Strictly speaking a simplex is a convex linear combination of \(n+1\) points in general position (when \(k\) points are never in one subspace of dimension \(k-1\)). One can view it as an \(n\)-dimensional tetrahedron or a body spanned over vertices \((0,0,...,0), (1,0,0,...,0), (0,1,0,0...,0), ... (0,0,...0,1)\). \[\mathcal{A} = \{\sum_{i=1}^{n+1}a_i(0,0,...,1,...,0), \,\,\, a_i \geq 0, \,\,\,\, \sum_{i=1}^{n+1}a_i = 1\}.\]

A simplicial subdivision of an \(n\)-dimensional simplex \(\mathcal{A}\) is a partition of \(\mathcal{A}\) into small simplices (cells) of the same dimension, such that any two cells are either disjoint, or they share a full face of a certain dimension.
Define a Sperner’s coloring of a simplicial subdivision as an assignment of \(n+1\) colors to the vertices of the subdivision, so that the vertices of \(\mathcal{A}\) receive all different colors, and points on each face of \(\mathcal{A}\) use only the colors of the vertices defining the respective face of \(\mathcal{A}\).
Prove that every Sperner’s coloring of any subdivision of an \(n\)-dimensional simplex contains an odd number of rainbow simplexes, namely whose vertices are colored using all \(n+1\) colors.