Knaster–Kuratowski–Mazurkiewicz lemma

Target entity: Knaster–Kuratowski–Mazurkiewicz lemma
Context triple: [Sperner's lemma, relatedTo, Knaster–Kuratowski–Mazurkiewicz lemma]

• A. Sperner's lemma
  Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
• B. Tucker’s lemma
  Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
• C. Brouwer fixed-point theorem
  The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
• D. Ky Fan’s lemma
  Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
• E. Kakutani fixed-point theorem
  The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Knaster–Kuratowski–Mazurkiewicz lemma
Target entity description: The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.

• A. Sperner's lemma
  Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
• B. Tucker’s lemma
  Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
• C. Brouwer fixed-point theorem
  The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
• D. Ky Fan’s lemma
  Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
• E. Kakutani fixed-point theorem
  The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
• F. None of above. chosen