Sperner and KKM-type theorems on trees and cycles
Andrew Niedermaier, Douglas Rizzolo, Francis Edward Su · arXiv (Cornell University) · 2009
Abstract. In this paper we prove a new combinatorial theorem for labellings of trees, and show that it is equivalent to a KKM-type theorem for finite covers of trees and to discrete and continuous fixed point theorems on finite trees. This is in analogy with the equivalence of the classical Sperner’s lemma, KKM lemma, and the Brouwer fixed point theorem on simplices. Furthermore, we use these ideas to develop new KKM and fixed point theorems for infinite covers and infinite trees. Finally, we extend the KKM theorem on trees to an entirely new KKM theorem for cycles, and discuss interesting social consequences, including an application in voting theory. 1.