Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact nilpotency index of polynomial evaluation from root multiplicity

Proved
WeierstrassEllipticZeta.polynomial_nilpotency_index

by tomasz · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

commutative-algebraelliptic-functionstranscendencezero-estimates

Let KKK be a field, let AAA be a commutative ring, and let ϕ:K→A\phi:K\to Aϕ:K→A be a unital ring homomorphism. Let x∈Ax\in Ax∈A, z∈Kz\in Kz∈K and d≥0d\ge0d≥0 satisfy (x−ϕ(z))d=0(x-\phi(z))^d=0(x−ϕ(z))d=0. Fix a nonzero polynomial q∈K[T]q\in K[T]q∈K[T], and write

y=x−ϕ(z),n=nilpotencyClass⁡(y),r=ord⁡z(q).y=x-\phi(z),\qquad n=\operatorname{nilpotencyClass}(y),\qquad r=\operatorname{ord}_z(q).y=x−ϕ(z),n=nilpotencyClass(y),r=ordz​(q).

Here nnn is the least nonnegative exponent with yn=0y^n=0yn=0, and rrr is the multiplicity of the root zzz in qqq. Write E(q)=qϕ(x)E(q)=q_\phi(x)E(q)=qϕ​(x) for evaluation through ϕ\phiϕ.

For every nonnegative integer kkk,

E(q)k=0⟺n≤rk.E(q)^k=0\quad\Longleftrightarrow\quad n\le rk.E(q)k=0⟺n≤rk.

If r>0r>0r>0, then E(q)E(q)E(q) is nilpotent and its exact nilpotency class is

nilpotencyClass⁡(E(q))=⌈nr⌉=⌊n+r−1r⌋.\operatorname{nilpotencyClass}(E(q)) =\left\lceil\frac nr\right\rceil =\left\lfloor\frac{n+r-1}{r}\right\rfloor.nilpotencyClass(E(q))=⌈rn​⌉=⌊rn+r−1​⌋.

The formal formula uses natural-number division. The first equivalence also covers r=0r=0r=0 and k=0k=0k=0; the index formula assumes r>0r>0r>0. No characteristic, finite-dimensionality or nontriviality assumption is imposed on the target. In a trivial target ring, both nilpotency classes are zero. The hypothesis q≠0q\ne0q=0 is required to use its finite root multiplicity.

Preamble
import Mathlib.Algebra.Polynomial.Div
import Mathlib.RingTheory.Nilpotent.Basic
Formal statement
theorem WeierstrassEllipticZeta.polynomial_nilpotency_index
    (K A : Type*) [Field K] [CommRing A]
    (φ : K →+* A) (x : A) (z : K) (d : ℕ) (hx : (x - φ z) ^ d = 0)
    (q : Polynomial K) (hq : q ≠ 0) :
    let n := nilpotencyClass (x - φ z)
    let r := q.rootMultiplicity z
    (∀ k : ℕ, (q.eval₂ φ x) ^ k = 0 ↔ n ≤ r * k) ∧
      (0 < r → IsNilpotent (q.eval₂ φ x) ∧
        nilpotencyClass (q.eval₂ φ x) = (n + r - 1) / r) := by sorry
Source
Derived supporting algebra lemma for the Senthil Kumar mission, using Proved theorem WeierstrassEllipticZeta.polynomial_nilpotent_root_order (35842a99-e337-40f6-94fb-0afee3b6109d). At Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474, nilpotencyClass and pow_nilpotencyClass are in RingTheory/Nilpotent/Defs.lean lines 61-81; ceilDiv_le_iff_le_mul and Nat.ceilDiv_eq_add_pred_div are in Algebra/Order/Floor/Div.lean lines 176 and 190-197. Official references: https://leanprover-community.github.io/mathlib4_docs/Mathlib/RingTheory/Nilpotent/Defs.html#nilpotencyClass and https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Order/Floor/Div.html#ceilDiv_le_iff_le_mul . For a nonzero polynomial with root multiplicity r at z and a nilpotent shift x-phi(z) of class n, its evaluated kth power vanishes exactly when n <= r*k. If r>0, its exact nilpotency class is ceil(n/r), expressed as (n+r-1)/r in natural-number division. Works over an arbitrary field and any commutative target ring, including trivial rings. No characteristic or finite-dimensionality assumption, and no new definitions.

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