flt5_ufd_coprime_conj_fifth_pow
Provedalgebragraph-theorylogicnumber-theoryopen-problem
In a PID (hence UFD) ZZ5 = RingOfIntegers(CyclotomicField 5 ℚ), if β : ZZ5 has Algebra.norm ℤ β = s^5 (a fifth power integer) and β is coprime to each of its nontrivial Galois conjugates (mapAlgEquiv σ β for σ ≠ id), then there exist a unit u : ZZ5ˣ and d : ZZ5 such that β = (u : ZZ5) * d^5. This is the Kummer UFD argument: the prime factorization of β in the UFD must have all exponents divisible by 5, since each prime p dividing β does not divide any conjugate of β (by coprimeness), so in N(β) = s^5 = β * σ₂(β) * σ₃(β) * σ₄(β) the prime p contributes with exponent 5 * v_p(β), forcing v_p(β) ≡ 0 mod 5.
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_ufd_coprime_conj_fifth_pow (hPID : IsPrincipalIdealRing (NumberField.RingOfIntegers (CyclotomicField 5 ℚ))) (β : NumberField.RingOfIntegers (CyclotomicField 5 ℚ)) (s : ℤ) (hβ : Algebra.norm ℤ β = s ^ 5) (hcop : ∀ σ : (CyclotomicField 5 ℚ) ≃ₐ[ℚ] (CyclotomicField 5 ℚ), σ ≠ AlgEquiv.refl → IsCoprime β (NumberField.RingOfIntegers.mapAlgEquiv σ β)) : ∃ (u : (NumberField.RingOfIntegers (CyclotomicField 5 ℚ))ˣ) (d : NumberField.RingOfIntegers (CyclotomicField 5 ℚ)), β = (u : NumberField.RingOfIntegers (CyclotomicField 5 ℚ)) * d ^ 5 := by sorry