\(\mathcal {F}\) -finite embeddabilities of sets and ultrafilters

详细信息    查看全文

• 作者：Lorenzo Luperi Baglini
• 刊名：Archive for Mathematical Logic
• 出版年：2016
• 出版时间：August 2016
• 年：2016
• 卷：55
• 期：5-6
• 页码：705-734
• 全文大小：624 KB
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Mathematical Logic and Foundations
  Mathematics
  Algebra
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1432-0665
• 卷排序：55

文摘

Let S be a semigroup, let \(n\in \mathbb {N}\) be a positive natural number, let \(A,B\subseteq S\), let \(\mathcal {U},\mathcal {V}\in \beta S\) and let let \(\mathcal {F}\subseteq \{f:S^{n}\rightarrow S\}\). We say that A is \(\mathcal {F}\)-finitely embeddable in B if for every finite set \(F\subseteq A\) there is a function \(f\in \mathcal {F}\) such that \(f\left( A^{n}\right) \subseteq B\), and we say that \(\mathcal {U}\) is \(\mathcal {F}\)-finitely embeddable in \(\mathcal {V}\) if for every set \(B\in \mathcal {V}\) there is a set \(A\in \mathcal {U}\) such that A is \(\mathcal {F}\)-finitely embeddable in B. We show that \(\mathcal {F}\)-finite embeddabilities can be used to study certain combinatorial properties of sets and ultrafilters related with finite structures. We introduce the notions of set and of ultrafilter maximal for \(\mathcal {F}\)-finite embeddability, whose existence is proved under very mild assumptions. Different choices of \(\mathcal {F}\) can be used to characterize many combinatorially interesting sets/ultrafilters as maximal sets/ultrafilters, for example thick sets, AP-rich sets, \(\overline{K(\beta S)}\) and so on. The set of maximal ultrafilters for \(\mathcal {F}\)-finite embeddability can be characterized algebraically in terms of \(\mathcal {F}\). This property can be used to give an algebraic characterization of certain interesting sets of ultrafilters, such as the ultrafilters whose elements contain, respectively, arbitrarily long arithmetic, geoarithmetic or polynomial progressions. As a consequence of the connection between sets and ultrafilters maximal for \(\mathcal {F}\)-finite embeddability we are able to prove a general result that entails, for example, that given a finite partition of a set that contains arbitrarily long geoarithmetic (resp. polynomial) progressions, one cell must contain arbitrarily long geoarithmetic (resp. polynomial) progressions. Finally we apply \(\mathcal {F}\)-finite embeddabilities to study a few properties of homogeneous partition regular diophantine equations. Some of our results are based on connections between ultrafilters and nonstandard models of arithmetic.KeywordsUltrafiltersRamsey theoryCombinatoricsNonstandard analysisSemigroups