Tucker's lemma

In this example, where n=2, the red 1-simplex has vertices which are labelled by the same number with opposite signs. Tucker's lemma states that for such a triangulation at least one such 1-simplex must exist.

In mathematics, Tucker's lemma is a combinatorial analog of the Borsuk–Ulam theorem, named after Albert W. Tucker.

Let T be a triangulation of the closed n-dimensional ball ${\displaystyle B_{n}}$. Assume T is antipodally symmetric on the boundary sphere ${\displaystyle S_{n-1}}$. That means that the subset of simplices of T which are in ${\displaystyle S_{n-1}}$ provides a triangulation of ${\displaystyle S_{n-1}}$ where if σ is a simplex then so is −σ. Let ${\displaystyle L:V(T)\to \{+1,-1,+2,-2,...,+n,-n\}}$ be a labeling of the vertices of T which is an odd function on ${\displaystyle S_{n-1}}$, i.e, ${\displaystyle L(-v)=-L(v)}$ for every vertex ${\displaystyle v\in S_{n-1}}$. Then Tucker's lemma states that T contains a complementary edge - an edge (a 1-simplex) whose vertices are labelled by the same number but with opposite signs.^[1]

Proofs[]

The first proofs were non-constructive, by way of contradiction.^[2]

Later, constructive proofs were found, which also supplied algorithms for finding the complementary edge.^[3][4] Basically, the algorithms are path-based: they start at a certain point or edge of the triangulation, then go from simplex to simplex according to prescribed rules, until it is not possible to proceed any more. It can be proved that the path must end in a simplex which contains a complementary edge.

An easier proof of Tucker's lemma uses the more general Ky Fan lemma, which has a simple algorithmic proof.

The following description illustrates the algorithm for ${\displaystyle n=2}$.^[5] Note that in this case ${\displaystyle B_{n}}$ is a disc and there are 4 possible labels: ${\displaystyle -2,-1,1,2}$, like the figure at the top-right.

Start outside the ball and consider the labels of the boundary vertices. Because the labeling is an odd function on the boundary, the boundary must have both positive and negative labels:

• If the boundary contains only ${\displaystyle \pm 1}$ or only ${\displaystyle \pm 2}$, there must be a complementary edge on the boundary. Done.
• Otherwise, the boundary must contain ${\displaystyle (+1,-2)}$ edges. Moreover, the number of ${\displaystyle (+1,-2)}$ edges on the boundary must be odd.

Select an ${\displaystyle (+1,-2)}$ edge and go through it. There are three cases:

• You are now in a ${\displaystyle (+1,-2,+2)}$ simplex. Done.
• You are now in a ${\displaystyle (+1,-2,-1)}$ simplex. Done.
• You are in a simplex with another ${\displaystyle (+1,-2)}$ edge. Go through it and continue.

The last case can take you outside the ball. However, since the number of ${\displaystyle (+1,-2)}$ edges on the boundary must be odd, there must be a new, unvisited ${\displaystyle (+1,-2)}$ edge on the boundary. Go through it and continue.

This walk must end inside the ball, either in a ${\displaystyle (+1,-2,+2)}$ or in a ${\displaystyle (+1,-2,-1)}$ simplex. Done.

Run-time[]

The run-time of the algorithm described above is polynomial in the triangulation size. This is considered bad, since the triangulations might be very large. It would be desirable to find an algorithm which is logarithmic in the triangulation size. However, the problem of finding a complementary edge is PPA-complete even for ${\displaystyle n=2}$ dimensions. This implies that there is not too much hope for finding a fast algorithm.^[6]

Equivalent results[]

There are several fixed-point theorems which come in three equivalent variants: an algebraic topology variant, a combinatorial variant and a set-covering variant. Each variant can be proved separately using totally different arguments, but each variant can also be reduced to the other variants in its row. Additionally, each result in the top row can be deduced from the one below it in the same column.^[7]

See also[]

• Topological combinatorics

References[]