Triple
T6832962
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | linear algebra |
E157381
|
entity |
| Predicate | hasKeyTheorem |
P72923
|
FINISHED |
| Object |
rank–nullity theorem
The rank–nullity theorem is a fundamental result in linear algebra that relates the dimension of a vector space to the sum of the dimensions of the kernel and image of a linear transformation.
|
E621086
|
NE FINISHED |
How this triple was built (5 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: rank–nullity theorem | Statement: [linear algebra, hasKeyTheorem, rank–nullity theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: rank–nullity theorem Context triple: [linear algebra, hasKeyTheorem, rank–nullity 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.
linear algebra
Linear algebra is a branch of mathematics that studies vectors, vector spaces, linear transformations, and systems of linear equations, forming a foundation for many areas of science and engineering.
-
C.
Banach–Mazur theorem
The Banach–Mazur theorem is a fundamental result in functional analysis that characterizes separable Banach spaces as isometrically isomorphic to closed subspaces of spaces of continuous functions on compact metric spaces.
-
D.
Hahn–Banach theorem
The Hahn–Banach theorem is a fundamental result in functional analysis that guarantees the extension of bounded linear functionals from a subspace to the whole space without increasing their norm.
-
E.
Riemann–Roch theorem
The Riemann–Roch theorem is a fundamental result in algebraic geometry and complex analysis that relates the dimension of spaces of meromorphic sections of a line bundle on a curve to topological data such as genus and degree.
- 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: rank–nullity theorem Triple: [linear algebra, hasKeyTheorem, rank–nullity theorem]
Generated description
The rank–nullity theorem is a fundamental result in linear algebra that relates the dimension of a vector space to the sum of the dimensions of the kernel and image of a linear transformation.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: rank–nullity theorem Target entity description: The rank–nullity theorem is a fundamental result in linear algebra that relates the dimension of a vector space to the sum of the dimensions of the kernel and image of a linear transformation.
-
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.
linear algebra
Linear algebra is a branch of mathematics that studies vectors, vector spaces, linear transformations, and systems of linear equations, forming a foundation for many areas of science and engineering.
-
C.
Banach–Mazur theorem
The Banach–Mazur theorem is a fundamental result in functional analysis that characterizes separable Banach spaces as isometrically isomorphic to closed subspaces of spaces of continuous functions on compact metric spaces.
-
D.
Hahn–Banach theorem
The Hahn–Banach theorem is a fundamental result in functional analysis that guarantees the extension of bounded linear functionals from a subspace to the whole space without increasing their norm.
-
E.
Riemann–Roch theorem
The Riemann–Roch theorem is a fundamental result in algebraic geometry and complex analysis that relates the dimension of spaces of meromorphic sections of a line bundle on a curve to topological data such as genus and degree.
- F. None of above. chosen
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasKeyTheorem Context triple: [linear algebra, hasKeyTheorem, rank–nullity theorem]
-
A.
hasKeyDecision
Indicates that an entity holds primary responsibility or authority for making a significant decision in a given context.
-
B.
hasKeyDua
Indicates that one entity possesses or is associated with a specific secondary or backup key related to another entity.
-
C.
hasKeyIssue
Indicates that an entity is associated with a primary or central problem, concern, or topic of importance.
-
D.
hasKeyWork
Indicates that an entity possesses or is associated with a primary or central work (such as a main publication, artwork, or project) that is especially representative or important.
-
E.
hasKeyPass
Indicates that an entity possesses or is granted a key-based pass that allows access or authorization to something.
- F. None of above. chosen
Provenance (7 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_69c6882c53608190b99aebef079b23bd |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d62b1e8c8190a81d91191a54b073 |
completed | March 27, 2026, 7:10 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c723fd50c88190af005fd58ca0aee6 |
completed | March 28, 2026, 12:42 a.m. |
| NEDg | Description generation | batch_69c7247806808190ac60c134cec612c8 |
completed | March 28, 2026, 12:44 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c7253b94f081909e7cee870a12af6b |
completed | March 28, 2026, 12:47 a.m. |
| PD | Predicate disambiguation | batch_69c6d09d95f0819091ca7f897dc21efe |
completed | March 27, 2026, 6:46 p.m. |
| PDg | Predicate description generation | batch_69c6d11fab808190b18160ff3829fcc6 |
completed | March 27, 2026, 6:49 p.m. |
Created at: March 27, 2026, 2:18 p.m.