arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.13883math.CAmath.GN
收藏

勒贝格覆盖定理与连续函数的水平集

Lebesgue Covering Theorem and level sets of continuous functions

Michał Dybowski

AI总结:

研究勒贝格覆盖定理的维度理论推广,此推广涵盖广义n维斯坦豪斯棋盘定理。还研究与连续函数\(g\colon [0,1]^n \to \mathbb{R}\)相关的两类集合,包括纤维\(g^{-1}[\{p\}]\)连接或分离\([0,1]^n\)相对面的点\(p\)的集合。

摘要:

我们阐述并证明了勒贝格覆盖定理一个版本的维度理论推广。Turzański和Ziajor最近通过算法证明的广义n维斯坦豪斯棋盘定理是该结果的一个特殊情况。此外,我们研究了与连续函数\(g\colon [0,1]^n \to \mathbb{R}\)相关的两类集合。一类是\(\mathbb{R}\)中所有使得纤维\(g^{-1}[\{p\}]\)连接\([0,1]^n\)第\(i\)对相对面的点\(p\)的集合,另一类是\(\mathbb{R}\)中所有使得纤维\(g^{-1}[\{p\}]\)分离\([0,1]^n\)第\(i\)对相对面的点\(p\)的集合。

英文摘要:

We formulate and prove a dimension-theoretic generalization of a version of the Lebesgue Covering Theorem. A generalized $n$-dimensional version of the Steinhaus Chessboard Theorem, recently proved algorithmically by Turzański and Ziajor, is a particular case of this result. Moreover, we study two types of sets associated with a continuous function $g \colon [0,1]^n \to \mathbb{R}$. Namely, the set of all points $p \in \mathbb{R}$ such that the fiber $g^{-1}[\left\{p\right\}]$ connects $i$th opposite faces of $[0,1]^n$, and the set of all points $p \in \mathbb{R}$ such that the fiber $g^{-1}[\left\{p\right\}]$ separates $i$th opposite faces of $[0, 1]^n$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑