Triple

T21953453
Position Surface form Disambiguated ID Type / Status
Subject universal enveloping algebra E542123 entity
Predicate hasBasisDescribedBy P38836 FINISHED
Object Poincaré–Birkhoff–Witt basis NE NERFINISHED

How this triple was built (3 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
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).
Input
Phrase: Poincaré–Birkhoff–Witt basis | Statement: [universal enveloping algebra, hasBasisDescribedBy, Poincaré–Birkhoff–Witt basis]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Poincaré–Birkhoff–Witt basis
Context triple: [universal enveloping algebra, hasBasisDescribedBy, Poincaré–Birkhoff–Witt basis]
  • A. The Poincaré-Birkhoff-Witt theorem in ring theory chosen
    "The Poincaré-Birkhoff-Witt theorem in ring theory" is a mathematical work, attributed here to N. G. de Bruijn, that studies and applies the Poincaré–Birkhoff–Witt theorem in the context of associative and Lie-theoretic ring structures.
  • B. Bott–Samelson theorem
    The Bott–Samelson theorem is a fundamental result in algebraic topology and geometry that provides a resolution of singularities for Schubert varieties via Bott–Samelson varieties, illuminating the topology and cohomology of flag manifolds.
  • C. Gelfand–Tsetlin basis
    The Gelfand–Tsetlin basis is a canonical, combinatorially defined basis for representations of certain Lie algebras and groups, particularly used in the representation theory of GL(n) and related structures.
  • D. Beilinson–Bernstein localization theorem
    The Beilinson–Bernstein localization theorem is a fundamental result in geometric representation theory that realizes representations of semisimple Lie algebras as sheaves of differential operators on flag varieties, establishing an equivalence between algebraic and geometric categories.
  • E. Rota–Baxter algebra
    A Rota–Baxter algebra is an associative algebra equipped with a linear operator satisfying a specific integration-like identity that generalizes the properties of integral and summation operators in algebraic form.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: hasBasisDescribedBy
Context triple: [universal enveloping algebra, hasBasisDescribedBy, Poincaré–Birkhoff–Witt basis]
  • A. hasBasisIn
    Indicates that one entity is founded, derived, or justified on the grounds of another entity.
  • B. hasStandardBasis
    Indicates that a given vector space is equipped with or possesses its usual canonical set of basis vectors.
  • C. hasCanonicalBasis chosen
    Indicates that there exists a standard or preferred basis associated with an entity, typically used as the reference basis in its context.
  • D. proposedRepresentationBasis
    Indicates that one entity has been put forward as the foundational or reference basis for representing or encoding another entity.
  • E. hasGivenNameBasis
    Indicates that one entity’s given name is derived from, based on, or formed using another entity (such as a name, word, or person) as its basis.
  • F. None of above.

Provenance (3 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69e0c47ef0e48190a50e1bcc43f4b3fd completed April 16, 2026, 11:14 a.m.
NER Named-entity recognition batch_69f1243dfb4081909bc7a722843ffea7 completed April 28, 2026, 9:18 p.m.
PD Predicate disambiguation batch_69e6f601f2188190893bcdde0cf58ad6 completed April 21, 2026, 3:58 a.m.
Created at: April 16, 2026, 7:59 p.m.