Pseudocomplemented semilattices, Boolean algebras, and compatible products (Q5945612): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 00:55, 30 January 2024

scientific article; zbMATH DE number 1657279
Language Label Description Also known as
English
Pseudocomplemented semilattices, Boolean algebras, and compatible products
scientific article; zbMATH DE number 1657279

    Statements

    Pseudocomplemented semilattices, Boolean algebras, and compatible products (English)
    0 references
    30 January 2002
    0 references
    Pseudocomplemented semilattices and (complete) pseudocomplemented lattices are studied. The authors collect a list of important examples of these structures occurring in mathematics. The notion of Goldie dimension is introduced and calculated in terms of the so-called maximal uniform elements if they exist in abundance. Recall that an element \(e\) of a pseudocomplemented semilattice \(S\) is essential if \(e\wedge x\neq 0\) for each nonzero \(x\in S\); a nonzero \(u\in S\) is uniform if each nonzero \(x< u\) is essential in \([0,u]\). It is shown that the maximal uniform elements of \(S\) are precisely the atoms of the Boolean algebra \(B(S)\) of all pseudocomplements of \(S\). A compatible product in lattices is introduced and questions on the existence and uniqueness of these products in pseudocomplemented lattices, as well as on the abundance of prime elements in lattices with a compatible product, are discussed. Yood's decomposition theorem for topological rings is extended to complete pseudocomplemented lattices.
    0 references
    0 references
    pseudocomplemented lattices
    0 references
    Goldie dimension
    0 references
    maximal uniform elements
    0 references
    pseudocomplemented semilattice
    0 references
    atoms
    0 references
    Boolean algebra
    0 references
    compatible product
    0 references
    prime elements
    0 references
    decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references