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: Fritz John conditions | Statement: [KKT conditions, relatedConcept, Fritz John conditions]

Target entity: Fritz John conditions
Context triple: [KKT conditions, relatedConcept, Fritz John conditions]

• A. Karush–Kuhn–Tucker conditions
  The Karush–Kuhn–Tucker conditions are fundamental optimality criteria in nonlinear programming that generalize Lagrange multipliers to handle inequality constraints.
• B. KKT conditions
  KKT conditions are a set of necessary (and under certain conditions, sufficient) optimality conditions used in nonlinear programming to characterize solutions of constrained optimization problems.
• C. Bohr–Courant theorem
  The Bohr–Courant theorem is a classical result in analytic number theory describing the value distribution of Dirichlet series, particularly the Riemann zeta function, and serves as a precursor to modern universality theorems such as Voronin’s.
• D. Busemann–Feller theorem
  The Busemann–Feller theorem is a result in geometric measure theory that characterizes when a metric space is geodesic by relating distance properties to the existence of shortest paths between points.
• E. Courant–Fischer min–max theorem
  The Courant–Fischer min–max theorem is a fundamental result in linear algebra and spectral theory that characterizes the eigenvalues of a Hermitian (or symmetric) matrix via variational min–max principles over subspaces.
• 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: Fritz John conditions
Triple: [KKT conditions, relatedConcept, Fritz John conditions]

Fritz John conditions are generalized first-order necessary optimality conditions in nonlinear programming that extend the Karush–Kuhn–Tucker framework by allowing for degenerate cases where standard constraint qualifications fail.

Target entity: Fritz John conditions
Target entity description: Fritz John conditions are generalized first-order necessary optimality conditions in nonlinear programming that extend the Karush–Kuhn–Tucker framework by allowing for degenerate cases where standard constraint qualifications fail.

• A. Karush–Kuhn–Tucker conditions
  The Karush–Kuhn–Tucker conditions are fundamental optimality criteria in nonlinear programming that generalize Lagrange multipliers to handle inequality constraints.
• B. KKT conditions
  KKT conditions are a set of necessary (and under certain conditions, sufficient) optimality conditions used in nonlinear programming to characterize solutions of constrained optimization problems.
• C. Bohr–Courant theorem
  The Bohr–Courant theorem is a classical result in analytic number theory describing the value distribution of Dirichlet series, particularly the Riemann zeta function, and serves as a precursor to modern universality theorems such as Voronin’s.
• D. Busemann–Feller theorem
  The Busemann–Feller theorem is a result in geometric measure theory that characterizes when a metric space is geodesic by relating distance properties to the existence of shortest paths between points.
• E. Courant–Fischer min–max theorem
  The Courant–Fischer min–max theorem is a fundamental result in linear algebra and spectral theory that characterizes the eigenvalues of a Hermitian (or symmetric) matrix via variational min–max principles over subspaces.
• F. None of above. chosen