The sharp Hessian bound for convex four-body central configurations

In a previous paper (arXiv:2609.35632) we proved that the planar four-body problem has exactly one convex central configuration for each choice of positive masses and each cyclic order of the bodies, by proving that these configurations are nondegenerate. Here we prove the sharp form of this nondegeneracy: at every convex central configuration, the Hessian of the potential on a level set of the moment of inertia exceeds two thirds of its radial part. The constant 2/3 is optimal; it is approached by isosceles trapezoids in which the two masses on one of the parallel sides tend to zero. We give two independent computer-assisted proofs of an equivalent inequality for the largest eigenvalue of a 2×2 matrix that depends only on the shape of the configuration, and one of them is formalized in the Lean proof assistant. Besides the paper, the record contains the programs and data for the computer-assisted part of the paper's first proof. That part covers the configurations with a relatively short side (roundness at most 3/4, in the paper's terms), while Section 4 of the paper treats the others by hand. The programs run with Python and the python-flint library, and one of them also needs SymPy. README.md explains how to check and run them. In our runs the longest of the checks took about 11.5 hours with up to nine processes at a time, needed more than 72 GiB of memory, and completed with 120 GiB available. Section 9 of the paper also describes a formal proof in Lean of the main theorem of arXiv:2609.35632. The repositories of both formal proofs are listed under Related works. Mathematics Subject Classification (2020): 70F10, 70F15, 65G20, 68V20.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-28
DOI
https://doi.org/10.5281/zenodo.23727137
Primary Topic
Advanced Differential Equations and Dynamical Systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The sharp Hessian bound for convex four-body central configurations

Tejasvi Singh Tomar
Zenodo (CERN European Organization for Nuclear Research)
Advanced Differential Equations and Dynamical Systems
preprint

The sharp Hessian bound for convex four-body central configurations

Tejasvi Singh Tomar
preprint en

Abstract

In a previous paper (arXiv:2609.35632) we proved that the planar four-body problem has exactly one convex central configuration for each choice of positive masses and each cyclic order of the bodies, by proving that these configurations are nondegenerate. Here we prove the sharp form of this nondegeneracy: at every convex central configuration, the Hessian of the potential on a level set of the moment of inertia exceeds two thirds of its radial part. The constant 2/3 is optimal; it is approached by isosceles trapezoids in which the two masses on one of the parallel sides tend to zero. We give two independent computer-assisted proofs of an equivalent inequality for the largest eigenvalue of a 2×2 matrix that depends only on the shape of the configuration, and one of them is formalized in the Lean proof assistant. Besides the paper, the record contains the programs and data for the computer-assisted part of the paper's first proof. That part covers the configurations with a relatively short side (roundness at most 3/4, in the paper's terms), while Section 4 of the paper treats the others by hand. The programs run with Python and the python-flint library, and one of them also needs SymPy. README.md explains how to check and run them. In our runs the longest of the checks took about 11.5 hours with up to nine processes at a time, needed more than 72 GiB of memory, and completed with 120 GiB available. Section 9 of the paper also describes a formal proof in Lean of the main theorem of arXiv:2609.35632. The repositories of both formal proofs are listed under Related works. Mathematics Subject Classification (2020): 70F10, 70F15, 65G20, 68V20.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Differential Equations and Dynamical Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon