Some Boolean algebras with finitely many distinguished ideals II

We describe the countably saturated models and prime models (up to isomorphism) of the theory Th_prin of Boolean algebras with a principal ideal, the theory Th_max of Boolean algebras with a maximal ideal, the theory Th_ac of atomic Boolean algebras with an ideal such that the supremum of the ideal exists, and the theory Th_sa of atomless Boolean algebras with an ideal such that the supremum of the ideal exists. We prove that there are infinitely many completions of the theory of Boolean algebras with a distinguished ideal that do not have a countably saturated model. Also, we give a sufficient condition for a model of the theory T_X of Boolean algebras with distinguished ideals to be elementarily equivalent to a countably saturated model of T_X.     

Partition Complete Boolean Algebras and Almost Compact Cardinals

For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated (e. g. every K-Suslin algebra is a K-partition complete Boolean algebra). It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ K. For strongly inaccessible K we show that K is K-almost compact iff K is weakly compact, and if K is 2^K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K.     

σ‐short Boolean algebras

We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach‐Mazur Boolean game. A σ‐short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ‐short Boolean algebras and study properties of σ‐short Boolean algebras. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Derivations,automorphisms, and representations of complex ω-Lie algebras

Let (𝔤,ω) be a finite-dimensional non-Lie complex ω-Lie algebra. We study the derivation algebra Der(𝔤) and the automorphism group Aut(𝔤) of (𝔤,ω). We introduce the notions of ω-derivations and ω-automorphisms of (𝔤,ω) which naturally preserve the bilinear form ω. We show that the set Der_ω(𝔤) of all ω-derivations is a Lie subalgebra of Der(𝔤) and the set Aut_ω(𝔤) of all ω-automorphisms is a subgroup of Aut(𝔤). For any three-dimensional and four-dimensional nontrivial ω-Lie algebra 𝔤, we compute Der(𝔤) and Aut(𝔤) explicitly, and study some Lie group properties of Aut(𝔤). We also study representation theory of ω-Lie algebras. We show that all three-dimensional nontrivial ω-Lie algebras are multiplicative, as well as we provide a four-dimensional example of ω-Lie algebra that is not multiplicative. Finally, we show that any irreducible representation of the simple ω-Lie algebra C_α(α≠0,?1) is one-dimensional.     

On the Semigroup Algebra of Binary Relations

The semigroup of binary relations on {1,…, n} with the relative product is isomorphic to the semigroup B _n of n × n zero-one matrices with the Boolean matrix product. Over any field F, we prove that the semigroup algebra FB _n contains an ideal K _n of dimension (2 ⁿ  ? 1)², and we construct an explicit isomorphism of K _n with the matrix algebra M _{2 ⁿ ?1}(F).     

Boolean products of R0‐algebras

In this paper, the (weak) Boolean representation of R₀‐algebras are investigated. In particular, we show that directly indecomposable R₀‐algebras are equivalent to local R₀‐algebras and any nontrivial R₀‐algebra is representable as a weak Boolean product of local R₀‐algebras (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Boolean algebras of definable sets in weakly o‐minimal theories

We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Note on Boolean Algebras with Few Partitions Modulo some Filter

We show that for every uncountable regular κ and every κ-complete Boolean algebra B of density ≤ κ there is a filter F ? B such that the number of partitions of length < modulo κF is ≤2^<κ. We apply this to Boolean algebras of the form P(X)/I, where I is a κ-complete κ-dense ideal on X. Mathematics Subject Classification: 06E05, 03C20.     

On Poset Boolean Algebras

Let (P,≤) be a partially ordered set. The poset Boolean algebra of P, denoted F(P), is defined as follows: The set of generators of F(P) is {x _p  : p∈P}, and the set of relations is {x _p ⋅x _q =x _p  : p≤q}. We say that a Boolean algebra B is well-generated, if B has a sublattice G such that G generates B and (G,≤ ^B |G) is well-founded. A well-generated algebra is superatomic. THEOREM 1. Let (P,≤) be a partially ordered set. The following are equivalent. (i) P does not contain an infinite set of pairwise incomparable elements, and P does not contain a subset isomorphic to the chain of rational numbers, (ii) F(P) is superatomic, (iii) F(P) is well-generated. The equivalence (i) ⇔ (ii) is due to M. Pouzet. A partially ordered set W is well-ordered, if W does not contain a strictly decreasing infinite sequence, and W does not contain an infinite set of pairwise incomparable elements. THEOREM 2. Let F(P) be a superatomic poset algebra. Then there are a well-ordered set W and a subalgebra B of F(W), such that F(P) is a homomorphic image of B. This is similar but weaker than the fact that every interval algebra of a scattered chain is embeddable in an ordinal algebra. Remember that an interval algebra is a special case of a poset algebra. This revised version was published online in June 2006 with corrections to the Cover Date.     

BOOLEAN ALGEBRAS IN AST

In this paper we investigate Boolean algebras and their subalgebras in Alternative Set Theory (AST). We show that any two countable atomless Boolean algebras are isomorphic and we give an example of such a Boolean algebra. One other main result is, that there is an infinite Boolean algebra freely generated by a set. At the end of the paper we show that the sentence “There is no non-trivial free group which is a set” is consistent with AST.     

The Degree Spectra of Definable Relations on Boolean Algebras

We study some questions concerning the structure of the spectra of the sets of atoms and atomless elements in a computable Boolean algebra. We prove that if the spectrum of the set of atoms contains a 1-low degree then it contains a computable degree. We show also that in a computable Boolean algebra of characteristic (1, 1, 0) whose set of atoms is computable the spectrum of the atomless ideal consists of all Π ₀ ² degrees.Original Russian Text Copyright © 2005 Semukhin P. M.The author was supported by the Russian Foundation for Basic Research (Grant 02-01-00593), the Leading Scientific Schools of the Russian Federation (Grant NSh-2112.2003.1), and the Program “Universities of Russia” (Grant UR.04.01.013).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 928–941, July–August, 2005.     

Additivity of Lie multiplicative maps on triangular algebras

Let 𝒜 and ? be unital algebras over a commutative ring ?, and ? be a (𝒜,??)-bimodule, which is faithful as a left 𝒜-module and also as a right ?-module. Let 𝒰?=?Tri(𝒜,??,??) be the triangular algebra and 𝒱 any algebra over ?. Assume that Φ?:?𝒰?→?𝒱 is a Lie multiplicative isomorphism, that is, Φ satisfies Φ(ST???TS)?=?Φ(S)Φ(T)???Φ(T)Φ(S) for all S, T?∈?𝒰. Then Φ(S?+?T)?=?Φ(S)?+?Φ(T)?+?Z _S,T for all S, T?∈?𝒰, where Z _S,T is an element in the centre 𝒵(𝒱) of 𝒱 depending on S and T.     

Critère d’existence d’idempotent basé sur les algèbres de Rétrocroisement

We study the relationship of backcrossing algebras with mutation algebras and algebras satisfying ω-polynomial identities: we show that in a backcrossing algebra every element of weight 1 generates a mutation algebra and that for any polynomial identity f there is a backcrossing algebra satisfying f. We give a criterion for the existence of idempotent in the case of baric algebras satisfying a nonhomogeneous polynomial identity and containing a backcrossing subalgebra. We give numerous genetic interpretations of the algebraic results.     

Dense subtrees in complete Boolean algebras

We characterize complete Boolean algebras with dense subtrees. The main results show that a complete Boolean algebra contains a dense tree if its generic filter collapses the algebra's density to its distributivity number and the reverse holds for homogeneous algebras. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

JC代数的乘子代数

本文用双中心子刻画了JC代数的乘子代数,并且研究了复C^*-代数的自伴部分的乘子代数生成的C^*-代数与原C^*-代数的乘子代数之间的关系,最后研究了JB代数的扩张.     

π-Complementation in the Unitisation and Multiplication Algebras of a Semiprime Algebra

π-complemented algebras are defined as those (not necessarily associative or unital) algebras such that each annihilator ideal is complemented by other annihilator ideal. For a given semiprime algebra A, we discuss the π-complementation of the unitisation algebra A ¹ of A. Moreover, if in addition the multiplication algebra ?(A) of A is also semiprime, we study the π-complementation in the algebras ?(A) and ?^?(A) (the multiplication ideal of A). In associative setting, we prove that A is π-complemented if and only if ?^?(A) is π-complemented, and that A ¹ π-complemented if and only if ?(A) is π-complemented.     

On tightly κ-filtered Boolean algebras

In this article we study the notion of tight ?-filteredness of a Boolean algebra for infinite regular cardinals ?. Tight à₀ \aleph_0 -filteredness is projectivity. We give characterizations of tightly ?-filtered Boolean algebras which generalize the internal characterizations of projectivity given by Haydon, Šcepin, and Koppelberg (see [15] or [17]). We show that for each ? there is an rc-filtered Boolean algebra which is not tightly ?-filtered. This generalizes a result of Šcepin (see [15]). We prove that no complete Boolean algebra of size larger than à₂ \aleph_2 is tightly à₁ \aleph_1 -filtered. We give a new example of a model of set theory where \frak P(w) \frak P(\omega) is tightly s-filtered. We study the effect of the tight s-filteredness of \frak P(w) \frak P(\omega) on the automorphism group of \frak P(w)/fin \frak P(\omega)/fin .     

The Nikodym property and cardinal characteristics of the continuum

We present a general method of constructing Boolean algebras with the Nikodym property and of some given cardinalities. The construction is dependent on the values of some classical cardinal characteristics of the continuum. As a result we obtain a consistent example of an infinite Boolean algebra with the Nikodym property and of cardinality strictly less than the continuum $\mathfrak{c}$. It follows that the existence of such an algebra is undecidable by the usual axioms of set theory. Besides, our results shed some new light on the Efimov problem and cofinalities of Boolean algebras.     

Solvability of universal bol 2-loops

ABSTRACT

Let (A, ^?) be a structurable algebra. Then the opposite algebra (A ^op , ^?) is structurable, and we show that the triple system B ^op _A(x, y, z):=V^opx,y(z)=x(y¯z)+z(y¯x)?y(x¯z), x, y, z ∈ A, is a Kantor triple system (or generalized Jordan triple system of the second order) satisfying the condition (A). Furthermore, if A=𝔸₁?𝔸₂ denotes tensor products of composition algebras, (^?) is the standard conjugation, and (^∧) denotes a certain pseudoconjugation on A, we show that the triple systems B ^op _𝔸1?𝔸2 ( x , y¯^∧, z) are models of compact Kantor triple systems. Moreover these triple systems are simple if (dim𝔸₁, dim𝔸₂) ≠ (2, 2). In addition, we obtain an explicit formula for the canonical trace form for compact Kantor triple systems defined on tensor products of composition algebras.