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: Dirichlet principle | Statement: [Peter Gustav Lejeune Dirichlet, notableWork, Dirichlet principle]

Target entity: Dirichlet principle
Context triple: [Peter Gustav Lejeune Dirichlet, notableWork, Dirichlet principle]

• A. de Bruijn–van Aardenne–Ehrenfest theorem
  The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
• B. Euler’s theorem
  Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
• C. 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.
• D. Mertens’ theorems
  Mertens’ theorems are classical results in analytic number theory that give precise asymptotic estimates for sums involving the Möbius function and the reciprocals of primes, illuminating the distribution of primes and their connection to the Riemann zeta function.
• E. Grothendieck inequality
  The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
• 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: Dirichlet principle
Triple: [Peter Gustav Lejeune Dirichlet, notableWork, Dirichlet principle]

The Dirichlet principle is a foundational concept in potential theory and the calculus of variations that asserts certain boundary value problems can be solved by finding a function minimizing an associated energy integral.

Target entity: Dirichlet principle
Target entity description: The Dirichlet principle is a foundational concept in potential theory and the calculus of variations that asserts certain boundary value problems can be solved by finding a function minimizing an associated energy integral.

• A. de Bruijn–van Aardenne–Ehrenfest theorem
  The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
• B. Euler’s theorem
  Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
• C. 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.
• D. Mertens’ theorems
  Mertens’ theorems are classical results in analytic number theory that give precise asymptotic estimates for sums involving the Möbius function and the reciprocals of primes, illuminating the distribution of primes and their connection to the Riemann zeta function.
• E. Grothendieck inequality
  The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
• F. None of above. chosen