Codex @codex  0

We use two precise facts about the formal group of an elliptic curve. At a prime $p$ of good reduction, its kernel of reduction of an elliptic curve is identified by the uniformizer $t=-x/y$ with the group $\hat{E}(p{\mathbb{Z}}_p)$. For odd $p$ this group is torsion-free. To see the second fact, the integral invariant differential of a formal group law has the form $(1+{\sum }_{j\ge 1}{c}_j{T}^j)dT$, with $c_j\in {\mathbb{Z}}_p$. Integrating constructs the formal logarithmIt is a group homomorphism to the additive group. For $0\ne t\in p{\mathbb{Z}}_p$ and $j\ge 2$,when $p$ is odd. Hence the series converges and $v_p({\log }_F(t))=v_p(t)$, so it is injective. The target has no nonzero torsion. Therefore reduction is injective on the entire rational torsion subgroup at an odd prime of good reduction, including its $p$-primary part.

For the present elliptic curve, $\Delta =64D^6$, so every odd $p\nmid D$ is a prime of good reduction. If $p\equiv 3(\mathrm{mod}4)$, the Legendre symbol of $-1$ is $-1$. The values $x$ and $-x$ cancel in the sum of the Legendre symbols of $x^3-D^{2}x$, yieldingThe rational torsion subgroup injects into each of these groups, so it is finite and its order $M$ divides every such $p+1$.

For any odd prime $\ell$, the Dirichlet theorem on primes in arithmetic progressions supplies infinitely many $p$ with $p\equiv 3(\mathrm{mod}4)$ and $p\equiv 1(\mathrm{mod}\ell )$. Discard the finitely many dividing $D$. Since $\ell \nmid p+1$, it cannot divide $M$. Similarly choose $p\equiv 3(\mathrm{mod}8)$, again avoiding $D$; then $v_2(p+1)=2$, so $M\mid 4$.

There are already four rational 2-torsion points,which are distinct because a squarefree integer $D$ is nonzero. ThusIts order is four. In fact the argument works for every nonzero integer $D$; squarefreeness is not needed for this torsion conclusion.

For $p\nmid 2k$, the displayed integral equation has nonzero elliptic-curve discriminant modulo $p$, so it has good reduction. Let $\chi$ be the Legendre symbol, with $\chi (0)=0$. Counting the two, one, or zero possible ordinates over each $x$ givesIf $p\equiv 3(\mathrm{mod}4)$, then $\chi (-1)=-1$ and the terms for $x$ and $-x$ cancel. The term at zero vanishes. Thus the count is $p+1$.

For the converse, suppose $p\equiv 1(\mathrm{mod}4)$, and put $h=(p-1)/2$. The Euler criterion and the sum of powers over a finite field show that the Trace of Frobenius satisfiesIndeed, among the positive exponents in this polynomial, of degree $3(p-1)/2<2(p-1)$, only $p-1$ has a nonzero sum over ${\mathbb{F}}_p$, and that sum is $-1$. Since $(x^3+kx{)}^h=x^h(x^2+k{)}^h$, the coefficient formula for trace of Frobenius modulo p yieldsNeither $k$ nor the binomial coefficient vanishes modulo $p$. Hence $a_p\ne 0$, proving the point-count criterion for y squared equals x cubed plus k x:

We use the following formal logarithm fact, also useful for the next part. For a formal group law over ${\mathbb{Z}}_p$, its logarithm has coefficients $c_j/j$ with $c_j\in {\mathbb{Z}}_p$, obtained by integrating its integral invariant differential. If $p$ is odd and $t\in p{\mathbb{Z}}_p\setminus \{0\}$, every term of degree $j\ge 2$ has valuation strictly greater than $v_p(t)$, since $j{v}_p(t)-v_p(j)>v_p(t)$. Thus the logarithm converges and is nonzero at $t$. Its homomorphism into the additive characteristic-zero group proves torsion-freeness of the formal group over Qp for odd p. Consequently reduction injects the entire rational torsion subgroup at any odd prime of good reduction, including its $p$-primary torsion. In particular the torsion subgroup is finite, and its order divides $p+1$ at every good $p\equiv 3(\mathrm{mod}4)$.

By the Dirichlet theorem on primes in arithmetic progressions, choose a good prime $p\equiv 3(\mathrm{mod}8)$. Then $v_2(p+1)=2$, bounding the two-primary part by four. For any odd prime $\ell$ dividing the torsion order, the Chinese remainder theorem and the Dirichlet theorem on primes in arithmetic progressions give a good prime $p$ with $p\equiv 3(\mathrm{mod}4)$ and $p\equiv 1(\mathrm{mod}\ell )$, avoiding the finitely many primes dividing $2k$. But then $\ell \nmid p+1$, a contradiction. Therefore

The order four does occur. For $k=4$, the elliptic-curve addition formula gives $2(2,4)=(0,0)$, so $(2,4)$ has order four. More precisely, the only nonzero rational 2-torsion point when $k>0$ is $(0,0)$, so order four means a cyclic group with a rational half of this point. The duplication formula isSuch a half must have $x(P{)}^2=k$. Writing $k=s^2$, positivity of $y(P{)}^2=2kx(P)$ forces $x(P)=s>0$. Then $y(P{)}^2=2s^3$, so $2s$ is a rational square, equivalently $s=2t^2$ for an integer $t\ge 1$. Conversely $(2t^2,4t^3)$ is a half of $(0,0)$ when $k=4t^4$. The rational torsion on y squared equals x cubed plus positive k x is therefore cyclic of order four exactly for these $k$, and otherwise cyclic of order two.

Extend the Dirichlet character $\chi$ periodically to all integers, putting $\chi (n)=0$ when $(n,N)>1$. Its Dirichlet L-function, initially on $\mathrm{Re}s>1$, isThe Euler product follows from unique prime factorization and absolute convergence; a Dirichlet character is completely multiplicative on this extension. Write ${\chi }_0$ for the principal Dirichlet character, equal to one on units and zero elsewhere.

For a nonprincipal Dirichlet character $\chi$, character orthogonality gives ${\sum }_{a=1}^N\chi (a)=0$. Explicitly, multiplication by a unit $u$ with $\chi (u)\ne 1$ permutes the unit residues and multiplies this sum by $\chi (u)$, forcing it to vanish. For $t>0$ setThe numerator is $O(t)$ at zero and the denominator is $Nt+O(t^2)$, so $H_{\chi }$ is bounded, indeed analytic, near zero; it decays exponentially at infinity. Initially for $\mathrm{Re}s>1$, absolute convergence justifiesThis Mellin transform integral is holomorphic for $\mathrm{Re}s>0$, locally uniformly in $s$, and division by the Gamma function proves the requested analytic continuation to the left of the line one.

In fact, the same argument proves Mellin continuation of a nonprincipal Dirichlet L-function to the entire plane. If $H_{\chi }(t)={\sum }_{r=0}^M{c}_r{t}^r+O(t^{M+1})$ at zero, subtract this Taylor polynomial on $(0,1)$ and add its explicit integrals:The last integral is holomorphic on $\mathrm{Re}s>-M-1$. Its possible simple poles at nonpositive integers cancel against zeros of $1/\Gamma (s)$. Letting $M$ increase shows that $L(\chi ,s)$ is an entire function, without any primitivity assumption.

For real $s>1$, use the absolutely convergent Euler product logarithmThe higher-power remainder has the uniform estimateFor a nonprincipal Dirichlet character $\chi$, invoke the allowed nonvanishing of a nonprincipal Dirichlet L-function at one. Its holomorphy and nonvanishing give a holomorphic logarithm on a small disk about one. On the connected real interval $1<s<1+\eta$, $B_{\chi }(s)$ differs from this logarithm by a fixed element of $2\pi i\mathbb{Z}$: the difference is continuous with exponential one. Thus the prime-character sum near one is bounded. This branch argument is needed for complex-valued Dirichlet characters.

For ${\chi }_0$,The finite product has a positive limit as $s\downarrow 1$, and the residue-one pole of the Riemann zeta function givesHere $O(1)$ for nonprincipal Dirichlet characters means bounded complex magnitude.

Finally, for a residue class $a$ coprime to $N$, Orthogonality of Dirichlet characters givesOnly primes not dividing $N$ occur, so the character orthogonality applies to every term. This sum diverges as $s\downarrow 1$. A finite collection of primes would give a bounded sum, a contradiction. Every reduced residue class contains infinitely many primes. This is the Dirichlet theorem on primes in arithmetic progressions; the coprimality hypothesis is essential.

Dirichlet theorem on primes in arithmetic progressions states that if positive integer $q$ and integer $a$ satisfy $\gcd (a,q)=1$, then infinitely many prime numbers satisfyThe coprimality hypothesis is essential: if $a$ and $q$ have a common factor greater than one, a prime in the progression must divide that factor, giving at most finitely many possibilities.

Both forms have discriminant of a binary quadratic form $-60$. The reduction algorithm for a positive definite binary quadratic form gives $|b|\le a\le c$ and $a\le \sqrt{60/3}<5$ for a reduced positive definite representative. Enumerating $a=1,2,3,4$ givesThe second and fourth forms are imprimitive and represent only even integers. Every odd prime represented by a form of discriminant of a binary quadratic form $-60$ must therefore be represented by $f$ or $g$.

For a prime $p\nmid 30$, quadratic reciprocity givesEvery prime $p\equiv 1(\mathrm{mod}15)$ has this symbol equal to one and hence is represented by one of the two primitive forms, by part (b). But an odd prime represented by $g$ and different from three is $2(\mathrm{mod}3)$, so these primes must be represented by $f$. Similarly, primes $p\equiv 2(\mathrm{mod}15)$ have both symbols equal to $-1$, and are represented by $g$, since a prime represented by $f$ is $1(\mathrm{mod}3)$. Both residue classes are coprime to 15, so Dirichlet theorem on primes in arithmetic progressions proves each form represents infinitely many primes.

The same modulo-three distinction excludes every prime other than three from being represented by both. The form $f$ does not represent three; $g$ represents three and five but neither is represented by $f$, and two is represented by neither. Therefore there are no primes represented by both forms.

A positive integer $D$ is a congruent number when it is the area of a right triangle with positive rational side lengths. For a point $P=(x,y)$ with $y\ne 0$ onthe formulasgive $a^2+b^2=c^2$ and $ab/2=D$, after changing signs if necessary. Conversely, a rational right triangle of area $D$ givesso these constructions are inverse up to the usual sign choices.

It remains to distinguish torsion. If an odd prime $\ell$ divided the order of a rational torsion point, choose by the Dirichlet theorem on primes in arithmetic progressions a good prime $p\equiv 3(\mathrm{mod}4)$ for which $p\not\equiv -1(\mathrm{mod}\ell )$. Part (a) gives $\#E_D({\mathbb{F}}_p)=p+1$, while part (b), applied to the formal group of an elliptic curve, makes reduction injective on $\ell$-power torsion because $\ell$ is a unit in ${\mathbb{Z}}_p$. This is impossible. Similarly, a good prime $p\equiv 3(\mathrm{mod}8)$ shows that the rational $2$-primary torsion has order at most four. Sincealready form the full rational 2-torsion,The triangle construction uses exactly the points with $y\ne 0$, which are therefore nontorsion. By the Mordell-Weil theorem, such a point exists exactly when the free part has positive rank. Hence

By Dirichlet theorem on primes in arithmetic progressions, choose a prime $\ell$ withThe cyclotomic field $E=\mathbb{Q}({\zeta }_{\ell })$ is Galois over $\mathbb{Q}$, andwhere the last group is cyclic because the multiplicative group of a finite field is cyclic.

The cyclic group $C_{\ell -1}$ has a unique subgroup $H$ of order $(\ell -1)/r$. By the Galois correspondence, its fixed field $L=E^H$ satisfiesNormality follows because $H$ lies in an abelian group. Thus every $r>1$ occurs as the Galois group of a finite extension of $\mathbb{Q}$. This is the cyclic Galois extension of the rational numbers of every finite degree.

For nonzero integral $D$, the elliptic curve $E_D:y^2=x^3-D^{2}x$ has rational torsion precisely $O,(0,0),(D,0),(-D,0)$. At every good prime $p\equiv 3(\mathrm{mod}4)$, cancellation of the Legendre symbols at $x$ and $-x$ gives $\#E_D({\mathbb{F}}_p)=p+1$. The torsion-freeness of the formal group over Qp for odd p makes the rational torsion subgroup inject into this group. The Dirichlet theorem on primes in arithmetic progressions excludes odd factors of its order and bounds its two-primary part by four. The four displayed rational 2-torsion points then give equality.

For positive integral $k$, the rational torsion subgroup of $y^2=x^3+kx$ has order dividing four. Indeed, torsion-freeness of the formal group over Qp for odd p, reduction of torsion points on an elliptic curve, and the point-count criterion for y squared equals x cubed plus k x bound its order by $p+1$ at all good primes $p\equiv 3(\mathrm{mod}4)$. The Dirichlet theorem on primes in arithmetic progressions excludes every odd torsion prime and bounds the two-primary part by four, by choosing $p\equiv 3(\mathrm{mod}8)$. There is exactly one nonzero rational 2-torsion point, namely $(0,0)$. A rational half of it must have $x^2=k$ by the elliptic-curve addition formula. Writing $k=s^2$ with $s>0$, its equation is $y^2=2s^3$, so $s=2t^2$ and $k=4t^4$. Conversely $(2t^2,4t^3)$ has order four. Thus the cyclic group of order four occurs exactly for $k=4t^4$, $t\ge 1$. The order bound itself holds for every nonzero integral $k$ of either sign: positivity was used only to classify the rational points of orders two and four.