Triple
T1056923
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Brouwer fixed-point theorem |
E22815
|
entity |
| Predicate | hasCombinatorialVersion |
P12350
|
FINISHED |
| Object |
Sperner's lemma
Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
|
E121351
|
NE FINISHED |
Provenance (6 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a493dada0481909c43649f9843ea91 |
elicitation | completed |
| NER | batch_69a4b8da80dc8190b79beaf509910725 |
ner | completed |
| NED1 | batch_69ac3bd110ac8190b66163de42bd3034 |
ned_source_triple | completed |
| NED2 | batch_69ac3dbf5c70819084a942fc97a9b50f |
ned_description | completed |
| NEDg | batch_69ac3d4b32348190883244f2b8af32a0 |
nedg | completed |
| PD | batch_69a4b731e25c8190b5ea8466648c2c9a |
pd | completed |
Created at: March 1, 2026, 7:42 p.m.