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: Mazur’s theorem on convex sets | Statement: [Stanisław Mazur, notableWork, Mazur’s theorem on convex sets]

Target entity: Mazur’s theorem on convex sets
Context triple: [Stanisław Mazur, notableWork, Mazur’s theorem on convex sets]

• A. Minkowski’s theorem on convex sets
  Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
• B. 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.
• C. Banach–Mazur theorem
  The Banach–Mazur theorem is a fundamental result in functional analysis that characterizes separable Banach spaces as isometrically isomorphic to closed subspaces of spaces of continuous functions on compact metric spaces.
• D. Helly’s theorem
  Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
• E. Gale’s theorem on linear inequalities
  Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
• 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: Mazur’s theorem on convex sets
Triple: [Stanisław Mazur, notableWork, Mazur’s theorem on convex sets]

Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.

Target entity: Mazur’s theorem on convex sets
Target entity description: Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.

• A. Minkowski’s theorem on convex sets
  Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
• B. 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.
• C. Banach–Mazur theorem
  The Banach–Mazur theorem is a fundamental result in functional analysis that characterizes separable Banach spaces as isometrically isomorphic to closed subspaces of spaces of continuous functions on compact metric spaces.
• D. Helly’s theorem
  Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
• E. Gale’s theorem on linear inequalities
  Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
• F. None of above. chosen