Annihilator characterizations of Boolean rings and Boolean lattices (Q1326026): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Remarks on a Class of Distributive Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphic sheaf representations of normal lattices / rank
 
Normal rank

Latest revision as of 15:52, 22 May 2024

scientific article
Language Label Description Also known as
English
Annihilator characterizations of Boolean rings and Boolean lattices
scientific article

    Statements

    Annihilator characterizations of Boolean rings and Boolean lattices (English)
    0 references
    0 references
    0 references
    13 July 1994
    0 references
    An associative ring is said to be Boolean provided all its elements are idempotent. A generalized Boolean lattice is defined as a relatively pseudocomplemented distributive lattice with zero. The annihilator of an element \(a\) of a ring \(R\) (lattice \(L\) with zero) is the set \(a^*= \{x\in R\mid ax= xa= 0\}\) (\(a^*= \{x\in L\mid a\land x= 0\}\)). Various characterizations of Boolean rings within the class of associative rings (of generalized Boolean lattices within the class of distributive lattices with zero) are provided in terms of annihilators. Boolean rings are also characterized in terms of 0-automorphisms, i.e. of bijections \(\alpha\) such that \(xy= 0\Leftrightarrow \alpha(x)\alpha(y)= 0\).
    0 references
    0 references
    0 references
    0 references
    0 references
    associative ring
    0 references
    generalized Boolean lattice
    0 references
    relatively pseudocomplemented distributive lattice
    0 references
    annihilator
    0 references
    Boolean rings
    0 references
    0- automorphisms
    0 references