Triple

T9844178
Position Surface form Disambiguated ID Type / Status
Subject Cauchy interlacing theorem E239297 entity
Predicate relatedTo P37 FINISHED
Object 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.
E825435 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: Courant–Fischer min–max theorem | Statement: [Cauchy interlacing theorem, relatedTo, Courant–Fischer min–max theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Courant–Fischer min–max theorem
Context triple: [Cauchy interlacing theorem, relatedTo, Courant–Fischer min–max theorem]
  • A. Sylvester’s law of inertia
    Sylvester’s law of inertia is a theorem in linear algebra stating that the numbers of positive, negative, and zero eigenvalues (the inertia) of a real symmetric matrix are invariant under change of basis.
  • B. Cauchy interlacing theorem
    The Cauchy interlacing theorem is a fundamental result in linear algebra that relates the eigenvalues of a symmetric matrix to those of its principal submatrices, showing how they "interlace" on the real line.
  • C. Cayley–Hamilton theorem
    The Cayley–Hamilton theorem is a fundamental result in linear algebra stating that every square matrix satisfies its own characteristic polynomial.
  • D. May–Wigner stability theorem
    The May–Wigner stability theorem is a result in theoretical ecology and random matrix theory showing that large, complex systems with many random interactions are generically unstable beyond a critical level of complexity.
  • E. 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.
  • 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: Courant–Fischer min–max theorem
Triple: [Cauchy interlacing theorem, relatedTo, Courant–Fischer min–max theorem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Courant–Fischer min–max theorem
Target entity description: 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.
  • A. Sylvester’s law of inertia
    Sylvester’s law of inertia is a theorem in linear algebra stating that the numbers of positive, negative, and zero eigenvalues (the inertia) of a real symmetric matrix are invariant under change of basis.
  • B. Cauchy interlacing theorem
    The Cauchy interlacing theorem is a fundamental result in linear algebra that relates the eigenvalues of a symmetric matrix to those of its principal submatrices, showing how they "interlace" on the real line.
  • C. Cayley–Hamilton theorem
    The Cayley–Hamilton theorem is a fundamental result in linear algebra stating that every square matrix satisfies its own characteristic polynomial.
  • D. May–Wigner stability theorem
    The May–Wigner stability theorem is a result in theoretical ecology and random matrix theory showing that large, complex systems with many random interactions are generically unstable beyond a critical level of complexity.
  • E. 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.
  • 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_69ca84e3f0c48190ada72a65ebd50efd completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdb35dc29c819080203be5b904dc9d completed April 2, 2026, 12:07 a.m.
NED1 Entity disambiguation (via context triple) batch_69d1d5dda4b0819092703270e87bee5a completed April 5, 2026, 3:24 a.m.
NEDg Description generation batch_69d1d6815e28819081788393cda63bc0 completed April 5, 2026, 3:26 a.m.
NED2 Entity disambiguation (via description) batch_69d1d74e7a148190a9470745bfd7ad42 completed April 5, 2026, 3:30 a.m.
Created at: March 30, 2026, 8:33 p.m.