Convexity from order: a theory of faces and generalized separation
Abstract
It is known that any convex cone in a general vector space is the positive cone of a preorder compatible with the vector space, and that any convex set is an affine slice of a convex cone. We therefore treat convex sets order-theoretically, as affine slices of positive cones. We find that faces are sets of strong minima, and we generalize functionals to oriented maps valued in arbitrary ordered vector spaces. Oriented maps expose every face, and an oriented affine map f separates C from D when f(D) ≤ 0 ≤ f(C) element-wise. This generalization of hyperplane separation recovers mathematical objects that are "local", including the generated face at a point and the normal cone. The kernels of separating oriented maps form a lattice of separating affine flats whose bottom element is the joint supporting subspace (JSS), recently introduced in finite dimensions for qualification-free convex analysis results. We define the JSS in general vector spaces for two convex sets $C, D$ as the affine slice of the cross-lineality lin(K−G), where K,G are the homogenization cones of $C, D$. We show that in finite dimensions, bilateral facial reduction corresponds to a descent in the lattice of separating affine flats, which we formalize as lexicographic products of oriented maps. The lexicographic characterization of faces follows as a corollary. By making no assumption other than convexity, our approach yields general results: we show that the face of a difference of two convex sets is a difference of faces, dropping assumptions of compactness, finite dimensionality, and exposedness. We also show that any face of an intersection of two convex sets is an intersection of faces, resolving open problem 5.10 by Weis in "A note on faces of convex sets", dropping the assumption of non-empty intrinsic core.
Related
- Higher order Teodorescu transform in the theory of generalized partial-slice monogenic functions
- Generalised flip order on the faces of nestohedra
- Eventual convexity for separable chance constraints with skewed generalized hyperbolic random variables
- Tilted Convexity and an Exact Offline-Online Separation
- On a New Generalized Convexity and Its Related Midpoint-, Trapezoid-, and Simpson-Type Inequalities via Multiplicative Calculus
BibTeX
@misc{scott2026convexity,
title = {{Convexity from order: a theory of faces and generalized separation}},
author = {Matthew S. Scott},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.05775},
eprint = {2609.05775},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.05775},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Convexity from order: a theory of faces and generalized separation
AU - Matthew S. Scott
PY - 2026
DA - 2026/09/04
PB - arXiv
DO - 10.48550/arxiv.2609.05775
UR - https://arxiv.org/abs/2609.05775
AB - It is known that any convex cone in a general vector space is the positive cone of a preorder compatible with the vector space, and that any convex set is an affine slice of a convex cone. We therefore treat convex sets order-theoretically, as affine slices of positive cones. We find that faces are sets of strong minima, and we generalize functionals to oriented maps valued in arbitrary ordered vector spaces. Oriented maps expose every face, and an oriented affine map f separates C from D when f(D) ≤ 0 ≤ f(C) element-wise. This generalization of hyperplane separation recovers mathematical objects that are "local", including the generated face at a point and the normal cone. The kernels of separating oriented maps form a lattice of separating affine flats whose bottom element is the joint supporting subspace (JSS), recently introduced in finite dimensions for qualification-free convex analysis results. We define the JSS in general vector spaces for two convex sets $C, D$ as the affine slice of the cross-lineality lin(K−G), where K,G are the homogenization cones of $C, D$. We show that in finite dimensions, bilateral facial reduction corresponds to a descent in the lattice of separating affine flats, which we formalize as lexicographic products of oriented maps. The lexicographic characterization of faces follows as a corollary. By making no assumption other than convexity, our approach yields general results: we show that the face of a difference of two convex sets is a difference of faces, dropping assumptions of compactness, finite dimensionality, and exposedness. We also show that any face of an intersection of two convex sets is an intersection of faces, resolving open problem 5.10 by Weis in "A note on faces of convex sets", dropping the assumption of non-empty intrinsic core.
ER -