On σ-saturations of a Boolean algebra

Nel presente lavoro introduciamo una classe di estensioni di una data algebra di Boole, denominate σ-saturazioni, in cui è definita una nozione di minimalità. II risultato principale consiste nel dimostrare che esistono algebre che non ammettono una σ-saturazione minimale, per cui è possibile ripartire tutte le algebre di Boole in tre classi: σ-sature, σ-saturabili e non σ-saturabili, di cui nessuna è vuota. Vengono inoltre messi in luce i legami esistenti fra i concetti così introdotti equelli noti di algebra completa o σ-perfetta.     

On the normal completion of a Boolean algebra

A familiar construction for a Boolean algebra A is its normal completion, given by its normal ideals or, equivalently, the intersections of its principal ideals, together with the embedding taking each element of A to its principal ideal. In the classical setting of Zermelo-Fraenkel set theory with Choice, is characterized in various ways; thus, it is the unique complete extension of A in which the image of A is join-dense, the unique essential completion of A, and the injective hull of A.Here, we are interested in characterizing the normal completion in the constructive context of an arbitrary topos. We show among other things that it is, even at this level, the unique join-dense, or alternatively, essential completion. En route, we investigate the functorial properties of and establish that it is the reflection of A, in the category of Boolean homomorphisms which preserve all existing joins, to the complete Boolean algebras. In this context, we make crucial use of the notion of a skeletal frame homomorphism.     

On generalized Boolean functions i

In this paper we introduce the concept of generalized Boolean function. Such a function has its arguments and values in a Boolean algebra and can be written in a manner similar to the canonical disjunctive form, but instead of the product of simple or complemented variables, the product of values of certain functions is used. Every Boolean function is a generalized Boolean one but the converse is not true. The set of all generalized Boolean function “generated” by some fixed function is a Boolean algebra.     

On generalized Boolean functions II

This cycle of papers is based on the concept of generalized Bolean functions introduced by the author in the first article of the series. Every generalized Boolean function f:Bⁿ→B can be written in a manner similar to the canonical disjunctive form using some function defined on A×B, where A is a finite subset of B containing 0 and 1. The set of those functions f is denoted by GBF_n[A]. In this paper the following questions are presented: (1) What is the relationship between GBF_n[A₁] and GBF_n[A₂] when A₁A₂. (2) What can be said about GBF_n[A₁∩A₂] and GBF_n[A₁A₂] in comparison with GBF_n[A₁]∩GBF_n[A₂] and GBF_n[A₁]GBF_n[A₂], respectively.     

On generalized inverses of Boolean Matrices

Generalized inverses of Boolean Matrices are defined and the general form of matrices having generalized inverses is determined. Some structure theorems are proved, from which, some known results are obtained as corollaries. An algorithm to compute a generalized inverse of a matrix, when it exists, is given. The existence of various types of g-inverses is also investigated. All the results are obtained first for the {0,1}-Boolean algebra and then extended to an arbitrary Boolean algebra.     

Subdirect decompositions and the radical of a generalized Boolean algebra extension of a lattice ordered group

The extension of a lattice ordered group A by a generalized Boolean algebra B will be denoted by A _B . In this paper we apply subdirect decompositions of A _B for dealing with a question proposed by Conrad and Darnel. Further, in the case when A is linearly ordered we investigate (i) the completely subdirect decompositions of A _B and those of B, and (ii) the values of elements of A _B and the radical R(A _B ).     

On the S-transform over a Banach algebra

The S-transform is shown to satisfy a specific twisted multiplicativity property for free random variables in a B-valued Banach noncommutative probability space, for an arbitrary unital complex Banach algebra B. Also, a new proof of the additivity of the R-transform in this setting is given.     

Extensions between finite-dimensional simple modules over a generalized current Lie algebra

We calculate the first extension groups for finite-dimensional simple modules over an arbitrary generalized current Lie algebra, which includes the case of loop Lie algebras and their multivariable analogs.     

Linear maps that strongly preserve regular matrices over the Boolean algebra

The set of all m × n Boolean matrices is denoted by $ \mathbb{M} $ \mathbb{M} _m,n . We call a matrix A ∈ $ \mathbb{M} $ \mathbb{M} _m,n regular if there is a matrix G ∈ $ \mathbb{M} $ \mathbb{M} _n,m such that AGA = A. In this paper, we study the problem of characterizing linear operators on $ \mathbb{M} $ \mathbb{M} _m,n that strongly preserve regular matrices. Consequently, we obtain that if min{m, n} ⩽ 2, then all operators on $ \mathbb{M} $ \mathbb{M} _m,n strongly preserve regular matrices, and if min{m, n} ⩾ 3, then an operator T on $ \mathbb{M} $ \mathbb{M} _m,n strongly preserves regular matrices if and only if there are invertible matrices U and V such that T(X) = UXV for all X ε $ \mathbb{M} $ \mathbb{M} _m,n , or m = n and T(X) = UX ^T V for all X ∈ $ \mathbb{M} $ \mathbb{M} _n .     

On a superatomic Boolean algebra which is not generated by a well-founded sublattice

Let b denote the unboundedness number of ω^ω. That is, b is the smallest cardinality of a subset such that for everyg∈ω^ω there isf ∈ F such that {n: g(n) ≤ f(n)}is infinite. A Boolean algebraB is wellgenerated, if it has a well-founded sublatticeL such thatL generatesB. We show that it is consistent with ZFC that , and there is a Boolean algebraB such thatB is not well-generated, andB is superatomic with cardinal sequence 〈ℵ₀, ℵ₁, ℵ₁, 1〉. This result is motivated by the fact that if the cardinal sequence of a Boolean algebraB is 〈ℵ₀, ℵ₀, λ, 1〉, andB is not well-generated, then λ≥b.     

The power and Arnoldi methods in an algebra of circulants

Circulant matrices play a central role in a recently proposed formulation of three‐way data computations. In this setting, a three‐way table corresponds to a matrix where each ‘scalar’ is a vector of parameters defining a circulant. This interpretation provides many generalizations of results from matrix or vector‐space algebra. These results and algorithms are closely related to standard decoupling techniques on block‐circulant matrices using the fast Fourier transform. We derive the power and Arnoldi methods in this algebra. In the course of our derivation, we define inner products, norms, and other notions. These extensions are straightforward in an algebraic sense, but the implications are dramatically different from the standard matrix case. For example, the number of eigenpairs may exceed the dimension of the matrix, although it is still polynomial in it. It is thus necessary to take an extra step and carefully select a smaller, canonical set of size equal to the dimension of the matrix from which all possible eigenpairs can be formed. Copyright © 2012 John Wiley & Sons, Ltd.     

Forcing a Boolean algebra with predesigned automorphism group

For suitable groups we will show that one can add a Boolean algebra by forcing in such a way that is almost isomorphic to . In particular, we will give a positive answer to the following question due to J. Roitman: Is a possible number of automorphisms of a rich Boolean algebra?

     

On the triple jump of the set of atoms of a Boolean algebra

We prove the following result concerning the degree spectrum of the atom relation on a computable Boolean algebra. Let be a computable Boolean algebra with infinitely many atoms and be the Turing degree of the atom relation of . If is a c.e. degree such that , then there is a computable copy of where the atom relation has degree . In particular, for every c.e. degree , any computable Boolean algebra with infinitely many atoms has a computable copy where the atom relation has degree .

     

A very rigid Boolean algebra

A Boolean algebra is constructed having only those endomorphisms corresponding to prime ideals, which are present in any BA. The BA constructed is of powerc, has 2 ^c endomorphisms, and is not rigid in Bonnet’s sense.     

The spectrum of partitions of a Boolean algebra

The main notion dealt with in this article is