Ordering the order of a distributive lattice by itself (Q941431): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jlap.2008.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018735818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudocomplemented semilattices are finite-to-finite relatively universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free products of bounded distributive lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributive lattice orderings and Priestley duality / rank
 
Normal rank

Latest revision as of 14:47, 28 June 2024

scientific article
Language Label Description Also known as
English
Ordering the order of a distributive lattice by itself
scientific article

    Statements

    Ordering the order of a distributive lattice by itself (English)
    0 references
    0 references
    0 references
    1 September 2008
    0 references
    The authors order the ordering relation of a poset \(P\) component-wise by itself, obtaining a poset \(\Phi(P)\) extending \(P\) in the special case when \(P\in \text{\text{DLAT01}}\), the category of all bounded distributive lattices. If \((P,\leq)\) is a poset, then a product order \(\leq_{P \times P}\) on \(P \times P\) is defined by \((a,a')\leq _{P \times P} (b,b')\) iff \(a\leq b\) and \(a'\leq b'\) for all \((a,a'), (b,b')\in P \times P\). Consider a binary relation \(R_P\) of \(P \times P\) consisting of all pairs \((a,a')\in P \times P\) satisfying \(a\leq a'\). Then \(\Phi(P)\) is defined as \(\Phi(P)=(R_P,\leq_{P \times P} / R_P)\) and it is proved that \(\Phi(P)\) is a functor from \(\text{DLAT01}\) to \(\text{DLAT01}\). If TOD is the category of all Priestley spaces, then the Priestley duality consists of the fact that \(\text{DLAT01}\) and TOD are dually equivalent categories. Let \(D\) and \(E\) be the functors defining the duality. It is proved that, if \(L\in \text{DLAT01}\), then \(D(\Phi(L))\cong D(L) \times 2\). One of the main results of the present paper asserts that, if \(K\in \text{DLAT01}\), then \(K\cong \Phi(L)\) for some \(L\in \text{DLAT01}\) iff \(D(K)\cong Y\times 2\) for some \(Y\in \text{TOD}\). This result provides a characterization in terms of Priestley duality of all \(K\in \text{DLAT01}\) occurring as \(\Phi(L)\) for some \(L\in \text{DLAT01}\). As an application, it is shown how to decide in polynomial time whether a given finite distributive lattice occurs as the \(\Phi\)-image of another one. A fixpoint of \(\Phi\) in \(\text{DLAT01}\) is any \(L\in \text{DLAT01}\) satisfying \(\Phi(L)\cong L\). As another main result the authors characterize those \(L\in \text{DLAT01}\) which stay fixed under \(\Phi\) and relate them to free bounded distributive lattices on infinitely many generators. We conclude that the paper contains very interesting results and it can be a starting point for future studies.
    0 references
    partially ordered set
    0 references
    distributive lattice
    0 references
    Priestley duality
    0 references
    free distributive lattice
    0 references

    Identifiers