Triple
T16983578
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Alan Hoffman |
E412003
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object |
Hoffman–Wielandt inequality
The Hoffman–Wielandt inequality is a fundamental result in matrix analysis that bounds the difference between the eigenvalues of two normal matrices in terms of the Frobenius norm of their difference.
|
E1243905
|
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: Hoffman–Wielandt inequality | Statement: [Alan Hoffman, notableConcept, Hoffman–Wielandt inequality]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hoffman–Wielandt inequality Context triple: [Alan Hoffman, notableConcept, Hoffman–Wielandt inequality]
-
A.
Weyl inequalities
Weyl inequalities are fundamental results in linear algebra that bound the eigenvalues of sums of Hermitian (or symmetric) matrices in terms of the eigenvalues of the individual matrices.
-
B.
Hadamard inequality
The Hadamard inequality is a fundamental result in linear algebra and analysis that bounds the absolute value of a determinant by the product of the Euclidean norms of its row or column vectors.
-
C.
Courant–Fischer min–max theorem
The Courant–Fischer min–max theorem is a fundamental result in linear algebra and spectral theory that characterizes the eigenvalues of a Hermitian (or symmetric) matrix via variational min–max principles over subspaces.
-
D.
Friedrichs inequality
Friedrichs inequality is a fundamental result in functional analysis and partial differential equations that provides bounds on the norms of functions in terms of their derivatives, playing a key role in the theory of Sobolev spaces and boundary value problems.
-
E.
Schur product theorem
The Schur product theorem is a result in linear algebra stating that the entrywise (Hadamard) product of two positive semidefinite matrices is itself positive semidefinite.
- 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: Hoffman–Wielandt inequality Triple: [Alan Hoffman, notableConcept, Hoffman–Wielandt inequality]
Generated description
The Hoffman–Wielandt inequality is a fundamental result in matrix analysis that bounds the difference between the eigenvalues of two normal matrices in terms of the Frobenius norm of their difference.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hoffman–Wielandt inequality Target entity description: The Hoffman–Wielandt inequality is a fundamental result in matrix analysis that bounds the difference between the eigenvalues of two normal matrices in terms of the Frobenius norm of their difference.
-
A.
Weyl inequalities
Weyl inequalities are fundamental results in linear algebra that bound the eigenvalues of sums of Hermitian (or symmetric) matrices in terms of the eigenvalues of the individual matrices.
-
B.
Hadamard inequality
The Hadamard inequality is a fundamental result in linear algebra and analysis that bounds the absolute value of a determinant by the product of the Euclidean norms of its row or column vectors.
-
C.
Courant–Fischer min–max theorem
The Courant–Fischer min–max theorem is a fundamental result in linear algebra and spectral theory that characterizes the eigenvalues of a Hermitian (or symmetric) matrix via variational min–max principles over subspaces.
-
D.
Friedrichs inequality
Friedrichs inequality is a fundamental result in functional analysis and partial differential equations that provides bounds on the norms of functions in terms of their derivatives, playing a key role in the theory of Sobolev spaces and boundary value problems.
-
E.
Schur product theorem
The Schur product theorem is a result in linear algebra stating that the entrywise (Hadamard) product of two positive semidefinite matrices is itself positive semidefinite.
- 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_69d886ca8f348190812768ea8d5055ce |
completed | April 10, 2026, 5:12 a.m. |
| NER | Named-entity recognition | batch_69e3d188ede48190baead48aac84c78d |
completed | April 18, 2026, 6:46 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a00dc0f13c88190b55da5be40a0a476 |
completed | May 10, 2026, 7:27 p.m. |
| NEDg | Description generation | batch_6a00dc96a9588190b020fd7fd1deee2b |
completed | May 10, 2026, 7:29 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a0114e04e00819093805024f8417fad |
completed | May 10, 2026, 11:29 p.m. |
Created at: April 10, 2026, 5:32 a.m.