On the representation of partially ordered sets (Q1360190)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the representation of partially ordered sets |
scientific article; zbMATH DE number 1036020
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the representation of partially ordered sets |
scientific article; zbMATH DE number 1036020 |
Statements
On the representation of partially ordered sets (English)
0 references
18 November 1997
0 references
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.
0 references
left meet distributive poset
0 references
supremum-dense poset
0 references
join-irreducible elements
0 references
neatest representation
0 references
0.96498775
0 references
0.9453559
0 references
0 references
0 references
0.9255407
0 references