Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite geometric inverse of a nonzero scalar plus a nilpotent

Proved
WeierstrassEllipticZeta.nilpotent_shift_geometric_inverse

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let KKK be a field, AAA a commutative ring, and ϕ:K→A\phi:K\to Aϕ:K→A a unital ring homomorphism giving its scalar structure. Suppose x∈Ax\in Ax∈A satisfies xN=0x^N=0xN=0 for some integer N≥0N\ge0N≥0, and let c∈Kc\in Kc∈K be nonzero. Define

b=ϕ(c−1)∑j=0N−1(−ϕ(c−1)x)j,b=\phi(c^{-1})\sum_{j=0}^{N-1}(-\phi(c^{-1})x)^j,b=ϕ(c−1)j=0∑N−1​(−ϕ(c−1)x)j,

where scalars act through the algebra structure and the sum is empty when N=0N=0N=0. Then

(x+ϕ(c))b=b(x+ϕ(c))=1.(x+\phi(c))b=b(x+\phi(c))=1.(x+ϕ(c))b=b(x+ϕ(c))=1.

In particular, x+ϕ(c)x+\phi(c)x+ϕ(c) is a unit of AAA, with the displayed explicit inverse. The statement allows the zero algebra; the hypothesis x0=0x^0=0x0=0 forces precisely this case when N=0N=0N=0.

Preamble
import Mathlib.Algebra.Ring.GeomSum
import Mathlib.Algebra.Algebra.Basic
import Mathlib.Tactic.Ring
Formal statement
theorem WeierstrassEllipticZeta.nilpotent_shift_geometric_inverse
    (K A : Type*) [Field K] [CommRing A] (φ : K →+* A)
    (x : A) (N : ℕ) (hx : x ^ N = 0) (c : K) (hc : c ≠ 0) :
    let b := φ c⁻¹ * ∑ i ∈ Finset.range N, (-(φ c⁻¹ * x)) ^ i
    (x + φ c) * b = 1 ∧ b * (x + φ c) = 1 ∧ IsUnit (x + φ c) := by sorry
Source
Derived algebra lemma, proved here from the finite geometric sum identity mul_neg_geom_sum in Mathlib, Algebra/Ring/GeomSum.lean, lines 240-246 at revision 0df444a360eaa60ab8c11dca51a86af692955474: https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/Ring/GeomSum.lean#L240-L246. It supplies an explicit finite inverse of a nonzero scalar plus a nilpotent element in a commutative algebra over a field. This supporting lemma for the Senthil Kumar mission is not quoted from the article. No new definitions or platform theorem dependencies.

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