Independence algebras, basis algebras and the distributivity condition

Abstract

Stable basis algebras were introduced by Fountain and Gould and developed in a series of articles. They form a class of universal algebras, extending that of independence algebras. If a stable basis algebra B of finite rank satisfies the distributivity condition (a condition satisfied by all the previously known examples), it is a reduct of an independence algebra A. Our first aim is to give an example of an independence algebra not satisfying the distributivity condition. Gould showed that if a stable basis algebra B with the distributivity condition has finite rank, then so does the independence algebra A of which it is a reduct, and in this case the endomorphism monoid End(B) of B is a left order in the endomorphism monoid End(A) of A. We complete the picture by determining when End(B) is a right, and hence a two-sided, order in End(A). In fact (for rank at least 2), this happens precisely when every element of End(A) can be written as αβ where α,β∈ End(B), α is the inverse of α in a subgroup of End(A) and α and β have the same kernel. This is equivalent to End(B) being a special kind of left order in End(A) known as straight.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…