scholarly journals Strictly positive measures on Boolean algebras

2008 ◽  
Vol 73 (4) ◽  
pp. 1416-1432 ◽  
Author(s):  
Mirna Džamonja ◽  
Grzegorz Plebanek
Keyword(s):  
Boolean Algebra ◽  
Positive Measure ◽  
Finite Measure ◽  
Chain Condition ◽  
Boolean Algebras ◽  
Radon Measures ◽  
Finitely Additive Measures ◽  
Nonatomic Measure ◽  
A Chain ◽  
Additive Measures

AbstractWe investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a combinatorial characterisation of Boolean algebras which carry a strictly positive finitely additive finite measure with some additional properties, such as separability or nonatomicity. A possible consistent characterisation for an algebra to carry a separable strictly positive measure was suggested by Talagrand in 1980, which is that the Stone space K of the algebra satisfies that its space M(K) of measures is weakly separable, equivalently that C(K) embeds into l∞. We show that there is a ZFC example of a Boolean algebra (so of a compact space) which satisfies this condition and does not support a separable strictly positive measure. However, we use this property as a tool in a proof which shows that under MA + ¬ CH every atomless ccc Boolean algebra of size < c carries a nonatomic strictly positive measure. Examples are given to show that this result does not hold in ZFC. Finally, we obtain a characterisation of Boolean algebras that carry a strictly positive nonatomic measure in terms of a chain condition, and we draw the conclusion that under MA + ¬ CH every atomless ccc Boolean algebra satisfies this stronger chain condition.

scholarly journals Existence of nonatomic charges

1978 ◽  
Vol 25 (1) ◽  
pp. 1-6 ◽  
Author(s):  
K. P. S. Bhaskara Rao ◽  
M. Bhaskara Rao
Keyword(s):  
Boolean Algebra ◽  
Complete Characterization ◽  
Boolean Algebras ◽  
Finitely Additive Measures ◽  
Additive Measures

AbstractA complete characterization of Boolean algebras which admit nonatomic charges (i.e. finitely additive measures) is obtained. This also gives rise to a characterization of superatomic Boolean algebras. We also consider the problem of denseness of the set of all nonatomic charges in the space of all charges on a given Boolean algebra, equipped with a suitable topology.

Weakly Purely Finitely Additive Measures

1994 ◽  
Vol 46 (4) ◽  
pp. 872-885 ◽  
Author(s):  
Gottfried T. Rüttimann
Keyword(s):  
Positive Measure ◽  
Sufficient Conditions ◽  
Zero Element ◽  
Orthomodular Poset ◽  
Additive Measure ◽  
Finitely Additive Measure ◽  
Finitely Additive Measures ◽  
Mediator Role ◽  
Boolean Lattices ◽  
Additive Measures

AbstractLet L be an orthomodular poset. A positive measure ξ on L is said to be weakly purely finitely additive if the zero measure is the only completely additive measure majorized by ξ. It was shown in [15] that, in an arbitrary orthomodular poset L, every positive measures μ is the sum v + ξ of a positive completely additive measure v and a weakly purely finitely additive measure ξ. We give sufficient conditions for this Yosida-Hewitt-type decomposition to be unique.A positive measure λ on L is said to be filtering if every non-zero element p in L majorizes a non-zero element q on which λ vanishes. A filtering measure is weakly purely finitely additive. Filtering measures play a mediator role throughout these investigations since some of the aforementioned conditions are given in terms of these.The results obtained here are then viewed in the context of Boolean lattices and applied to lattices of idempotents of non-associative JBW-algebras.

Embedding theorems for boolean algebras and consistency results on ordinal definable sets

1977 ◽  
Vol 42 (1) ◽  
pp. 64-76 ◽  
Author(s):  
Petr Štěpánek ◽  
Bohuslav Balcar
Keyword(s):  
Boolean Algebra ◽  
Extreme Case ◽  
Chain Condition ◽  
Boolean Algebras ◽  
Complete Boolean Algebra ◽  
Suslin Tree ◽  
Consistency Results ◽  
Weak Homogeneity ◽  
Uncountable Cardinal ◽  
Definable Sets

The existence of complete rigid Boolean algebras was first proved by McAloon [8] who also showed that every Boolean algebra can be completely embedded in a rigid complete Boolean algebra. McAloon was interested in consistency results on ordinal definable sets. His approach was based on forcing. Recently, Shelah [10] proved that for every uncountable cardinal κ there exists a Boolean algebra of power κ with rigid completion. Extending his method, we get the following theorems.Theorem 1. Any Boolean algebra B can be completely embedded in a complete Boolean algebra C with no nontrivial σ-complete one-one endomor-phism. If B satisfies the κ-chain condition for an uncountable cardinal κ, the same holds true for C.Since every automorphism is a complete endomorphism, it follows from Theorem 1 that C is rigid. The other extreme case of Boolean algebras are homogeneous algebras. It was proved by Kripke [7] that every Boolean algebra can be completely embedded in a homogeneous complete Boolean algebra. In his proof, the homogeneous algebra contains antichains of cardinality equal to the power of the embedded Boolean algebra. The following result shows that this is essential: the analogue of Theorem 1 is not provable in set theory even for Boolean algebras with a very weak homogeneity property. We use a Suslin tree with particular properties constructed by Jensen [6] in conjunction with a forcing argument.

Weak Distributivity, A Problem of Von Neumann and the Mystery of Measurability

2006 ◽  
Vol 12 (2) ◽  
pp. 241-266 ◽  
Author(s):  
Bohuslav Balcar ◽  
Thomas Jech
Keyword(s):  
Boolean Algebra ◽  
Representation Theorem ◽  
Chain Condition ◽  
Boolean Algebras ◽  
Partial Ordering ◽  
Additive Measure ◽  
Boolean Operations ◽  
Von Neumann ◽  
Countable Chain Condition ◽  
Countable Chain

This article investigates the weak distributivity of Boolean σ-algebras satisfying the countable chain condition. It addresses primarily the question when such algebras carry a σ-additive measure. We use as a starting point the problem of John von Neumann stated in 1937 in the Scottish Book. He asked if the countable chain condition and weak distributivity are sufficient for the existence of such a measure.Subsequent research has shown that the problem has two aspects: one set theoretic and one combinatorial. Recent results provide a complete solution of both the set theoretic and the combinatorial problems. We shall survey the history of von Neumann's Problem and outline the solution of the set theoretic problem. The technique that we describe owes much to the early work of Dorothy Maharam to whom we dedicate this article.§1. Complete Boolean algebras and weak distributivity. ABoolean algebrais a setBwith Boolean operationsa˅b(join),a˄b(meet) and −a(complement), partial orderinga≤bdefined bya˄b=aand the smallest and greatest element,0and1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty setS, under operationsa∪b,a∩b,S−a, ordered by inclusion, with0= ∅ and1=S.Complete Boolean algebras and weak distributivity.A Boolean algebrais a setBwith Boolean operationsa˅b(join),a˄b(meet) and -a(complement), partial orderinga≤bdefined bya˄b=aand the smallest and greatest element.0and1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty setS, under operationsa∪b,a∩b,S-a, ordered by inclusion, with0= ϕ and1=S.

Chains and antichains in interval algebras

1994 ◽  
Vol 59 (3) ◽  
pp. 860-867
Author(s):  
M. Bekkali
Keyword(s):  
Boolean Algebra ◽  
Regular Cardinal ◽  
Boolean Algebras ◽  
Interval Algebra ◽  
A Chain

AbstractLet κ be a regular cardinal, and let B be a subalgebra of an interval algebra of size κ. The existence of a chain or an antichain of size κ in ℬ is due to M. Rubin (see [7]). We show that if the density of B is countable, then the same conclusion holds without this assumption on κ. Next we also show that this is the best possible result by showing that it is consistent with 2ℵ0 = ℵω1 that there is a boolean algebra B of size ℵω1 such that length(B) = ℵω1 is not attained and the incomparability of B is less than ℵω1. Notice that B is a subalgebra of an interval algebra. For more on chains and antichains in boolean algebras see. e.g., [1] and [2].

scholarly journals CHOICE-FREE STONE DUALITY

2019 ◽  
Vol 85 (1) ◽  
pp. 109-148
Author(s):  
NICK BEZHANISHVILI ◽  
WESLEY H. HOLLIDAY
Keyword(s):  
Boolean Algebra ◽  
Boolean Algebras ◽  
Stone Space ◽  
Spectral Space ◽  
Topological Representation ◽  
Stone Duality ◽  
Closed Sets ◽  
Spectral Spaces ◽  
Basic Facts ◽  
Regular Open

AbstractThe standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form a Boolean algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras.

On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem Löwenheim theorems and compactness of related quantifiers

1980 ◽  
Vol 45 (2) ◽  
pp. 265-283 ◽  
Author(s):  
Matatyahu Rubin ◽  
Saharon Shelah
Keyword(s):  
Boolean Algebra ◽  
Automorphism Groups ◽  
Order Logic ◽  
Boolean Algebras ◽  
First Order Logic ◽  
Elementary Equivalence ◽  
First Order ◽  
Finite Models ◽  
Countably Compact

AbstractTheorem 1. (◊ℵ1,) If B is an infinite Boolean algebra (BA), then there is B1, such that ∣ Aut (B1) ≤∣B1∣ = ℵ1 and 〈B1, Aut (B1)〉 ≡ 〈B, Aut(B)〉.Theorem 2. (◊ℵ1) There is a countably compact logic stronger than first-order logic even on finite models.This partially answers a question of H. Friedman. These theorems appear in §§1 and 2.Theorem 3. (a) (◊ℵ1) If B is an atomic ℵ-saturated infinite BA, Ψ Є Lω1ω and 〈B, Aut (B)〉 ⊨Ψ then there is B1, Such that ∣Aut(B1)∣ ≤ ∣B1∣ =ℵ1, and 〈B1, Aut(B1)〉⊨Ψ. In particular if B is 1-homogeneous so is B1. (b) (a) holds for B = P(ω) even if we assume only CH.

Sign in / Sign up

Export Citation Format

Share Document