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: Jarník–Besicovitch theorem | Statement: [Diophantine approximation, hasKeyResult, Jarník–Besicovitch theorem]

Target entity: Jarník–Besicovitch theorem
Context triple: [Diophantine approximation, hasKeyResult, Jarník–Besicovitch theorem]

• 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. Steinhaus theorem
  The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
• 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. 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.
• E. 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.
• 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: Jarník–Besicovitch theorem
Triple: [Diophantine approximation, hasKeyResult, Jarník–Besicovitch theorem]

The Jarník–Besicovitch theorem is a fundamental result in metric number theory that determines the Hausdorff dimension of sets of real numbers that are very well approximable by rationals.

Target entity: Jarník–Besicovitch theorem
Target entity description: The Jarník–Besicovitch theorem is a fundamental result in metric number theory that determines the Hausdorff dimension of sets of real numbers that are very well approximable by rationals.

• 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. Steinhaus theorem
  The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
• 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. 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.
• E. 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.
• F. None of above. chosen