Thomson, One N at a Time
Blog post from Vals
The Thomson problem seeks the arrangement of \(N\) mutually repelling electrons on a sphere that minimizes total inverse-distance energy, and a recent Lean formalization established that for \(N=7\) the unique optimum is the pentagonal bipyramid, using a 17,895-line proof developed by multiple AI agents. The approach constructs global lower bounds from Legendre-polynomial and spherical-harmonic positivity identities, translating sums over pairwise angles into nonnegative squared norms; when a polynomial lies below the energy function, it yields a rigorous energy bound. This two-point linear-programming method is exact for highly balanced spherical designs such as the icosahedron at \(N=12\), but leaves a small gap for the \(N=7\) configuration because pair-angle data alone permits unrealizable “fake” distributions. Stronger three-point semidefinite bounds incorporate the geometric constraints among triangles, and, combined with case splits restricting possible inner products plus local rigidity arguments, have proved the cases \(N=7\) and \(N=8\). Numerical evidence suggests that the same certificate-and-cut strategy may next establish \(N=10\) and \(N=9\), whereas the highly symmetric conjectured \(N=32\) optimum, an icosahedron combined with a dodecahedron, appears to require a new idea because current pairwise and three-point bounds remain insufficient.
No tracked trend matches for this post yet.
Use this post, company, and trend context to find content marketing opportunities, perform competitive analysis, or address product feature gaps via the Plushcap MCP server or the Plushcap API.