Norm relation
ProvedCyclotomicEulerSystem.norm_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, let be a prime with , and let be the Frobenius automorphism of , i.e. the field automorphism with . Then
This is the Euler-system norm relation for cyclotomic units: going down one prime level multiplies by the Euler factor (written multiplicatively).
Formalization Note (1) The source prints the norm as ; this is a typo, since lies in and acts on ; the base field is , as in the standard references (e.g. Rubin, Euler Systems). (2) The hypothesis is added: for , and , so the right-hand side is undefined, while the left-hand side is . (3) The extension is encoded as inside , and the norm is Algebra.norm; the multiplicative exponent is written as the quotient in . The statement is made for every automorphism of over sending to (there is exactly one).
import Mathlib import Definitions.Def_CyclotomicEulerSystem_defs open NumberField
namespace CyclotomicEulerSystem
theorem norm_relation (ζ : ℕ → ℂ) (hζ : IsCompatibleRootSystem ζ) (n l : ℕ)
(hn : Squarefree n) (hn1 : 1 < n) (hl : l.Prime) (hln : ¬ l ∣ n)
(Frob : cycField ζ n ≃ₐ[ℚ] cycField ζ n) (hFrob : Frob (zetaIn ζ n) = zetaIn ζ n ^ l) :
((Algebra.norm (cycField ζ n) (alphaExt ζ n (n * l)) : cycField ζ n) : ℂ) =
(Frob (alphaIn ζ n) : ℂ) / alpha ζ n := by sorry
end CyclotomicEulerSystemConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.