Triple
T6929713
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cantor–Bernstein–Schröder theorem |
E160401
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Zorn's lemma |
E608817
|
NE FINISHED |
How this triple was built (2 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: Zorn's lemma | Statement: [Cantor–Bernstein–Schröder theorem, relatedTo, Zorn's lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Zorn's lemma Context triple: [Cantor–Bernstein–Schröder theorem, relatedTo, Zorn's lemma]
-
A.
Hausdorff maximal principle
chosen
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.
Hahn–Banach theorem
The Hahn–Banach theorem is a fundamental result in functional analysis that guarantees the extension of bounded linear functionals from a subspace to the whole space without increasing their norm.
-
C.
Cantor–Bernstein–Schröder theorem
The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
-
D.
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.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69c6884e15208190b9e91487eaafcf85 |
completed | March 27, 2026, 1:38 p.m. |
| NER | Named-entity recognition | batch_69c6da1f5fcc8190b43f53f90fc1821c |
completed | March 27, 2026, 7:27 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c7514774d88190af212d7953014703 |
completed | March 28, 2026, 3:55 a.m. |
Created at: March 27, 2026, 2:27 p.m.