1 Fermat’s Method of Infinite Descent

PIC

Definition (Rational, primitive triangle). A triangle is rational if a,b,c.

A triangle is primitive if a,b,c and are coprime.

Lemma 1.1. Assuming that:

Then Δ is of the form

PIC

for some integers u>v>0.

Proof. Without loss of generality a odd, b even (work modulo 4). This then forces c odd.

Then

(b2)2=c+a2ca2,

and note that all the fractions are integers. Also note that the product on the right hand side is a product of positive coprime integers.

Unique prime factorisation in gives that c+a2=u2, ca2=v2 for some u,v.

Then a=u2v2, b=2uv, c=u2+v2.

Definition (Congruent number). D>0 is a congruent number if there exists a rational triangle Δ with area(Δ)=D.

Note. It suffices to consider D>0 square-free.

Example. D=5,6 are congruent.

Lemma 1.2. Assuming that:

  • D>0

Then D is congruent if and only if Dy2=x3x for some x,y, y0.

Proof. Lemma 1.1 shows

D congruentDw2=uv(u2v2)

for some u,v,w, with w0. Put x=uv and y=wv2.

Fermat showed that 1 is not a congruent number.

Theorem 1.3. There is no solution to

w2=uv(u+v)(uv)(∗)

for u,v,w and w0.

Proof. Without loss of generality u,v are coprime, u>0, w>0. If v<0 then replace (u,v,w) by (v,u,w). If u,v both odd then replace (u,v,w) by (u+v2,uv2,w2).

Then u,v,u+v,uv are pairwise coprime positive integers with product a square.

Unique factorisation in gives

u=a2,v=b2,u+v=c2,uv=d2

for some a,b,c,d>0.

Since uv(mod2), both c and d are odd.

Then consider:

(c+d2)2+(cd2)2=c2+d22=u=a2.

PIC

This is a primitive triangle. The area is c2d28=v4=(b2)2.

Let w1=b2. Lemma 1.1 gives w12=u1v1(u1+v1)(u1v1) for u1,v1. Therefore we have a new solution to (). But 4w12=b2=v|w2 so w112w.

So by Fermat’s method of infinite descent, there is no solution to () .

1.1 A variant for polynomials

In Section 1, K is a field with charK2.

Write K¯ for the algebraic closure of K.

Lemma 1.4. Assuming that:

  • u,vK[t] coprime

  • αu+βv is a square for 4 distinct (α:β)1

Then u,vK.

Proof. Without loss of generality K=K¯.

Changing coordinates on 1, we may assume the ratios (α:β) are (1:0),(0:1),(1:1),(1:λ) for some λK{0,1} (Möbius map).

u=a2v=b2uv=(a+b)(ab)uλv=(a+μb)(aμb)

(where μ is a square root of λ). Unique factorisation in K[t] gives that a+b, ab, a+μb, aμb are squares. But

max( deg (a), deg (b))12max( deg (u), deg (v)).

So Fermat’s method of infinite descent, we get a contradiction, unless the degrees of u and v are zero. So u,vK.

Definition 1.5 (Elliptic curve (temporary definition)).

  • (i) An elliptive curve EK is the projective closure of the plane affine curve
    y2=f(x)

    where fK[x] is a monic cubic polynomial with distinct roots in K¯. We call this equation “a Weierstrass equation”.

  • (ii) For LK any field extension
    E(L)={(x,y)L2|y2=f(x)}{0}.

    0 is the “point at infinity” that we get because we take the projective closure.

Fact: E(L) is naturally an abelian group.

In this course, we study E(K) for K being a finite field, local field ([K:p]<) or number field ([K:]<).

Lemma 1.2 and Theorem 1.3 tells us that if E is y2=x3x, then

E()={0,(0,0),(±1,0)}.

Corollary 1.6. Let EK be an elliptic curve. Then E(K(t))=E(K).

Proof. Without loss of generality K=K¯. By a change of coordinates, we may assume

y2=x(x1)(xλ)

for some λK{0,1}. Suppose (x,y)E(K(t)). Put x=uv, where u,vK[t] are coprime.

Then w2=uv(uv)(uλv) for some wK[t].

Unique factorisation in K[t] gives that u,v,uv,uλv are squares. Hence by Section 1.1, u,vK, so xK, so yK.