Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Thomson N=7N=7N=7: the cubic remainders near the pentagonal bipyramid are O(r)∑∥yi−Pi∥2O(r)\sum\|y_i-P_i\|^2O(r)∑∥yi​−Pi​∥2

Proved
ThomsonN7.Reg.sum_Dpair_lower

by Lucas · Oct 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-geometrythomson-problem

Let P=(P0,…,P6)P=(P_0,\dots,P_6)P=(P0​,…,P6​) be the pentagonal bipyramid with the regular pentagon Pk=(cos⁡2πk5,sin⁡2πk5,0)P_k=(\cos\tfrac{2\pi k}5,\sin\tfrac{2\pi k}5,0)Pk​=(cos52πk​,sin52πk​,0) at indices k=0,…,4k=0,\dots,4k=0,…,4 and the poles (0,0,±1)(0,0,\pm1)(0,0,±1) at indices 5,65,65,6; let φ(t)=(2−2t)−1/2\varphi(t)=(2-2t)^{-1/2}φ(t)=(2−2t)−1/2, so that ∥x−y∥−1=φ(⟨x,y⟩)\|x-y\|^{-1}=\varphi(\langle x,y\rangle)∥x−y∥−1=φ(⟨x,y⟩) for unit vectors, and write gij=⟨Pi,Pj⟩g_{ij}=\langle P_i,P_j\ranglegij​=⟨Pi​,Pj​⟩ and E(y)=∑i<j∥yi−yj∥−1E(y)=\sum_{i<j}\|y_i-y_j\|^{-1}E(y)=∑i<j​∥yi​−yj​∥−1.

For y∈(R3)7y\in(\mathbb R^3)^7y∈(R3)7 write hi=yi−Pih_i=y_i-P_ihi​=yi​−Pi​, τij=⟨yi,yj⟩−gij\tau_{ij}=\langle y_i,y_j\rangle-g_{ij}τij​=⟨yi​,yj​⟩−gij​ and

Dij(y)=32φ(gij)5τij2+52φ(gij)7τij3−32φ(gij)5(⟨Pi,hj⟩+⟨hi,Pj⟩)2.D_{ij}(y)=\tfrac32\varphi(g_{ij})^5\tau_{ij}^2+\tfrac52\varphi(g_{ij})^7\tau_{ij}^3-\tfrac32\varphi(g_{ij})^5\big(\langle P_i,h_j\rangle+\langle h_i,P_j\rangle\big)^2.Dij​(y)=23​φ(gij​)5τij2​+25​φ(gij​)7τij3​−23​φ(gij​)5(⟨Pi​,hj​⟩+⟨hi​,Pj​⟩)2.

If 0≤r≤110000\le r\le\tfrac1{1000}0≤r≤10001​ and ∥hi∥≤r\|h_i\|\le r∥hi​∥≤r for all iii (no unit-norm assumption), then

−28 r∑i∥hi∥2 ≤ ∑i<jDij(y).-28\,r\sum_i\|h_i\|^2\ \le\ \sum_{i<j}D_{ij}(y).−28ri∑​∥hi​∥2 ≤ i<j∑​Dij​(y).

Since τij=⟨Pi,hj⟩+⟨hi,Pj⟩+⟨hi,hj⟩\tau_{ij}=\langle P_i,h_j\rangle+\langle h_i,P_j\rangle+\langle h_i,h_j\rangleτij​=⟨Pi​,hj​⟩+⟨hi​,Pj​⟩+⟨hi​,hj​⟩, each DijD_{ij}Dij​ consists of terms of order at least three in hhh, and the bound makes this quantitative on the rrr-ball.

Formalization Note All named objects (pentBipyramid, coulombEnergy, Base.phi, Reg.W, Reg.muP, Reg.gP, Reg.tau, Reg.Dpair, Reg.Qhess, Reg.Pen, Glue.TubeRigid) come from the platform definition ThomsonN7_core, taken verbatim from the source; R3 is EuclideanSpace ℝ (Fin 3).

Preamble
import Definitions.Def_ThomsonN7_core
Formal statement
namespace ThomsonN7

theorem Reg.sum_Dpair_lower {y : Fin 7 → R3} {r : ℝ} (hr : r ≤ 1 / 1000)
    (hρ : ∀ i, ‖y i - pentBipyramid i‖ ≤ r) :
    -(28 * r * ∑ i, ‖y i - pentBipyramid i‖ ^ 2)
      ≤ ∑ i, ∑ j ∈ Finset.Ioi i, Reg.Dpair y i j := by sorry

end ThomsonN7
Source
H. Tran, Thomson problem N = 7 Lean proof package, https://github.com/huwngtran/thomson-n7-lean @ 25f2fa53119273458cfbb3c4230904bffdd61e53: paper/PAPER.md §7.2 step 5 (local minimality); Lean `ThomsonN7.Reg.sum_Dpair_lower`, https://github.com/huwngtran/thomson-n7-lean/blob/25f2fa53119273458cfbb3c4230904bffdd61e53/formal/lean/ThomsonN7/Solution.lean#L8949

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