Zulip Chat Archive

Stream: Lean Together 2024

Topic: FLT-regular


Riccardo Brasca (Jan 11 2024 at 14:49):

Concerning Kevin's questions about FLT5, here I've started the proof.

There are three sorry in the file:

  • the first one is a boring but easy one: just check that the coercion from to of (-1)^(...) is what it should be.
  • the second one is the inequality 125 < (2 * (π ^ 2 / 16) * (32 / 3)) ^ 2. It shouldn't be difficult (it is enough that 3 < π).
  • the third one is the fact that the number of complex places of the 5th cyclotomic field is 2. This shouldn't be very difficult but we need to work a little bit on it.

Riccardo Brasca (Jan 11 2024 at 14:58):

Thanks gcongr, the inequality was really easy.

Riccardo Brasca (Jan 11 2024 at 14:59):

And I don't know how but simp did the first one :D

Andrew Yang (Jan 11 2024 at 15:02):

We should show that cyclotomic fields are totally complex and then use docs#NumberField.InfinitePlace.card_eq_card_isUnramifiedIn

Johan Commelin (Jan 11 2024 at 15:03):

So only the 3rd sorry remains?

Riccardo Brasca (Jan 11 2024 at 15:10):

Yes, I am working on it, it's also rather easy

Riccardo Brasca (Jan 11 2024 at 17:31):

It's done. It should be golfed and generalized, but it wasn't very difficult.

Kevin Buzzard (Jan 11 2024 at 18:32):

The reason I'm specifically interested in 5 is that this is a curve of huge genus (6 I guess?) with lots of local points (and a few global ones), and so finding all rational points on it is a really nontrivial achievement. The n=4 case x4+1=z4x^4+1=z^4 (dividing through by yy) has genus 3 but it maps onto a rank 0 genus 1 curve x4+1=Z2x^4+1=Z^2 so it's still easy -- methods known to Fermat will (and did) do it. I conjecture that such a high genus Diophantine equation has never been explicitly solved in any other prover -- this is genuinely hard in some sense.

Michael Stoll (Jan 11 2024 at 18:47):

In fact, the p=5p = 5 case of FLT reduces to rational points on a genus 2 curve. Generally, for pp an odd prime, FLT holds for pp iff the (hyper)elliptic curve y2=xp+1/4y^2 = x^p + 1/4 has only the obvious rational points. In the p=5p = 5 case, one can easily (not in Lean, but in Magma) compute that the 2-Selmer group is trivial, from which it is easy to conclude.

Michael Stoll (Jan 11 2024 at 18:48):

(I actually have a proof of FLT(37) that "only" relies on GRH for the computation of the class group of Q(237)\mathbb{Q}(\sqrt[37]{2}).)

Michael Stoll (Jan 11 2024 at 18:49):

(The paper is here.)

Kevin Buzzard (Jan 11 2024 at 18:54):

So we can push through this proof once you've finished formalising your Acta Arith paper on 2-descent for Jacobians of hyperelliptic curves :-)

Kevin Buzzard (Jan 11 2024 at 18:55):

Is the class group of Q(21/37)\mathbb{Q}(2^{1/37}) not provably computable without GRH?

Michael Stoll (Jan 11 2024 at 18:59):

It is in theory :smile: . One could try to let the computation run for a while; it may be feasible unconditionally. The input needed is that the class number is odd. (Experimentally, all these fields have class number 1, but of course nothing general can be proved...)

Michael Stoll (Jan 11 2024 at 19:02):

Kevin Buzzard said:

So we can push through this proof once you've finished formalising your Acta Arith paper on 2-descent for Jacobians of hyperelliptic curves :-)

Possibly. We'd need to have Jacobians and Selmer groups first, so right now, this is some way off (but certainly on my radar).

Chris Birkbeck (Jan 11 2024 at 19:08):

Kevin Buzzard said:

Is the class group of Q(21/37)\mathbb{Q}(2^{1/37}) not provably computable without GRH?

The Minkowski bound is 2715982925229018753717, which makes me think no.

Kevin Buzzard (Jan 11 2024 at 19:09):

Selmer groups we're working on at Imperial. Jacobians I am very unclear about how to do them.


Last updated: May 02 2025 at 03:31 UTC