A generalization of pseudocomplementation in semilattices, lattices and posets with 0

arXiv:2610.35988 · math.CO · Submitted 2026-10-26 · Read on arXiv

math.CO

Submitted: 2026-10-26

Updated: 2026-10-26

License: http://creativecommons.org/licenses/by/4.0/

The gist: Pseudocomplemented lattices satisfy a lot of nice properties and were studied by a number of algebraists.

Terminology

Abstract

Pseudocomplemented lattices satisfy a lot of nice properties and were studied by a number of algebraists. However, even when a poset P with 0 is not pseudocomplemented, we can assign to every element a of P the set a p of all maximal elements being orthogonal to a. This assignment p is a non-trivial operator provided P satisfies the so-called Ascending Chain Condition (ACC). In particular, we investigate this operator when the poset P in question is a semilattice or a lattice. We characterize this operator and describe its properties that turn out to be similar to the corresponding properties of pseudocomplementation. Moreover, we introduce an equivalence relation Θ p on P induced by p similarly as it was done by V. I. Glivenko for distributive pseudocomplemented lattices. Finally, we investigate for which lattices L with 0 satisfying the ACC this equivalence relation turns out to be a congruence and when the quotient lattice L/Θ p is complemented respectively modular.

Related papers