alphaFeedback

WorksMathematics

Cyclic reductions of elliptic curves at a positive proportion of primes

AI contributions
  • OpenAI ChatGPT GPT-6
View details

Abstract

We prove that every elliptic curve over \Q whose points of order two are not all rational has cyclic reduction at a positive lower density of primes. This is the only necessary restriction: full rational two-torsion prevents cyclic reduction at every odd prime of good reduction. More precisely, a common zero-free half-plane ℜs>1−1/N\Re s>1-1/N for Dedekind zeta functions gives a lower proportion of at least cE/(Nlog⁡N)c_E/(N\log N), with cE>0c_E>0 independent of NN; the theorem of Cureton and Thorner supplies N=32N=32. The proof uses the varying-cofactor sieve of our earlier works on primitive roots and primitive points, in conjunction with the marked Type~II estimates of~OpenAI, to construct candidate primes. We then apply a smoothed explicit formula for Dedekind zeta functions, with nonnegative weights on prime ideals, to bound the number of candidates with noncyclic reduction. This gives a common argument for CM and non-CM curves.

Introduction

In this article, we prove the following theorem.

Theorem 1. Let E/QE/\mathbb{Q} be an elliptic curve whose points of order two are not all rational. Then there exists a positive lower proportion of primes pp such that E(Fp)E(\mathbb{F}_p) is cyclic.

More precisely, let

CE(X)=#{p≤X:p of good reduction for E, E(Fp) cyclic}.C_E(X)=\#\{p\leq X:p\text{ of good reduction for }E,\ E(\mathbb{F}_p)\text{ cyclic}\}.

Then Theorem 1 states that

lim inf⁡X→∞CE(X)π(X)>0.(1)\liminf_{X\to\infty}\frac{C_E(X)}{\pi(X)}>0. \tag*{(1)}

The hypothesis in Theorem 1 is necessary. If all the points of order two are rational, then at every odd prime of good reduction the group E(Fp)E(\mathbb{F}_p) contains a subgroup isomorphic to (Z/2Z)2(\mathbb{Z}/2\mathbb{Z})^2, and so is not cyclic. Thus Theorem 1 gives a necessary and sufficient condition for an elliptic curve over Q\mathbb{Q} to have cyclic reduction at a positive lower proportion of primes.

The study of cyclic reductions of elliptic curves over Q\mathbb{Q} was initiated in the suggestive numerical investigations of Borosh, Moreno, and Porta [3]. A precise density prediction was given by Serre, who stated it in an equivalent Galois-theoretic form in his 1977–1978 course summary [14 pp. 67–68]. For each integer m≥1m\geq1, let Km=Q(E[m])K_m=\mathbb{Q}(E[m]) be the field generated by the coordinates of the mm-torsion points of EE; then Serre predicted that

CE(X)∼δELi⁡(X),δE=∑m≥1μ(m)[Km:Q].(2)C_E(X)\sim\delta_E\operatorname{Li}(X),\qquad\delta_E=\sum_{m\geq1}\frac{\mu(m)}{[K_m:\mathbb{Q}]}. \tag*{(2)}

when K2≠QK_{2} \ne\mathbb{Q}, where Li⁡(X)=∫2Xdtlog⁡t\operatorname{Li}(X) = \int_{2}^{X} \frac{\mathrm{d}t}{\log t}; see also [10 Sections 2, 3, and 5]. Adapting Hooley’s proof of Artin’s conjecture under the generalized Riemann hypothesis [9], Serre established this cyclicity asymptotic under GRH and observed that the density δE\delta_{E} is positive precisely when K2≠QK_{2} \ne\mathbb{Q}. A proof was published by Murty [10 Section 5]. Cojocaru and Murty [6] later obtained sharper error terms in this conditional asymptotic.

For curves with complex multiplication, Murty [10] removed the GRH assumption, using the class field theory of CM curves and a number-field version of the Bombieri–Vinogradov theorem. Cojocaru [5] subsequently gave an even simpler proof with explicit error terms. Thus the positive-proportion conclusion was already known in the CM case.

For general elliptic curves, Gupta and Murty [8] proved that cyclic reduction occurs at infinitely many primes whenever K2≠QK_{2} \ne\mathbb{Q}. More precisely, their theorem gives the unconditional lower bound

CE(X)≫EX(log⁡X)2.C_{E}(X) \gg_{E} \frac{X}{(\log X)^{2}}.

For non-CM curves, Cojocaru [4 Theorem 1.2] proved that the asymptotic (2) follows from the weaker hypothesis that the Dedekind zeta functions of KmK_{m}, for squarefree mm, have no zeros in ℜs>3/4\Re s > 3/4. The zero-free region available to us from Cureton and Thorner [7] is ℜs>31/32\Re s > 31/32, which is weaker and does not supply the hypothesis used by Cojocaru. Our purpose is to obtain the positive-proportion lower bound (1) for every curve with K2≠QK_{2} \ne\mathbb{Q} using this narrower zero-free region.

The analytic framework comes from our earlier works on Artin’s primitive root problem [1] and on primitive points on elliptic curves [2]. The varying-cofactor sieve developed there, using the marked Type II estimates of OpenAI [11, 12], produces primes whose predecessor has the form

p−1=crQ,r≤xϵ,Q>x0.9 prime,q∣r⟹q>Y,(3)p - 1 = crQ,\qquad r \le x^{\epsilon},\qquad Q > x^{0.9}\ \text{prime},\qquad q \mid r \Longrightarrow q > Y, \tag*{(3)}

where x<p<2xx < p < 2x, cc is a fixed power of two, and ϵ>0\epsilon> 0 and YY are fixed before xx tends to infinity. In a suitable fixed arithmetic progression, the number of these primes is at least a constant times

ϵlog⁡Yxlog⁡x.\frac{\epsilon}{\log Y}\frac{x}{\log x}.

Allowing the cofactor rr to vary supplies the additional logarithm needed for a positive proportion. The uniformity in ϵ\epsilon and YY will also be important.

To use these primes, recall that E(Fp)E(\mathbb{F}_{p}) fails to be cyclic precisely when pp splits completely in KℓK_{\ell} for some prime ℓ≠p\ell\ne p. Such an ℓ\ell divides p−1p - 1 and satisfies ℓ2∣#E(Fp)\ell^{2} \mid\#E(\mathbb{F}_{p}). We choose the progression to exclude complete splitting in K2K_{2}. Hasse’s bound excludes the distinguished large prime QQ in (3). Every remaining obstruction therefore comes from a prime

Y<ℓ≤xϵ.Y < \ell\le x^{\epsilon}.

This observation makes the predecessor p−1p - 1 useful for arbitrary elliptic curves, even though their group orders need not have any fixed form.

The degree of KℓK_{\ell} is ≫Eℓ2\gg_{E} \ell^{2}, and its logarithmic root discriminant is ≪Elog⁡ℓ\ll_{E} \log\ell. We apply the explicit formula for its Dedekind zeta function with a nonnegative smooth weight that is at least one on the interval being counted. Every completely split prime pp in this interval contributes at least [Kℓ:Q]log⁡p[K_{\ell}:\mathbb{Q}]\log p to the resulting nonnegative sum, so a zero-free half-plane gives an upper bound for the number of such primes. We count these exceptional primes among all primes and subtract them from the candidate set. Thus the argument needs no joint distribution statement for the cofactor condition and the division fields. Both the cofactor construction and this smoothed prime-ideal bound are taken from [2]; we give the predecessor version of the construction and the division-field deduction explicitly.

We retain the width of the zero-free half-plane as a parameter in order to make its effect on the lower bound explicit. The quantitative result from which Theorem 1 follows is the following.

Theorem 2. Let E/QE/\mathbb{Q} be an elliptic curve with Q(E[2])≠Q\mathbb{Q}(E[2]) \ne\mathbb{Q}. Suppose that, for some fixed real N≥2N \ge2, every Dedekind zeta function has no zeros in the half-plane

ℜs>1−1N.(4)\Re s > 1 - \frac{1}{N}. \tag*{(4)}

Then there is a constant cE>0c_E > 0, depending only on EE and independent of NN, such that

CE(2x)−CE(x)≥cENlog⁡Nxlog⁡x(5)C_E(2x) - C_E(x) \ge\frac{c_E}{N\log N}\frac{x}{\log x} \tag*{(5)}

for all sufficiently large xx. The threshold may depend on EE and NN, but cEc_E does not depend on NN. After decreasing cEc_E if necessary, we also have

lim inf⁡X→∞CE(X)π(X)≥cENlog⁡N.(6)\liminf_{X\to\infty}\frac{C_E(X)}{\pi(X)} \ge\frac{c_E}{N\log N}. \tag*{(6)}

Cureton and Thorner [7 Theorem 1.1] prove that every Dedekind zeta function has no zeros in ℜs>31/32\Re s > 31/32. Their theorem therefore supplies N=32N = 32 in Theorem 2.

This paper is organized as follows. In § 2, we recall the division-field criterion for cyclicity and construct the required arithmetic progression. In § 3, we deduce the prime-predecessor estimate from the cofactor sieve of [2], recording the changes of sign and the required uniformity. In § 4, we establish the division-field bounds and apply the smoothed prime-ideal bound to count completely split primes. Finally, in § 5, we remove the remaining obstructions and prove Theorems 1 and 2.

Notation. Throughout the paper, the letters pp, qq, ℓ\ell denote rational primes unless otherwise specified. We use P−(r)P^{-}(r) for the least prime divisor of an integer r>1r > 1, and set P−(1)=∞P^{-}(1) = \infty. All constants allowed to depend on EE may also depend on the fixed progression chosen for EE. The parameters NN, ϵ\epsilon, and YY are fixed before xx tends to infinity.

Cyclicity and a fixed arithmetic progression

We begin with the standard criterion that connects cyclic reduction to complete splitting. Let RER_E denote the product of the primes of bad reduction of EE.

Lemma 3. Let p≥3p \ge3 be a prime of good reduction for EE. The group E(Fp)E(\mathbb{F}_p) is noncyclic if and only if pp splits completely in Kℓ=Q(E[ℓ])K_\ell= \mathbb{Q}(E[\ell]) for some prime ℓ≠p\ell\ne p. Every such ℓ\ell satisfies

ℓ∣p−1,ℓ2∣#E(Fp),ℓ≤p+1.(7)\ell\mid p - 1,\qquad\ell^2 \mid\#E(\mathbb{F}_p),\qquad\ell\le\sqrt{p}+1. \tag*{(7)}

Proof. A noncyclic finite abelian group contains a subgroup isomorphic to (Z/ℓZ)2(\mathbb{Z}/\ell\mathbb{Z})^2 for some prime ℓ\ell. Hasse’s bound gives

#E(Fp)≤(p+1)2<p2(p≥3),\#E(\mathbb{F}_p) \le(\sqrt{p}+1)^2 < p^2 \qquad(p \ge3),

so such an ℓ\ell cannot equal pp. For ℓ≠p\ell\ne p, good reduction identifies E[ℓ]E[\ell] with the geometric ℓ\ell-torsion of the reduction. Thus E(Fp)E(\mathbb{F}_p) contains (Z/ℓZ)2(\mathbb{Z}/\ell\mathbb{Z})^2 if and only if Frobenius acts trivially on E[ℓ]E[\ell], i.e., if and only if pp splits completely in KℓK_\ell. The Weil pairing gives ℓ∣p−1\ell\mid p - 1, and the remaining assertions follow from the subgroup and Hasse’s bound. These facts may also be found in [16]. ∎

The progression must exclude complete splitting in K2K_2 while leaving every odd prime divisor of its modulus coprime to p−1p-1. The following observation gives this compatibility.

Lemma 4. Let χ\chi be a nontrivial Dirichlet character of conductor ff. There is a unit aa mod ff such that χ(a)≠1\chi(a) \ne1 and

a≢1(modq)for every odd prime q∣f.a \not\equiv1 \pmod{q} \qquad\text{for every odd prime }q \mid f.

Proof. Write χ=∏qe∥fχq\chi= \prod_{q^{e}\Vert f}\chi_q by the Chinese remainder theorem. For an odd prime q∣fq \mid f, let AqA_q be the units modulo qeq^e that are not congruent to 11 modulo qq; for q=2q=2, let A2A_2 be the full group of units modulo 2e2^e. Suppose that χ\chi is identically 11 on the product of these sets. Fixing all but one coordinate shows that each χq\chi_q is constant on AqA_q.

The component at two, if present, is therefore trivial. For odd qq, multiplication by any unit congruent to 11 modulo qq preserves AqA_q, so constancy forces χq\chi_q to be trivial on the kernel of reduction modulo qq. Hence it descends to a character of Fq×\mathbb{F}_q^\times that is constant, say with value zz, away from 11. If this character is nontrivial, character orthogonality gives

0=1+(q−2)z.0=1+(q-2)z.

Since ∣z∣=1|z|=1, this is possible only for q=3q=3, with z=−1z=-1. It follows that either every local character is trivial, contrary to the hypothesis, or the only nontrivial local character is the quadratic character modulo 33. In the latter case the product is constantly −1-1 on the indicated set, again a contradiction.

Lemma 5. Suppose K2≠QK_2 \ne\mathbb{Q}. There are fixed positive integers M,cM,c and an integer uu, with cc a power of two, such that

c∣M,2∣M/c,(u,M)=1,c∣u−1,(u−1c,Mc)=1,(8)c\mid M,\qquad2\mid M/c,\qquad(u,M)=1,\qquad c\mid u-1,\qquad\left(\frac{u-1}{c},\frac{M}{c}\right)=1, \tag*{(8)}

and every prime p≡u(modM)p\equiv u\pmod{M} is of good reduction and does not split completely in K2K_2. The modulus MM may also be required to be divisible by any prescribed finite set of primes.

Proof. The nontrivial group Gal⁡(K2/Q)\operatorname{Gal}(K_2/\mathbb{Q}) is a subgroup of S3S_3. It is therefore isomorphic to C2C_2, C3C_3, or S3S_3, and has a nontrivial cyclic quotient of order two or three. Consequently K2K_2 contains an abelian extension F/QF/\mathbb{Q} of degree two or three. By the Kronecker–Weber theorem, there is a nontrivial Dirichlet character χ\chi of conductor ff such that a prime p∤fp\nmid f splits completely in FF if and only if χ(p)=1\chi(p)=1.

Choose a residue aa mod ff as in Lemma 4, and choose an odd integer representative a≠1a\ne1. Put k=v2(a−1)≥1k=v_2(a-1)\ge1 and c=2kc=2^k. Take MM divisible by ff, 2k+12^{k+1}, RER_E, and the prescribed primes. By the Chinese remainder theorem, extend aa mod ff to a class uu mod MM, retaining aa mod 2k+12^{k+1} and choosing a residue different from 00 and 11 at every newly introduced odd prime. We may take the exponents at these new odd primes to be one.

Then (u,M)=1(u,M)=1, v2(u−1)=kv_2(u-1)=k, and no odd prime dividing MM divides u−1u-1. These are exactly the conditions in (8). Moreover, a prime p≡u(modM)p\equiv u\pmod{M} does not divide RER_E and satisfies χ(p)=χ(a)≠1\chi(p)=\chi(a)\ne1. It therefore has good reduction and does not split completely in FF, or in K2K_2.

Fix such M,c,uM,c,u for the remainder of the paper. In particular, cc is precisely the power of two dividing p−1p-1 for primes in this progression. The choices depend only on EE.

Prime predecessors with a small cofactor

We use the varying-cofactor sieve of [2] in its predecessor form. That sieve counts primes p≡u(modM)p \equiv u \pmod{M} with p−1=crQp-1=crQ as in (3) by weighting integers dd with Fx(d−1)W(d−1)F_x(d-1)W(d-1): the selector FxF_x records the required factorization, and the marks WW are what make the marked Type II estimates applicable. Summing over the cofactors rr with their marked weights gives a weighted harmonic mass comparable to ϵlog⁡x/log⁡Y\epsilon\log x/\log Y, producing the extra logarithm. The analytic input is the marked Type II estimate of [11 Theorem 3.1], together with the coefficient criterion and rough-factor replacement of [12 Lemma 10.2 and Proposition 10.3]. The arithmetic-progression and smoothing deductions, and the uniformity over invariant selectors and dyadic intervals, are in [2 Proposition 5].

Proposition 6. Fix M,c,uM,c,u satisfying (8). There are constants A>0A>0, ϵ0>0\epsilon_0>0, and Y0≥3Y_0\ge3, depending only on this fixed progression, with the following property. For every fixed 0<ϵ<ϵ00<\epsilon<\epsilon_0 and Y≥Y0Y\ge Y_0, the set

C(x;ϵ,Y)={x<p<2x:p≡u(modM), p−1=crQ, r≤xϵ, Q>x0.9 prime, P−(r)>Y}(9)C(x;\epsilon,Y)=\{x<p<2x:p\equiv u\pmod{M},\ p-1=crQ,\ r\le x^\epsilon,\ Q>x^{0.9}\ \text{prime},\ P^{-}(r)>Y\} \tag*{(9)}

satisfies

#C(x;ϵ,Y)≥Aϵlog⁡Yxlog⁡x(10)\#C(x;\epsilon,Y)\ge A\frac{\epsilon}{\log Y}\frac{x}{\log x} \tag*{(10)}

for all sufficiently large xx. The threshold may depend on ϵ\epsilon and YY, but AA, ϵ0\epsilon_0, and Y0Y_0 do not.

Proof. Proposition 4 of [2] is the corresponding statement for prime successors, with p+1=crQp+1=crQ and u+1u+1 in the progression conditions. We record the changes in its proof, which is given in Section 3 of that paper.

Use the same family of cofactors, marked weight WW, and invariant selector FxF_x. If P\mathcal{P} is the set of marked primes and hPh_{\mathcal{P}} is the largest divisor of hh supported on P\mathcal{P}, the selector has the form

Fx(h)=1{h/hP=cr0Q for some r0∈Rx, Q>x0.9 prime},F_x(h)=1_{\{h/h_{\mathcal{P}}=cr_0Q\ \text{for some }r_0\in\mathcal{R}_x,\ Q>x^{0.9}\ \text{prime}\}},

where Rx\mathcal{R}_x is the cofactor family constructed there. In particular, Fx(ℓh)=Fx(h)F_x(\ell h)=F_x(h) for every marked prime ℓ\ell, including when ℓ∣h\ell\mid h. Replace the weight on integers dd by

w(d)=1d≡u (M)Ψ(d/x)Fx(d−1)W(d−1),(11)w(d)=1_{d\equiv u\ (M)}\Psi(d/x)F_x(d-1)W(d-1), \tag*{(11)}

where 0≤Ψ≤10\le\Psi\le1 is smooth, supported in (1,2)(1,2), and has ∫Ψ>0\int\Psi>0. On its support, d=crQ+1d=crQ+1, in place of crQ−1crQ-1. The required marked replacement is [2 Proposition 5] with σ=1\sigma=1, the original sign in [11, 12]. Its constants are uniform over the invariant selectors and all dyadic intervals in the fixed exponent ranges used in the sieve.

Put M0=M/cM_0=M/c. The progression for the prime variable QQ becomes

Q≡((u−1)/c)r−1(modM0).(12)Q\equiv((u-1)/c)r^{-1}\pmod{M_0}. \tag*{(12)}

Take Y0Y_0 larger than every prime divisor of MM. Then (r,M)=1(r,M)=1, and (12) is a reduced residue class. For an odd prime ℓ∤Mr\ell\nmid Mr, the condition ℓ∣crQ+1\ell\mid crQ+1 excludes the single nonzero residue Q≡−(cr)−1(modℓ)Q\equiv-(cr)^{-1}\pmod{\ell}. If ℓ∣Mr\ell\mid Mr, no permitted residue is excluded. Thus the multiplicative sieve density remains

gr(d)=1(d,Mr)=1φ(d)(d odd and squarefree).(13)g_r(d)=\frac{1_{(d,Mr)=1}}{\varphi(d)} \qquad(d\ \text{odd and squarefree}). \tag*{(13)}

The distribution estimate of [2 Lemma 7] follows unchanged from Bombieri–Vinogradov, which is uniform over reduced residue classes. The smooth main integral has log⁡((xy−1)/(cr))\log((xy-1)/(cr)) in place of log⁡((xy+1)/(cr))\log((xy+1)/(cr)) in its denominator; all comparisons used there are identical.

In the rough-pair estimate of [2 Lemma 8], the congruence is now mn≡1(modcr)mn \equiv1 \pmod{cr}, which has φ(cr)\varphi(cr) solutions in pairs of residue classes. At an odd sieving prime ℓ∤cr\ell\nmid cr, the conditions mn≡1(modℓ)mn \equiv1 \pmod{\ell} and mn≡0(modℓ)mn \equiv0 \pmod{\ell} have, respectively, ℓ−1\ell- 1 and 2ℓ−12\ell- 1 solutions, and these sets are disjoint. Hence the local counts and the resulting bound are unchanged, including the independence of its constant from the number of marked groups.

The cofactor mass and tail estimates involve only the factorization of d−1d - 1 and are otherwise the same. Their full harmonic mass is ≫Kϵlog⁡x/log⁡Y\gg_K \epsilon\log x / \log Y, where KK is the number of marked groups. The cutoff r≤xϵr \le x^\epsilon is imposed by discarding the negligible tail after the marked estimates; it is not inserted into FxF_x, since doing so would destroy its invariance. The block sieve, Buchstab subtraction, and removal of the remaining semiprimes therefore give the same lower bound as in [2 Proposition 4]. As in the last subsection of its § 3, first fix all sieve parameters and KK using only the progression, and then choose ϵ\epsilon and YY. The boundedness of the marked weights converts the weighted lower bound into (10), with a constant independent of these two parameters.

The proof uses only the analytic estimates and cofactor construction of [2]; the elliptic curve and rational point considered there play no role in Proposition 6. In particular, the proposition applies to the progression of Lemma 5 for an arbitrary elliptic curve satisfying K2≠QK_2 \ne\mathbb{Q}.

Completely split primes in division fields

For a prime ℓ\ell, put

nℓ=[Kℓ:Q],Dℓ=∣disc⁡(Kℓ)∣.n_\ell= [K_\ell: \mathbb{Q}], \qquad D_\ell= \lvert\operatorname{disc}(K_\ell) \rvert.

The following familiar bounds allow us to treat CM and non-CM curves together.

Lemma 7. For every prime ℓ\ell,

nℓ≫Eℓ2,log⁡Dℓnℓ≪Elog⁡(2ℓ).(14)n_\ell\gg_E \ell^2, \qquad\frac{\log D_\ell}{n_\ell} \ll_E \log(2\ell). \tag*{(14)}

Proof. If EE has no complex multiplication, Serre’s open image theorem [13 Théorème 2] gives

Gal⁡(Kℓ/Q)=GL⁡2(Fℓ)\operatorname{Gal}(K_\ell/\mathbb{Q}) = \operatorname{GL}_2(\mathbb{F}_\ell)

for all sufficiently large ℓ\ell. Hence nℓ≍ℓ4n_\ell\asymp\ell^4 in this case. If EE has complex multiplication by an order O\mathcal{O} in an imaginary quadratic field FF, the main theorem of complex multiplication gives an image of bounded index, depending only on EE, in (O/ℓO)×(\mathcal{O}/\ell\mathcal{O})^\times over FF; see [17 Chapter II]. Outside a fixed finite set of primes, this group has order (ℓ−1)2(\ell- 1)^2 or ℓ2−1\ell^2 - 1. Since

[F(E[ℓ]):F]=[Kℓ:Kℓ∩F]≤nℓ,[F(E[\ell]) : F] = [K_\ell: K_\ell\cap F] \le n_\ell,

we obtain nℓ≫Eℓ2n_\ell\gg_E \ell^2. Enlarging the implied constant accommodates the finitely many remaining primes in either case.

For the discriminant, the Néron–Ogg–Shafarevich criterion gives

rad⁡(Dℓ)∣ℓRE,\operatorname{rad}(D_\ell) \mid\ell R_E,

and the faithful action on E[ℓ]E[\ell] gives nℓ≤∣GL⁡2(Fℓ)∣<ℓ4n_\ell\le\lvert\operatorname{GL}_2(\mathbb{F}_\ell) \rvert< \ell^4. The general discriminant bound for a Galois extension [15 Proposition 6] is

log⁡Dℓ≤(nℓ−1)log⁡rad⁡(Dℓ)+nℓlog⁡nℓ.\log D_\ell\le(n_\ell- 1)\log\operatorname{rad}(D_\ell) + n_\ell\log n_\ell.

Consequently,

log⁡Dℓnℓ≤log⁡RE+5log⁡ℓ,\frac{\log D_{\ell}}{n_{\ell}} \le\log R_E + 5\log\ell,

which proves the second bound.

We next recall the consequence of the smoothed explicit formula needed here. For a number field TT, let ΛT\Lambda_T be the von Mangoldt function on its nonzero integral ideals: ΛT(pj)=log⁡Np\Lambda_T(\mathfrak{p}^j)=\log N\mathfrak{p} for a prime ideal p\mathfrak{p} and j≥1j\ge1, and ΛT\Lambda_T is zero otherwise. We choose a nonnegative smooth weight, so that discarding unwanted prime ideals can only decrease the sum.

Lemma 8 (Smoothed prime-ideal bound). Let TT be a number field of degree nn and absolute discriminant DTD_T. Suppose that all nontrivial zeros of ζT\zeta_T have real part at most 1−δ1-\delta, where 0<δ≤1/20<\delta\le1/2. Fix a nonnegative smooth function ff supported in (1/2,3)(1/2,3) and at least one on [1,2][1,2]. Then

∑aΛT(a)f(Na/x)≪fx+x1−δ(log⁡DT+n)(x≥2),(15)\sum_{\mathfrak{a}}\Lambda_T(\mathfrak{a})f(N\mathfrak{a}/x)\ll_f x+x^{1-\delta}(\log D_T+n)\qquad(x\ge2), \tag*{(15)}

with an implied constant independent of TT and δ\delta.

Proof. This is [2 Lemma 10]. We recall why its uniformity does not cost a factor depending on 1/δ1/\delta. If f^\widehat{f} is the Mellin transform of ff, the smoothed explicit formula gives a pole term xf^(1)x\widehat{f}(1), a zero term

−∑ρxρf^(ρ),-\sum_{\rho}x^\rho\widehat{f}(\rho),

and a remaining contribution Of(log⁡DT+n)O_f(\log D_T+n) for x≥2x\ge2. Smoothness and the usual zero count give

∑ρ∣f^(ρ)∣≪flog⁡DT+n.\sum_{\rho}|\widehat{f}(\rho)|\ll_f\log D_T+n.

The zero-free hypothesis bounds each ∣xρ∣|x^\rho| by x1−δx^{1-\delta}, proving (15) with the asserted uniformity.

Proposition 9. Let N≥2N\ge2 be real, and suppose that every Dedekind zeta function has no zeros in ℜs>1−1/N\Re s>1-1/N. Let

Bℓ(x)=#{x<p<2x:p splits completely in Kℓ}.B_{\ell}(x)=\#\{x<p<2x:p\text{ splits completely in }K_{\ell}\}.

Then

Bℓ(x)≪Exℓ2log⁡x+x1−1/Nlog⁡(2ℓ)log⁡x.(16)B_{\ell}(x)\ll_E\frac{x}{\ell^2\log x}+\frac{x^{1-1/N}\log(2\ell)}{\log x}. \tag*{(16)}

Consequently, for Y≥3Y\ge3 and z≥2z\ge2,

∑Y<ℓ≤zBℓ(x)≪ExYlog⁡Ylog⁡x+x1−1/Nzlog⁡x.(17)\sum_{Y<\ell\le z}B_{\ell}(x)\ll_E\frac{x}{Y\log Y\log x}+\frac{x^{1-1/N}z}{\log x}. \tag*{(17)}

All implied constants are independent of NN, YY, and zz.

Proof. Choose ff as in Lemma 8, fixed once and for all. A completely split prime p∈(x,2x)p\in(x,2x) gives nℓn_{\ell} distinct prime ideals of norm pp in KℓK_{\ell}, and hence contributes at least nℓlog⁡xn_{\ell}\log x to the nonnegative sum in (15). Applying that lemma with δ=1/N\delta=1/N and dividing by nℓlog⁡xn_{\ell}\log x gives

Bℓ(x)≪xnℓlog⁡x+x1−1/Nlog⁡x(log⁡Dℓnℓ+1).B_{\ell}(x)\ll\frac{x}{n_{\ell}\log x}+\frac{x^{1-1/N}}{\log x}\left(\frac{\log D_{\ell}}{n_{\ell}}+1\right).

Lemma 7 proves (16). Finally, the elementary prime estimates

∑ℓ>Y1ℓ2≪1Ylog⁡Y,∑ℓ≤zlog⁡(2ℓ)≪z\sum_{\ell>Y}\frac{1}{\ell^2}\ll\frac{1}{Y\log Y},\qquad\sum_{\ell\le z}\log(2\ell)\ll z

give (17). The first follows by partial summation from π(t)≪t/log⁡t\pi(t)\ll t/\log t, and the second is Chebyshev’s bound.

The factor nℓn_\ell contributed by a completely split prime is essential: it leaves only the logarithmic root discriminant in the error term. We have used the explicit formula for the Dedekind zeta function itself, so no separate effective Chebotarev theorem is required.

Proof of the main theorems

Let E/QE/\mathbb{Q} satisfy K2≠QK_2\ne\mathbb{Q}, and fix the progression of Lemma 5. We may decrease ϵ0\epsilon_0 in Proposition 6 so that ϵ0<1/10\epsilon_0<1/10. Fix, for the moment, 0<ϵ<ϵ00<\epsilon<\epsilon_0 and Y≥Y0Y\ge Y_0.

Suppose p∈C(x;ϵ,Y)p\in\mathcal{C}(x;\epsilon,Y) and E(Fp)E(\mathbb{F}_p) is noncyclic. By Lemma 3, pp splits completely in KℓK_\ell for some prime ℓ≠p\ell\ne p satisfying (7). The progression excludes ℓ=2\ell=2. Since

ℓ∣p−1=crQ\ell\mid p-1=crQ

and cc is a power of two, either ℓ∣r\ell\mid r or ℓ=Q\ell=Q. For all sufficiently large xx, the latter is impossible, because

Q>x0.9>2x+1≥p+1.Q>x^{0.9}>\sqrt{2x+1}\ge\sqrt{p}+1.

Thus ℓ∣r\ell\mid r and

Y<ℓ≤r≤xϵ.(18)Y<\ell\le r\le x^\epsilon. \tag*{(18)}

Suppose that every Dedekind zeta function has no zeros in ℜs>1−1/N\Re s>1-1/N, for a fixed real N≥2N\ge2. Proposition 9 therefore shows that the number of noncyclic candidates is at most

C1xYlog⁡Ylog⁡x+C2x1−1/N+ϵlog⁡x.(19)C_1\frac{x}{Y\log Y\log x}+C_2\frac{x^{1-1/N+\epsilon}}{\log x}. \tag*{(19)}

where C1,C2C_1,C_2 depend only on EE. Combining (10) and (19), we obtain

CE(2x)−CE(x)≥(Aϵlog⁡Y−C1Ylog⁡Y−C2x−1/N+ϵ)xlog⁡x(20)C_E(2x)-C_E(x)\ge\left(\frac{A\epsilon}{\log Y}-\frac{C_1}{Y\log Y}-C_2x^{-1/N+\epsilon}\right)\frac{x}{\log x} \tag*{(20)}

for all sufficiently large xx, with the threshold permitted to depend on the fixed parameters. We now choose these parameters, keeping the dependence on NN explicit. Fix

0<α<min⁡(1,2ϵ0)0<\alpha<\min(1,2\epsilon_0)

and then fix B≥2B\ge2, depending only on EE, so large that

2B≥Y0,C1B≤Aα4.2B\ge Y_0,\qquad\frac{C_1}{B}\le\frac{A\alpha}{4}.

For each fixed N≥2N\ge2, put

ϵ=αN,Y=BN.(21)\epsilon=\frac{\alpha}{N},\qquad Y=BN. \tag*{(21)}

These choices are admissible in Proposition 6. The second term in parentheses in (20) is at most one quarter of the first. Moreover,

x−1/N+ϵ=x−(1−α)/N⟶0(x→∞),x^{-1/N+\epsilon}=x^{-(1-\alpha)/N}\longrightarrow0 \qquad(x\to\infty),

so for all sufficiently large xx the third term is also at most one quarter of the first. We conclude that

CE(2x)−CE(x)≥Aα2Nlog⁡(BN)xlog⁡x.(22)C_E(2x)-C_E(x)\ge\frac{A\alpha}{2N\log(BN)}\frac{x}{\log x}. \tag*{(22)}

Since N≥2N\ge2,

log⁡(BN)≤(1+log⁡Blog⁡2)log⁡N.\log(BN)\le\left(1+\frac{\log B}{\log2}\right)\log N.

The constant

dE=Aα2(1+log⁡B/log⁡2)>0d_E=\frac{A\alpha}{2(1+\log B/\log2)}>0

is independent of NN, and (22) proves (5) with dEd_E in place of cEc_E.

For the lower proportion, apply this bound with x=X/2x=X/2 and use the prime number theorem. It gives

lim inf⁡X→∞CE(X)π(X)≥dE2Nlog⁡N.\liminf_{X\to\infty}\frac{C_E(X)}{\pi(X)}\ge\frac{d_E}{2N\log N}.

Taking cE=dE/2c_E=d_E/2 proves both assertions of Theorem 2. The zero-free half-plane ℜs>31/32\Re s>31/32 of Cureton and Thorner now proves Theorem 1.

The argument isolates a set of primes on which every obstruction to cyclicity lies in the short range (18). It does not evaluate the full inclusion-exclusion sum in (2), or prove an asymptotic with that constant. Its conclusion is a positive lower proportion, uniformly expressed in terms of the available zero-free width.

Formal verification. The accompanying Lean development verifies the positive-proportion argument for integral Weierstrass models of elliptic curves from explicit analytic and arithmetic inputs. It proves the construction of the fixed progression and shows that, among the candidate primes, every obstruction to cyclicity—a subgroup (Z/ℓZ)2(\mathbb{Z}/\ell\mathbb{Z})^2 in E(Fp)E(\mathbb{F}_p), corresponding to complete splitting in KℓK_\ell—has Y<ℓ≤xϵY<\ell\le x^\epsilon. The bound for these exceptional primes, their subtraction, and the final parameter choice are proved within the development. The formal theorem gives cE/(Nlog⁡N)c_E/(N\log N), with cE>0c_E>0 chosen before NN, including the lower-proportion conclusion and its specialization to N=32N=32.

The analytic inputs are the zero-free hypothesis supplied by [7], the candidate-prime estimate from [1, 2], the prime number theorem, the elementary prime-sum estimates, and the smoothed prime-ideal bound of Lemma 8. The last bound is proved in [2 Lemma 10] from Mellin inversion, the Dedekind zeta functional equation, and the standard zero count, with a constant independent of the field and the zero-free width. It is an explicit hypothesis in Lean because that analytic derivation has not been formalized. The arithmetic inputs are standard facts about torsion, reduction, and division fields. These inputs are supplied as explicit hypotheses; Lean checks the deductions from them. The development records its assumptions and references explicitly, and its completed build has no proof placeholders or added global axioms.

The Lean sources for [1], [2], and the current article are available at https://github.com/bhargavamanjul/FormalizedProofs/.

Acknowledgments

I thank Peter Sarnak, Paul Pollack, and Jesse Thorner for helpful conversations. GPT-6 was used to help write and formalize the arguments. The author was supported by the National Science Foundation (Grant DMS-1001828).

References

  1. [1]M. Bhargava, Every nonsquare integer not equal to −1 is a primitive root modulo a positive lower density of primes, Hexagon preprint 2610.00228v1, October 2026. Preprint.
  2. [2]M. Bhargava, Rational points on elliptic curves that are primitive modulo a positive proportion of primes, Hexagon preprint 2610.00294v1, October 2026. Preprint.
  3. [3]I. Borosh, C. J. Moreno, and H. Porta, Elliptic curves over finite fields. II, Math. Comp. 29 (1975), no. 131, 951–964. Article.DOI
  4. [4]A. C. Cojocaru, On the cyclicity of the group of Fₚ-rational points of non-CM elliptic curves, J. Number Theory 96 (2002), no. 2, 335–350. doi:10.1006/jnth.2002.2789.DOI
  5. [5]A. C. Cojocaru, Cyclicity of CM elliptic curves modulo p, Trans. Amer. Math. Soc. 355 (2003), no. 7, 2651–2662. doi:10.1090/S0002-9947-03-03283-5.DOI
  6. [6]A. C. Cojocaru and M. Ram Murty, Cyclicity of elliptic curves modulo p and elliptic curve analogues of Linnik’s problem, Math. Ann. 330 (2004), no. 3, 601–625. doi:10.1007/s00208-004-0562-x.DOI
  7. [7]D. Cureton and J. Thorner, A quasi-Riemann hypothesis for Dedekind zeta functions, Hexagon preprint 2610.00200v2, October 2026. Preprint.
  8. [8]R. Gupta and M. Ram Murty, Cyclicity and generation of points mod p on elliptic curves, Invent. Math. 101 (1990), no. 1, 225–235. doi:10.1007/BF01231502.DOI
  9. [9]C. Hooley, On Artin’s conjecture, J. Reine Angew. Math. 225 (1967), 209–220.
  10. [10]M. Ram Murty, On Artin’s conjecture, J. Number Theory 16 (1983), no. 2, 147–168. doi:10.1016/0022-314X(83)90039-2.DOI
  11. [11]OpenAI, The Poisson–Dirichlet law for prime predecessors, preprint, 24 September 2026, Theorem 3.1 and Sections 3–5; version consulted: repository commit 1581d4cbdd69. Preprint.hub.valency.io/works/W_czsttptq
  12. [12]OpenAI, Primitive roots for every admissible integer base, preprint, 4 October 2026, Lemma 10.2, Proposition 10.3, and Section 12; version consulted: repository commit 1581d4cbdd69. Preprint.hub.valency.io/works/W_c5c99wuv
  13. [13]J.-P. Serre, Propriétés galoisiennes des points d’ordre fini des courbes elliptiques, Invent. Math. 15 (1972), 259–331. doi:10.1007/BF01405086.DOI
  14. [14]J.-P. Serre, Résumé des cours de 1977–1978, Annuaire du Collège de France (1978), 67–70. Original course summary.
  15. [15]J.-P. Serre, Quelques applications du théorème de densité de Chebotarev, Publ. Math. IHES 54 (1981), 123–201. Numdam.
  16. [16]J. H. Silverman, The Arithmetic of Elliptic Curves, second edition, Graduate Texts in Mathematics 106, Springer, 2009.
  17. [17]J. H. Silverman, Advanced Topics in the Arithmetic of Elliptic Curves, Graduate Texts in Mathematics 151, Springer, 1994.DOI

Paper details

vlnc:W_3dwvdqrp
v1 · latestHistory (1)

published · Fresh — published within the last 30 days

Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

OpenAI ChatGPT GPT-6 · View statement →

Looking for related papers…
Contents