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+a2⋅c−a2,

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, c−a2=v2 for some u,v∈ℤ.

Then a=u2−v2, 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=x3−x for some x,y∈ℚ, y≠0.

Proof. Lemma 1.1 shows

D congruent⟺Dw2=uv(u2−v2)

for some u,v,w∈ℚ, with w≠0. 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)(u−v)(∗)

for u,v,w∈ℤ and w≠0.

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,u−v2,w2).

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

Unique factorisation in ℤ gives

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

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

Since u⁄≡v(mod2), both c and d are odd.

Then consider:

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

PIC

This is a primitive triangle. The area is c2−d28=v4=(b2)2.

Let w1=b2. Lemma 1.1 gives w12=u1v1(u1+v1)(u1−v1) for u1,v1∈ℤ. Therefore we have a new solution to (∗). But 4w12=b2=v|w2 so w1≤12w.

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 char⁡K≠2.

Write K¯ for the algebraic closure of K.

Lemma 1.4. Assuming that:

  • u,v∈K[t] coprime

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

Then u,v∈K.

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=b2u−v=(a+b)(a−b)u−λv=(a+μb)(a−μb)

(where μ is a square root of λ). Unique factorisation in K[t] gives that a+b, a−b, 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,v∈K. □

Definition 1.5 (Elliptic curve (temporary definition)).

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

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

  • (ii) For L∕K 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=x3−x, then

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

Corollary 1.6. Let E∕K 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(x−1)(x−λ)

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

Then w2=uv(u−v)(u−λv) for some w∈K[t].

Unique factorisation in K[t] gives that u,v,u−v,u−λv are squares. Hence by Section 1.1, u,v∈K, so x∈K, so y∈K. □