The metric completion of convex sets and modules (Q1411550): Difference between revisions

A convex module is a set on which an operation of taking convex combinations is defined. Convex modules form a category \textbf{Conv} whose morphisms are affine maps, that is maps preserving convex combinations. In the first section a natural pseudo-metric \(d_C(x,y)=\inf\{\frac{\alpha}{1-\alpha}:\exists x_1,y_1\in C\) with \(\alpha x_1+(1-\alpha)x=\alpha y_1+(1-\alpha)y\}\) on each convex module \(C\) is introduced and studied. In the second section the author gives conditions guaranteeing that this pseudo-metric is a metric. The third section is devoted to describing the completion of a convex module \(C\) by the metric \(d_C\). For this to each convex module \(C\) the author assigns an ordered Banach space \(\text{Aff}_b(C)\) of all real-valued bounded affine functions on \(C\) and then considers the canonical evaluation map \(\widetilde \tau_C:C\to\text{Aff}_b(C)'\) into the dual Banach space. It turns out that \(d_C\) is a metric if and only if the canonical map \(\widetilde \tau_C\) is an injective isometry. In this case the completion of \(C\) can be identified with the closure of \(\widetilde\tau_C(C)\) in \(\text{Aff}_b(C)'\). This closure is a superconvex module in the sense that it is endowed with the operation of taking infinite convex combinations. This observation is then used to prove Completion Theorem 3.6 asserting that (i) any affine mapping between complete convex modules is superaffine (in the sense that it preserves infinite convex combinations); (ii) the full subcategory \textbf{ComplConv} of \textbf{Conv} generated by complete convex modules it reflective in the sense that there is a functor assigning to each convex module some complete convex module; (iii) the category \textbf{ComplConv} is equivalent to the category of base normed Banach spaces.