A measurable cardinal with a nonwellfounded ultrapower

1980 ◽  
Vol 45 (3) ◽  
pp. 623-628 ◽  
Author(s):  
Mitchell Spector
Keyword(s):  
Set Theory ◽  
Measurable Cardinal ◽  
Axiom Of Choice ◽  
Partial Ordering ◽  
Partition Relation ◽  
Partition Relations ◽  
Consistency Results ◽  
The Axiom Of Choice ◽  
Measurable Cardinals ◽  
Weakened Form

The usefulness of measurable cardinals in set theory arises in good part from the fact that an ultraproduct of wellfounded structures by a countably complete ultrafilter is wellfounded. In the standard proof of the wellfoundedness of such an ultraproduct, one first shows, without any use of the axiom of choice, that the ultraproduct contains no infinite descending chains. One then completes the proof by noting that, assuming the axiom of choice, any partial ordering with no infinite descending chain is wellfounded. In fact, the axiom of dependent choices (a weakened form of the axiom of choice) suffices. It is therefore of interest to ask whether some use of the axiom of choice is needed in order to prove the wellfoundedness of such ultraproducts or whether, on the other hand, their wellfoundedness can be proved in ZF alone. In Theorem 1, we show that the axiom of choice is needed for the proof (assuming the consistency of a strong partition relation). Theorem 1 also contains some related consistency results concerning infinite exponent partition relations. We then use Theorem 1 to show how to change the cofinality of a cardinal κ satisfying certain partition relations to any regular cardinal less than κ, while introducing no new bounded subsets of κ. This generalizes a theorem of Prikry [5].

A measure representation theorem for strong partition cardinals

1982 ◽  
Vol 47 (1) ◽  
pp. 161-168 ◽  
Author(s):  
E. M. Kleinberg
Keyword(s):  
Set Theory ◽  
Representation Theorem ◽  
Axiom Of Choice ◽  
Partition Relation ◽  
Subsequent Work ◽  
Partition Relations ◽  
Measure Representation ◽  
The Axiom Of Choice ◽  
Measurable Cardinals ◽  
Strong Partition Cardinals

There are two main axiomatic extensions of Zermelo-Fraenkel set theory without the axiom of choice, that associated with the axiom of determinateness, and that associated with infinite exponent partition relations. Initially, the axiom of determinateness, henceforth AD, was the sole tool available. Using it, set theorists in the late 1960s produced many remarkable results in pure set theory (e.g. the measurability of ℵ1) as well as in projective set theory (e.g. reduction principles for ). Infinite exponent partition relations were first studied successfully soon after these early consequences of AD. They too produced measurable cardinals and not only were the constructions here easier than those from AD—the results gave a far clearer picture of the measures involved than had been offered by AD. In general, the techniques offered by infinite exponent partition relations became so attractive that a great deal of the subsequent work from AD involved an initial derivation from AD of the appropriate infinite exponent partition relation and then the derivation from the partition relation of the desired result.Since the early 1970s work on choiceless extensions of ZF + DC has split mainly between AD and its applications to projective set theory, and infinite exponent partition relations and their applications to pure set theory. There has certainly been a fair amount of interplay between the two, but for the most part the theories have been pursued independently.Unlike AD, infinite exponent partition relations have shown themselves amenable to nontrivial forcing arguments. For example, Spector has constructed models for interesting partition relations, consequences of AD, in which AD is false. Thus AD is a strictly stronger assumption than are various infinite exponent partition relations. Furthermore, Woodin has recently proved the consistency of infinite exponent partition relations relative to assumptions consistent with the axiom of choice, in particular, relative to the existence of a supercompact cardinal. The notion of doing this for AD is not even considered.

Some consequences of an infinite-exponent partition relation

1977 ◽  
Vol 42 (4) ◽  
pp. 523-526 ◽  
Author(s):  
J. M. Henle
Keyword(s):  
Set Theory ◽  
Measurable Cardinal ◽  
Large Cardinals ◽  
Axiom Of Choice ◽  
Partition Relation ◽  
Basic Theorem ◽  
Axiom Of Determinacy ◽  
Ramsey’S Theorem ◽  
Partition Relations ◽  
Dependent Choice

Beginning with Ramsey's theorem of 1930, combinatorists have been intrigued with the notion of large cardinals satisfying partition relations. Years of research have established the smaller ones, weakly ineffable, Erdös, Jonsson, Rowbottom and Ramsey cardinals to be among the most interesting and important large cardinals in set theory. Recently, cardinals satisfying more powerful infinite-exponent partition relations have been examined with growing interest. This is due not only to their inherent qualities and the fact that they imply the existence of other large cardinals (Kleinberg [2], [3]), but also to the fact that the Axiom of Determinacy (AD) implies the existence of great numbers of such cardinals (Martin [5]).That these properties are more often than not inconsistent with the full Axiom of Choice (Kleinberg [4]) somewhat increases their charm, for the theorems concerning them tend to be a little odd, and their proofs, circumforaneous. The properties are, as far as anyone knows, however, consistent with Dependent Choice (DC).Our basic theorem will be the following: If k > ω and k satisfies k→(k)k then the least cardinal δ such that has a δ-additive, uniform ultrafilter. In addition, if ACω is assumed, we will show that δ is greater than ω, and hence a measurable cardinal. This result will be strengthened somewhat when we prove that for any k, δ, if then .

Adding a closed unbounded set

1976 ◽  
Vol 41 (2) ◽  
pp. 481-482 ◽  
Author(s):  
J. E. Baumgartner ◽  
L. A. Harrington ◽  
E. M. Kleinberg
Keyword(s):  
Regular Cardinal ◽  
Measurable Cardinal ◽  
Axiom Of Choice ◽  
Partition Relations ◽  
Uncountable Cardinal ◽  
Unbounded Subset ◽  
The Axiom Of Choice ◽  
Closed Unbounded Subset

The extreme interest of set theorists in the notion of “closed unbounded set” is epitomized in the following well-known theorem:Theorem A. For any regular cardinal κ > ω, the intersection of any two closed unbounded subsets of κ is closed and unbounded.The proof of this theorem is easy and in fact yields a stronger result, namely that for any uncountable regular cardinal κ the intersection of fewer than κ many closed unbounded sets is closed and unbounded. Thus, if, for κ a regular uncountable cardinal, we let denote {A ⊆ κ ∣ A contains a closed unbounded subset}, then, for any such κ, is a κ-additive nonprincipal filter on κ.Now what about the possibility of being an ultrafilterκ It is routine to see that this is impossible for κ > ℵ1. However, for κ = ℵ1 the situation is different. If were an ultrafilter, ℵ1 would be a measurable cardinal. As is well-known this is impossible if we assume the axiom of choice; however if ZF + “there exists a measurable cardinal” is consistent, then so is ZF + “ℵ1 is a measurable cardinal” [2]. Furthermore, under the assumption of certain set theoretic axioms (such as the axiom of determinateness or various infinite exponent partition relations) can be proven to be an ultrafilter. (See [3] and [5].)

On large cardinals and partition relations

1971 ◽  
Vol 36 (2) ◽  
pp. 305-308 ◽  
Author(s):  
E. M. Kleinberg ◽  
R. A. Shore
Keyword(s):  
Set Theory ◽  
Measurable Cardinal ◽  
Order Type ◽  
Large Cardinals ◽  
Infinite Cardinal ◽  
Partition Relation ◽  
Weakly Compact ◽  
Original Result ◽  
Partition Relations ◽  
Uncountable Cardinal

A significant portion of the study of large cardinals in set theory centers around the concept of “partition relation”. To best capture the basic idea here, we introduce the following notation: for x and y sets, κ an infinite cardinal, and γ an ordinal less than κ, we let [x]γ denote the collection of subsets of x of order-type γ and abbreviate with the partition relation for each function F frominto y there exists a subset C of κ of cardinality κ such that (such that for each α < γ) the range of F on [С]γ ([С]α) has cardinality 1. Now although each infinite cardinal κ satisfies the relation for each n and m in ω (F. P. Ramsey [8]), a connection with large cardinals arises when one asks, “For which uncountable κ do we have κ → (κ)2?” Indeed, any uncountable cardinal κ which satisfies κ → (κ)2 is strongly inaccessible and weakly compact (see [9]). As another example one can look at the improvements of Scott's original result to the effect that if there exists a measurable cardinal then there exists a nonconstructible set. Indeed, if κ is a measurable cardinal then κ → (κ)< ω, and as Solovay [11] has shown, if there exists a cardinal κ such that κ → (κ)< ω3 (κ → (ℵ1)< ω, even) then there exists a nonconstructible set of integers.

Jonsson-like partition relations and j: V → V

2004 ◽  
Vol 69 (4) ◽  
pp. 1267-1281 ◽  
Author(s):  
Arthur W. Apter ◽  
Grigor Sargsyan
Keyword(s):  
Axiom Of Choice ◽  
Elementary Embedding ◽  
Partition Relation ◽  
Partition Relations ◽  
Final Segment ◽  
The Axiom Of Choice ◽  
Jonsson Cardinals

Abstract.Working in the theory ”ZF + There is a nontrivial elementary embedding j : V → V“, we show that a final segment of cardinals satisfies certain square bracket finite and infinite exponent partition relations. As a corollary to this, we show that this final segment is composed of Jonsson cardinals. We then show how to force and bring this situation down to small alephs. A prototypical result is the construction of a model for ZF in which every cardinal μ ≥ ℵ2 satisfies the square bracket infinite exponent partition relation . We conclude with a discussion of some consistency questions concerning different versions of the axiom asserting the existence of a nontrivial elementary embedding j: V → V. By virtue of Kunen's celebrated inconsistency result, we use only a restricted amount of the Axiom of Choice.

Partitions of products

1993 ◽  
Vol 58 (3) ◽  
pp. 860-871 ◽  
Author(s):  
Carlos A. Di Prisco ◽  
James M. Henle
Keyword(s):  
Finite Number ◽  
Axiom Of Choice ◽  
Inaccessible Cardinal ◽  
Partition Relation ◽  
Partition Relations ◽  
Image Position ◽  
The Axiom Of Choice ◽  
Usual Notation

We will consider some partition properties of the following type: given a function F: ωω →2, is there a sequence H0, H1, … of subsets of ω such that F is constant on ΠiεωHi? The answer is obviously positive if we allow all the Hi's to have exactly one element, but the problem is nontrivial if we require the Hi's to have at least two elements. The axiom of choice contradicts the statement “for all F: ωω→ 2 there is a sequence H0, H1, H2,… of subsets of ω such that {i|(Hi) ≥ 2} is infinite and F is constant on ΠHi”, but the infinite exponent partition relation ω(ω)ω implies it; so, this statement is relatively consistent with an inaccessible cardinal. (See [1] where these partition properties were considered.)We will also consider partitions into any finite number of pieces, and we will prove some facts about partitions into ω-many pieces.Given a partition F: ωω → k, we say that H0, H1…, a sequence of subsets of ω, is homogeneous for F if F is constant on ΠHi. We say the sequence H0, H1,… is nonoverlapping if, for all i ∈ ω, ∪Hi > ∩Hi+1.The sequence 〈Hi: i ∈ ω〉 is of type 〈α0, α1,…〉 if, for every i ∈ ω, ∣Hi∣ = αi.We will adopt the usual notation for polarized partition relations due to Erdös, Hajnal, and Rado.means that for every partition F: κ1 × κ2 × … × κn→δ there is a sequence H0, H1,…, Hn such that Hi ⊂ κi and ∣Hi∣ = αi for every i, 1 ≤ i ≤ n, and F is constant on H1 × H2 × … × Hn.

Ultrapowers without the axiom of choice

1988 ◽  
Vol 53 (4) ◽  
pp. 1208-1219 ◽  
Author(s):  
Mitchell Spector
Keyword(s):  
General Theory ◽  
Set Theory ◽  
Fundamental Theorem ◽  
Axiom Of Choice ◽  
Partition Relations ◽  
Omitting Types ◽  
The Axiom Of Choice ◽  
Almost All ◽  
Models Of Set Theory ◽  
Theory And Model

AbstractA new method is presented for constructing models of set theory, using a technique of forming pseudo-ultrapowers. In the presence of the axiom of choice, the traditional ultrapower construction has proven to be extremely powerful in set theory and model theory; if the axiom of choice is not assumed, the fundamental theorem of ultrapowers may fail, causing the ultrapower to lose almost all of its utility. The pseudo-ultrapower is designed so that the fundamental theorem holds even if choice fails; this is arranged by means of an application of the omitting types theorem. The general theory of pseudo-ultrapowers is developed. Following that, we study supercompactness in the absence of choice, and we analyze pseudo-ultrapowers of models of the axiom of determinateness and various infinite exponent partition relations. Relationships between pseudo-ultrapowers and forcing are also discussed.

Zermelo-Fraenkel consistency results by Fraenkel-Mostowski methods

1972 ◽  
Vol 37 (4) ◽  
pp. 721-743 ◽  
Author(s):  
David Pincus
Keyword(s):  
Large Class ◽  
Set Theory ◽  
Transfer Problem ◽  
Axiom Of Choice ◽  
Conceptual Tool ◽  
Consistency Results ◽  
The Axiom Of Choice ◽  
Universe Of Sets

Fraenkel-Mostowski models are a particularly simple and conceptual tool for proving consistency results involving the axiom of choice, AC. These models satisfy the theory, FM, of a well founded universe of sets built from a ground set of individuals. Zermelo-Fraenkel set theory, ZF, is the extension of FM in which the set of individuals is assumed to be empty. In this paper we show that there is a large class of statements whose consistency with ZF can be proven directly by means of a Fraenkel-Mostowski model.A statement, Φ, of set theory is said to be transferable if there is a metatheorem: If Φ is true in a Fraenkel-Mostowski model then Φ is consistent with ZF. Jech and Sochor introduced, in [12], the class of boundable statements and proved them to be transferable. Most existential contradictions of AC are boundable. It remains to find criteria under which Ψ ∧ Φ is transferable where Ψ is a universal consequence of AC and Φ is an existential contradiction of AC. To this end we give two classes of statements. Each class is closed under conjunction, contains the boundable statements, and contains a number of universal consequences of AC. Nearly every Fraenkel-Mostowski consistency in the literature falls into one of these two classes.In §2 we give two generalizations of the boundable statements. In §§3 and 4 the classes of transferable statements are discussed. In §5 we discuss the transfer problem and prove a metatheorem concerning nontransferable statements.

Infinite exponent partition relations and well-ordered choice

1973 ◽  
Vol 38 (2) ◽  
pp. 299-308 ◽  
Author(s):  
E. M. Kleinberg ◽  
J. I. Seiferas
Keyword(s):  
Recursion Theory ◽  
Axiom Of Choice ◽  
Partition Relation ◽  
The Past ◽  
Cardinal Numbers ◽  
Partition Relations ◽  
Close Study ◽  
The Axiom Of Choice ◽  
Dependent Choice ◽  
Refined Version

The study of partition relations for cardinal numbers introduced by Erdös and his school in the 1950's has, for the past several years, had a profound impact in logic. Unfortunately, quite early in their development, it was noticed by Rado [1] that the potentially most fruitful class of such relations, infinite exponent partition relations, were always in contradiction with the axiom of choice (AC). As a result, such relations were overlooked. This turned out to be a mistake; for, as has been noticed recently, a close study of infinite exponent partition relations is both interesting and rewarding. For example, there are weakened versions of such relations which are provable in ZF and which have valuable applications in recursion theory and set theory. In addition, the pure theory of these relations, like that of the axiom of determinateness, is fruitful as well as elegant. For more background here one should refer to [3].At any rate, with a more detailed look at infinite exponent partition relations came a more refined version of Rado's original theorem. Specifically, Rado used the full axiom of choice to carefully construct partitions to violate any desired relation—a more sophisticated look at the actual theory of such relations indicated how one could put together some desired partitions using only well-ordered choice [3].The distinction between well-ordered choice and full choice is by no means vacuous in this context. For Mathias has shown [4] that the simplest infinite exponent partition relation, ω → (ω)ω, is consistent with countable choice (well-ordered choice of length ℵ0) and, in fact, is consistent with dependent choice.

The Axiom of Choice Machine

2018 ◽  
Author(s):  
Alexander R. Pruss
Keyword(s):  
Set Theory ◽  
Laws Of Nature ◽  
Axiom Of Choice ◽  
Dutch Book ◽  
The Axiom Of Choice

This is a mainly technical chapter concerning the causal embodiment of the Axiom of Choice from set theory. The Axiom of Choice powered a construction of an infinite fair lottery in Chapter 4 and a die-rolling strategy in Chapter 5. For those applications to work, there has to be a causally implementable (though perhaps not compatible with our laws of nature) way to implement the Axiom of Choice—and, for our purposes, it is ideal if that involves infinite causal histories, so the causal finitist can reject it. Such a construction is offered. Moreover, other paradoxes involving the Axiom of Choice are given, including two Dutch Book paradoxes connected with the Banach–Tarski paradox. Again, all this is argued to provide evidence for causal finitism.

Sign in / Sign up

Export Citation Format

Share Document