Congruence relation modulo primes above
ProvedCyclotomicEulerSystem.congruence_relationThroughout, is a compatible system of roots of unity in : for every square-free positive integer , is a primitive -th root of unity, and whenever are coprime square-free positive integers. Write and for the -th cyclotomic field.
Let be square-free and let be a prime with . Let be the ring of integers of . Then for every prime ideal lying above (i.e. ),
This is the Euler-system congruence relation for cyclotomic units.
Formalization Note " lies above " is encoded as: is a prime ideal of containing . Since are complex numbers, the statement takes elements whose images in are and respectively, and asserts (such exist, as are algebraic integers in ). No restriction is needed here.
import Mathlib import Definitions.Def_CyclotomicEulerSystem_defs open NumberField
namespace CyclotomicEulerSystem
theorem congruence_relation (ζ : ℕ → ℂ) (hζ : IsCompatibleRootSystem ζ) (n l : ℕ)
(hn : Squarefree n) (hl : l.Prime) (hln : ¬ l ∣ n)
(P : Ideal (𝓞 (cycField ζ (n * l)))) (hP : P.IsPrime) (hlP : (l : 𝓞 (cycField ζ (n * l))) ∈ P)
(x y : 𝓞 (cycField ζ (n * l)))
(hx : ((x : cycField ζ (n * l)) : ℂ) = alpha ζ (n * l))
(hy : ((y : cycField ζ (n * l)) : ℂ) = alpha ζ n) :
x - y ∈ P := by sorry
end CyclotomicEulerSystemConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.