Constructive proof of Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions by Sperner's lemma
Yasuhito Tanaka

TL;DR
This paper provides a constructive proof of Brouwer's fixed point theorem for a specific class of functions using Sperner's lemma, advancing the understanding of fixed point existence in a constructive framework.
Contribution
It introduces a new constructive proof of Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions using Sperner's lemma.
Findings
Constructive proof of Brouwer's fixed point theorem for the specified functions
Application of Sperner's lemma to a modified partition of a simplex
Advancement in constructive fixed point theory
Abstract
In this paper using Sperner's lemma for modified partition of a simplex we will constructively prove Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Formal Methods in Verification · Numerical Methods and Algorithms
