On the representation of partially ordered sets

DOI10.1007/BF02844476MaRDI QIDQ1360190zbMATH OpenFDO

Authors Paula A. Kemp

Publication date 18 November 1997

Published in Rendiconti del Circolo Matematico di Palermo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02844476

zbMATH Keywords

join-irreducible elements left meet distributive poset neatest representation supremum-dense poset

Mathematics Subject Classification ID

Partial orders, general (06A06)

Review text

A poset \(P\) is left meet-distributive (LMD) if for all \(x,y,z\) of \(P\), if \(x\wedge(y\vee z)\) exists then also \((x\wedge y)\vee(x\wedge z)\) exists and they are equal. \(P\) is supremum-dense if each \(b\) of \(P\) is the join of all completely join-irreducible elements below \(b\). An isomorphism \(f\) from \((P,\leq)\) onto \((Q,\subseteq)\) is called a neatest representation if for any \(S\subseteq P\) we have \[ f\bigl(\bigwedge \{a_i;\;i\in I\}\bigr)= \bigcap\bigl\{f(a_i);\;i\in I\bigr\} \] \[ f\bigl(\bigvee \{a_i;\;i\in I\}\bigr)= \bigcup\bigl\{f(a_i);\;i\in I\bigr\}. \] The result: Let \(P\) be an LMD poset where every nonempty chain has an infimum. Them \(P\) is supremum-dense iff \(P\) has a neatest representation.

Recommendations

Cites work

Cited in

(18)

This page was built for publication: On the representation of partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360190)