Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube
Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, and N. V., Vinodchandran

TL;DR
This paper introduces neighborhood variants of classical topological lemmas like KKM, Lebesgue, and Sperner's lemma on the cube, providing discretized results that guarantee multiple colors within small neighborhoods under certain coloring conditions.
Contribution
It establishes new neighborhood versions of key topological lemmas on the cube and derives a discretized Sperner's lemma variant with quantitative color diversity guarantees.
Findings
Existence of an $ ext{l}_ ext{infty}$ $ ext{varepsilon}$-ball with many colors
Quantitative bounds on the number of colors in neighborhoods
Neighborhood variants of classical lemmas on the cube
Abstract
We establish a "neighborhood" variant of the cubical KKM lemma and the Lebesgue covering theorem and deduce a discretized version which is a "neighborhood" variant of Sperner's lemma on the cube. The main result is the following: for any coloring of the unit -cube in which points on opposite faces must be given different colors, and for any , there is an -ball which contains points of at least different colors, (so in particular, at least different colors for all sensible ).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Point processes and geometric inequalities · Limits and Structures in Graph Theory
