Thomson : the cubic remainders near the pentagonal bipyramid are
ProvedThomsonN7.Reg.sum_Dpair_lowerdiscrete-geometrythomson-problem
Let be the pentagonal bipyramid with the regular pentagon at indices and the poles at indices ; let , so that for unit vectors, and write and .
For write , and
If and for all (no unit-norm assumption), then
Since , each consists of terms of order at least three in , and the bound makes this quantitative on the -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 ThomsonN7Source
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