/-
Copyright 2025 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import Mathlib.NumberTheory.LegendreSymbol.JacobiSymbol@[expose] public sectionWall-Sun-Sun primes
References:
open scoped NumberTheorySymbolsThe Lucas sequence of the first kind $U_0(P, Q) = 0$, $U_1(P, Q)=1$, $U_{n+2}(P, Q)=PU_{n+1}(P, Q)-QU_n(P, Q)$
def LucasSequence.U (P Q : ℤ) : ℕ → ℤ
| 0 => 0
| 1 => 1
| n + 2 => P * LucasSequence.U P Q (n + 1) - Q * LucasSequence.U P Q nThe Lucas sequence of the second kind $V_0(P, Q) = 0$, $V_1(P, Q)=P$, $V_{n+2}(P, Q)=PV_{n+1}(P, Q)-QV_n(P, Q)$
def LucasSequence.V (P Q : ℤ) : ℕ → ℤ
| 0 => 2
| 1 => P
| n + 2 => P * LucasSequence.V P Q (n + 1) - Q * LucasSequence.V P Q nThe Lucas numbers $L_0 = 2$, $L_1=1$, $L_{n+2} = L_{n+1}+L_n$
def lucasNumber : ℕ → ℤ := LucasSequence.V 1 (-1)Wall–Sun–Sun prime A prime $p$ is a Wall–Sun–Sun prime if and only if $L_p \equiv 1 \pmod{p^2}$, where $L_p$ is the $p$-th Lucas number.
structure IsWallSunSunPrime (p : ℕ) : Prop where
prime : p.Prime
lucasNumber_modeq : lucasNumber p ≡ 1 [ZMOD (p ^ 2)]Lucas–Wieferich prime A Lucas–Wieferich prime associated with $(a,b)$ is an odd prime $p$, not dividing $a^2 - 4b$, such that $U_{p-\varepsilon}(a,b) \equiv 0 \pmod{p^2}$ where $U(a,b)$ is the Lucas sequence of the first kind and $\varepsilon$ is the Legendre symbol $\left({\tfrac {a^{2}-4b}{p}}\right)$.
See first paragraph of https://en.wikipedia.org/wiki/Wall%E2%80%93Sun%E2%80%93Sun_prime#Wall%E2%80%93Sun%E2%80%93Sun_primes_with_discriminant_D for the condition that $p$ is odd and coprime to the discriminant
structure IsLucasWieferichPrime (a b : ℤ) (p : ℕ) : Prop where
prime : p.Prime
odd : Odd p
not_dvd : ¬(p : ℤ) ∣ a ^ 2 - 4 * b
modeq : LucasSequence.U a b (p - J(a^2 - 4*b | p)).toNat ≡ 0 [ZMOD (p^2)]The parameter $P$ divides every even-indexed term of the Lucas sequence $U(P, Q)$.
succ P:ℤQ:ℤk:ℕih:P ∣ U P Q (2 * k)⊢ P ∣ U P Q (2 * k + 2)
simp only [LucasSequence.U] succ P:ℤQ:ℤk:ℕih:P ∣ U P Q (2 * k)⊢ P ∣ P * U P Q (2 * k + 1) - Q * U P Q (2 * k)
exact dvd_sub (dvd_mul_right P _) (dvd_mul_of_dvd_right ih Q) All goals completed! 🐙If $p^2 \mid a$, then every odd prime $p$ not dividing $a^2 - 4b$ is a Lucas–Wieferich prime associated with $(a, b)$: the index $p - \left(\tfrac{a^2-4b}{p}\right)$ is even, and $a$ divides every even-indexed term of $U(a, b)$.
theorem IsLucasWieferichPrime.of_sq_dvd {a b : ℤ} {p : ℕ} (hp : p.Prime) (hodd : Odd p)
(hpd : ¬(p : ℤ) ∣ a ^ 2 - 4 * b) (ha : (p : ℤ) ^ 2 ∣ a) : IsLucasWieferichPrime a b p := by a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ a⊢ IsLucasWieferichPrime a b p
refine ⟨hp, hodd, hpd, ?_⟩ a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ a⊢ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat ≡ 0 [ZMOD ↑p ^ 2]
rw [Int.modEq_zero_iff_dvd a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ a⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ a⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat] a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ a⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
have hgcd : (a ^ 2 - 4 * b).gcd (p : ℤ) = 1 := by a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ a⊢ IsLucasWieferichPrime a b p a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
have hpnat : ¬p ∣ (a ^ 2 - 4 * b).natAbs := fun h ↦ hpd (Int.natCast_dvd.mpr h) a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahpnat:¬p ∣ (a ^ 2 - 4 * b).natAbs⊢ (a ^ 2 - 4 * b).gcd ↑p = 1 a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
rw [Int.gcd_eq_natAbs, a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahpnat:¬p ∣ (a ^ 2 - 4 * b).natAbs⊢ (a ^ 2 - 4 * b).natAbs.gcd (↑p).natAbs = 1 a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahpnat:¬p ∣ (a ^ 2 - 4 * b).natAbs⊢ p.gcd (a ^ 2 - 4 * b).natAbs = 1 a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat Int.natAbs_natCast, a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahpnat:¬p ∣ (a ^ 2 - 4 * b).natAbs⊢ (a ^ 2 - 4 * b).natAbs.gcd p = 1 a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahpnat:¬p ∣ (a ^ 2 - 4 * b).natAbs⊢ p.gcd (a ^ 2 - 4 * b).natAbs = 1 a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat Nat.gcd_comm a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahpnat:¬p ∣ (a ^ 2 - 4 * b).natAbs⊢ p.gcd (a ^ 2 - 4 * b).natAbs = 1 a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahpnat:¬p ∣ (a ^ 2 - 4 * b).natAbs⊢ p.gcd (a ^ 2 - 4 * b).natAbs = 1 a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat] a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahpnat:¬p ∣ (a ^ 2 - 4 * b).natAbs⊢ p.gcd (a ^ 2 - 4 * b).natAbs = 1 a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
exact hp.coprime_iff_not_dvd.mpr hpnat a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
obtain ⟨k, hk⟩ := hodd a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
rcases jacobiSym.eq_one_or_neg_one hgcd with hJ | hJ inl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNatinr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
· inl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat have hindex : ((p : ℤ) - J(a ^ 2 - 4 * b | p)).toNat = 2 * k := by a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ a⊢ IsLucasWieferichPrime a b p inl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
rw [hJ, a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1⊢ (↑p - 1).toNat = 2 * k a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1⊢ (↑(2 * k + 1) - 1).toNat = 2 * kinl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat hk a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1⊢ (↑(2 * k + 1) - 1).toNat = 2 * k a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1⊢ (↑(2 * k + 1) - 1).toNat = 2 * kinl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat] a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1⊢ (↑(2 * k + 1) - 1).toNat = 2 * kinl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
omegainl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNatinl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
rw [hindex inl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (2 * k) inl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (2 * k)]inl a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = 1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * k⊢ ↑p ^ 2 ∣ LucasSequence.U a b (2 * k)
exact ha.trans (LucasSequence.dvd_U_two_mul a b k) All goals completed! 🐙
· inr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat have hindex : ((p : ℤ) - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1) := by a:ℤb:ℤp:ℕhp:Nat.Prime phodd:Odd phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ a⊢ IsLucasWieferichPrime a b p inr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
rw [hJ, a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1⊢ (↑p - -1).toNat = 2 * (k + 1) a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1⊢ (↑(2 * k + 1) - -1).toNat = 2 * (k + 1)inr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat hk a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1⊢ (↑(2 * k + 1) - -1).toNat = 2 * (k + 1) a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1⊢ (↑(2 * k + 1) - -1).toNat = 2 * (k + 1)inr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat] a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1⊢ (↑(2 * k + 1) - -1).toNat = 2 * (k + 1)inr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
omegainr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNatinr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (↑p - J(a ^ 2 - 4 * b | p)).toNat
rw [hindex inr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (2 * (k + 1)) inr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (2 * (k + 1))]inr a:ℤb:ℤp:ℕhp:Nat.Prime phpd:¬↑p ∣ a ^ 2 - 4 * bha:↑p ^ 2 ∣ ahgcd:(a ^ 2 - 4 * b).gcd ↑p = 1k:ℕhk:p = 2 * k + 1hJ:J(a ^ 2 - 4 * b | p) = -1hindex:(↑p - J(a ^ 2 - 4 * b | p)).toNat = 2 * (k + 1)⊢ ↑p ^ 2 ∣ LucasSequence.U a b (2 * (k + 1))
exact ha.trans (LucasSequence.dvd_U_two_mul a b (k + 1)) All goals completed! 🐙