An inequality for partially ordered sets
The pair of (P,f) is called a real partially ordered set if P is a partially ordered set and f: \(P\to {\mathbb{R}}^+\) is a function from P to the positive real numbers. For a subset \(T\subseteq P\) define \(Id^ f(P)=\sum \{f(I):\) I ideal and \(T\subseteq I\}\). The author proves the following theorem: Let A and B be subsets of a real poset (P,f). Then \(Id^ f(A\cup B)\cdot Id^ f(A\cap B)\geq Id^ f(A)\cdot Id^ f(B)\) and the equality holds exactly when any path from A to B has to pass through the upper ideal generated by \(A\cap B\). One corollary specifies this inequality and the other one has some flavour of a Nullstellensatz.
- An inequality for the weights of two families of sets, their unions and intersections
- Correlation inequalities on some partially ordered sets
- Families of Non-disjoint subsets
- scientific article; zbMATH DE number 3570525 (Why is no real title available?)
- Inequalities for a pair of maps S S S with S a finite set
- Intersection theorems and a lemma of Kleitman
- The number of meets between two subsets of a lattice
This page was built for publication: An inequality for partially ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912874)
