Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 10 min ago
PreprintarXiv licencearXiv

On the Five-Point Case of Mordell's Problem

Abstract

For five complex points z1,…,z5 satisfying ∑i|zi|2=5, Mordell's discriminant inequality states that ∏i<j|zi−zj|2≤55, with equality precisely for a unit regular pentagon, up to rotation and permutation. We organize its proof around a direct comparison of discriminant values. A global maximizer gives a centered stationary configuration, whose coefficient equations reduce the generic case to two quartic branches. On each branch, the absolute value of a cubic polynomial gives the original discriminant objective after accounting for the normalization scale. Exact rational interval bounds exclude both branches from the maximum, and the exceptional coefficient cases leave the regular pentagon. The argument determines the maximizing configuration without reconstructing all stationary shapes. We have completed a full Lean formalization of the five-point inequality and both directions of its equality condition, including all reductions and finite checks used in this proof.

Related

  1. The Five-Point Case of Mordell's Discriminant Inequality
    Jie Wang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. Optimal Configurations for Mordell's Problem
    Xiang Ji, Tiancheng Xu, Wensheng Yu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  3. Big Bounce, Big Crunch Cycle: Full Vector--Gravity Coupling, Fixed-Point Instability, and Stable Limit Cycle in a Five-Dimensional Bessel--Klein--Gordon Framework Paper I of a two-part series
    Jacek Wolejszo
    HALPreprintPublisher termsFull textGeneral mathematicsGeneral physicsHAL
  4. Finiteness of Dziobek central configurations in the Newtonian five-body problem
    Kefeng Liu, Yangshanshan Liu
    arXivPreprintarXiv licenceFull textDynamical systemsMathematical physicsarXiv
  5. A non-lattice periodic point set beating the optimal lattice packing-covering constant in dimension five
    Sven Ahrend, Mathieu Dutour Sikirić
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
BibTeX
@misc{xu2026fivepoint,
  title = {{On the Five-Point Case of Mordell's Problem}},
  author = {Tiancheng Xu and Guowei Dou and Wensheng Yu},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.12504},
  eprint = {2610.12504},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.12504},
}
RIS
TY  - UNPB
TI  - On the Five-Point Case of Mordell's Problem
AU  - Tiancheng Xu
AU  - Guowei Dou
AU  - Wensheng Yu
PY  - 2026
DA  - 2026/10/04
PB  - arXiv
DO  - 10.48550/arxiv.2610.12504
UR  - https://arxiv.org/abs/2610.12504
AB  - For five complex points z_1,…,z_5 satisfying ∑_i|z_i|^2=5, Mordell's discriminant inequality states that ∏_i<j|z_i−z_j|^2≤5^5, with equality precisely for a unit regular pentagon, up to rotation and permutation. We organize its proof around a direct comparison of discriminant values. A global maximizer gives a centered stationary configuration, whose coefficient equations reduce the generic case to two quartic branches. On each branch, the absolute value of a cubic polynomial gives the original discriminant objective after accounting for the normalization scale. Exact rational interval bounds exclude both branches from the maximum, and the exceptional coefficient cases leave the regular pentagon. The argument determines the maximizing configuration without reconstructing all stationary shapes. We have completed a full Lean formalization of the five-point inequality and both directions of its equality condition, including all reductions and finite checks used in this proof.
ER  -