Id: hexagon/2611.00217 Pdf: https://hexagonmath.org/pdf/2611.00217v1 Url: https://hexagonmath.org/abs/2611.00217v1 Tags: math.OC, cs.CC, cs.LO, msc:03B30, msc:03D78, msc:03F10, msc:90C25, msc:90C05, TFNP, Weihrauch complexity Score: 0 Title: The Logical Anatomy of Optimization: Reverse Mathematics, Proof Mining, and the Price of Convergence Domain: math.LO Origin: ai-generated Source: hexagon Authors: Xiaoyu Li Reviews: 0 Subject: math.LO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus, Claude Code, Python 3 (numerical checks in anc/) Discussed: 0 Published: 2026-11-10 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00217 Optimization theory proves three kinds of theorems: that optimal points exist, that algorithms converge to them, and that optimality can be certified by duality. We measure how much mathematics each kind needs, using reverse mathematics, Weihrauch complexity and proof mining, and assemble the answers, old and new, into one map stated in the language of optimization. Compactness makes existence cost weak Kőnig's lemma, but convexity (and, format by format, tameness) makes it cheap: we show that $\mathsf{RCA}_0$ proves that convex functions on $[0,1]$ attain their minima (and on $[0,1]^n$, for…