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: Kuratowski–Zorn lemma (attribution as Zorn’s lemma variant) | Statement: [Kazimierz Kuratowski, notableFor, Kuratowski–Zorn lemma (attribution as Zorn’s lemma variant)]

Target entity: Kuratowski–Zorn lemma (attribution as Zorn’s lemma variant)
Context triple: [Kazimierz Kuratowski, notableFor, Kuratowski–Zorn lemma (attribution as Zorn’s lemma variant)]

• A. Hausdorff maximal principle
  The Hausdorff maximal principle is a foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is equivalent to the axiom of choice.
• B. Ky Fan’s lemma
  Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
• C. 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.
• D. 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.
• E. Krein–Milman theorem
  The Krein–Milman theorem is a fundamental result in functional analysis and convex geometry stating that a compact convex set in a locally convex topological vector space is the closed convex hull of its extreme points.
• 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: Kuratowski–Zorn lemma (attribution as Zorn’s lemma variant)
Triple: [Kazimierz Kuratowski, notableFor, Kuratowski–Zorn lemma (attribution as Zorn’s lemma variant)]

The Kuratowski–Zorn lemma is a fundamental result in set theory and order theory, equivalent to the Axiom of Choice, which guarantees the existence of maximal elements in certain partially ordered sets.

Target entity: Kuratowski–Zorn lemma (attribution as Zorn’s lemma variant)
Target entity description: The Kuratowski–Zorn lemma is a fundamental result in set theory and order theory, equivalent to the Axiom of Choice, which guarantees the existence of maximal elements in certain partially ordered sets.

• A. Hausdorff maximal principle
  The Hausdorff maximal principle is a foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is equivalent to the axiom of choice.
• B. Ky Fan’s lemma
  Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
• C. 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.
• D. 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.
• E. Krein–Milman theorem
  The Krein–Milman theorem is a fundamental result in functional analysis and convex geometry stating that a compact convex set in a locally convex topological vector space is the closed convex hull of its extreme points.
• F. None of above. chosen