Finite Taylor expansion and exact Hasse-jet criteria for polynomial evaluation
ProvedWeierstrassEllipticZeta.polynomial_nilpotent_taylor_calculuscommutative-algebraelliptic-functionstranscendencezero-estimates
Let and be commutative rings, let be a unital ring homomorphism, and fix , and a nonnegative integer . Write for polynomial evaluation. Assume the exact kernel criterion
for every .
Let be the th Hasse derivative: is the coefficient of in . Then every polynomial satisfies the finite Taylor formula
Moreover,
and, for every pair ,
Thus the first Taylor coefficients exactly determine polynomial evaluation at . No characteristic, integrality or finite-dimensionality assumption is needed. Trivial rings and are allowed; for the sum and jet conditions are empty, and the kernel hypothesis forces every evaluation to be zero.
Preamble
import Mathlib.Algebra.Polynomial.Taylor import Mathlib.Algebra.Polynomial.Div
Formal statement
theorem WeierstrassEllipticZeta.polynomial_nilpotent_taylor_calculus
(K A : Type*) [CommRing 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.hasseDeriv i q).eval z) * (x - φ z) ^ i) ∧
(∀ q : Polynomial K,
q.eval₂ φ x = 0 ↔ ∀ i < n, (Polynomial.hasseDeriv i q).eval z = 0) ∧
∀ q r : Polynomial K, q.eval₂ φ x = r.eval₂ φ x ↔
∀ i < n, (Polynomial.hasseDeriv i q).eval z = (Polynomial.hasseDeriv i r).eval z := by sorry
Source
Derived supporting algebra lemma for the Senthil Kumar mission, not quoted from the article. Exact sources in Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474: Polynomial.taylor_coeff, taylorEquiv and taylor_apply in Algebra/Polynomial/Taylor.lean (lines 46, 68-76 and 192-202); Polynomial.X_pow_dvd_iff in Algebra/Polynomial/Div.lean (44-55); Polynomial.eval₂_eq_sum_range' and eval₂_comp in Algebra/Polynomial/Eval/Degree.lean (49-54 and 205-206); map_dvd_iff in Algebra/Ring/Divisibility/Basic.lean (29-31). Links: https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/Polynomial/Taylor.lean#L68-L76 and https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/Polynomial/Div.lean#L44-L55. Under an exact evaluation-kernel hypothesis ((T-z)^n), evaluation is a finite Taylor sum; zero and equality are characterized by the first n Hasse derivatives at z. Both coefficient and target rings may be arbitrary commutative rings, including trivial rings; n=0 is allowed. No new definitions or platform theorem dependencies.