Rainbow KKM lemma (Gale)
Statement
David Gale proved the following generalization of the KKM lemma. Suppose that, instead of one KKM covering, we have n different KKM coverings: . Then, there exists a permutation of the coverings with a non-empty intersection, i.e.:
The name "rainbow KKM lemma" is inspired by Gale's description of his lemma:
"A colloquial statement of this result is... if each of three people paint a triangle red, white and blue according to the KKM rules, then there will be a point which is in the red set of one person, the white set of another, the blue of the third".
The rainbow KKM lemma can be proved using a rainbow generalization of Sperner's lemma.
The original KKM lemma follows from the rainbow KKM lemma by simply picking n identical coverings.
Further reading
- Wikipedia, page 3963004, revision 1362920252, Knaster–Kuratowski–Mazurkiewicz lemma, section Generalizations > Rainbow KKM lemma (Gale). adopted
About this page
| Tag | 6P95Y8Z98A |
|---|---|
| URI | m2://6P95Y8Z98A |
| Kind | statement, lemma |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status 6P95Y8Z98A. |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out: each definition that the statement needs (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.