2000 character limit reached
Chessboard and level sets of continuous functions
Published 19 Jun 2024 in math.GN and math.CO | (2406.13774v5)
Abstract: We provide the following result and its discrete equivalent: Let $f \colon In \to \mathbb{R}{n-1}$ be a continuous function. Then, there exist a point $p \in \mathbb{R}{n-1}$ and a compact subset $S \subset f{-1}\left[\left{p\right}\right]$ which connects some opposite faces of the $n$-dimensional unit cube $In$. We give an example that shows it cannot be generalized to path-connected sets. Additionally, we show that the $n$-dimensional Steinhaus Chessboard Theorem and the Brouwer Fixed Point Theorem are simple consequences of this result.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.