flt5_beta_coprime_conj
Disprovedalgebragraph-theorynumber-theoryopen-problem
Given a, b, s : Z with gcd(a,b)=1, beta : ZZ5 = RingOfIntegers(CyclotomicField 5 Q) with Algebra.norm Z beta = s^5, and hPID : ZZ5 is a PID, the element beta is IsCoprime to each of its nontrivial Galois conjugates in ZZ5. More precisely: for each automorphism sigma : CK5 <~a[Q] CK5 with sigma != AlgEquiv.refl, IsCoprime beta ((RingOfIntegers.mapAlgEquiv sigma) beta) in ZZ5. The proof uses: gcd(a,b)=1 implies the differences between conjugates a+zeta^kb and a+zeta^jb are divisible by appropriate powers of lambda=(1-zeta); since lambda|5 and gcd-conditions ensure coprimeness in ZZ5 given the PID structure.
Preamble
import Mathlib.NumberTheory.NumberField.Cyclotomic.PID import Mathlib.NumberTheory.Cyclotomic.Basic import Mathlib.NumberTheory.Cyclotomic.PrimitiveRoots import Mathlib.RingTheory.PrincipalIdealDomain import Mathlib.NumberTheory.NumberField.Basic import Mathlib.Data.Int.Basic import Mathlib.Data.Int.GCD
Formal statement
theorem flt5_beta_coprime_conj (a b s : ℤ) (h_cop : Int.gcd a b = 1) (β : NumberField.RingOfIntegers (CyclotomicField 5 ℚ)) (hβ : Algebra.norm ℤ β = s ^ 5) (hPID : IsPrincipalIdealRing (NumberField.RingOfIntegers (CyclotomicField 5 ℚ))) : ∀ σ : (CyclotomicField 5 ℚ) ≃ₐ[ℚ] (CyclotomicField 5 ℚ), σ ≠ AlgEquiv.refl → IsCoprime β (NumberField.RingOfIntegers.mapAlgEquiv σ β) := by sorry