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: Galois connection | Statement: [Évariste Galois, conceptNamedAfter, Galois connection]

Target entity: Galois connection
Context triple: [Évariste Galois, conceptNamedAfter, Galois connection]

• A. Curry–Howard correspondence
  The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
• B. Lattice Theory
  Lattice Theory is a foundational mathematical text that systematically develops the theory of lattices and ordered structures, profoundly influencing modern algebra and order theory.
• C. Continuous Lattices
  Continuous Lattices is a foundational work in domain theory and lattice theory that introduced a mathematical framework for modeling computation and denotational semantics.
• D. Birkhoff’s representation theorem for finite distributive lattices
  Birkhoff’s representation theorem for finite distributive lattices is a fundamental result in lattice theory that characterizes every finite distributive lattice as isomorphic to the lattice of lower (order) ideals of a finite poset.
• E. Tarski’s fixed point theorem
  Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
• 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: Galois connection
Triple: [Évariste Galois, conceptNamedAfter, Galois connection]

A Galois connection is a pair of order-reversing (or order-preserving) maps between partially ordered sets that form an adjoint relationship, linking their structures in a way that generalizes many dualities in mathematics.

Target entity: Galois connection
Target entity description: A Galois connection is a pair of order-reversing (or order-preserving) maps between partially ordered sets that form an adjoint relationship, linking their structures in a way that generalizes many dualities in mathematics.

• A. Curry–Howard correspondence
  The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
• B. Lattice Theory
  Lattice Theory is a foundational mathematical text that systematically develops the theory of lattices and ordered structures, profoundly influencing modern algebra and order theory.
• C. Continuous Lattices
  Continuous Lattices is a foundational work in domain theory and lattice theory that introduced a mathematical framework for modeling computation and denotational semantics.
• D. Birkhoff’s representation theorem for finite distributive lattices
  Birkhoff’s representation theorem for finite distributive lattices is a fundamental result in lattice theory that characterizes every finite distributive lattice as isomorphic to the lattice of lower (order) ideals of a finite poset.
• E. Tarski’s fixed point theorem
  Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
• F. None of above. chosen