What good is a completely labeled subsimplex
Kim C. Border · Cambridge University Press eBooks · 1985
Remark The proof of Sperner's lemma given in 4.3 suggests an algorithm for finding completely labeled subsimplexes. Cohen [1967] uses the following argument for proving Sperner's lemma. The suggestive terminology is borrowed from a lecture by David Schmeidler. Consider the simplex to be a house and all the n -subsimplexes to be rooms. The completely labeled ( n –1)-subsimplexes are doors. A completely labeled n -simplex is a room with only one door. The induction hypothesis asserts that there are an odd number of doors to the outside. If we enter one of these doors and keep going from room to room we either end up in a room with only one door or back outside. If we end up in a room with only one door, we have found a completely labeled subsimplex. If we come back outside there are still an odd number of doors to the outside that we have not yet used. Thus an odd number of them must lead to a room inside with only one door. The details involved in implementing a computational procedure based on this “path-following” approach are beyond the scope of these notes. An excellent reference for this subject is Scarf [1973] or Todd [1976]. In this chapter we will see that finding completely labeled subsimplexes allows us to approximate fixed points of functions, maximal elements of binary relations, and intersections of sets. Remark: Completely Labeled Subsimplexes and the K-K-M Lemma Section 5.3 presents a proof of the K-K-M lemma based on simplicial subdivision and Sperner's lemma.