Triple
T18956024
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kummer |
E463782
|
entity |
| Predicate | hasEponym |
P12247
|
FINISHED |
| Object | Kummer's lemma |
—
|
NE NERFINISHED |
How this triple was built (3 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: Kummer's lemma | Statement: [Kummer, hasEponym, Kummer's lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kummer's lemma Context triple: [Kummer, hasEponym, Kummer's lemma]
-
A.
Kummer's theorem (number theory)
Kummer's theorem (number theory) is a result that characterizes the highest power of a prime dividing a binomial coefficient by counting the carries that occur when adding the binomial parameters in base that prime.
-
B.
Kummer sequence
The Kummer sequence is a short exact sequence in algebraic number theory and algebraic geometry that relates a ring or scheme to its group of roots of unity and underpins Kummer theory and the study of cyclic extensions.
-
C.
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.
-
D.
Kummer theory
Kummer theory is a branch of algebraic number theory that studies abelian extensions of fields, especially cyclotomic and radical extensions, using properties of roots of unity and ideal class groups.
-
E.
Hensel’s lemma
Hensel’s lemma is a fundamental result in number theory and p-adic analysis that allows one to lift solutions of polynomial congruences modulo a prime power to higher powers, analogous to Newton’s method in the p-adic setting.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kummer's lemma Target entity description: Kummer's lemma is a result in algebraic number theory that provides conditions on ideal factorization in cyclotomic fields, particularly relating to divisibility properties of class numbers and units.
-
A.
Kummer's theorem (number theory)
Kummer's theorem (number theory) is a result that characterizes the highest power of a prime dividing a binomial coefficient by counting the carries that occur when adding the binomial parameters in base that prime.
-
B.
Kummer sequence
The Kummer sequence is a short exact sequence in algebraic number theory and algebraic geometry that relates a ring or scheme to its group of roots of unity and underpins Kummer theory and the study of cyclic extensions.
-
C.
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.
-
D.
Kummer theory
Kummer theory is a branch of algebraic number theory that studies abelian extensions of fields, especially cyclotomic and radical extensions, using properties of roots of unity and ideal class groups.
-
E.
Hensel’s lemma
Hensel’s lemma is a fundamental result in number theory and p-adic analysis that allows one to lift solutions of polynomial congruences modulo a prime power to higher powers, analogous to Newton’s method in the p-adic setting.
- F. None of above. chosen
Provenance (2 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_69d8dcffc278819086792a4ebfddfafa |
completed | April 10, 2026, 11:20 a.m. |
| NER | Named-entity recognition | batch_69e5d5cdf2d08190a0aecd3fa5335a75 |
completed | April 20, 2026, 7:29 a.m. |
Created at: April 10, 2026, noon