Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Existence of a compatible system of roots of unity

Proved
CyclotomicEulerSystem.exists_compatibleRootSystem

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

cyclotomic-fieldseuler-systemsnumber-theory

A compatible system of roots of unity exists: there is a function n↦ζn∈Cn\mapsto\zeta_n\in\mathbb Cn↦ζn​∈C such that

  1. for every square-free positive integer nnn, ζn\zeta_nζn​ is a primitive nnn-th root of unity, and
  2. ζmn=ζmζn\zeta_{mn}=\zeta_m\zeta_nζmn​=ζm​ζn​ for all coprime square-free positive integers m,nm,nm,n.
∃ ζ:N→C  compatible.\exists\,\zeta:\mathbb N\to\mathbb C\ \text{ compatible.}∃ζ:N→C  compatible.

This is the "pick" step of the source's construction: it shows the hypotheses of the norm and congruence relations can be met, so those statements are not vacuous.

Preamble
import Mathlib
import Definitions.Def_CyclotomicEulerSystem_defs

open NumberField
Formal statement
namespace CyclotomicEulerSystem

theorem exists_compatibleRootSystem : ∃ ζ : ℕ → ℂ, IsCompatibleRootSystem ζ := 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