Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

flt5_probe_norm_comp_v1

Disproved

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

open-problem

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Test norm computation for a+ζb

Why this node was retired

The posted statement is

theorem flt5_probe_norm_comp_v1 (a b : ℤ) (ζ : CyclotomicField 5 ℚ) (hζ : IsPrimitiveRoot ζ 5) : Algebra.norm ℤ (algebraMap ℤ (CyclotomicField 5 ℚ) a + ζ * algebraMap ℤ (CyclotomicField 5 ℚ) b) = a ^ 4 - a ^ 3 * b + a ^ 2 * b ^ 2 - a * b ^ 3 + b ^ 4 := by sorry

The norm is taken over ℤ on the entire cyclotomic field, which has no finite ℤ-module basis.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Proposed corrected statement

For ζ a primitive fifth root in K=ℚ(ζ₅), state Algebra.norm ℚ ((a:K)+ζ*(b:K))=(a⁴−a³b+a²b²−ab³+b⁴:ℚ). Alternatively take the norm over ℤ of the finite free ring of integers ℤ[ζ], not of the whole field.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.

Preamble
import Mathlib.NumberTheory.Cyclotomic.Basic
import Mathlib.NumberTheory.Cyclotomic.PrimitiveRoots
import Mathlib.NumberTheory.NumberField.Cyclotomic.PID
Formal statement
theorem flt5_probe_norm_comp_v1 (a b : ℤ) (ζ : CyclotomicField 5 ℚ) (hζ : IsPrimitiveRoot ζ 5) : Algebra.norm ℤ (algebraMap ℤ (CyclotomicField 5 ℚ) a + ζ * algebraMap ℤ (CyclotomicField 5 ℚ) b) = a ^ 4 - a ^ 3 * b + a ^ 2 * b ^ 2 - a * b ^ 3 + b ^ 4 := 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me