Some inequalities for partial orders (Q580381)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4016964
Language Label Description Also known as
default for all languages
No label defined
    English
    Some inequalities for partial orders
    scientific article; zbMATH DE number 4016964

      Statements

      Some inequalities for partial orders (English)
      0 references
      0 references
      1987
      0 references
      Inequalities connecting several parameters of a partially ordered set (poset) \(P=\langle P,\leq\rangle\) are established. The parameters are: (1) width, \(\mu (P)\), the smallest cardinal (t.s.c.) \(\mu\) such that \(| A| <1+\mu\) for any antichain \(A\subseteq P\); (2) narrowness, \(\nu(P)\), t.s.c. \(\nu\) such that \(| A| =\nu\) for some maximal antichain \(A\subseteq P\); (3) chain decomposition number, \(K(P)\), t.s.c. \(K\) such that \(P\) is a union of \(K\) chains; (4) chain end-decomposition number, \(K_ 1(P)\), t.s.c. \(K_ 1\) such that \(K(P\upharpoonright E)=K_ 1\) for some subset \(E\subseteq P\) which is both cofinal and coinitial in \(P\); (5) the local maximal chain number, \(\lambda(P)\), t.s.c. \(\lambda\) such that \(| MC([a,b])| <1+\lambda\), for all \(a,b\in P\), where \(MC([a,b])\) is the collection of maximal chains in the interval \([a,b]\) of \(P\); (6) the local chain decomposition number, \(\lambda_ 1(P)\), t.s.c. \(\lambda_ 1\) such that \(K([a,b])<1+\lambda_ 1\) for all \(a,b\) in \(P\); (7) the ideal decomposition number \(\iota (P)\), t.s.c. \(\iota\) such that \(P\) is a union of \(\iota\) ideals; (8) the strong antichain number of \(P\), \(\mu_ 1(P)\), t.s.c. \(\mu_ 1\) such that \(| A| <1+\mu_ 1\) for every strong antichain \(A\subseteq P\) [i.e., \(\{y\mid x,x'\leq y\}=\emptyset\) for \(x\neq x'\) elements of \(A\)]. Results noted are as follows: [Dilworth]: \(\mu (P)<\omega\) implies \(K(P()=\mu (P)\); [Perles]: \(\exists P\) with \(\mu (P)=\omega\) and \(K(P)>K\) (any cardinal); [Erdős and Tarski]: \(\mu_ 1(P)\neq \omega\); [Milner and Prikry]: \(\exists P\), \(\mu_ 1(P)=\omega\), \(\iota (P)>K\). Observations by the authors (delete \(P\)): \(\nu^+\leq 1+\mu \leq K^+\); \(\mu_ 1\leq \mu\); \(\lambda_ 1\leq \lambda\); \(K_ 1\leq K\); \(1+\lambda_ 1\leq K^+\); \(\iota\leq K\); \(\mu_ 1=\iota\) if \(\mu_ 1<\omega\). Established by the authors: \(K\leq K_ 1\cdot \lambda \cdot \nu\) (best possible); \(\mu \leq [K^ 2_ 1\lambda_ 1]^+\); \(\nu \leq K_ 1\) if \(\lambda <\omega\); \(K\leq \lambda\) if \(K_ 1=1\); all trees belong to a class of posets (described) for which \(K\leq \mu\), generalizing a result of F. Kurepa and F. Galvin; necessary and sufficient conditions on \(P\) such that \(\iota <1+\mu_ 1.\) In addition to those principally concerned with the study of various parameters these results should also prove interesting to those more involved in relating ``numerical'' parameters to other structural properties of posets. It seems that more can still be accomplished along the lines continued in this interesting paper from previous points of departure.
      0 references
      Inequalities
      0 references
      partially ordered set
      0 references
      width
      0 references
      antichain
      0 references
      narrowness
      0 references
      chain decomposition number
      0 references
      chain end-decomposition number
      0 references
      maximal chains
      0 references
      local chain decomposition number
      0 references
      ideal decomposition number
      0 references
      strong antichain number
      0 references
      trees
      0 references
      posets
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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