Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fitting decomposition and stabilization of quotient multiplication powers

Proved
WeierstrassEllipticZeta.quotient_multiplication_fitting

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let AAA be a commutative complex algebra, let III be an ideal, and let β\betaβ be a basis of A/IA/IA/I indexed by {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}. Suppose that ρ:A→Mat⁡d(C)\rho:A\to\operatorname{Mat}_d(\mathbb C)ρ:A→Matd​(C) is an algebra homomorphism and that ρ(p)\rho(p)ρ(p) is the matrix of multiplication by the class of ppp in the basis β\betaβ.

For each p∈Ap\in Ap∈A, put T=ρ(p)T=\rho(p)T=ρ(p). Its kernel and image at exponent ddd are complementary subspaces of Cd\mathbb C^dCd, and there is a complex-linear isomorphism

A/I≃ker⁡Td×im⁡Td.A/I\simeq\ker T^d\times\operatorname{im}T^d.A/I≃kerTd×imTd.

For every integer N≥dN\ge dN≥d,

ker⁡TN=ker⁡Td,im⁡TN=im⁡Td,\ker T^N=\ker T^d,\qquad \operatorname{im}T^N=\operatorname{im}T^d,kerTN=kerTd,imTN=imTd,

and the residual colon ideals satisfy

I:pN=I:pd.I:p^N=I:p^d.I:pN=I:pd.

Here I:pn={a∈A:apn∈I}I:p^n=\{a\in A:ap^n\in I\}I:pn={a∈A:apn∈I}. The ambient algebra AAA need not be finite-dimensional, and the statement includes d=0d=0d=0.

Preamble
import Mathlib.Data.Complex.Basic
import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
import Mathlib.LinearAlgebra.Matrix.ToLin
import Mathlib.LinearAlgebra.Prod
import Mathlib.RingTheory.Artinian.Module
import Mathlib.RingTheory.Ideal.Colon
import Mathlib.RingTheory.Ideal.Quotient.Operations

open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.quotient_multiplication_fitting
    (A : Type*) [CommRing A] [Algebra ℂ A]
    (I : Ideal A) (d : ℕ) (β : Module.Basis (Fin d) ℂ (A ⧸ I))
    (ρ : A →ₐ[ℂ] Matrix (Fin d) (Fin d) ℂ)
    (hρ : ∀ p : A, ρ p = Algebra.leftMulMatrix β (Ideal.Quotient.mk I p)) :
    ∀ p : A,
      IsCompl (LinearMap.ker ((ρ p) ^ d).mulVecLin)
        (LinearMap.range ((ρ p) ^ d).mulVecLin) ∧
      Nonempty ((A ⧸ I) ≃ₗ[ℂ]
        (LinearMap.ker ((ρ p) ^ d).mulVecLin) ×
          (LinearMap.range ((ρ p) ^ d).mulVecLin)) ∧
      ∀ N : ℕ, d ≤ N →
        LinearMap.ker ((ρ p) ^ N).mulVecLin =
          LinearMap.ker ((ρ p) ^ d).mulVecLin ∧
        LinearMap.range ((ρ p) ^ N).mulVecLin =
          LinearMap.range ((ρ p) ^ d).mulVecLin ∧
        I.colon {p ^ N} = I.colon {p ^ d} := by sorry
Source
Derived finite-algebra 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. For a quotient of dimension d it proves that multiplication kernels, images and colon ideals stabilize at exponent d, and constructs the Fitting direct-sum decomposition. Primary Mathlib references: Module.End.ker_pow_eq_ker_pow_finrank_of_le, LinearMap.iterateRange, LinearMap.finrank_range_add_finrank_ker, LinearMap.eventually_isCompl_ker_pow_range_pow, Submodule.prodEquivOfIsCompl and Algebra.leftMulMatrix_mulVec_repr. 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