For a simplex with vertices indexed by , let closed sets have the property that every face spanned by an index set lies in . Then is nonempty. The triangle KKM lemma is a two-dimensional covering formulation of this simplex-intersection principle.
If three closed sets cover a triangle and respectively contain its three opposite sides, then their triple intersection is nonempty.
Let closed subsets of a triangle have empty common intersection. Their distance functions have positive sum at every point, so
are continuous barycentric coordinates. If one is empty it may be assigned the constant positive function one instead. The denominator condition is essential; the formula is undefined on a common intersection.
If the cover the triangle, at least one vanishes everywhere, placing on its boundary. If also contains the side opposite the th vertex, then on that side: the map carries each side into itself. The no-retraction covering principle rules out this boundary-valued continuous map, proving the triangle KKM lemma.
Let be an -dimensional simplex, , with barycentric coordinates . Suppose closed sets cover it and each contains the opposite face of a simplex . Then their common intersection is nonempty. This is the higher-dimensional opposite-face version of the triangle KKM lemma.
If the common intersection were empty, normalized distance functions to the would give a continuous map carrying every face of a simplex into itself. On the boundary, the straight interpolation stays in the same face of a simplex, so is homotopic to the identity map. It therefore induces the identity on reduced top homology. Yet it extends across the contractible simplex, whose reduced homology is zero, a contradiction.
Conversely, any such face-preserving boundary-valued continuous map would produce a counterexample by . These are closed, cover the simplex, contain their opposite faces of a simplex and have empty common intersection, because the sum to one. Thus the covering assertion and the absence of that map are equivalent.

Articles by others on the same topic (1)