Triple
T19231064
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Stone–Weierstrass theorem |
E480871
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object | complex Stone–Weierstrass theorem |
—
|
NE NERFINISHED |
How this triple was built (2 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: complex Stone–Weierstrass theorem | Statement: [Stone–Weierstrass theorem, hasVariant, complex Stone–Weierstrass theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: complex Stone–Weierstrass theorem Context triple: [Stone–Weierstrass theorem, hasVariant, complex Stone–Weierstrass theorem]
-
A.
Stone–Weierstrass theorem
chosen
The Stone–Weierstrass theorem is a fundamental result in functional analysis that characterizes when a subalgebra of continuous functions on a compact space is dense, thereby generalizing classical polynomial approximation results.
-
B.
Weierstrass approximation theorem
The Weierstrass approximation theorem is a fundamental result in real analysis stating that any continuous function on a closed interval can be uniformly approximated by polynomials.
-
C.
Mergelyan's theorem
Mergelyan's theorem is a fundamental result in complex analysis stating that every function continuous on a compact subset of the complex plane with connected complement and holomorphic in its interior can be uniformly approximated by polynomials.
-
D.
Runge approximation theorem
The Runge approximation theorem is a fundamental result in complex analysis stating that holomorphic functions on certain domains can be uniformly approximated by rational functions with poles outside those domains.
-
E.
Banach–Stone theorem
The Banach–Stone theorem is a fundamental result in functional analysis that characterizes compact Hausdorff spaces via isometric isomorphisms between their spaces of continuous real- or complex-valued functions.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d8e8ccb8f48190ad420098e74fb1db |
completed | April 10, 2026, 12:10 p.m. |
| NER | Named-entity recognition | batch_69e5fa9ce5e081909df994841ce476d5 |
completed | April 20, 2026, 10:06 a.m. |
Created at: April 10, 2026, 1:25 p.m.