Search arXivSearch

arXiv · 1407.7437

Algebra, selections, and additive Ramsey theory

Abstract

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods include, in addition to Hurewicz's game theoretic characterization of Menger's property, extensions of the classic idempotent theory in the Stone--Czech compactification of semigroups, and of the more recent theory of selection principles. This provides strong versions of the mentioned celebrated theorems, where the monochromatic substructures are large, beyond infinitude, in an analytic sense. Reducing the main theorems to the purely combinatorial setting, we obtain nontrivial consequences concerning uncountable cardinal characteristics of the continuum. The main results, modulo technical refinements, are of the following type (definitions provided in the main text): Let $X$ be a Menger space, and $\mathcal{U}$ be an infinite open cover of $X$. Consider the complete graph, whose vertices are the open sets in $X$. For each finite coloring of the vertices and edges of this graph, there are disjoint finite subsets $\mathcal{F}_1,\mathcal{F}_2,\dots$ of the cover $\mathcal{U}$ whose unions $V_1 := \bigcup\mathcal{F}_1, V_2 := \bigcup\mathcal{F}_2,\dots$ have the following properties: 1. The sets $\bigcup_{n\in F}V_n$ and $\bigcup_{n\in H}V_n$ are distinct for all nonempty finite sets $F<H$. 2. All vertices $\bigcup_{n\in F}V_n$, for nonempty finite sets $F$, are of the same color. 3. All edges $\bigl\{\,\bigcup_{n\in F}V_n, \bigcup_{n\in H}V_n\,\bigr\}$, for nonempty finite sets $F<H$, have the same color. 4. The family $\{V_1,V_2,\dots\}$ is an open cover of $X$. A self-contained introduction to the necessary parts of the needed theories is provided.

Explore related subjects

Keep this discovery

BibTeXRIS

Boaz Tsaban. 2014-07-28. Algebra, selections, and additive Ramsey theory. https://doi.org/10.4064/fm342-1-2017

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN