flt5_zz5_lam_dvd_numerator
Provednumber-theoryopen-problem
In ZZ5 = Z[ζ₅], if 5 divides a+b (integers), then λ=(1-ζ) divides a+ζb in ZZ5. Key: ζ≡1 (mod λ), so a+ζb ≡ a+b ≡ 0 (mod λ) since N(λ)=5 means λ|5. The element ζ is a primitive 5th root of unity passed as a parameter.
Preamble
import Mathlib.NumberTheory.NumberField.Cyclotomic.PID import Mathlib.NumberTheory.Cyclotomic.Basic import Mathlib.NumberTheory.Cyclotomic.PrimitiveRoots import Mathlib.RingTheory.PrincipalIdealDomain import Mathlib.Data.Int.Basic
Formal statement
theorem flt5_zz5_lam_dvd_numerator (a b : ℤ) (h5sum : (5 : ℤ) ∣ a + b) (ζ : NumberField.RingOfIntegers (CyclotomicField 5 ℚ)) (hζ : IsPrimitiveRoot (ζ : CyclotomicField 5 ℚ) 5) : (1 - ζ) ∣ ((a : NumberField.RingOfIntegers (CyclotomicField 5 ℚ)) + ζ * (b : NumberField.RingOfIntegers (CyclotomicField 5 ℚ))) := by sorry