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: Mazurkiewicz trace theorem | Statement: [Stefan Mazurkiewicz, notableWork, Mazurkiewicz trace theorem]

Target entity: Mazurkiewicz trace theorem
Context triple: [Stefan Mazurkiewicz, notableWork, Mazurkiewicz trace theorem]

• A. Petri’s theorem
  Petri’s theorem is a fundamental result in algebraic geometry that characterizes the ideal of a canonically embedded algebraic curve by describing it as being generated by quadrics under suitable conditions.
• B. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• C. 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.
• D. Böhm–Jacopini theorem
  The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
• E. Kesten’s theorem
  Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
• 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: Mazurkiewicz trace theorem
Triple: [Stefan Mazurkiewicz, notableWork, Mazurkiewicz trace theorem]

The Mazurkiewicz trace theorem is a result in geometric measure theory that characterizes the boundary behavior and trace properties of Sobolev functions on domains.

Target entity: Mazurkiewicz trace theorem
Target entity description: The Mazurkiewicz trace theorem is a result in geometric measure theory that characterizes the boundary behavior and trace properties of Sobolev functions on domains.

• A. Petri’s theorem
  Petri’s theorem is a fundamental result in algebraic geometry that characterizes the ideal of a canonically embedded algebraic curve by describing it as being generated by quadrics under suitable conditions.
• B. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• C. 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.
• D. Böhm–Jacopini theorem
  The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
• E. Kesten’s theorem
  Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
• F. None of above. chosen