Determinants of contact multiplication matrices and their invertibility criterion
ProvedWeierstrassEllipticZeta.triangular_multiplication_determinantcommutative-algebraelliptic-functionstranscendencezero-estimates
Let , let be a finite set of points of , and assign a nonnegative integer to each point. Suppose is an ideal of whose elements vanish at each with . Put
Let and write . Assume
Let be a complex-algebra homomorphism. Suppose every is obtained by evaluating in , and that has characteristic polynomial .
Then for every ,
Moreover, is invertible if and only if for every with .
Zero multiplicities and the empty set are allowed. For the empty set, and the determinant of the resulting zero-by-zero matrix is . Distinct points need not have distinct time coordinates. This is a derived algebraic lemma for the mission's contact-quotient construction.
Preamble
import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Analysis.Complex.Polynomial.Basic import Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff import Mathlib.LinearAlgebra.Matrix.NonsingularInverse import Mathlib.RingTheory.Ideal.Basic open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.triangular_multiplication_determinant
(V : Finset (Fin 4 → ℂ)) (e : V → ℕ)
(I : Ideal (MvPolynomial (Fin 4) ℂ))
(hvanish : ∀ p ∈ I, ∀ v : V, 0 < e v → MvPolynomial.eval v.val p = 0)
(M : Polynomial ℂ)
(hM : M = ∏ v : V, (Polynomial.X - Polynomial.C (v.val 0)) ^ e v)
(r : Fin 3 → Polynomial ℂ)
(hmem : ∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p)
(ρ : MvPolynomial (Fin 4) ℂ →ₐ[ℂ]
Matrix (Fin M.natDegree) (Fin M.natDegree) ℂ)
(hρ : ∀ p : MvPolynomial (Fin 4) ℂ,
ρ p = Polynomial.aeval (ρ (MvPolynomial.X (0 : Fin 4)))
(MvPolynomial.aeval (Fin.cons Polynomial.X r) p))
(hchar : (ρ (MvPolynomial.X (0 : Fin 4))).charpoly = M) :
(∀ p : MvPolynomial (Fin 4) ℂ,
(ρ p).det = ∏ v : V, (MvPolynomial.eval v.val p) ^ e v) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
IsUnit (ρ p) ↔ ∀ v : V, 0 < e v → MvPolynomial.eval v.val p ≠ 0) := 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. Proved here under explicit ideal vanishing, triangular presentation, polynomial-evaluation representation and factored time characteristic-polynomial hypotheses. This lemma is not quoted from the article. It proves det(rho(p)) = product_v p(v)^e(v), and invertibility precisely when p(v) is nonzero at every positive-multiplicity point. Primary Mathlib references: IsAlgClosed.splits, Polynomial.Splits, Submonoid.closure_induction, Matrix.eval_charpoly, det_neg, det_mul, and isUnit_iff_isUnit_det. No Prove2Me theorem dependencies or new definitions.