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.
Normalized distances to three closed sets give continuous barycentric coordinates; a covering forces at least one coordinate to vanish, placing the image on the simplex boundary.
A closed-cover intersection statement for a simplex is equivalent to the nonexistence of a boundary-valued map that preserves every face.

Articles by others on the same topic (1)