Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Scarf’s lemma | Statement: [Herbert Scarf, notableWork, Scarf’s lemma]

Target entity: Scarf’s lemma
Context triple: [Herbert Scarf, notableWork, Scarf’s 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. Knaster–Kuratowski–Mazurkiewicz lemma
  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.
• C. Shapley–Gale theorem
  The Shapley–Gale theorem is a foundational result in cooperative game theory that characterizes stable outcomes in assignment and matching problems, underpinning much of modern market design and matching theory.
• 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. 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.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Scarf’s lemma
Triple: [Herbert Scarf, notableWork, Scarf’s lemma]

Scarf’s lemma is a fundamental result in combinatorial topology and game theory that guarantees the existence of approximate solutions to certain systems, underpinning proofs of equilibrium existence in economics and related fields.

Target entity: Scarf’s lemma
Target entity description: Scarf’s lemma is a fundamental result in combinatorial topology and game theory that guarantees the existence of approximate solutions to certain systems, underpinning proofs of equilibrium existence in economics and related fields.

• 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. Knaster–Kuratowski–Mazurkiewicz lemma
  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.
• C. Shapley–Gale theorem
  The Shapley–Gale theorem is a foundational result in cooperative game theory that characterizes stable outcomes in assignment and matching problems, underpinning much of modern market design and matching theory.
• 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. 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.
• F. None of above. chosen