Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ordinary Taylor expansion and exact derivative criteria for polynomial evaluation

Proved
WeierstrassEllipticZeta.polynomial_nilpotent_derivative_calculus

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let KKK be a field of characteristic zero, let AAA be a commutative ring, and let ϕ:K→A\phi:K\to Aϕ:K→A be a unital ring homomorphism. Fix x∈Ax\in Ax∈A, z∈Kz\in Kz∈K and a nonnegative integer nnn. Write E(q)=qϕ(x)E(q)=q_\phi(x)E(q)=qϕ​(x) for polynomial evaluation, and assume the exact kernel criterion

E(q)=0⟺(T−z)n∣qE(q)=0\quad\Longleftrightarrow\quad (T-z)^n\mid qE(q)=0⟺(T−z)n∣q

for every q∈K[T]q\in K[T]q∈K[T].

Write q(i)q^{(i)}q(i) for the iiith ordinary polynomial derivative, with q(0)=qq^{(0)}=qq(0)=q. Then

E(q)=∑i=0n−1ϕ ⁣(q(i)(z)i!)(x−ϕ(z))i.E(q)=\sum_{i=0}^{n-1}\phi\!\left(\frac{q^{(i)}(z)}{i!}\right)(x-\phi(z))^i.E(q)=i=0∑n−1​ϕ(i!q(i)(z)​)(x−ϕ(z))i.

Moreover,

E(q)=0⟺q(i)(z)=0 for every 0≤i<n,E(q)=0\quad\Longleftrightarrow\quad q^{(i)}(z)=0\text{ for every }0\le i<n,E(q)=0⟺q(i)(z)=0 for every 0≤i<n,

and, for all q,r∈K[T]q,r\in K[T]q,r∈K[T],

E(q)=E(r)⟺q(i)(z)=r(i)(z) for every 0≤i<n.E(q)=E(r)\quad\Longleftrightarrow\quad q^{(i)}(z)=r^{(i)}(z)\text{ for every }0\le i<n.E(q)=E(r)⟺q(i)(z)=r(i)(z) for every 0≤i<n.

The factorial divisions take place in KKK before applying ϕ\phiϕ. No finite-dimensionality or nontriviality assumption is imposed on AAA. The case n=0n=0n=0 is included: the sum and derivative conditions are empty, and the kernel hypothesis forces all evaluations to be zero.

Preamble
import Mathlib.Algebra.Polynomial.HasseDeriv
Formal statement
theorem WeierstrassEllipticZeta.polynomial_nilpotent_derivative_calculus
    (K A : Type*) [Field K] [CharZero K] [CommRing A]
    (φ : K →+* A) (x : A) (z : K) (n : ℕ)
    (hker : ∀ q : Polynomial K,
      q.eval₂ φ x = 0 ↔ (Polynomial.X - Polynomial.C z) ^ n ∣ q) :
    (∀ q : Polynomial K, q.eval₂ φ x =
      ∑ i ∈ Finset.range n,
        φ (((Polynomial.derivative^[i]) q).eval z / (i.factorial : K)) * (x - φ z) ^ i) ∧
    (∀ q : Polynomial K,
      q.eval₂ φ x = 0 ↔ ∀ i < n, ((Polynomial.derivative^[i]) q).eval z = 0) ∧
    ∀ q r : Polynomial K, q.eval₂ φ x = r.eval₂ φ x ↔
      ∀ i < n, ((Polynomial.derivative^[i]) q).eval z =
        ((Polynomial.derivative^[i]) r).eval z := by sorry
Source
Derived supporting algebra lemma for the Senthil Kumar mission. Uses the Proved platform theorem WeierstrassEllipticZeta.polynomial_nilpotent_taylor_calculus (978e04a7-bb71-4b68-b1d0-3a57aacf0696) and Polynomial.factorial_smul_hasseDeriv in pinned Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474, Algebra/Polynomial/HasseDeriv.lean lines 128-146: https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/Polynomial/HasseDeriv.lean#L128-L146. Over a characteristic-zero field K, ordinary derivatives divided by factorials give the finite Taylor evaluation formula under exact kernel ((T-z)^n), and ordinary derivatives of orders below n exactly detect zero and equality. The target is any commutative ring, including a trivial ring, with explicit coefficient homomorphism. The case n=0 is included. 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