Related papers: An Infinitary version of Sperner's lemma
We prove Sklar's theorem in infinite dimensions via a topological argument and the notion of inverse systems.
In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…
We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces.
The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…
The present paper is a continuation of author's paper arXiv:1909.00940 [math.AT] devoted to the lemmas of Alexander and Sperner, but is independent from it. We begin by a step back from Alexander and Sperner to Lebesgue work on the…
We develop a geometric framework that unifies several different combinatorial fixed-point theorems related to Tucker's lemma and Sperner's lemma, showing them to be different geometric manifestations of the same topological phenomena. In…
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…
We prove an infinite-dimensional generalization of Zenger's lemma that was used in the proof of the fact that the convex hull of the point spectrum of a linear operator is contained in its numerical range. Two relevant examples are given,…
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk - Ulam theorems with many useful applications. These classic lemmas are concerning labellings of triangulated discs and spheres. In this paper we show that…
The additive square problem is a relatively famous open problem in the area of combinatorics on words: Does there exist an infinite word over a finite alphabet, such that no two consecutive blocks of the same length have the same sum? In…
We extend Hadamard's Lemma to the setting of a separable Hilbert space.
In this paper we introduce the notion of existentially closed Leibniz algebras. Then we use HNN-extensions of Leibniz algebras in order to prove an embedding theorem.
The purpose of this paper is to study some new concrete approximation processes for continuous vector-valued mappings defined on the infinite dimensional cube or on a subset of a real Hilbert space. In both cases these operators are…
In this paper we consider finite dimensional dynamical systems generated by a Lipschitz function. We prove a version of the Whitney's Extension Theorem on compact manifolds to obtain a version of the well-known Lambda Lemma for Lipschitz…
An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…
Alexander's lemma is a version of Sperner's lemma published by Alexander two years earlier than Sperner's paper. The present paper is devoted to a modern but elementary exposition of lemmas of Alexander and Sperner and their main…
We give a short and self-contained proof of Levi's Extension Lemma for pseudoline arrangements.
We give a new proof of a lemma by L. Shepp, that was used in connection to random coverings of a circle.
The diagrammatic cumulant expansion for the periodic Anderson model with infinite Coulomb repulsion ($U=\infty $) is considered here for an hypercubic lattice of infinite dimension ($d=\infty $). The same type of simplifications obtained by…
We deduce an extension theorem for the so-called Sobolev-Grand Lebesgue Spaces defined on the suitable subsets of the whole finite-dimensional Euclidean space, and estimate the norms of correspondent extension operator, which may be choosed…