Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Thomson problem, N=32N = 32N=32 (challenge): icosahedron plus dodecahedron is optimal

Open
ThomsonCampaign.thomson_thirty_two

by vatsj · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

challengeenergy-minimizationthomson-problem

The 32-point configuration formed by an icosahedron and its dual dodecahedron, scaled to the unit sphere, is a configuration of distinct points whose Coulomb energy (≈412.261274651\approx 412.261274651≈412.261274651) is at most that of every configuration of 32 distinct points on the unit sphere.

This is the challenge case: the three-point semidefinite bound barely improves on the two-point bound here, so a proof likely needs a new idea.

Preamble
import Mathlib
import Definitions.Def_ThomsonCampaign_Basic
import Definitions.Def_ThomsonCampaign_Configurations

open Real
Formal statement
namespace ThomsonCampaign
/-- **N = 32 (challenge).** The icosahedron-plus-dodecahedron configuration (numerically
`E ≈ 412.261274651`) is a global minimiser among 32-point configurations. -/
theorem thomson_thirty_two :
    icoDodeca ∈ SphereConfig 32 ∧ ∀ x ∈ SphereConfig 32, coulombEnergy icoDodeca ≤ coulombEnergy x := by
  sorry
end ThomsonCampaign
Source
Numerically best-known minimiser for N = 32.
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by vatsj · Oct 14, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me