In mathematics, Ky Fan's lemma (KFL) is a combinatorial lemma about labellings of triangulations. It is a generalization of Tucker's lemma. It was proved by Ky Fan in 1952.
Definitions KFL uses the following concepts.
B n {\displaystyle B_{n}} : the closed n-dimensional ball.
S n − 1 {\displaystyle S_{n-1}} : its boundary sphere. T: a triangulation of B n {\displaystyle B_{n}} . T is called boundary antipodally symmetric if the subset of simplices of T which are in S n − 1 {\displaystyle S_{n-1}} provides a triangulation of S n − 1 {\displaystyle S_{n-1}} where if σ is a simplex then so is −σ. L: a labeling of the vertices of T, which assigns to each vertex a non-zero integer: L : V ( T ) → Z ∖ { 0 } {\displaystyle L:V(T)\to \mathbb {Z} \setminus \{0\}} . L is called boundary odd if for every vertex v ∈ S n − 1 {\displaystyle v\in S_{n-1}} , L ( − v ) = − L ( v ) {\displaystyle L(-v)=-L(v)} . An edge of T is called a complementary edge of L if the labels of its two endpoints have the same size and opposite signs, e.g. {−2, +2}. An n-dimensional simplex of T is called an alternating simplex of T if its labels have different sizes with alternating signs, e.g.{−1, +2, −3} or {+3, −5, +7}.
Statement Let T be a boundary-antipodally-symmetric triangulation of B n {\displaystyle B_{n}} and L a boundary-odd labeling of T. If L has no complementary edge, then L has an odd number of n-dimensional alternating simplices.
Corollary: Tucker's lemma By definition, an n-dimensional alternating simplex must have labels with n + 1 different sizes. This means that, if the labeling L uses only n different sizes (i.e. L : V ( T ) → { + 1 , − 1 , + 2 , − 2 , … , + n , − n } {\displaystyle L:V(T)\to \{+1,-1,+2,-2,\ldots ,+n,-n\}} ), it cannot have an n-dimensional alternating simplex. Hence, by KFL, L must have a complementary edge.
Proof KFL can be proved constructively based on a path-based algorithm. The algorithm starts at a certain point or edge of the triangulation, then goes 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 an alternating simplex. The proof is by induction on n. The basis is n = 1 {\displaystyle n=1} . In this case, B n {\displaystyle B_{n}} is the interval [ − 1 , 1 ] {\displaystyle [-1,1]} and its boundary is the set { − 1 , 1 } {\displaystyle \{-1,1\}} . The labeling L is boundary-odd, so L ( − 1 ) = − L ( + 1 ) {\displaystyle L(-1)=-L(+1)} . Without loss of generality, assume that L ( − 1 ) = − 1 {\displaystyle L(-1)=-1} and L ( + 1 ) = + 1 {\displaystyle L(+1)=+1} . Start at −1 and go right. At some edge e, the labeling must change from negative to positive. Since L has no complementary edges, e must have a negative label and a positive label with a different size (e.g. −1 and +2); this means that e is a 1-dimensional alternating simplex. Moreover, if at any point the labeling changes again from positive to negative, then this change makes a second alternating simplex, and by the same reasoning as before there must be a third alternating simplex later. Hence, the number of alternating simplices is odd. The following description illustrates the induction step for n = 2 {\displaystyle n=2} . In this case B n {\displaystyle B_{n}} is a disc and its boundary is a circle. The labeling L is boundary-odd, so in particular L ( − v ) = − L ( v ) {\displaystyle L(-v)=-L(v)} for some point v on the boundary. Split the boundary circle to two semi-circles and treat each semi-circle as an interval. By the induction basis, this interval must have an alternating simplex, e.g. an edge with labels (+1,−2). Moreover, the number of such edges on both intervals is odd. Using the boundary criterion, on the boundary we have an odd number of edges where the smaller number is positive and the larger negative, and an odd number of edges where the smaller number is negative and the larger positive. We call the former decreasing, the latter increasing. There are two kinds of triangles.
… excerpt ends here. Continue reading the full article.
