no. 17 · Wednesday 18 November 2026
Finite de Finetti for convex bodies and Polynomial Optimization
Abstract
We study polynomial optimization over convex bodies with separately affine objectives and local affine equality and inequality constraints. We construct a convergent hierarchy of conic relaxations with explicit finite-level error bounds of order $n^{-1/2}$ at level $n$, complemented by a constructive rounding scheme that produces feasible points. The relaxation bounds and rounded objective values bracket the optimum at the same rate. The analytic ingredient is a finite de Finetti representation theorem for arbitrary proper cones: bipartite marginals of symmetric extensions in maximal tensor products are $O(n^{-1/2})$-close, in base norm, to points of the minimal tensor product. Its proof combines a uniform, monogamy-type bound on a variational mutual information based on Frenkel's relative entropy with classical conditioning and informationally complete measurements. We apply the framework to the assemblage relaxation of two-player non-local games in general probabilistic theories. For polytopic state spaces, the hierarchy consists of linear programs, and experiments on the Clauser–Horne–Shimony–Holt (CHSH) game provide a numerical proof of concept for the outer approximations and feasible rounding procedure.
- comments
- Main body and declarations, pp. 1-58. Appendices A-E, pp. 58-68. References, pp. 69-71. Julius A. Zeiss and Gereon Kossmann contributed equally to this work. Changes from v1: Added numerical illustrations and revised proofs, game formulation and exposition
- fields
- Optimization and Control, Mathematical Physics