[Paper Review] The Triangular Bi-Pyramid Minimizes a Range of Power Law Potentials

Richard Evan Schwartz|arXiv (Cornell University)|Dec 15, 2015

Mathematical Approximation and Integration12 references3 citations

TL;DR

This paper presents a rigorous computer-assisted proof that the triangular bi-pyramid (TBP) is the unique minimizer of Riesz potentials $ R_s(r) = \mathrm{sign}(s)/r^s $ for all $ s \in (-2, 13] \setminus \{0\} $ among 5-point configurations on the unit sphere. By combining Tumanov's observation with a divide-and-conquer algorithm using interval arithmetic and energy estimates on dyadic blocks, the authors verify minimality for key auxiliary potentials $ G_k $, thereby extending known results for Thomson's problem ($ s=1 $) and Polya's problem ($ s=-1 $) to a broad range of power-law potentials.

ABSTRACT

Combining a brilliant obserbation of A. Tumanov with our computational approach to Thomson's 5-electron problem, we prove that the triangular bi-pyramid is the unique global minimizer for the Rieze potential R_s(r) = sign(s) r^{-s} amongst all configurations of 5 points on the unit sphere, provided that s in (-2,0) or s in (0,13]. The lower bound is sharp and the upper bound is pretty close to the presumed sharp cutoff of about 15.040908. I hope to reach the sharp cutoff in a sequel paper. The discussion section of this paper has a brief sketch of the approach I will take in the sequel to deal with exponents in the range [13,15.04.0809...].

Motivation & Objective

• To resolve the long-standing open problem of identifying the global minimizer of Riesz potentials for 5 points on the 2-sphere across a wide range of power-law exponents.
• To extend prior computer-assisted proofs for $ s = 1 $ (Thomson) and $ s = -1 $ (Polya) to a continuous interval of exponents up to $ s = 13 $.
• To establish that the triangular bi-pyramid is the unique minimizer for $ R_s $ when $ s \in (-2, 13] \setminus \{0\} $, with sharp lower bound at $ s = -2 $.
• To validate Tumanov's conjecture that minimality for certain auxiliary potentials $ G_k $ implies minimality for $ R_s $, using a novel divide-and-conquer strategy with interval arithmetic.

Proposed method

• The authors use stereographic projection to embed 5-point spherical configurations into $ \mathbb{R}^2 \cup \{\infty\} $, enabling a Euclidean moduli space for algorithmic analysis.
• They define 'blocks'—dyadic rectangular solids in the moduli space—within which energy minima are estimated using the Energy Theorem, which bounds minimum energy via vertex configurations and an error term.
• A divide-and-conquer algorithm recursively subdivides blocks, eliminating those whose estimated minimum energy exceeds that of the TBP, using interval arithmetic to ensure rigorous bounds.
• The method relies on interval arithmetic with double-precision floating-point numbers, where operations are performed with infinite precision and then rounded outward to guarantee containment of real values.
• Key auxiliary potentials $ G_k(r) = (4 - r^2)^k $ for $ k = 3,4,5,6 $ and $ G^\#_{10} = G_{10} + 28G_5 + 102G_2 $ are verified to be minimized by the TBP using the same algorithmic framework.
• The proof leverages Tumanov’s result that if the TBP minimizes $ G_3, G_4, G_5, G_6, G^\#_{10} $, then it minimizes $ R_s $ for $ s \in (-2,13] \setminus \{0\} $, thus reducing the problem to verifying minimality on these five potentials.

Experimental results

Research questions

• RQ1 Is the triangular bi-pyramid the unique minimizer of Riesz potentials $ R_s $ for $ s \in (-2, 13] \setminus \{0\} $ among 5-point spherical configurations?
• RQ2 Can the TBP be rigorously proven to minimize $ R_s $ for a continuous range of $ s $, extending beyond known results for $ s = 1 $ and $ s = -1 $?
• RQ3 Does the minimality of the TBP for certain auxiliary potentials $ G_k $ imply its minimality for $ R_s $, and can this implication be algorithmically verified?
• RQ4 What is the sharp lower bound on $ s $ below which the TBP ceases to be the minimizer, and is $ s = -2 $ indeed the threshold?
• RQ5 Can interval arithmetic and a divide-and-conquer strategy on dyadic blocks provide a rigorous, computer-assisted proof of global minimality for complex energy functionals?

Key findings

• The triangular bi-pyramid is the unique global minimizer of the Riesz potential $ R_s(r) = \mathrm{sign}(s)/r^s $ for all $ s \in (-2, 13] \setminus \{0\} $ among 5-point configurations on the unit sphere.
• The proof establishes that the TBP minimizes $ R_s $ for $ s = 1 $ (Thomson’s problem) and $ s = -1 $ (Polya’s problem), confirming and extending prior results.
• The minimality of the TBP for the auxiliary potentials $ G_3, G_4, G_5, G_6 $, and $ G^\#_{10} $ was rigorously verified using interval arithmetic and the divide-and-conquer algorithm.
• The lower bound $ s = -2 $ is sharp: the TBP is not a minimizer for $ R_s $ when $ s < -2 $, confirming the tightness of the interval.
• The method provides a new framework for proving global minimality of symmetric configurations in energy minimization problems using interval arithmetic and block-based energy estimation.
• The algorithm successfully eliminates all blocks except those near the TBP configuration, confirming that no other configuration achieves lower energy for the specified potentials.