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: Knaster–Tarski theorem | Statement: [Tarski’s fixed point theorem, relatedTo, Knaster–Tarski theorem]

Target entity: Knaster–Tarski theorem
Context triple: [Tarski’s fixed point theorem, relatedTo, Knaster–Tarski theorem]

• A. 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.
• B. Glicksberg fixed-point theorem
  The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
• C. Kakutani fixed-point theorem
  The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
• D. Brouwer fixed-point theorem
  The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
• E. Knaster–Kuratowski–Mazurkiewicz lemma
  The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.
• 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: Knaster–Tarski theorem
Triple: [Tarski’s fixed point theorem, relatedTo, Knaster–Tarski theorem]

The Knaster–Tarski theorem is a fundamental result in order theory stating that any monotone function on a complete lattice has at least one fixed point, and in fact possesses a complete lattice of fixed points.

Target entity: Knaster–Tarski theorem
Target entity description: The Knaster–Tarski theorem is a fundamental result in order theory stating that any monotone function on a complete lattice has at least one fixed point, and in fact possesses a complete lattice of fixed points.

• A. Tarski’s fixed point theorem chosen
  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.
• B. Glicksberg fixed-point theorem
  The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
• C. Kakutani fixed-point theorem
  The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
• D. Brouwer fixed-point theorem
  The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
• E. Knaster–Kuratowski–Mazurkiewicz lemma
  The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.
• F. None of above.