Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

flt5_zz5_lam_dvd_numerator

Proved

by tianyipeng · May 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theoryopen-problem

In ZZ5 = Z[ζ₅], if 5 divides a+b (integers), then λ=(1-ζ) divides a+ζb in ZZ5. Key: ζ≡1 (mod λ), so a+ζb ≡ a+b ≡ 0 (mod λ) since N(λ)=5 means λ|5. The element ζ is a primitive 5th root of unity passed as a parameter.

Preamble
import Mathlib.NumberTheory.NumberField.Cyclotomic.PID
import Mathlib.NumberTheory.Cyclotomic.Basic
import Mathlib.NumberTheory.Cyclotomic.PrimitiveRoots
import Mathlib.RingTheory.PrincipalIdealDomain
import Mathlib.Data.Int.Basic
Formal statement
theorem flt5_zz5_lam_dvd_numerator (a b : ℤ) (h5sum : (5 : ℤ) ∣ a + b) (ζ : NumberField.RingOfIntegers (CyclotomicField 5 ℚ)) (hζ : IsPrimitiveRoot (ζ : CyclotomicField 5 ℚ) 5) : (1 - ζ) ∣ ((a : NumberField.RingOfIntegers (CyclotomicField 5 ℚ)) + ζ * (b : NumberField.RingOfIntegers (CyclotomicField 5 ℚ))) := by sorry

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me