Triple

T5446381
Position Surface form Disambiguated ID Type / Status
Subject Carathéodory metric E122257 entity
Predicate isUpperBoundFor P14327 FINISHED
Object Lempert function on convex domains
The Lempert function on convex domains is a complex-analytic invariant that coincides with the Kobayashi distance and provides an extremal characterization of holomorphic mappings between convex domains in several complex variables.
E521040 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: Lempert function on convex domains | Statement: [Carathéodory metric, isUpperBoundFor, Lempert function on convex domains]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Lempert function on convex domains
Context triple: [Carathéodory metric, isUpperBoundFor, Lempert function on convex domains]
  • A. Nevanlinna–Pick interpolation
    Nevanlinna–Pick interpolation is a classical problem in complex analysis and operator theory that seeks analytic functions, typically bounded by one in the unit disk, which match prescribed values at given points.
  • B. Inequalities for analytic functions
    "Inequalities for analytic functions" is a mathematical work by Gábor Szegő that develops fundamental bounds and estimates for complex analytic functions, particularly in the context of complex analysis and approximation theory.
  • C. Szegő kernel
    The Szegő kernel is a fundamental reproducing kernel in complex analysis and operator theory, associated with Hardy spaces on the boundary of a domain and central to the study of orthogonal polynomials and boundary behavior of analytic functions.
  • D. Dynamics in One Complex Variable
    Dynamics in One Complex Variable is a foundational graduate-level textbook by John Milnor that introduces and develops the theory of complex dynamical systems, particularly the iteration of rational maps on the Riemann sphere.
  • E. 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.
  • 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: Lempert function on convex domains
Triple: [Carathéodory metric, isUpperBoundFor, Lempert function on convex domains]
Generated description
The Lempert function on convex domains is a complex-analytic invariant that coincides with the Kobayashi distance and provides an extremal characterization of holomorphic mappings between convex domains in several complex variables.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Lempert function on convex domains
Target entity description: The Lempert function on convex domains is a complex-analytic invariant that coincides with the Kobayashi distance and provides an extremal characterization of holomorphic mappings between convex domains in several complex variables.
  • A. Nevanlinna–Pick interpolation
    Nevanlinna–Pick interpolation is a classical problem in complex analysis and operator theory that seeks analytic functions, typically bounded by one in the unit disk, which match prescribed values at given points.
  • B. Inequalities for analytic functions
    "Inequalities for analytic functions" is a mathematical work by Gábor Szegő that develops fundamental bounds and estimates for complex analytic functions, particularly in the context of complex analysis and approximation theory.
  • C. Szegő kernel
    The Szegő kernel is a fundamental reproducing kernel in complex analysis and operator theory, associated with Hardy spaces on the boundary of a domain and central to the study of orthogonal polynomials and boundary behavior of analytic functions.
  • D. Dynamics in One Complex Variable
    Dynamics in One Complex Variable is a foundational graduate-level textbook by John Milnor that introduces and develops the theory of complex dynamical systems, particularly the iteration of rational maps on the Riemann sphere.
  • E. 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.
  • 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_69bd4640f52c81909e653ec361f66d76 completed March 20, 2026, 1:06 p.m.
NER Named-entity recognition batch_69bd91cf5d488190868ffefad02c7a04 completed March 20, 2026, 6:28 p.m.
NED1 Entity disambiguation (via context triple) batch_69bf413573c08190beae400c485d2132 completed March 22, 2026, 1:09 a.m.
NEDg Description generation batch_69bf4364b2f48190b69cc27ca6900892 completed March 22, 2026, 1:18 a.m.
NED2 Entity disambiguation (via description) batch_69bf43b523a88190938662ae89eba502 completed March 22, 2026, 1:19 a.m.
Created at: March 20, 2026, 2:07 p.m.