Genus-One Fibrations and the Jacobian of Linear Slices in the Quintic Equal-Sum Problem

Abstract

We study the Diophantine equation a5+b5=c5+d5 under the linear slicing constraint (c+d)-(a+b)=h. We first prove the necessary congruence 30 h. After symmetrization, the associated discriminant equation defines, for each fixed nonzero slice parameter h, a genus-one curve over Q(S); to study Mordell-Weil rank, one must pass to its Jacobian fibration Eh/Q(S). We show that Eh carries a global rational 2-torsion section and never has full rational 2-torsion over Q(S). We also prove that no nonsingular rational specialization acquires additional rational 2-torsion: by homogeneity, the relevant square condition reduces to rational points on a universal genus-two hyperelliptic curve, whose rational points are determined via a verified Magma computation using a rank-0 bound and the Chabauty-Coleman method. We further show that, after the normalization x=S/h, the Jacobian fibrations for all h≠ 0 become isomorphic over a rational function field. For the representative slice h=30, we compute the classical invariants of the associated binary quartic, obtain an explicit Weierstrass model, and apply the Gusi\'c-Tadi\'c injectivity criterion together with verified specialized-rank computations to prove the uniform bound rank\,Eh(Q(S)) 1 for all h≠ 0. We then construct an explicit rational section on the universal Jacobian model and, specializing at S=12 on the slice h=30, show via injective specialization that this section has infinite order. Consequently, rank\,Eh(Q(S))=1 for every h∈Q×. We conclude by recording the additional integrality, parity, and size conditions required to recover integer solutions from the genus-one/Jacobian framework.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…