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: Sylvester–Gallai theorem | Statement: [James Joseph Sylvester, notableWork, Sylvester–Gallai theorem]

Target entity: Sylvester–Gallai theorem
Context triple: [James Joseph Sylvester, notableWork, Sylvester–Gallai theorem]

• A. de Bruijn–Erdős theorem
  The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
• B. Erdős–Szekeres theorem
  The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
• C. 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.
• D. Radon’s theorem
  Radon’s theorem is a fundamental result in convex geometry stating that any set of sufficiently many points in Euclidean space can be partitioned into two disjoint subsets whose convex hulls intersect.
• E. Erdős distinct distances problem
  The Erdős distinct distances problem is a famous question in combinatorial geometry that asks for the minimum number of distinct distances determined by a given number of points in the plane.
• 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: Sylvester–Gallai theorem
Triple: [James Joseph Sylvester, notableWork, Sylvester–Gallai theorem]

The Sylvester–Gallai theorem is a result in incidence geometry stating that for any finite set of points in the Euclidean plane not all on a single line, there exists a line that passes through exactly two of the points.

Target entity: Sylvester–Gallai theorem
Target entity description: The Sylvester–Gallai theorem is a result in incidence geometry stating that for any finite set of points in the Euclidean plane not all on a single line, there exists a line that passes through exactly two of the points.

• A. de Bruijn–Erdős theorem
  The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
• B. Erdős–Szekeres theorem
  The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
• C. 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.
• D. Radon’s theorem
  Radon’s theorem is a fundamental result in convex geometry stating that any set of sufficiently many points in Euclidean space can be partitioned into two disjoint subsets whose convex hulls intersect.
• E. Erdős distinct distances problem
  The Erdős distinct distances problem is a famous question in combinatorial geometry that asks for the minimum number of distinct distances determined by a given number of points in the plane.
• F. None of above. chosen