Triple

T10991934
Position Surface form Disambiguated ID Type / Status
Subject Montel's theorem E259771 entity
Predicate generalizationOf P2372 FINISHED
Object Arzelà–Ascoli theorem for holomorphic functions
The Arzelà–Ascoli theorem for holomorphic functions is a compactness criterion stating that a family of holomorphic functions on a domain has a subsequence converging uniformly on compact subsets whenever it is uniformly bounded (and typically equicontinuous), serving as a key tool in complex analysis.
E259771 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: Arzelà–Ascoli theorem for holomorphic functions | Statement: [Montel's theorem, generalizationOf, Arzelà–Ascoli theorem for holomorphic functions]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Arzelà–Ascoli theorem for holomorphic functions
Context triple: [Montel's theorem, generalizationOf, Arzelà–Ascoli theorem for holomorphic functions]
  • A. 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.
  • 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. 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.
  • D. 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.
  • E. Rellich–Kondrachov compactness theorem
    The Rellich–Kondrachov compactness theorem is a fundamental result in functional analysis and the theory of Sobolev spaces that guarantees the compactness of certain embedding operators, playing a key role in the study of partial differential equations.
  • 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: Arzelà–Ascoli theorem for holomorphic functions
Triple: [Montel's theorem, generalizationOf, Arzelà–Ascoli theorem for holomorphic functions]
Generated description
The Arzelà–Ascoli theorem for holomorphic functions is a compactness criterion stating that a family of holomorphic functions on a domain has a subsequence converging uniformly on compact subsets whenever it is uniformly bounded (and typically equicontinuous), serving as a key tool in complex analysis.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Arzelà–Ascoli theorem for holomorphic functions
Target entity description: The Arzelà–Ascoli theorem for holomorphic functions is a compactness criterion stating that a family of holomorphic functions on a domain has a subsequence converging uniformly on compact subsets whenever it is uniformly bounded (and typically equicontinuous), serving as a key tool in complex analysis.
  • A. 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.
  • B. Montel theorem chosen
    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. 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.
  • D. 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.
  • E. Rellich–Kondrachov compactness theorem
    The Rellich–Kondrachov compactness theorem is a fundamental result in functional analysis and the theory of Sobolev spaces that guarantees the compactness of certain embedding operators, playing a key role in the study of partial differential equations.
  • F. None of above.

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_69d6aa8a6a548190a750f944ccdc8064 completed April 8, 2026, 7:20 p.m.
NER Named-entity recognition batch_69d795d1e918819090c71f5a077fa15a completed April 9, 2026, 12:04 p.m.
NED1 Entity disambiguation (via context triple) batch_69e34504ebec8190a78e4795765b0c24 completed April 18, 2026, 8:47 a.m.
NEDg Description generation batch_69e3556fd3548190a33f04604be947cf completed April 18, 2026, 9:57 a.m.
NED2 Entity disambiguation (via description) batch_69e3593b0f8481909ed7a90f8bb9839d completed April 18, 2026, 10:13 a.m.
Created at: April 8, 2026, 9:24 p.m.