Live data from Hacker News

Gerd Faltings, who proved the Mordell conjecture, wins the Abel Prize

scientificamerican.com

11–13 of 13 posts

Re: Gerd Faltings, who proved the Mordell conjecture, wins the Abel Prize

#11
post #10

Earlier quoted context omitted.

The curve they mean y = x^4 is irreducible but the genus is 0 since it’s isomorphic to the affine line.

The correct description is “a smooth curve of genus at least 2”. https://en.wikipedia.org/wiki/Faltings%27_theorem 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…

I think the theorem applies to any curve, if you take geometric genus.

Re: Gerd Faltings, who proved the Mordell conjecture, wins the Abel Prize

#13
post #3

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:

https://www.ams.org/notices/199507/faltings.pdf

Post reply on HN