Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cyclotomic Euler system relations

Proved
CyclotomicEulerSystem.cyclotomic_euler_system

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

cyclotomic-fieldseuler-systemsnumber-theory

Throughout, ζ=(ζn)\zeta = (\zeta_n)ζ=(ζn​) is a compatible system of roots of unity in C\mathbb CC: for every square-free positive integer nnn, ζn\zeta_nζn​ is a primitive nnn-th root of unity, and ζmn=ζmζn\zeta_{mn} = \zeta_m\zeta_nζmn​=ζm​ζn​ whenever m,nm,nm,n are coprime square-free positive integers. Write αn=1−ζn\alpha_n = 1-\zeta_nαn​=1−ζn​ and Q(ζn)⊆C\mathbb Q(\zeta_n)\subseteq\mathbb CQ(ζn​)⊆C for the nnn-th cyclotomic field.

Let nnn be square-free and lll a prime with l∤nl\nmid nl∤n. Then the cyclotomic units satisfy the two Euler-system relations:

  1. (Norm relation) If n>1n>1n>1 and Frl\mathrm{Fr}_lFrl​ is the automorphism of Q(ζn)/Q\mathbb Q(\zeta_n)/\mathbb QQ(ζn​)/Q with Frl(ζn)=ζn l\mathrm{Fr}_l(\zeta_n)=\zeta_n^{\,l}Frl​(ζn​)=ζnl​, then
NQ(ζnl)/Q(ζn)(αnl)=αnFrl−1=Frl(αn)αn.N_{\mathbb Q(\zeta_{nl})/\mathbb Q(\zeta_n)}(\alpha_{nl})=\alpha_n^{\mathrm{Fr}_l-1}=\frac{\mathrm{Fr}_l(\alpha_n)}{\alpha_n}.NQ(ζnl​)/Q(ζn​)​(αnl​)=αnFrl​−1​=αn​Frl​(αn​)​.
  1. (Congruence relation) For every prime ideal P\mathfrak PP of the ring of integers of Q(ζnl)\mathbb Q(\zeta_{nl})Q(ζnl​) lying above lll,
αnl≡αn(modP).\alpha_{nl}\equiv\alpha_n\pmod{\mathfrak P}.αnl​≡αn​(modP).

These two relations are what make (αn)n(\alpha_n)_n(αn​)n​ an Euler system; they are the input to Kolyvagin's and Rubin's Euler-system arguments bounding ideal class groups.

Formalization Note The base field of the norm is Q(ζn)\mathbb Q(\zeta_n)Q(ζn​) (the source's Q(ζl)\mathbb Q(\zeta_l)Q(ζl​) is a typo), and n>1n>1n>1 is required in the norm relation because α1=0\alpha_1=0α1​=0. See the two milestone statements for the encoding details.

Preamble
import Mathlib
import Definitions.Def_CyclotomicEulerSystem_defs

open NumberField
Formal statement
namespace CyclotomicEulerSystem

theorem cyclotomic_euler_system (ζ : ℕ → ℂ) (hζ : IsCompatibleRootSystem ζ) (n l : ℕ)
    (hn : Squarefree n) (hl : l.Prime) (hln : ¬ l ∣ n) :
    (1 < n → ∀ Frob : cycField ζ n ≃ₐ[ℚ] cycField ζ n, Frob (zetaIn ζ n) = zetaIn ζ n ^ l →
      ((Algebra.norm (cycField ζ n) (alphaExt ζ n (n * l)) : cycField ζ n) : ℂ) =
        (Frob (alphaIn ζ n) : ℂ) / alpha ζ n) ∧
    (∀ P : Ideal (𝓞 (cycField ζ (n * l))), P.IsPrime →
      (l : 𝓞 (cycField ζ (n * l))) ∈ P →
      ∀ x y : 𝓞 (cycField ζ (n * l)),
        ((x : cycField ζ (n * l)) : ℂ) = alpha ζ (n * l) →
        ((y : cycField ζ (n * l)) : ℂ) = alpha ζ n → x - y ∈ P) := by sorry

end CyclotomicEulerSystem
Source
Wikipedia, "Euler system", revision 1353502478 (https://en.wikipedia.org/w/index.php?title=Euler_system&oldid=1353502478), section "Examples / Cyclotomic units", displayed relations (norm relation and congruence relation) and the preceding sentence "For every square-free positive integer n pick an n-th root ζ_n of 1, with ζ_mn = ζ_m ζ_n for m,n coprime. Then the cyclotomic Euler system is the set of numbers α_n = 1 − ζ_n."
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me