Model-theoretic properties of ultrafilters built by independent families of functions

DOI10.1017/JSL.2013.28zbMATH Open1338.03055arXiv1208.2579OpenAlexW2962679058MaRDI QIDQ2921022FDOQ2921022

Authors: S. Shelah, M. Malliaris 

Publication date: 30 September 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Abstract: Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We begin by showing that any flexible regular ultrafilter makes the product of an unbounded sequence of finite cardinals large, {thus} saturating any stable theory. We then prove directly that a "bottleneck" in the inductive construction of a regular ultrafilter on $lambda$ (i.e. a point after which all antichains of $P(lambda)/D$ have cardinality less than $lambda$) essentially prevents any subsequent ultrafilter from being flexible, {thus} from saturating any non-low theory. The paper's three main constructions are as follows. First, we construct a regular filter $D$ on $lambda$ so that any ultrafilter extending $D$ fails to $lambd{a}^{+}$-saturate ultrapowers of the random graph, {thus} of any unstable theory. The proof constructs the omitted random graph type directly. Second, assuming existence of a measurable cardinal $kappa$, we construct a regular ultrafilter on $lambda>kappa$ which is $lambda$-flexible but not $kapp{a}^{++}$-good, improving our previous answer to a question raised in Dow 1975. Third, assuming a weakly compact cardinal $kappa$, we construct an ultrafilter to show that $lcf(alep{h}_0)$ may be small while all symmetric cuts of cofinality $kappa$ are realized. Thus certain families of pre-cuts may be realized while still failing to saturate any unstable theory.

Full work available at URL: https://arxiv.org/abs/1208.2579

Recommendations

• Constructing regular ultrafilters from a model-theoretic point of view
• Saturating ultrafilters on N
• Saturating the random graph with an independent family of small range
• A dividing line within simple unstable theories
• Independence, order, and the interaction of ultrafilters and theories

zbMATH Keywords

regular ultrafilterssaturation of ultrapowersKeisler orderunstable model theory

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Other combinatorial set theory (03E05) Ultraproducts and related constructions (03C20)

Cites Work

• Some theorems of set theory and their topological consequences
• Toward classifying unstable theories
• Realization of \(\varphi \)-types and Keisler's order
• A dividing line within simple unstable theories
• Combinatorial set theory: Partition relations for cardinals
• On \(\vartriangleleft^{*}\)-maximality.
• Good ideals in fields of sets
• Regular ultrafilters and finite square principles

Cited In (10)

• A dividing line within simple unstable theories
• Constructing regular ultrafilters from a model-theoretic point of view
• On cuts in ultraproducts of linear orders. I.
• Cofinality spectrum theorems in model theory, set theory, and general topology
• Atomic saturation of reduced powers
• Some simple theories from a Boolean algebra point of view
• Existence of optimal ultrafilters and the fundamental complexity of simple theories
• Saturating the random graph with an independent family of small range
• On cuts in ultraproducts of linear orders. II
• Saturating ultrafilters on N

This page was built for publication: Model-theoretic properties of ultrafilters built by independent families of functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921022)