Triple
T11728192
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Lennart Carleson |
E278829
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
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."
|
E943111
|
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: Corona theorem | Statement: [Lennart Carleson, knownFor, Corona theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Corona theorem Context triple: [Lennart Carleson, knownFor, Corona theorem]
-
A.
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.
-
B.
Picard theorem
Picard theorem is a fundamental result in complex analysis stating that entire non-constant functions take on all possible complex values, with at most one exception.
-
C.
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.
-
D.
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.
-
E.
Bieberbach conjecture
The Bieberbach conjecture, now a theorem, is a landmark result in complex analysis that characterizes the size of Taylor coefficients of normalized univalent (injective) holomorphic functions on the unit disk.
- 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: Corona theorem Triple: [Lennart Carleson, knownFor, Corona theorem]
Generated description
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."
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Corona theorem Target entity description: 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."
-
A.
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.
-
B.
Picard theorem
Picard theorem is a fundamental result in complex analysis stating that entire non-constant functions take on all possible complex values, with at most one exception.
-
C.
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.
-
D.
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.
-
E.
Bieberbach conjecture
The Bieberbach conjecture, now a theorem, is a landmark result in complex analysis that characterizes the size of Taylor coefficients of normalized univalent (injective) holomorphic functions on the unit disk.
- 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_69d6aaffec6881908bead509e8621742 |
completed | April 8, 2026, 7:22 p.m. |
| NER | Named-entity recognition | batch_69d8a4d80ef881908cab956787ab07fd |
completed | April 10, 2026, 7:20 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ef83e9efdc8190830f9b9cb5362b1c |
completed | April 27, 2026, 3:42 p.m. |
| NEDg | Description generation | batch_69ef96b286e48190adf7224749f9a01c |
completed | April 27, 2026, 5:02 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69efb51a94508190ae3159ad4a9725c8 |
completed | April 27, 2026, 7:12 p.m. |
Created at: April 8, 2026, 9:41 p.m.