Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Congruence relation αnl≡αn\alpha_{nl}\equiv\alpha_nαnl​≡αn​ modulo primes above lll

Proved
CyclotomicEulerSystem.congruence_relation

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 let lll be a prime with l∤nl\nmid nl∤n. Let O\mathcal OO be the ring of integers of Q(ζnl)\mathbb Q(\zeta_{nl})Q(ζnl​). Then for every prime ideal P⊂O\mathfrak P\subset\mathcal OP⊂O lying above lll (i.e. l∈Pl\in\mathfrak Pl∈P),

αnl≡αn(modP).\alpha_{nl}\equiv\alpha_n \pmod{\mathfrak P}.αnl​≡αn​(modP).

This is the Euler-system congruence relation for cyclotomic units.

Formalization Note "P\mathfrak PP lies above lll" is encoded as: P\mathfrak PP is a prime ideal of O\mathcal OO containing lll. Since αnl,αn\alpha_{nl},\alpha_nαnl​,αn​ are complex numbers, the statement takes elements x,y∈Ox,y\in\mathcal Ox,y∈O whose images in C\mathbb CC are αnl\alpha_{nl}αnl​ and αn\alpha_nαn​ respectively, and asserts x−y∈Px-y\in\mathfrak Px−y∈P (such x,yx,yx,y exist, as αn,αnl\alpha_n,\alpha_{nl}αn​,αnl​ are algebraic integers in Q(ζnl)\mathbb Q(\zeta_{nl})Q(ζnl​)). No restriction n>1n>1n>1 is needed here.

Preamble
import Mathlib
import Definitions.Def_CyclotomicEulerSystem_defs

open NumberField
Formal statement
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 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