Quasi product on Boolean D-posets (Q2426161)

A difference poset (D-poset) is a partially ordered set \(P\) with a least element 0 and a greatest element 1 equipped with a partial binary operation \(\ominus\) such that for \(a, b, c\in P,\) the following conditions are satisfied: (i) \(a\ominus 0=a,\) (ii) \(a\leq b\leq c\) implies \(c\ominus b\leq c\ominus a\) and \((c\ominus a)\ominus (c\ominus b)=b\ominus a.\) A Boolean D-poset is a D-poset \(P\) satisfying for all \(a, b, c\in P:\) (i) \(a\ominus 0=a,\) (ii) \(a\ominus(a\ominus b)=b\ominus (b\ominus a),\) (iii) \(a\leq b\) implies \(c\ominus b\leq c\ominus a\) and (iv) \((a\ominus b)\ominus c=(a\ominus c)\ominus b.\) Note that D-posets are one of the most general structures describing quantum systems. The D-posets are categorically equivalent to effect algebras. In addition, Boolean D-posets are categorically equivalent to MV-algebras. We may consider measures with values in a \(\sigma\)-complete weakly \(\sigma\)-distributive MV-algebra \(M.\) It is possible to prove the product measure theorem, of course, under the additional condition that \(M\) is equipped with a binary operation \(\cdot,\) called product, which is commutative, associative and, for all \(a, b, c\in M,\) (i) \(1\cdot a=a\) and (ii) \(c\cdot (b\ominus a)=c\cdot b\ominus c\cdot a.\) Since the notion of an observable is a special case of a measure, the product measure theorem guarantees the existence of a unique joint observable with respect to this product [see \textit{B. Riečan}, Tatra Mt. Math. Publ. 16, No.~1, 143--149 (1999; Zbl 0951.06013)]. The author introduces a new binary operation \(\bullet\) \ (naming it ``quasi product'') on a Boolean D-poset: Let \((P;\leq, \ominus,0,1)\) be a Boolean D-poset. Let \(\bullet\) be a commutative and associative binary operation on \(P\) such that for all \(a, b, c\in P\) the following is true: (i) \(1\bullet a=a,\) (ii) if \(a\leq b\) then \(a\bullet c\leq b\bullet c\) and (iii) \(a\ominus (a\bullet b)\leq 1\ominus b.\) He shows that every product operation is a quasi product. Moreover, the operations \(\wedge,\) \(\odot\) and \(\wedge_u\) are quasi products, where \(a\wedge_u b=a\ominus ((a\vee u)\ominus b)\) and \(u\in P\) is arbitrary. Finaly, \(a\odot b\leq a\bullet b\leq a\wedge b.\)