Definition
The Ky Fan lemma is a combinatorial topological statement concerning the labeling of a triangulated $n$-dimensional ball (or sphere). It asserts that for any antipodal labeling of the vertices of a centrally symmetric triangulation that satisfies certain adjacency conditions, there must exist at least one pair of complementary labeled vertices joined by an edge (a “complementary edge”). The lemma generalizes Tucker’s lemma and is equivalent to the Borsuk–Ulam theorem.
Overview
First introduced by the Chinese‑American mathematician Ky Fan in the early 1950s, the lemma provides a discrete analogue of the Borsuk–Ulam theorem. It is widely employed in proofs of fixed‑point theorems, existence results in game theory, and various combinatorial optimization problems. By translating continuous topological statements into finite combinatorial configurations, the Ky Fan lemma serves as a bridge between algebraic topology and discrete mathematics.
Etymology / Origin
The lemma is named after Ky Fan (1914 – 2010), a mathematician noted for contributions to functional analysis, game theory, and combinatorial topology. His work on antipodal labelings and related fixed‑point results led to the formulation of the lemma that now bears his name.
Characteristics
| Aspect | Description |
|---|---|
| Setting | A centrally symmetric triangulation of an $n$-dimensional ball (or the boundary sphere) together with a labeling function assigning to each vertex an integer from ${ \pm1,\pm2,\dots,\pm n}$. |
| Antipodal labeling condition | For every pair of antipodal vertices $v$ and $-v$, the labels satisfy $\ell(-v) = -\ell(v)$. |
| Adjacency condition | No edge of the triangulation has endpoints whose labels are opposite integers of the same magnitude (i.e., an edge cannot connect vertices labeled $k$ and $-k$ for any $k$). |
| Conclusion | Under the above conditions, there exists at least one edge whose endpoints carry complementary labels $k$ and $-k$ for some $k$. |
| Equivalence | The lemma is equivalent to the Borsuk–Ulam theorem; a proof of one can be transformed into a proof of the other. |
| Generalizations | Extensions include higher‑dimensional versions, versions for simplicial complexes without central symmetry, and probabilistic analogues used in stochastic game theory. |
Related Topics
- Tucker’s lemma – a special case of the Ky Fan lemma for triangulations of the sphere.
- Borsuk–Ulam theorem – a fundamental result in topology equivalent to the Ky Fan lemma.
- Sperner’s lemma – another combinatorial lemma used in fixed‑point proofs, conceptually related through triangulation labeling.
- Ky Fan inequality – a distinct result in matrix analysis and convexity, also named after Ky Fan.
- Ky Fan minimax theorem – a result in game theory and optimization bearing the same eponym.
- Combinatorial topology – the broader field encompassing lemmas of this type.
The Ky Fan lemma remains a central tool in the interplay between discrete combinatorial methods and continuous topological theorems.