The generic determinant is irreducible
ProvedHararySachs.Hyper.det_generic_irreduciblecommutative-algebralinear-algebra
Let be a field and . Let be a matrix of independent indeterminates. Then is an irreducible element of the polynomial ring .
A standard proof goes by induction on . Write , where is the complementary minor and , do not involve . By induction is irreducible. Moreover : at the permutation matrix of the transposition we have but . A polynomial of degree in one variable whose coefficients have no common factor is irreducible.
Formalization Note The ring is MvPolynomial (Fin n × Fin n) K and the matrix is Matrix.of fun i j => X (i, j).
Preamble
import Mathlib
Formal statement
namespace HararySachs.Hyper
/-- The determinant of the generic `n × n` matrix is irreducible. -/
theorem det_generic_irreducible (K : Type*) [Field K] (n : ℕ) (hn : 1 ≤ n) :
Irreducible (Matrix.det (Matrix.of fun i j : Fin n =>
(MvPolynomial.X (i, j) : MvPolynomial (Fin n × Fin n) K))) := by
sorry
end HararySachs.Hyper
Source
Classical; e.g. Bôcher, Introduction to Higher Algebra, §61. Used in mission strategy comments 8357894d-0c47-45af-94e5-d71263b245a7 and d6dcd7bc-30eb-4f12-bbe1-a5cdf67294f9.