On the (in)equivalence of Brouwer's fixed point theorem and Sperner's lemma
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908431639642112 |
|---|---|
| author | Minagawa, Junichi |
| author_facet | Minagawa, Junichi |
| contents | We consider Brouwer's fixed point theorem and Sperner's lemma in one dimension. We present a proof of the Brouwer theorem using the Sperner lemma, and vice versa. However, we also show that they are not equivalent, because the Sperner lemma holds in the ordered field of rational numbers, whereas proving the Brouwer theorem requires the property of completeness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02366 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the (in)equivalence of Brouwer's fixed point theorem and Sperner's lemma Minagawa, Junichi Combinatorics We consider Brouwer's fixed point theorem and Sperner's lemma in one dimension. We present a proof of the Brouwer theorem using the Sperner lemma, and vice versa. However, we also show that they are not equivalent, because the Sperner lemma holds in the ordered field of rational numbers, whereas proving the Brouwer theorem requires the property of completeness. |
| title | On the (in)equivalence of Brouwer's fixed point theorem and Sperner's lemma |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2507.02366 |