Square specialisation
For the proposed cubic 𝑓(𝑇) =𝑇3 −𝑇 +6𝑐/𝑚, the recurrence will
force 𝑟2 −1 to be a square whenever
𝑟 is a root modulo a good prime. We
need the same conclusion for an algebraic root 𝛼 in ℚ(𝛼). The issue is that a putative
square root could lie in a quadratic extension of this field. Its
nontrivial automorphism would fix 𝛼 and change the sign of the square
root. Chebotarev supplies a prime with exactly that behaviour,
contradicting the finite-field condition. The following lemma isolates
this passage; in the cubic application we take 𝐻(𝑇) =𝑇2 −1.
Lemma 2.7 (square specialisation). Let 𝑓 ∈ℚ[𝑇] be irreducible with root 𝛼, and let 𝐻 ∈ℚ[𝑇] satisfy 𝐻(𝛼) ≠0. If for all but finitely
many primes ℓ every root 𝑟 ∈𝔽ℓ of the reduction of
𝑓 has 𝐻(𝑟) a square in 𝔽×ℓ, then 𝐻(𝛼) is a square in ℚ(𝛼)×.
Proof. Suppose that 𝐻(𝛼) is a nonsquare in 𝐾 =ℚ(𝛼), and choose 𝛽 with 𝛽2 =𝐻(𝛼). The nontrivial
automorphism of the quadratic extension 𝐾(𝛽)/𝐾 extends to an element 𝜎 ∈Gal(𝐿/𝐾) for a
finite Galois extension 𝐿/ℚ
containing 𝐾(𝛽). In particular
𝜎𝛼 =𝛼 and 𝜎𝛽 = −𝛽.
By Chebotarev’s density theorem in the form stated by Stevenhagen and
Lenstra [10], infinitely many unramified
rational primes have Frobenius conjugate to 𝜎. Only infinitude is needed. We
discard the exceptional primes in the hypothesis and the finitely many
primes at which coefficients, 𝛼 or 𝛽 have denominators, together with
2 and the primes at which 𝛽 reduces to zero. Above each
remaining prime ℓ, choose a
prime of 𝐿 whose Frobenius is 𝜎. Its residue field then satisfies
――𝛼ℓ=――𝛼,――𝛽ℓ=−――𝛽≠――𝛽.
Thus
――𝛼 ∈𝔽ℓ
is a root of the reduction of 𝑓.
Neither of the two roots ±――𝛽 of 𝑋2 −𝐻(――𝛼) is fixed by
Frobenius, so neither belongs to 𝔽ℓ. Hence 𝐻(――𝛼) is a nonsquare there,
contradicting the hypothesis. ◻
An alternative proof of Lemma 2.7 uses zeta
functions. A nonsquare algebraic integer 𝑏 in a number field 𝐾 is nonsquare modulo infinitely many
degree-one primes of 𝐾. The
underlying zeta-function argument first gives zero or a nonsquare. The
zero case is excluded beyond the prime divisors of the nonzero constant
coefficient of the minimal polynomial of 𝑏. If 𝐻(𝛼) is not a square in 𝐾 =ℚ(𝛼), this applies to 𝑏 =𝑚2𝐻(𝛼), where the nonzero integer
𝑚 makes 𝑏 an algebraic integer, and the residue
map at such a prime, of norm ℓ,
sends 𝛼 to a root 𝑟 ∈𝔽ℓ of the reduction of
𝑓 at which 𝐻(𝑟) is a nonsquare. The prime-reduction
argument (nonsquares
modulo primes) is proved from the simple pole of the Dedekind zeta
function at 𝑠 =1, which is in
Mathlib. If 𝑏 were a nonzero square
modulo all but finitely many primes of degree one, these primes would
split in 𝐾(√𝑏), and for real
𝑠 >1 near 1 the zeta function of 𝐾(√𝑏) would be at least a positive
constant times the square of the zeta function of 𝐾, which the two simple poles forbid.
Both arguments use the condition at every root for all but finitely
many primes. Testing finitely many primes supplies no such condition.
The zeta-function argument is the one used in the linked formal
proof.
Proposition 2.8 (the square forced by the numerator
recurrence). Write 𝜅 =𝑚/6
and 𝜂 =6𝑐/𝑚, so that 𝑄𝑚,𝑐(𝑛) =𝜅𝑓(𝑛 +1) for 𝑓(𝑇) =𝑇3 −𝑇 +𝜂. Then 𝛼2 −1 is a square in ℚ(𝛼)× for a root 𝛼 of 𝑓.
Proof. Eliminating 𝑣𝑛
from (2) gives
𝑢𝑛+2=(𝑎𝑛+𝑎𝑛+1)𝑢𝑛+1−𝑎2𝑛𝑢𝑛.(4)
Let ℓ be
a prime and 𝑘 an index with ℓ ∣𝑢𝑘. Reading (4) at 𝑛 =𝑘 −1 modulo ℓ gives 𝑢𝑘+1 ≡ −𝑎2𝑘−1𝑢𝑘−1, hence
−𝑢𝑘−1𝑢𝑘+1≡(𝑎𝑘−1𝑢𝑘−1)2(modℓ),(5)
so −𝑢𝑘−1𝑢𝑘+1 is a square modulo ℓ.
Let ℓ ∤6𝑚 and let 𝑟 ∈𝔽ℓ be a root of 𝑓. Then 𝑟 ≠0 and 𝑟 ≠ ±1, since 𝑓(0) =𝜂 ≠0 and 𝑓( ±1) =𝜂. Using 𝜂 =𝑟 −𝑟3,
𝑓(𝑟−1)=−3𝑟(𝑟−1),𝑓(𝑟+1)=3𝑟(𝑟+1),
so at an index 𝑘 ≡𝑟 −1(modℓ)
we may reduce the polynomial values in 𝔽ℓ. All equalities in the
following calculation are in that field: 𝑄(𝑘) =0, 𝑄(𝑘 −1) = −3𝜅𝑟(𝑟 −1), 𝑄(𝑘 +1) =3𝜅𝑟(𝑟 +1), and
−𝑄(𝑘−1)𝑄(𝑘+1)=9𝜅2𝑟2(𝑟2−1).(6)
If 𝑟2 −1
were a nonsquare modulo ℓ, then
so would be the right side of (6), because
9𝜅2𝑟2 is a nonzero square;
agreement at all three of 𝑘 −1,𝑘,𝑘 +1
would then contradict (5). That
prohibition recurs at every index of the class 𝑟 −1 modulo ℓ, and Lemma 2.4
with 𝐿 =3, ℎ =ℓ would give 𝑑――(𝑆) ≥1/(3ℓ). So 𝑟2 −1 is a square in 𝔽×ℓ at every root of
every good reduction, and Lemma 2.7 applies with
𝐻(𝑇) =𝑇2 −1. ◻