Triple

T20627467
Position Surface form Disambiguated ID Type / Status
Subject Schur algorithm E506855 entity
Predicate relatedTo P37 FINISHED
Object Schur complement
The Schur complement is a matrix operation that reduces a block-partitioned matrix to a smaller one, playing a key role in numerical linear algebra, optimization, and the analysis of matrix inverses and definiteness.
E1440923 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: Schur complement | Statement: [Schur algorithm, relatedTo, Schur complement]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Schur complement
Context triple: [Schur algorithm, relatedTo, Schur complement]
  • A. Schur decomposition
    Schur decomposition is a matrix factorization in linear algebra that expresses a square matrix as a unitary (or orthogonal) matrix times an upper triangular matrix times the inverse of the unitary matrix, revealing its eigenvalues and simplifying many numerical computations.
  • B. Cauchy–Binet formula
    The Cauchy–Binet formula is a fundamental result in linear algebra that expresses the determinant of a product of two rectangular matrices as a sum of products of determinants of their square submatrices.
  • C. 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.
  • D. Bott–Duffin inverse
    The Bott–Duffin inverse is a generalized matrix inverse introduced by Raoul Bott and R. J. Duffin, used particularly in electrical network theory and linear algebra when the usual matrix inverse does not exist.
  • E. Sylvester determinant
    The Sylvester determinant is a mathematical construct introduced by James Joseph Sylvester, typically referring to a determinant associated with resultants and elimination theory in algebra.
  • 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: Schur complement
Triple: [Schur algorithm, relatedTo, Schur complement]
Generated description
The Schur complement is a matrix operation that reduces a block-partitioned matrix to a smaller one, playing a key role in numerical linear algebra, optimization, and the analysis of matrix inverses and definiteness.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Schur complement
Target entity description: The Schur complement is a matrix operation that reduces a block-partitioned matrix to a smaller one, playing a key role in numerical linear algebra, optimization, and the analysis of matrix inverses and definiteness.
  • A. Schur decomposition
    Schur decomposition is a matrix factorization in linear algebra that expresses a square matrix as a unitary (or orthogonal) matrix times an upper triangular matrix times the inverse of the unitary matrix, revealing its eigenvalues and simplifying many numerical computations.
  • B. Cauchy–Binet formula
    The Cauchy–Binet formula is a fundamental result in linear algebra that expresses the determinant of a product of two rectangular matrices as a sum of products of determinants of their square submatrices.
  • C. 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.
  • D. Bott–Duffin inverse
    The Bott–Duffin inverse is a generalized matrix inverse introduced by Raoul Bott and R. J. Duffin, used particularly in electrical network theory and linear algebra when the usual matrix inverse does not exist.
  • E. Sylvester determinant
    The Sylvester determinant is a mathematical construct introduced by James Joseph Sylvester, typically referring to a determinant associated with resultants and elimination theory in algebra.
  • 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_69e0b4bd4a0081908d4e97a590a33fb2 completed April 16, 2026, 10:06 a.m.
NER Named-entity recognition batch_69e6abe645888190b639ebedc5b3041a completed April 20, 2026, 10:42 p.m.
NED1 Entity disambiguation (via context triple) batch_6a08bb1d9fc881909afe38600d8556b1 completed May 16, 2026, 6:44 p.m.
NEDg Description generation batch_6a08bbb64c40819080b2ea24d1f774ff completed May 16, 2026, 6:47 p.m.
NED2 Entity disambiguation (via description) batch_6a08bc4ea25881909fa71fe2f1b6ddb4 completed May 16, 2026, 6:49 p.m.
Created at: April 16, 2026, 11:42 a.m.