Oh wow! I wouldn't have expected this so many years later. Mordel's conjecture implies asva special case that for all n>=4 there are only a finite number of solutions to Fermat's equations with relative prime numbers.
Brings me back!
> Mordel's conjecture implies as a special case that for all n>=4 there are only a finite number of solutions to Fermat's equations with relative prime numbers
I just learnt that fact from Wikipedia's article on Mordel's conjecture (now Faltings' theorem), was curious whether the theorem could be strengthened to obtain a full proof of Fermat’s Last Theorem (FLT) that is genuinely different from the Taylor–Wiles proof (or its later variants) and so asked an AI (in this case Grok via Twitter).
Grok correctly told me "no it's not possible", but then surfaced (as an aside) a nice expository article on the Taylor–Wiles proof by Faltings from AMS notices in July 1995, which I thought I'd share here:
My understanding, which is to be taken with a grain of salt, is that there's an additional constraint, not stated in the Scientific American article, that the plane curve be irreducible. The example of x^4 is reducible, it's x^2 * x^2 among other thing. The actual conjecture is expressed in terms of genus, but this follows from the genus-degree formula.
The reason for the confusion is that a smooth, projective plane curve of degree d has genus (d-1)(d-2)/2, which is 2 or greater starting at d=4. Hence the phrasing in the article, which is missing the “smooth, projective” hypothesis. The equation y = x^4 doesn’t define a smooth curve when extended to the projective plane, because it has a singularity at infinity.