Id: palomar/PALOMAR-2026-11-19-000010 Url: https://github.com/caiusdfolkerts/research/tree/d56c76be36b7748817af351d26e547fec17b1310/conditional_decomposability Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000010-v1.json Repo: https://github.com/caiusdfolkerts/research Tags: math.CO, math.MG, msc:52B05, msc:52B11 Score: 0 Title: The sharp vertex bound for conditional decomposability Trust: high Domain: math.CO Source: palomar Authors: Caius Folkerts Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-19 Formalized: true Formalizes: title=The sharp vertex bound for conditional decomposability identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-19-000010 For every dimension d at least 3, the least number of vertices of a conditionally Minkowski decomposable convex d-polytope is 4d-4. The formalization proves the universal lower bound, all-dimensional attainment, the literal least-number formulation, and the stronger statement that below this threshold decomposability is determined by the face lattice. Polytopes are actual finite convex hulls with their extreme vertices, and Minkowski summands may have any affine dimension.