Order cancellation law in the family of bounded convex sets (Q2176279): Difference between revisions

Let \(X\) be a vector space, \(C\) a convex subset of \(X\) and \(x \in X\). The set \(T_xC = \lim_{n \rightarrow \infty} n(C - x)\) is a cone, called the tangent cone to \(C\) at \(x\). Denote by \(\leq_{T_x C }\) the partial order relation induced in \(X\) by the cone \(T_x C\). The main result of the paper reads as follows: Let \(B, C\) be convex subsets of \(X\) such that the set \(B\) is finite-dimensional and bounded. Then the implication \(A + B \subset B + C \; \Longrightarrow A \subset C\) holds true for all \(A \subset X\) if and only if, for each partial ordering \(\leq_{T_x C}\) corresponding to a cone \(T_x C\), \(x \notin C\), the set \(B\) contains a minimal element. Further, the authors show that the order cancellation law holds true in certain subsemigroups of convex sets.