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: Sperner's lemma | Statement: [Brouwer fixed-point theorem, hasCombinatorialVersion, Sperner's lemma]

Target entity: Sperner's lemma
Context triple: [Brouwer fixed-point theorem, hasCombinatorialVersion, Sperner's lemma]

• A. 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.
• B. 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.
• C. Glicksberg fixed-point theorem
  The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
• D. 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.
• E. Carathéodory’s theorem in convex geometry
  Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
• 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: Sperner's lemma
Triple: [Brouwer fixed-point theorem, hasCombinatorialVersion, 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.

Target entity: Sperner's lemma
Target entity description: 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.

• A. 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.
• B. 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.
• C. Glicksberg fixed-point theorem
  The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
• D. 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.
• E. Carathéodory’s theorem in convex geometry
  Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
• F. None of above. chosen

Target predicate: hasCombinatorialVersion
Context triple: [Brouwer fixed-point theorem, hasCombinatorialVersion, Sperner's lemma]

• A. hasComb
  Indicates that an entity possesses or is equipped with a comb.
• B. hasVersionCount
  Indicates the total number of distinct versions associated with a given entity.
• C. hasSpecialVersion
  Indicates that an entity possesses or is associated with a distinct or customized version of another entity, differing from the standard or default form.
• D. hasVersionNumber
  Indicates that an entity is associated with a specific version identifier or number.
• E. hasDisciplineSpecificVersion chosen
  Indicates that something has a version or form that is tailored or specialized for a particular discipline or field.
• F. None of above.