On the strength of the Sikorski extension theorem for Boolean algebras

1983 ◽  
Vol 48 (3) ◽  
pp. 841-846 ◽  
Author(s):  
J.L. Bell
Keyword(s):  
Boolean Algebra ◽  
Prime Ideal ◽  
Extension Theorem ◽  
Boolean Algebras ◽  
Complete Boolean Algebra ◽  
The Axiom Of Choice ◽  
Universe Of Sets ◽  
The Universe ◽  
Boolean Extension ◽  
Prime Ideal Theorem

The Sikorski Extension Theorem [6] states that, for any Boolean algebra A and any complete Boolean algebra B, any homomorphism of a subalgebra of A into B can be extended to the whole of A. That is,Inj: Any complete Boolean algebra is injective (in the category of Boolean algebras).The proof of Inj uses the axiom of choice (AC); thus the implication AC → Inj can be proved in Zermelo-Fraenkel set theory (ZF). On the other hand, the Boolean prime ideal theoremBPI: Every Boolean algebra contains a prime ideal (or, equivalently, an ultrafilter)may be equivalently stated as:The two element Boolean algebra 2 is injective,and so the implication Inj → BPI can be proved in ZF.In [3], Luxemburg surmises that this last implication cannot be reversed in ZF. It is the main purpose of this paper to show that this surmise is correct. We shall do this by showing that Inj implies that BPI holds in every Boolean extension of the universe of sets, and then invoking a recent result of Monro [5] to the effect that BPI does not yield this conclusion.

Zorn's lemma and complete Boolean algebras in intuitionistic type theories

1997 ◽  
Vol 62 (4) ◽  
pp. 1265-1279 ◽  
Author(s):  
J. L. Bell
Keyword(s):  
Boolean Algebra ◽  
Set Theory ◽  
Natural Kind ◽  
Extension Theorem ◽  
Axiom Of Choice ◽  
Boolean Algebras ◽  
Complete Boolean Algebra ◽  
Law Of Excluded Middle ◽  
The Axiom Of Choice ◽  
Excluded Middle

AbstractWe analyze Zorn's Lemma and some of its consequences for Boolean algebras in a constructive setting. We show that Zorn's Lemma is persistent in the sense that, if it holds in the underlying set theory, in a properly stated form it continues to hold in all intuitionistic type theories of a certain natural kind. (Observe that the axiom of choice cannot be persistent in this sense since it implies the law of excluded middle.) We also establish the persistence of some familiar results in the theory of (complete) Boolean algebras—notably, the proposition that every complete Boolean algebra is an absolute subretract. This (almost) resolves a question of Banaschewski and Bhutani as to whether the Sikorski extension theorem for Boolean algebras is persistent.

scholarly journals Boolean algebras of projections in (DF)-and (LF)-spaces

2003 ◽  
Vol 67 (2) ◽  
pp. 297-303 ◽  
Author(s):  
J. Bonet ◽  
W. J. Ricker
Keyword(s):  
Boolean Algebra ◽  
Spectral Measure ◽  
Boolean Algebras ◽  
Complete Boolean Algebra ◽  
Locally Convex Spaces ◽  
Important Class ◽  
Locally Convex ◽  
Convex Spaces

Conditions are presented which ensure that an abstractly σ-complete Boolean algebra of projections on a (DF)-space or on an (LF)-space is necessarily equicontinuous and/or the range of a spectral measure. This is an extension, to a large and important class of locally convex spaces, of similar and well known results due to W. Bade (respectively, B. Walsh) in the setting of normed (respectively metrisable) spaces.

scholarly journals Four games on Boolean algebras

Filomat ◽  
2016 ◽  
Vol 30 (13) ◽  
pp. 3389-3395
Author(s):  
Milos Kurilic ◽  
Boris Sobot
Keyword(s):  
Boolean Algebra ◽  
Winning Strategy ◽  
Zero Element ◽  
Boolean Algebras ◽  
The Other ◽  
Complete Boolean Algebra ◽  
Other Hand

The games G2 and G3 are played on a complete Boolean algebra B in ?-many moves. At the beginning White picks a non-zero element p of B and, in the n-th move, White picks a positive pn < p and Black chooses an in ? {0,1}. White wins G2 iff lim inf pin,n = 0 and wins G3 iff W A?[?]? ? n?A pin,n = 0. It is shown that White has a winning strategy in the game G2 iff White has a winning strategy in the cut-and-choose game Gc&c introduced by Jech. Also, White has a winning strategy in the game G3 iff forcing by B produces a subset R of the tree <?2 containing either ??0 or ??1, for each ? ? <?2, and having unsupported intersection with each branch of the tree <?2 belonging to V. On the other hand, if forcing by B produces independent (splitting) reals then White has a winning strategy in the game G3 played on B. It is shown that ? implies the existence of an algebra on which these games are undetermined.

scholarly journals Boolean algebras of projections

1975 ◽  
Vol 19 (3) ◽  
pp. 287-289
Author(s):  
P. G. Spain
Keyword(s):  
Hilbert Space ◽  
Boolean Algebra ◽  
Von Neumann Algebra ◽  
Boolean Algebras ◽  
Complete Boolean Algebra ◽  
Von Neumann ◽  
Relative Compactness ◽  
Weakly Closed ◽  
Result Theorem ◽  
Bounded Sets

Bade, in (1), studied Boolean algebras of projections on Banach spaces and showed that a σ-complete Boolean algebra of projections on a Banach space enjoys properties formally similar to those of a Boolean algebra of projections on Hilbert space. (His exposition is reproduced in (7: XVII).) Edwards and Ionescu Tulcea showed that the weakly closed algebra generated by a σ-complete Boolean algebra of projections can be represented as a von Neumann algebra; and that the representation isomorphism can be chosen to be norm, weakly, and strongly bicontinuous on bounded sets (8): Bade's results were then seen to follow from their Hilbert space counterparts. I show here that it is natural to relax the condition of σ-completeness to weak relative compactness; indeed, a Boolean algebra of projections has σ-completion if and only if it is weakly relatively compact (Theorem 1). Then, following the derivation of the theorem of Edwards and Ionescu Tulcea from the Vidav characterisation of abstract C*-algebras (see (9)), I give a result (Theorem 2) which, with its corollary, includes (1: 2.7, 2.8, 2.9, 2.10, 3.2, 3.3, 4.5).

Sign in / Sign up

Export Citation Format

Share Document