The inter-universal Teichm\"uller theory and new Diophantine results over the rational numbers. I

Abstract

By applying inter-universal Teichm\"uller theory and its slight modification over the rational number field, we prove new Diophantine results towards effective abc inequalities and the generalized Fermat equations. For coprime integers a, b, c satisfying a + b = c and (|abc|) ≥ 700, we prove |abc| ≤ 3(abc) + 8|abc| · |abc|. This implies for any 0 < ε ≤ 110, |abc| ≤ \(400 · ε-2 · (ε-1)),\ rad(abc)3+3ε\, reducing the constant in effective abc bounds from 1.7 · 1030 (Mochizuki-Fesenko-Hoshi-Minamide-Porowski) to 400. For positive primitive solutions (x, y, z) to the generalized Fermat equation xr + ys = zt (r, s, t ≥ 3), define h = (xr ys zt). We prove explicit bounds: gather* h ≤ 573\ \ (r, s, t ≥ 8); \; h ≤ 907\ \ (r, s, t ≥ 5); \; h ≤ 2283\ \ (r, s, t ≥ 4); \\ h ≤ 14750\ \ (\r, s\ ≥ 4\ or\ t ≥ 4); \; h ≤ 24626\ \ (r, s, t ≥ 3). gather* These imply Fermat's Last Theorem (FLT) holds unconditionally for prime exponents ≥ 11. Combined with classical results for FLT with exponents 3, 4, 5, 7, this yields a new alternative proof of FLT. Computational verification confirms no non-trivial primitive solution exists when r, s, t ≥ 20 or (r, s, t) is a permutation of (3, 3, n) (n ≥ 3).

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…