Existence of a compatible system of roots of unity
ProvedCyclotomicEulerSystem.exists_compatibleRootSystemcyclotomic-fieldseuler-systemsnumber-theory
A compatible system of roots of unity exists: there is a function such that
- for every square-free positive integer , is a primitive -th root of unity, and
- for all coprime square-free positive integers .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.