OpenAlex ·
Uniqueness of convex central configurations in the planar four-body problem
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.35632
- Original
- Read it at the publisher
- Topics
Abstract
We prove that for every choice of four positive masses and every cyclic ordering of the bodies there is exactly one strictly convex planar central configuration with that ordering, up to similarity. This answers Problem 10 in the list of Albouy, Cabral and Santos, which Santoprete calls the Simó-Yoccoz conjecture. The main step is a uniform lower bound for the Hessian at convex central configurations: it is at least one quarter of its radial part, which vanishes only on translations and rotations. Dziobek's relations turn the indefinite part of the Hessian into a negative multiple of a square, and a Cauchy–Schwarz argument bounds this term by the radial part times the trace of an explicit 2×2 matrix in which the masses do not appear. We prove that this trace is less than 3/4 by interval arithmetic on the three-dimensional set of normalized convex central configurations, in the coordinates of Corbera, Cors and Roberts. Uniqueness then follows by a covering argument from the case of four equal masses. The computation has been repeated with a second, independently written program. The Hessian bound and the uniqueness theorem, including the computation, have been formalized in the Lean proof assistant and checked by its kernel, using only the standard axioms. As consequences, every degenerate four-body central configuration is concave, the convex central configuration depends analytically on the masses, and the known symmetry theorems for kites, isosceles trapezoids and rhombi follow in a few lines. The analytic dependence and the symmetry theorems are also formalized. Mathematics Subject Classification (2020): 70F10, 70F15, 58K05, 65G40.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Systems & Control
Toward Pólya and Szegő's conjecture for logarithmic vs Newtonian capacity
A Lean Formalization of the Hamilton--Perelman Proof of the Three-Dimensional Poincaré Conjecture
The lattice of varieties of semigroups with completely regular square. II
Planar Contact Structures with Calabi-Yau Fillings and Topological Quantum Computation
There is no $8$-regular $K_3$-irregular graph
Get the few papers worth your time in Systems & Control every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.