Triple
T17020102
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Karamata's inequality |
E412925
|
entity |
| Predicate | generalizes |
P2372
|
FINISHED |
| Object |
Hardy–Littlewood–Pólya inequality
The Hardy–Littlewood–Pólya inequality is a fundamental result in majorization theory and inequalities that characterizes how convex functions behave under rearrangements of sequences or vectors.
|
E1247123
|
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: Hardy–Littlewood–Pólya inequality | Statement: [Karamata's inequality, generalizes, Hardy–Littlewood–Pólya inequality]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hardy–Littlewood–Pólya inequality Context triple: [Karamata's inequality, generalizes, Hardy–Littlewood–Pólya inequality]
-
A.
Chebyshev’s sum inequality
Chebyshev’s sum inequality is a mathematical inequality that provides bounds on the sum of products of similarly ordered sequences, widely used in analysis and probability theory.
-
B.
Karamata's inequality
Karamata's inequality is a fundamental result in majorization theory that generalizes several classical inequalities by comparing sums of convex (or concave) functions over majorized sequences.
-
C.
Maclaurin’s inequality in symmetric means
Maclaurin’s inequality in symmetric means is a classical result in mathematical analysis that relates and bounds the sequence of elementary symmetric means of a set of nonnegative real numbers, showing they form a decreasing sequence.
-
D.
Hardy inequality
The Hardy inequality is a fundamental result in mathematical analysis that provides bounds on integrals or sums involving a function and its distance from a point, with important applications in functional analysis and partial differential equations.
-
E.
Riesz rearrangement inequality
The Riesz rearrangement inequality is a fundamental result in mathematical analysis that provides an optimal bound for integrals of products of functions in terms of their symmetric decreasing rearrangements.
- 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: Hardy–Littlewood–Pólya inequality Triple: [Karamata's inequality, generalizes, Hardy–Littlewood–Pólya inequality]
Generated description
The Hardy–Littlewood–Pólya inequality is a fundamental result in majorization theory and inequalities that characterizes how convex functions behave under rearrangements of sequences or vectors.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hardy–Littlewood–Pólya inequality Target entity description: The Hardy–Littlewood–Pólya inequality is a fundamental result in majorization theory and inequalities that characterizes how convex functions behave under rearrangements of sequences or vectors.
-
A.
Chebyshev’s sum inequality
Chebyshev’s sum inequality is a mathematical inequality that provides bounds on the sum of products of similarly ordered sequences, widely used in analysis and probability theory.
-
B.
Karamata's inequality
Karamata's inequality is a fundamental result in majorization theory that generalizes several classical inequalities by comparing sums of convex (or concave) functions over majorized sequences.
-
C.
Maclaurin’s inequality in symmetric means
Maclaurin’s inequality in symmetric means is a classical result in mathematical analysis that relates and bounds the sequence of elementary symmetric means of a set of nonnegative real numbers, showing they form a decreasing sequence.
-
D.
Hardy inequality
The Hardy inequality is a fundamental result in mathematical analysis that provides bounds on integrals or sums involving a function and its distance from a point, with important applications in functional analysis and partial differential equations.
-
E.
Riesz rearrangement inequality
The Riesz rearrangement inequality is a fundamental result in mathematical analysis that provides an optimal bound for integrals of products of functions in terms of their symmetric decreasing rearrangements.
- 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_69d886cc4170819093deddc7b8b4b6a7 |
completed | April 10, 2026, 5:12 a.m. |
| NER | Named-entity recognition | batch_69e3d482c3a0819099e6ea4acb0a08ee |
completed | April 18, 2026, 6:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a011b4f9dfc819085639edb5cda1cca |
completed | May 10, 2026, 11:57 p.m. |
| NEDg | Description generation | batch_6a011cc1afc48190b83e3203407c1d7f |
completed | May 11, 2026, 12:03 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a011d67c82c8190b737406e8952eb2b |
completed | May 11, 2026, 12:05 a.m. |
Created at: April 10, 2026, 5:33 a.m.