Sperner's lemma

From Wikipedia, the free encyclopedia

In combinatorial mathematics, Sperner's lemma states that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors. The initial result of this kind was proved by Emanuel Sperner, in relation with proofs of invariance of domain. Sperner colorings have been used for effective computation of fixed points, in root-finding algorithms, and are applied in fair division algorithms.

According to the Soviet Mathematical Encyclopaedia (ed. I.M. Vinogradov), a related 1929 theorem (of Knaster, Borsuk and Mazurkiewicz) has also become known as the Sperner lemma - this point is discussed in the English translation (ed. M. Hazewinkel).

1 Two-dimensional case
2 Multidimensional case
3 Proof
4 External link

[edit] Two-dimensional case

The two-dimensional case is the one referred to most frequently. It is stated as follows:

Given a triangle ABC, and a triangulation T of the triangle. The set S of vertices of T is colored with three colors in such a way that

A, B and C are colored 1, 2 and 3 respectively
Each vertex on an edge of ABC is to be colored only with one of the two colors of the ends of its edge. For example, each vertex on AC must have a color either 1 or 3.

Then there exists a triangle from T, whose vertices are colored with the three different colors.

[edit] Multidimensional case

In the general case the lemma refers to a n-dimensional simplex

$\mathcal{A}=A_1 A_2 \ldots A_{n+1}$ .

We consider a triangulation T which is a disjoint division of $\mathcal{A}$ into smaller n-dimensional simplices. Denote the coloring function as f : S → {1,2,3,...,n,n+1}, where S is again the set of vertices of T. The rules of coloring are:

The vertices of the large simplex are colored with different colors, i. e. f(A_i) = i for 1 ≤ i ≤ n+1.
Vertices of T located on any given k-dimensional subface

$A_{i_1}A_{i_2}\ldots A_{i_k}$

are colored only with the colors

$f(A_{i_1}),f(A_{i_2}),\ldots,f(A_{i_k})$ .

Then there exists a simplex from T, whose vertices are colored with all n+1 colors.

[edit] Proof

We shall first address the two-dimensional case. Consider a graph G built from the triangulation T as follows:

The vertices of G are the members of T plus the area outside the triangle. Two vertices are connected with an edge if their corresponding areas share a common border, which is colored 1-2.

Note that on the interval AB there is an odd number of borders colored 1-2 (simply because A is colored 1, B is colored 2; and as we move along AB, there must be an odd number of color changes in order to get different colors at the beginning and at the end). Therefore the vertex of G corresponding to the outer area has an odd degree. But it is known that in a finite graph there is an even number of vertices with odd degree, and therefore there is an odd number of vertices with odd degree corresponding to members of T.

It can be easily seen that the only possible degree of a triangle from T is 0, 1 or 2, and that the degree 1 corresponds to a triangle colored with the three colors 1, 2 and 3.

Thus we have obtained a slightly stronger conclusion, which says that in a triangulation T there is an odd number (and at least one) of full-colored triangles.

A multidimensional case can be proved by induction on the dimension of a simplex. We apply the same reasoning, as in the 2-dimensional case, to conclude that in a n-dimensional triangulation there is an odd number of full-colored simplices.