Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Thomson N=7N=7N=7: a cap specification implies the theorem on the cap

Proved
ThomsonN7.Glue.capSpec_sound

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

discrete-geometrythomson-problem

Let a0∈Ra_0\in\mathbb Ra0​∈R and suppose the cap specification at a0a_0a0​ holds (reals e,δ,τe,\delta,\taue,δ,τ with τ≤1165000\tau\le\tfrac1{165000}τ≤1650001​, E(P)≤e+δE(P)\le e+\deltaE(P)≤e+δ, class minorants HA,HB,HC≤φH_A,H_B,H_C\le\varphiHA​,HB​,HC​≤φ whose typed pair sum is at least eee on minimal-pair configurations with ⟨y0,y1⟩≤a0\langle y_0,y_1\rangle\le a_0⟨y0​,y1​⟩≤a0​, and whose slack φ−H\varphi-Hφ−H being at most δ\deltaδ forces the inner product within τ\tauτ of −1-1−1, 000, or one of c1=cos⁡2π5c_1=\cos\tfrac{2\pi}5c1​=cos52π​, c2=cos⁡4π5c_2=\cos\tfrac{4\pi}5c2​=cos54π​ respectively).

Then for every configuration yyy of seven distinct unit vectors in R3\mathbb R^3R3 in which the pair (0,1)(0,1)(0,1) realises the smallest inner product and ⟨y0,y1⟩≤a0\langle y_0,y_1\rangle\le a_0⟨y0​,y1​⟩≤a0​:

E(P) ≤ E(y);E(P)\ \le\ E(y);E(P) ≤ E(y);
  1. if E(y)=E(P)E(y)=E(P)E(y)=E(P), then yi=g(Pσ(i))y_i=g(P_{\sigma(i)})yi​=g(Pσ(i)​) for some linear isometry ggg of R3\mathbb R^3R3 and some permutation σ\sigmaσ of {0,…,6}\{0,\dots,6\}{0,…,6}.

Here PPP is the pentagonal bipyramid with the pentagon at indices 0,…,40,\dots,40,…,4 and the poles at 5,65,65,6, and E(y)=∑i<j∥yi−yj∥−1E(y)=\sum_{i<j}\|y_i-y_j\|^{-1}E(y)=∑i<j​∥yi​−yj​∥−1.

This is the analytic half of the cap cell: it turns the near-sharp certificate into the sharp bound via tube rigidity of the bipyramid and its exact second-order local minimality.

Formalization Note Glue.CapSpec, Glue.Concl, SphereConfig and pentBipyramid come from the platform definition ThomsonN7_core, taken verbatim from the source.

Preamble
import Definitions.Def_ThomsonN7_core
Formal statement
namespace ThomsonN7

theorem Glue.capSpec_sound {a0 : ℝ} (h : Glue.CapSpec a0) :
    ∀ y ∈ SphereConfig 7, inner ℝ (y 0) (y 1) ≤ a0 →
      (∀ i j, i ≠ j → inner ℝ (y 0) (y 1) ≤ inner ℝ (y i) (y j)) → Glue.Concl y := 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 (steps 1–5); Lean `ThomsonN7.Glue.capSpec_sound`, https://github.com/huwngtran/thomson-n7-lean/blob/25f2fa53119273458cfbb3c4230904bffdd61e53/formal/lean/ThomsonN7/Solution.lean#L12729

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