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

preprint2012arXivOpen access

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 λλ (i.e. a point after which all antichains of P(λ)/DP(λ)/D have cardinality less than λλ) 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 DD on λλ so that any ultrafilter extending DD fails to λ+λ^+-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 κκ, we construct a regular ultrafilter on λ>κλ> κ which is λλ-flexible but not κ++κ^{++}-good, improving our previous answer to a question raised in Dow 1975. Third, assuming a weakly compact cardinal κκ, we construct an ultrafilter to show that $\lcf(\aleph_0)$ may be small while all symmetric cuts of cofinality κκ are realized. Thus certain families of pre-cuts may be realized while still failing to saturate any unstable theory.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.