Triple
T5425836
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ernst Lindelöf |
E121359
|
entity |
| Predicate | notableFor |
P22
|
FINISHED |
| Object |
Lindelöf theorem in complex analysis
The Lindelöf theorem in complex analysis is a result that refines the maximum modulus principle by controlling the boundary growth of analytic functions, particularly along paths approaching boundary points of their domain.
|
E518479
|
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: Lindelöf theorem in complex analysis | Statement: [Ernst Lindelöf, notableFor, Lindelöf theorem in complex analysis]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Lindelöf theorem in complex analysis Context triple: [Ernst Lindelöf, notableFor, Lindelöf theorem in complex analysis]
-
A.
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.
-
B.
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.
-
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.
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.
-
E.
Riemann mapping theorem
The Riemann mapping theorem is a fundamental result in complex analysis stating that any non-empty simply connected open subset of the complex plane (other than the whole plane) can be conformally mapped onto the open 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: Lindelöf theorem in complex analysis Triple: [Ernst Lindelöf, notableFor, Lindelöf theorem in complex analysis]
Generated description
The Lindelöf theorem in complex analysis is a result that refines the maximum modulus principle by controlling the boundary growth of analytic functions, particularly along paths approaching boundary points of their domain.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Lindelöf theorem in complex analysis Target entity description: The Lindelöf theorem in complex analysis is a result that refines the maximum modulus principle by controlling the boundary growth of analytic functions, particularly along paths approaching boundary points of their domain.
-
A.
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.
-
B.
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.
-
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.
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.
-
E.
Riemann mapping theorem
The Riemann mapping theorem is a fundamental result in complex analysis stating that any non-empty simply connected open subset of the complex plane (other than the whole plane) can be conformally mapped onto the open 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_69bd463b58d88190b258261573de9e91 |
completed | March 20, 2026, 1:06 p.m. |
| NER | Named-entity recognition | batch_69bd881598448190a9bb456dee36004b |
completed | March 20, 2026, 5:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bf3abfc7e88190b8f0a31b61c33973 |
completed | March 22, 2026, 12:41 a.m. |
| NEDg | Description generation | batch_69bf3b592a08819090e2873bcf4e797f |
completed | March 22, 2026, 12:44 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69bf3c0b9e5481909101eccbd55f24b2 |
completed | March 22, 2026, 12:47 a.m. |
Created at: March 20, 2026, 2:06 p.m.