Triple
T19231163
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Runge approximation theorem |
E480873
|
entity |
| Predicate | generalizedBy |
P2372
|
FINISHED |
| Object |
Mergelyan's theorem
Mergelyan's theorem is a fundamental result in complex analysis stating that every function continuous on a compact subset of the complex plane with connected complement and holomorphic in its interior can be uniformly approximated by polynomials.
|
E1365045
|
NE FINISHED |
How this triple was built (4 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: Mergelyan's theorem | Statement: [Runge approximation theorem, generalizedBy, Mergelyan's theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Mergelyan's theorem Context triple: [Runge approximation theorem, generalizedBy, Mergelyan's theorem]
-
A.
Runge approximation theorem
The Runge approximation theorem is a fundamental result in complex analysis stating that holomorphic functions on certain domains can be uniformly approximated by rational functions with poles outside those domains.
-
B.
Corona theorem
The Corona theorem is a fundamental result in complex analysis that characterizes when bounded analytic functions on the unit disk can be solved in a certain type of division problem, showing that the maximal ideal space of the disk algebra has no "corona."
-
C.
Montel theorem
Montel's theorem is a fundamental result in complex analysis stating that a family of holomorphic functions that is uniformly bounded on every compact subset of a domain is a normal family, meaning every sequence in it has a subsequence that converges uniformly on compact sets.
-
D.
Borel–Carathéodory theorem
The Borel–Carathéodory theorem is a result in complex analysis that provides bounds on the modulus of a holomorphic function inside a disk in terms of the maximum of its real part on a larger concentric disk.
-
E.
Mittag-Leffler theorem
The Mittag-Leffler theorem is a fundamental result in complex analysis that characterizes meromorphic functions by allowing the construction of such functions with prescribed principal parts at given poles.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
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]"
Input
Entity: Mergelyan's theorem Triple: [Runge approximation theorem, generalizedBy, Mergelyan's theorem]
Generated description
Mergelyan's theorem is a fundamental result in complex analysis stating that every function continuous on a compact subset of the complex plane with connected complement and holomorphic in its interior can be uniformly approximated by polynomials.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Mergelyan's theorem Target entity description: Mergelyan's theorem is a fundamental result in complex analysis stating that every function continuous on a compact subset of the complex plane with connected complement and holomorphic in its interior can be uniformly approximated by polynomials.
-
A.
Runge approximation theorem
The Runge approximation theorem is a fundamental result in complex analysis stating that holomorphic functions on certain domains can be uniformly approximated by rational functions with poles outside those domains.
-
B.
Corona theorem
The Corona theorem is a fundamental result in complex analysis that characterizes when bounded analytic functions on the unit disk can be solved in a certain type of division problem, showing that the maximal ideal space of the disk algebra has no "corona."
-
C.
Montel theorem
Montel's theorem is a fundamental result in complex analysis stating that a family of holomorphic functions that is uniformly bounded on every compact subset of a domain is a normal family, meaning every sequence in it has a subsequence that converges uniformly on compact sets.
-
D.
Borel–Carathéodory theorem
The Borel–Carathéodory theorem is a result in complex analysis that provides bounds on the modulus of a holomorphic function inside a disk in terms of the maximum of its real part on a larger concentric disk.
-
E.
Mittag-Leffler theorem
The Mittag-Leffler theorem is a fundamental result in complex analysis that characterizes meromorphic functions by allowing the construction of such functions with prescribed principal parts at given poles.
- F. None of above. chosen
Provenance (5 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_69d8e8ccb8f48190ad420098e74fb1db |
completed | April 10, 2026, 12:10 p.m. |
| NER | Named-entity recognition | batch_69e5fa9ce5e081909df994841ce476d5 |
completed | April 20, 2026, 10:06 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0700f303fc8190b8acd9bbc0b6093d |
completed | May 15, 2026, 11:18 a.m. |
| NEDg | Description generation | batch_6a07020e89c48190a61674ad9b2c410f |
completed | May 15, 2026, 11:22 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a07028efca08190aefa43f5fe8e595a |
completed | May 15, 2026, 11:25 a.m. |
Created at: April 10, 2026, 1:25 p.m.