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...

The following are named after him: Ky Fan norms Ky Fan inequality Ky Fan inequality (game theory) Ky Fan lemma Sur quelques notions fondamentales de...

lemma Littlewood–Offord lemma Pólya–Burnside lemma Sperner's lemma Ky Fan lemma (combinatorial geometry) Berge's lemma Counting lemma Crossing lemma Expander...

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...

simplexes. The proof uses Sperner's theorem, the K-K-M lemma, Gale's covering lemma and Ky Fan's lemma on coincidence points. In some cases, the 'cake' to...

infinite-dimensional locally convex topological vector spaces by Irving Glicksberg and Ky Fan. To state the theorem in this case, we need a few more definitions: Upper...

variables over a fixed probability space. This topology is metrizable by the Ky Fan metric: d ( X , Y ) = inf { ε > 0 :   P ( | X − Y | > ε ) ≤ ε } {\displaystyle...

Hardy–Littlewood maximal inequality Inequality of arithmetic and geometric means Ky Fan inequality Levinson's inequality Maclaurin's inequality Mahler's inequality...

reaction. Ky Fan norms: The sum of the k largest singular values of M is a matrix norm, the Ky Fan k-norm of M. The first of the Ky Fan norms, the Ky Fan 1-norm...

Pablo Parrilo, Motakuri Ramana, 2005) The Langlands–Shelstad fundamental lemma (Ngô Bảo Châu and Gérard Laumon, 2004) Milnor conjecture (Vladimir Voevodsky...