Commutant of multiplication by a polynomial generator
ProvedWeierstrassEllipticZeta.polynomial_cyclic_commutantcommutative-algebraelliptic-functionstranscendencezero-estimates
Let and be commutative semirings, with an -algebra. Let , and assume that polynomial evaluation at is surjective: every element of is for some . For , write for the -linear multiplication operator.
For every -linear map ,
Thus the commutant of consists exactly of multiplication operators, with a unique multiplier for each operator. This identifies the commuting linear maps when an algebra is generated by one element. The statement includes trivial algebras and requires neither a field nor finite-dimensionality.
Preamble
import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Algebra.Algebra.Bilinear
Formal statement
theorem WeierstrassEllipticZeta.polynomial_cyclic_commutant
(R A : Type*) [CommSemiring R] [CommSemiring A] [Algebra R A]
(x : A)
(hx : Function.Surjective (fun q : Polynomial R => q.eval₂ (algebraMap R A) x))
(T : A →ₗ[R] A) :
(∀ a : A, T (x * a) = x * T a) ↔
∃! b : A, T = Algebra.lmul R A b := by sorry
Source
Derived supporting algebra lemma for the Senthil Kumar mission: if evaluation at x surjects from R[T] onto a commutative R-algebra A, an R-linear map T commutes with multiplication by x iff it is multiplication by a unique element of A. That element is T(1). The proof is polynomial induction, linearity and surjectivity. It is not quoted as a separate theorem of the source article. At Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474, Polynomial.induction_on' is in Algebra/Polynomial/Basic.lean lines 952-956 and Algebra.lmul is in Algebra/Algebra/Bilinear.lean lines 143-146. Primary documentation: https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Polynomial/Basic.html and https://leanprover-community.github.io/mathlib4_docs/Mathlib/Algebra/Algebra/Bilinear.html . R and A are commutative semirings; there is no field, finite-dimensionality or nontriviality assumption. No platform theorem dependencies or new definitions.