On the compactness of some Boolean algebras

1984 ◽  
Vol 49 (1) ◽  
pp. 63-67
Author(s):  
Jacek Cichoń

We say that the Boolean algebra B is λ-compact, where λ is a cardinal number, if for every family Z ⊆ B∖{0} of power at most λ, if inf Z = 0 then for some finite subfamily Z0 ⊆ Z we have inf Z0 = 0.On the set of all finite subsets of a cardinal number κ, which is denoted [κ]<ω, the sets of the form for any p Є [κ]<ω generate the filter Tκ.This filter is a standard example of a κ-regular filter (see [2]). Because of the importance of κ-regular filters in studying the saturatedness of ultraproducts and reduced products by model-theoretic methods, the question of compactness of the algebra Bκ = P([κ]<ω/Tκ was natural. This question in the most optimistical way was formulated by M. Benda [1, Problem 5c]: is the algebra Bκω-compact for every uncountable κ?In this paper we show that for most of the cardinal numbers which are greater or equal to 2ω the algebra Bκ is not ω-compact. Hence, in view of obtained results, the following question appears: does there exist an uncountable κ such that the algebra Bκ is κ-compact?We use standard set-theoretical notations. CH denotes the Continuum Hypothesis, GCH denotes the General Continuum Hypothesis and MA denotes Martin's Axiom.

1980 ◽  
Vol 45 (1) ◽  
pp. 85-92 ◽  
Author(s):  
James E. Baumgartner

Consider the following propositions:(A) Every uncountable subset of contains an uncountable chain or antichain (with respect to ⊆).(B) Every uncountable Boolean algebra contains an uncountable antichain (i.e., an uncountable set of pairwise incomparable elements).Until quite recently, relatively little was known about these propositions. The oldest result, due to Kunen [4] and the author independently, asserts that if the Continuum Hypothesis (CH) holds, then (A) is false. In fact there is a counter-example 〈Aα: α < ω1〉 such that α < β implies Aβ −Aα is finite. Kunen also observed that Martin's Axiom (MA) + ¬CH implies that no such counterexample 〈Aα: α < ω1〉 exists.Much later, Komjáth and the author [2] showed that ◊ implies the existence of several kinds of uncountable Boolean algebras with no uncountable chains or antichains. Similar results (but motivated quite differently) were obtained independently by Rubin [5]. Berney [3] showed that CH implies that (B) is false, but his algebra has uncountable chains. Finally, Shelah showed very recently that CH implies the existence of an uncountable Boolean algebra with no uncountable chains or antichains.Except for Kunen's result cited above, the only result in the other direction was the theorem, due also to Kunen, that MA + ¬CH implies that any uncountable subset of with no uncountable antichains must have both ascending and decending infinite sequences under ⊆.


1982 ◽  
Vol 25 (4) ◽  
pp. 472-477 ◽  
Author(s):  
Murray Bell ◽  
John Ginsburg

AbstractIf X is a topological space then exp X denotes the space of non-empty closed subsets of X with the Vietoris topology and λX denotes the superextension of X Using Martin's axiom together with the negation of the continuum hypothesis the following is proved: If every discrete subset of exp X is countable the X is compact and metrizable. As a corollary, if λX contains no uncountable discrete subsets then X is compact and metrizable. A similar argument establishes the metrizability of any compact space X whose square X × X contains no uncountable discrete subsets.


1990 ◽  
Vol 55 (3) ◽  
pp. 1022-1036 ◽  
Author(s):  
Arnold W. Miller

AbstractIn this paper we ask the question: to what extent do basic set theoretic properties of Loeb measure depend on the nonstandard universe and on properties of the model of set theory in which it lies? We show that, assuming Martin's axiom and κ-saturation, the smallest cover by Loeb measure zero sets must have cardinality less than κ. In contrast to this we show that the additivity of Loeb measure cannot be greater than ω1. Define cof(H) as the smallest cardinality of a family of Loeb measure zero sets which cover every other Loeb measure zero set. We show that card(⌊log2(H)⌋) ≤ cof (H) ≤ card(2H), where card is the external cardinality. We answer a question of Paris and Mills concerning cuts in nonstandard models of number theory. We also present a pair of nonstandard universes M ≼ N and hyperfinite integer H ∈ M such that H is not enlarged by N, 2H contains new elements, but every new subset of H has Loeb measure zero. We show that it is consistent that there exists a Sierpiński set in the reals but no Loeb-Sierpiński set in any nonstandard universe. We also show that it is consistent with the failure of the continuum hypothesis that Loeb-Sierpiński sets can exist in some nonstandard universes and even in an ultrapower of a standard universe.


1997 ◽  
Vol 62 (1) ◽  
pp. 43-59 ◽  
Author(s):  
Douglas Peterson

This article is concerned with functions k assigning a cardinal number to each infinite Boolean algebra (BA), and the behaviour of such functions under ultraproducts. For some common functions k we havefor others we have ≤ instead, under suitable assumptions. For the function π character we go into more detail. More specifically, ≥ holds when F is regular, for cellularity, length, irredundance, spread, and incomparability. ≤ holds for π. ≥ holds under GCH for F regular, for depth, π, πχ, χ, h-cof, tightness, hL, and hd. These results show that ≥ can consistently hold in ZFC since if V = L holds then all uniform ultrafilters are regular. For π-character we prove two more results: (1) If F is regular and ess , then(2) It is relatively consistent to have , where A is the denumerable atomless BA.A thorough analysis of what happens without the assumption that F is regular can be found in Rosłanowski, Shelah [8] and Magidor, Shelah [5]. Those papers also mention open problems concerning the above two possible inequalities.


2016 ◽  
Vol 100 (549) ◽  
pp. 442-449
Author(s):  
A. C. Paseau

Metamathematics is the mathematical study of mathematics itself. Two of its most famous theorems were proved by Kurt Gödel in 1931. In a simplified form, Gödel's first incompleteness theorem states that no reasonable mathematical system can prove all the truths of mathematics. Gödel's second incompleteness theorem (also simplified) in turn states that no reasonable mathematical system can prove its own consistency. Another famous undecidability theorem is that the Continuum Hypothesis is neither provable nor refutable in standard set theory. Many of us logicians were first attracted to the field as students because we had heard something of these results. All research mathematicians know something of them too, and have at least a rough sense of why ‘we can't prove everything we want to prove’.


2004 ◽  
Vol 69 (3) ◽  
pp. 799-816 ◽  
Author(s):  
Michael Ray Oliver

Abstract.We examine the question of how many Boolean algebras, distinct up to isomorphism, that are quotients of the powerset of the naturals by Borel ideals, can be proved to exist in ZFC alone. The maximum possible value is easily seen to be the cardinality of the continuum ; earlier work by Ilijas Farah had shown that this was the value in models of Martin's Maximum or some similar forcing axiom, but it was open whether there could be fewer in models of the Continuum Hypothesis.We develop and apply a new technique for constructing many ideals whose quotients must be nonisomorphic in any model of ZFC. The technique depends on isolating a kind of ideal, called shallow, that can be distinguished from the ideal of all finite sets even after any isomorphic embedding, and then piecing together various copies of the ideal of all finite sets using distinct shallow ideals. In this way we are able to demonstrate that there are continuum-many distinct quotients by Borel ideals, indeed by analytic P-ideals, and in fact that there is in an appropriate sense a Borel embedding of the Vitali equivalence relation into the equivalence relation of isomorphism of quotients by analytic P-ideals. We also show that there is an uncountable definable wellordered collection of Borel ideals with distinct quotients.


1986 ◽  
Vol 51 (1) ◽  
pp. 12-21 ◽  
Author(s):  
P. Matet

In [2], Carlson and Simpson proved a dualized version of Ramsey's theorem obtained by coloring partitions of ω instead of subsets of ω. It was at the suggestion of Simpson that the author undertook to study the notion dual to that of a Ramsey ultrafilter. After stating the basic terminology and notation used in the paper in §1, in §2 we establish some basic properties of the lattice of all partitions of a cardinal κ. §3 is devoted to the study of families of pairwise disjoint partitions of ω. §4 is concerned with descending sequences of partitions. In §5, we give some examples of filters of partitions. Properties of such filters are discussed in §6. Co-Ramsey filters are introduced in §7, and it is shown how they can be associated with Ramsey ultrafilters. The main result of §8 is Proposition 8.1, which asserts the existence of a co-Ramsey filter under the continuum hypothesis.We use standard set theoretic conventions and notation. Let κ be a cardinal. We set κ* = κ − {0}. For every ordinal α ≤ κ, (κ)α denotes the set of those sequences X(ν), ν < α, of pairwise disjoint nonempty subsets of κ such that ⋃ν<αX(ν) = κ, and ⋂X(ν) < ⋂X(ν′) whenever ν < ν′. We also let (κ)≤α = ⋃β≤α(κ)β and (κ)<α = ⋃β<α(κ)β. Given X ∈ (κ)α, we put xν = ⋂X(ν) for every ν < α, and we denote by Ax the set of all xν, 0 < ν < α.


1974 ◽  
Vol 75 (2) ◽  
pp. 193-197 ◽  
Author(s):  
A. J. Ostaszewski

AbstractA theorem of Besicovitch, namely that, assuming the continuum hypothesis, there exists in any uncountable complete separable metric space a set of cardinality the continuum all of whose Hausdorif h-measures are zero, is here deduced by appeal to Martin's Axiom. It is also shown that for measures λ of Hausdorff type the union of fewer than 2ℵ0 sets of λ-measure zero is also of λ-measure zero; furthermore, the union of fewer than 2ℵ0 λ-measurable sets is λ-measurable.


Author(s):  
Kenneth Kunen

AbstractAssuming either the continuum hypothesis or Martin's axiom, we show that in the space βN – N, there are: (a) points which are not P-points, but which are also not limit points of any countable set, and (b) a countable set of points dense in itself such that each of the points is not a limit point of any countable discrete set. Our method is to construct such points in the Stone space of a measure algebra, and then embed that Stone space into βN – N. We also, by a similar use of measures, establish the independence of the existence of selective ultrafilters by showing that there are none in the random real model.


1984 ◽  
Vol 36 (1) ◽  
pp. 38-57 ◽  
Author(s):  
Mary Anne Swardson

Let X be a topological space and let A ⊂ X. The character of A in X is the minimal cardinal of a base for the neighborhoods of A in X. Previous studies have shown that the character of certain subsets of X (or of X2) is related to compactness conditions on X. For example, in [12], Ginsburg proved that if the diagonalof a space X has countable character in X2, then X is metrizable and the set of nonisolated points of X is compact. In [2], Aull showed that if every closed subset of X has countable character, then the set of nonisolated points of X is countably compact. In [18], we noted that if every closed subset of X has countable character, then MA + ┐ CH (Martin's axiom with the negation of the continuum hypothesis) implies that X is paracompact.


Sign in / Sign up

Export Citation Format

Share Document