Math 2.0

Theorem

Polytopal KKMS theorem (Komiya)

Statement

Hidetoshi Komiya generalized the KKMS theorem from simplices to polytopes. Let P be any compact convex polytope. Let Faces(P)\textrm{Faces}(P) be the set of nonempty faces of P. A Komiya covering of P is a family of closed sets {CF:F∈Faces(P)}\{C_F: F\in \textrm{Faces}(P)\} such that for every face F∈Faces(P)F\in \textrm{Faces}(P): F⊆⋃G⊆F, G∈Faces(P)CG.F\subseteq \bigcup_{G\subseteq F, ~ G \in \textrm{Faces}(P)} C_G. Komiya's theorem says that for every Komiya covering of P, there is a balanced collection B⊆Faces(P)B\subseteq \textrm{Faces}(P), such that the intersection of sets indexed by BB is nonempty:

⋂F∈BCF≠∅\bigcap_{F\in B} C_F \neq \emptyset

Komiya's theorem also generalizes the definition of a balanced collection: instead of requiring that there is a weight function on BB such that the sum of weights near each vertex of P is 1, we start by choosing any set of points b={bF:F∈Faces(P),bF∈F}\textbf{b} = \{b^F: F\in \textrm{Faces}(P), b^F\in F \}. A collection B⊆Faces(P)B\subseteq \textrm{Faces}(P) is called balanced with respect to b\textbf{b} iff bP∈conv⁡{bF:F∈B}b^P \in \operatorname{conv} \{ b^F: F\in B \}, that is, the point assigned to the entire polygon P is a convex combination of the points assigned to the faces in the collection B.

The KKMS theorem is a special case of Komiya's theorem in which the polytope P=Δn−1P = \Delta_{n-1} and bFb^F is the barycenter of the face F (in particular, bPb^P is the barycenter of Δn−1\Delta_{n-1}, which is the point (1/n,…,1/n)(1/n, \ldots, 1/n) ).

Further reading

  1. Wikipedia, page 3963004, revision 1362920252, Knaster–Kuratowski–Mazurkiewicz lemma, section Generalizations > Polytopal KKMS theorem (Komiya). adopted
About this page
TagCHPQR3J965
URIm2://CHPQR3J965
Aliaseskomiyas-theorem
Kindstatement, theorem
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status CHPQR3J965.
Changed4 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.