Triple

T846897
Position Surface form Disambiguated ID Type / Status
Subject Leopold Kronecker E18296 entity
Predicate notableWork P4 FINISHED
Object Kronecker’s lemma
Kronecker’s lemma is a result in real analysis and summability theory that links the convergence of series with weighted averages of their partial sums, often used in the study of Fourier series and ergodic theorems.
E100233 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: Kronecker’s lemma | Statement: [Leopold Kronecker, notableWork, Kronecker’s lemma]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Kronecker’s lemma
Context triple: [Leopold Kronecker, notableWork, Kronecker’s lemma]
  • A. Riemann–Lebesgue lemma
    The Riemann–Lebesgue lemma is a fundamental result in Fourier analysis stating that the Fourier coefficients (or transform) of an integrable function vanish at infinity.
  • B. Berry–Esseen theorem
    The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
  • C. Khinchin–Kahane type inequalities
    Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
  • D. Gauss’s lemma in number theory
    Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
  • E. Cameron–Martin theorem
    The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
  • 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: Kronecker’s lemma
Triple: [Leopold Kronecker, notableWork, Kronecker’s lemma]
Generated description
Kronecker’s lemma is a result in real analysis and summability theory that links the convergence of series with weighted averages of their partial sums, often used in the study of Fourier series and ergodic theorems.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Kronecker’s lemma
Target entity description: Kronecker’s lemma is a result in real analysis and summability theory that links the convergence of series with weighted averages of their partial sums, often used in the study of Fourier series and ergodic theorems.
  • A. Riemann–Lebesgue lemma
    The Riemann–Lebesgue lemma is a fundamental result in Fourier analysis stating that the Fourier coefficients (or transform) of an integrable function vanish at infinity.
  • B. Berry–Esseen theorem
    The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
  • C. Khinchin–Kahane type inequalities
    Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
  • D. Gauss’s lemma in number theory
    Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
  • E. Cameron–Martin theorem
    The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
  • 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_69a4938b04208190b82e1df6b572c548 completed March 1, 2026, 7:29 p.m.
NER Named-entity recognition batch_69a4ac0ba6b4819089c15ed7e1765502 completed March 1, 2026, 9:13 p.m.
NED1 Entity disambiguation (via context triple) batch_69a7929e65d08190bcea03f581288cc4 completed March 4, 2026, 2:02 a.m.
NEDg Description generation batch_69a7937c2ce481908c04e08e2be02985 completed March 4, 2026, 2:05 a.m.
NED2 Entity disambiguation (via description) batch_69a79761ee34819094a0558ef195d8a0 completed March 4, 2026, 2:22 a.m.
Created at: March 1, 2026, 7:38 p.m.