--- title: 'Convex: Theory, Methods & Applications' url: https://www.emergentmind.com/topics/convex type: topic --- # Convex: Theory, Methods & Applications Convex denotes a family of closure phenomena that preserve admissible combinations. In Euclidean and affine settings, a set is convex when it contains every segment between its points; in abstract algebraic settings, convexity is the existence of coherent mixing operations; in combinatorics it appears through closure systems with anti-exchange; in graph theory and network science it is expressed through geodesic containment; and in optimization it governs convex functions, convex envelopes, convex relaxations, and tractable modeling languages [0903.5522][1608.03402][1410.4821]. ## 1. Abstract and algebraic formulations A central generalization replaces ambient vector-space structure by intrinsic mixing. In Fritz’s formulation, a convex space is a set \(C\) equipped with binary operations \[ cc_\lambda:C\times C\to C,\qquad \lambda\in[0,1], \] satisfying the unit law \(cc_0(x,y)=y\), idempotency \(cc_\lambda(x,x)=x\), parametric commutativity \(cc_\lambda(x,y)=cc_{1-\lambda}(y,x)\), and deformed parametric associativity \[ cc_\lambda(cc_\mu(x,y),z)=cc_{\lambda\mu}\!\left(x,cc_{\tilde\mu}(y,z)\right),\qquad \tilde\mu=\frac{\lambda(1-\mu)}{1-\lambda\mu}, \] when \(\lambda\mu\neq 1\) [0903.5522]. Writing \(cc_\lambda(x,y)=\lambda x+(1-\lambda)y\), the structure isolates coherent finite mixing rather than linear addition itself. The same notion has two equivalent categorical descriptions. First, convex spaces are algebras over the finitary Giry monad: for a set \(X\), \[ \Delta_X=\left\{f:X\to[0,1]\mid f\text{ has finite support and }\sum_{x\in X}f(x)=1\right\}, \] and a convex structure on \(C\) is an evaluation map \(m:\Delta_C\to C\) satisfying the unit and associativity law \[ m\!\left(\sum_i \lambda_i\, m\!\left(\sum_j \mu_{ij}\,\underline{x_{ij}}\right)\right) = m\!\left(\sum_{i,j}\lambda_i\mu_{ij}\,\underline{x_{ij}}\right). \] Second, convex spaces are precisely models of the Lawvere theory of finite stochastic maps \(\mathbf{FinStoMap}\); Proposition 3.7 identifies the binary-operation, monad-algebra, and Lawvere-theoretic viewpoints as equivalent [0903.5522]. This abstract definition recovers ordinary convex subsets of real vector spaces and also includes non-geometric examples. If \(C\subseteq V\) is a convex subset of a real vector space, then \(cc_\lambda(x,y)=\lambda x+(1-\lambda)y\) yields a convex space. But convex spaces need not embed into vector spaces: semilattices form convex spaces of combinatorial type, where every nontrivial convex combination of two points is constant in \(\lambda\in(0,1)\), and the resulting operation is exactly an idempotent, commutative, associative meet [0903.5522]. The same paper interprets convex subsets of vector spaces as probabilistic and semilattices as possibilistic, with convex spaces unifying both. A formalized presentation in Coq develops the same idea as intrinsic barycentric structure. There a convex space carries operations \(x<|p|>y\) for \(p\in[0,1]\), and every such space embeds into a conical space \[ S_X=(\mathbb R_{>0}\times X)\cup\{\mathbf 0\}, \] with embedding \(\iota(x)=\ska{1}{x}\) satisfying \[ \iota\!\left(\narypchoiceS_{iy)\le f(x)<|p|>f(y) \] for all \(p\in[0,1]\) and \(x,y\in T\); concavity is obtained by reversing the order [2004.12713]. In polynomial optimization, convexity is expressed through the Hessian: a polynomial \(p\) is convex iff \(H_p(x)\succeq 0\) for all \(x\), equivalently \(y^T H_p(x)y\ge 0\) for all \(x,y\) [2404.14440]. A central convex-analytic construction is the convex envelope \[ \underline f(x)=\sup\{g(x): g \text{ is convex and } g\le f \text{ on } P\}. \] For a continuously differentiable ray-concave function \(f:P\to\mathbb R\) on a polytope \(P\), convex on every facet, the paper on ray-concave functions defines \[ g(v)=\alpha_v f(v^-)+(1-\alpha_v)f(v^+), \] where \(v^-,v^+\) are the two boundary intersections of the ray through \(v\), and proves that if \(g\) is positively homogeneous then \(\underline f=g\) [2105.03532]. This yields explicit envelopes over arbitrary polytopes and includes a previously unknown envelope for the probability/reliability function \(\frac{xy}{x+y-xy}\). A complementary algebraic certificate is sos-convexity. A polynomial is sos-convex when \(y^T H_p(x)y\) is a sum of squares in \((x,y)\), equivalently \(H_p(x)=M(x)^T M(x)\) for some polynomial matrix \(M(x)\). For ternary quartic forms, the paper “Convex Ternary Quartics Are SOS-Convex” proves the exact equality \[ \Sigma C_{3,4}=C_{3,4}, \] that is, every convex quartic form in three variables is sos-convex [2404.14440]. The result is presented as a convex analogue of Hilbert’s theorem for nonnegative ternary quartics, and the paper shows that exploiting the special linear compatibility relations of Hessian biquadratic forms is essential. ## 3. Optimization, projection, and computational frameworks Convexity also governs the shape of optimization trajectories. For gradient descent on a convex \(L\)-smooth function, \[ x_{k+1}=x_k-\eta \nabla f(x_k), \] the optimization curve \(k\mapsto f(x_k)\) is provably convex for \[ \eta\in\Bigl(0,\frac1L\Bigr], \] while monotone decrease of function values still holds on the larger interval \((0,2/L)\) [2503.10138]. The same paper constructs a one-dimensional convex \(L\)-smooth counterexample showing that for every \(L>0\) and every \[ \eta\in\Bigl(\frac{1.75}{L},\frac{2}{L}\Bigr), \] the optimization curve can be non-convex even though the objective still decreases monotonically. In contrast, for gradient flow \(\dot x(t)=-\nabla f(x(t))\), the objective curve \(t\mapsto f(x(t))\) is convex for every convex \(L\)-smooth \(f\), and the gradient norm is nonincreasing in both discrete and continuous time on the full natural stability range [2503.10138]. At the modeling-language level, Convex.jl treats convex programs as abstract syntax trees whose nodes carry sign, curvature, monotonicity, evaluability, and conic-form metadata. It checks disciplined convex programming compliance, canonicalizes to conic form, and dispatches to LP, SOCP, SDP, or exponential-cone solvers through Julia’s multiple dispatch [1410.4821]. The target conic form is \[ \min c^T x \quad \text{s.t.}\quad A x=b,\quad x\in\mathcal K, \] and each atom is equipped with a graph-form template. The framework is explicitly presented as a convex optimization modeling system whose separation of atoms from methods makes extension by new convex primitives straightforward [1410.4821]. Convexity also organizes structural graph optimization. A convex graph invariant is a graph invariant that is convex as a function of the adjacency matrix \(A\in S\). The elementary invariant is \[ \Theta_P(A)=\max_{\Pi\in\mathrm{Sym}(n)} \operatorname{Tr}(P\,\Pi A\Pi^T), \] and every convex graph invariant admits a representation \[ f(A)=\sup_{P\in\mathcal P}\ \Theta_P(A)-\alpha_P \] for suitable \(\mathcal P\subset S\) and scalars \(\alpha_P\) [1012.0623]. This yields invariant convex sets for maximum degree, spectral majorization, forbidden subgraph surrogates, and graph deconvolution; the same paper uses them in graph deconvolution, graph generation, and hypothesis testing between graph families [1012.0623]. For projection problems, convexity connects set projection and multi-objective optimization. Given \[ Y=\{y\in\mathbb R^m\mid \exists x\in\mathbb R^n:\ (x,y)\in S\}, \] the associated multi-objective convex problem is \[ \min \begin{pmatrix} y\\ -\mathbf 1^\top y \end{pmatrix} \text{ with respect to }\le_{\mathbb R^{m+1}_+} \text{ subject to }(x,y)\in S. \] The paper proves that exact solutions of the convex projection problem and the associated multi-objective problem coincide, and that approximate solutions transfer in both directions with sharp tolerance inflation factors \(\underline\kappa\) and \(\overline\kappa\) [2103.04076]. ## 4. Convex geometries, representability, and neural codes In closure theory, convexity appears as anti-exchange. A convex geometry is a closure system \((X,\varphi)\) such that \(\varphi(\emptyset)=\emptyset\) and, for every closed \(Y\subseteq X\) and distinct \(x,y\in X\setminus Y\), the implication \[ x\in \varphi(Y\cup\{y\}) \;\Longrightarrow\; y\notin \varphi(Y\cup\{x\}) \] holds [2206.05636]. For transit functions \(R:V\times V\to 2^V\), the induced interval convexity \(\mathcal C_R\) is the family of \(R\)-convex sets \(K\subseteq V\) satisfying \(R(u,v)\subseteq K\) for all \(u,v\in K\). Under the Peano axiom \((P)\), or more strongly under \((Ch)\), the paper on transit functions proves that \[ \mathcal C_R\text{ is a convex geometry } \iff R\text{ satisfies }(b1)\text{ and }(J0) \] [2406.01100]. This unifies a range of graph convexities, including geodesic, monophonic, toll, weak toll, \(m^3\), \(P_3\), all-path, and cut-vertex convexities. Representation theory separates small and large regimes. One paper proves that every finite convex geometry can be represented in the plane by a wide variety of convex sets extending Richter–Rogers’ polygon construction, but that general convex geometries cannot be represented by ellipses in the plane, and that there is no uniform bound on the number of common supporting lines allowed between pairs of representing convex sets; in higher dimensions every finite convex geometry of convex dimension \(d\) is representable in \(\mathbb R^d\) by ellipsoids arbitrarily close to a ball [1701.03333]. On the other hand, for the special case of a 5-element base set, the paper on colors and ellipses proves that all \(672\) convex geometries admit a representation by ellipses, while several properties of circle geometries—the opposite property, nested triangle property, area \(Q\) property, and separation property—obstruct circle representability; it also introduces colored-circle representations as unary predicates augmenting circle models [2206.05636]. A simplicial-complex variant is convex union representability. A complex \(\Delta\subseteq 2^{[n]}\) is \(d\)-convex union representable if it is the nerve of convex open sets in \(\mathbb R^d\) whose union is itself convex. The paper “Convex Union Representability and Convex Codes” proves that not every collapsible complex has this property: there exist shellable collapsible complexes and non-evasive complexes that are not convex union representable [1808.03992]. It also proves strong necessary conditions, including collapse onto the star of any face and collapsibility of the Alexander dual. For neural codes, the neural ideal \[ J_C=\langle \chi_v : v\in \mathbb F_2^n\setminus C\rangle \] and its canonical form provide algebraic signatures of convexity and non-convexity. In particular, certain minimal pseudo-monomials in the canonical form detect disconnected restricted nerves or hollow simplices, and therefore non-convexity of the code [1807.02741]. ## 5. Graph, network, and discrete-matrix convexity In graph theory, a subgraph induced by a node set \(S\) is convex if every geodesic path between any two nodes of \(S\) lies entirely inside the induced subgraph. A connected network is called convex if every connected subset of nodes is convex [1608.03402]. This notion yields several regimes. Trees and cliques are globally convex for opposite structural reasons; random graphs are only locally convex; and core-periphery networks can be regionally convex, with a non-convex core and convex periphery [1608.03402]. The paper introduces convex-hull growth measures such as \[ X_c=1-\sum_{t=1}^{n-1}\sqrt[c]{\max\{s(t)-s(t-1)-1/n,0\}} \] and local-convexity scales \[ L_c = 1+\max\left\{ t \mid s(t)<\frac{t+c+1}{n}\right\}, \] and reports that the Western US power grid, European highways, and a coauthorship graph are the most convex among the nine empirical networks studied, whereas the Little Rock food web is the only one classified as truly non-convex [1608.03402]. Directed graph convexities based on directed 2-paths lead to a sharper combinatorial theory. For an oriented graph \(D=(V,A)\), the \(\overrightarrow{P_3}\)-convexity forbids an outside vertex from being the center of a directed path \((u,v,w)\) with \(\{u,w\}\subseteq C\); the \(\overrightarrow{P_3^*}\)-convexity imposes the same restriction only for induced directed paths, equivalently when \((u,w)\notin A\) [2606.24707]. The paper proves that recognition of convex geometries is polynomial-time for \(\overrightarrow{P_3}\)-convexity, but coNP-complete for \(\overrightarrow{P_3^*}\)-convexity, even on DAGs. On the subclass of acyclic indifference oriented graphs, however, \(\overrightarrow{P_3^*}\)-geometricity is characterized by \(\overrightarrow{P_4}\)-freeness and becomes polynomial-time decidable [2606.24707]. Discrete tomography yields yet another meaning. A \((0,1)\)-matrix is convex when the 1s are consecutive in every row and every column. Writing \(\mathcal C(R,S)\) for the convex matrices with row-sum vector \(R\) and column-sum vector \(S\), the paper on convex \((0,1)\)-matrices studies when such classes are nonempty and how individual matrices can be reconstructed [2101.04148]. It extends ranked essential sets from permutation matrices to convex matrices, proves that the ranked essential set uniquely determines a matrix in \(\mathcal C(R,S)\), and gives an \(O(mn)\) reconstruction algorithm. It also shows, for example, that \[ \mathcal C_{m,n}(2e,S)\neq\varnothing \] iff \(\sum_{j=1}^n s_j=2m\) and \[ \sum_{i=1}^j (-1)^{j-i}s_i \ge 0 \qquad (j=1,\dots,n-1), \] and uses the term epitope for information that uniquely determines a matrix in \(A(R,S)\) [2101.04148]. ## 6. Spacetime, imaging, and functional shape priors In Lorentzian geometry, convexity must be adapted to indefinite signature. A smooth function \(f:M\to\mathbb R\) on a spacetime \((M,g_{\mu\nu})\) is a spacetime convex function when its Hessian \(\nabla_\mu\nabla_\nu f\) has Lorentzian signature and satisfies \[ V^\mu V^\nu \nabla_\mu\nabla_\nu f \ge c\, g_{\mu\nu}V^\mu V^\nu,\qquad c>0, \] for all \(V^\mu\in TM\) [1702.05584]. The level sets \(\Sigma_c=\{f=c\}\) then have second fundamental form controlled by \[ K_{\mu\nu}X^\mu Y^\nu = \frac{X^\mu Y^\nu \nabla_\mu\nabla_\nu f}{\sqrt{\epsilon\,\nabla_\rho f \nabla^\rho f}}, \] so spacetime convex functions generate foliations by expanding spacelike hypersurfaces [1702.05584]. The paper proves that a spacetime admitting such a function has no closed spacelike geodesics, excludes certain closed marginally trapped surfaces, induces convex or subharmonic functions on special initial data sets, and exhibits barrier phenomena in the Schwarzschild interior, where \(r=3M/2\) is a maximal hypersurface [1702.05584]. In data-driven image segmentation, convexity is imposed through quasi-concavity of the soft mask \(u:\Omega\to[0,1]\): all super-level sets \[ S_\gamma=\{x\in \Omega\mid u(x)\ge \gamma\} \] are required to be convex [2605.19210]. This is equivalent to \[ u(\lambda x+(1-\lambda)y)\ge \min(u(x),u(y)), \qquad \forall x,y,\ \lambda\in[0,1]. \] The paper develops exact zero- and first-order characterizations and a second-order sufficient condition based on tangent-space negativity of the Hessian. In two dimensions, the practical sufficient quantity is \[ Q_2(x)=u_x^2u_{yy}-2u_xu_yu_{xy}+u_y^2u_{xx}, \] and the condition \(Q_2(x)<0\) on points where \(\nabla u(x)\neq 0\) implies quasi-concavity [2605.19210]. This yields a differentiable loss \[ \mathcal L_{2nd}(u)=\frac1{|\Omega|}\sum_{x\in\Omega}\|\nabla u(x)\|\cdot \mathrm{ReLU}(Q_2(x)+\delta), \] implemented by fixed finite-difference convolutions, together with a Convex Gradient Projection Module that performs an unrolled proximal refinement of the output mask. The paper reports that on Swin-Unet the second-order prior improves Dice by \(+2.375\), IoU by \(+3.711\), reduces Hausdorff distance by \(1.630\), and increases per-image runtime from \(0.01\) s to \(0.12\) s [2605.19210]. Across these settings, convexity is not a single definition but a stable structural pattern: closure under mixtures, interval containment, anti-exchange closure, geodesic preservation, Hessian positivity, or level-set quasi-concavity. The recent literature shows that these forms are tightly interconnected but not interchangeable: some are probabilistic, some possibilistic, some combinatorial, some Lorentzian, and some algorithmic. What remains common is that convexity converts local consistency conditions into strong global consequences—uniqueness, representability, tractable optimization, or topological rigidity [0903.5522][2406.01100][1702.05584]. Source: https://www.emergentmind.com/topics/convex