Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unique multiplicative generalized inverse from pointwise existence

Proved
WeierstrassEllipticZeta.multiplicative_drazin_inverse

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let A and B be commutative rings, f:A→B a ring homomorphism, and d a natural number. Suppose that for every a in A there is b in B with f(a)bb=b and f(a)^(d+1)*b=f(a)^d.

There is a unique homomorphism G from the multiplicative monoid with zero of A to that of B such that, for every a, f(a)*G(a)*G(a)=G(a) and f(a)^(d+1)G(a)=f(a)^d. In particular, G(0)=0, G(1)=1, and G(xy)=G(x)*G(y). Only existence of the individual witnesses is assumed; their uniqueness is part of the proof. The theorem includes d=0 and trivial rings.

In the mission, f is the quotient map from the polynomial ring to a contact quotient, and d is the degree of its monic time polynomial. The individual generalized inverses therefore form one canonical multiplicative map.

Preamble
import Mathlib.Algebra.Ring.Hom.Defs
import Mathlib.Logic.ExistsUnique

open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.multiplicative_drazin_inverse
    (A B : Type*) [CommRing A] [CommRing B] (f : A →+* B) (d : ℕ)
    (h : ∀ a : A, ∃ b : B,
      f a * b * b = b ∧ (f a) ^ (d + 1) * b = (f a) ^ d) :
    ∃! G : A →*₀ B, ∀ a : A,
      f a * G a * G a = G a ∧ (f a) ^ (d + 1) * G a = (f a) ^ d := by sorry
Source
Derived commutative-ring lemma for the approach associated with Senthil Kumar K (2026), Appendix A and Theorem A.2, https://doi.org/10.1017/S001309152610145X. This lemma is proved here and is not quoted from the article. Given a ring homomorphism f:A→B and a fixed natural exponent d, existence for each a of b satisfying f(a)*b*b=b and f(a)^(d+1)*b=f(a)^d yields a unique zero-preserving monoid homomorphism G:A→B satisfying these relations pointwise. Uniqueness is proved from the equations; it is not an input hypothesis. Products of witnesses give the multiplication law. No Prove2Me theorem dependencies or 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