pith. sign in

arxiv: 1807.10906 · v1 · pith:GVRFH4EMnew · submitted 2018-07-28 · 🧮 math.GN

No bullying! A playful proof of Brouwer's fixed-point theorem

classification 🧮 math.GN
keywords childrengrouplemmatheoremtoysbrouwerbullyfixed-point
0
0 comments X
read the original abstract

We give an elementary proof of Brouwer's fixed-point theorem. The only mathematical prerequisite is a version of the Bolzano-Weierstrass theorem: a sequence in a compact subset of $n$-dimensional Euclidean space has a convergent subsequence with a limit in that set. Our main tool is a `no-bullying' lemma for agents with preferences over indivisible goods. What does this lemma claim? Consider a finite number of children, each with a single indivisible good (a toy) and preferences over those toys. Let's say that a group of children, possibly after exchanging toys, could bully some poor kid if all group members find their own current toy better than the toy of this victim. The no-bullying lemma asserts that some group $S$ of children can redistribute their toys among themselves in such a way that all members of $S$ get their favorite toy from $S$, but they cannot bully anyone.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.