Power sums and the determinant Schur specialization #
Given a sequence t : ℕ → ℂ of prospective power sums, this module
defines the complete homogeneous sequence newtonH t by the Newton
recursion (n+1) · h (n+1) = ∑_{i ≤ n} t (i+1) · h (n−i), its
integer-indexed extension newtonHZ (zero in negative degrees), and
the Schur specialization
`schurDet t rows = det (newtonHZ t (rows i + j − i))`,
the Jacobi–Trudi determinant read as a definition. All Schur
values in this development are these determinants; the link to the
symmetric-group characters is the frobenius field of
SchurPackage in Interfaces/SchurPackage.lean.
The complete homogeneous sequence attached to a sequence of
power sums, via the Newton recursion
(n+1) · h (n+1) = ∑_{i ≤ n} t (i+1) · h (n−i); h 0 = 1.
Equations
- RS.newtonH t 0 = 1
- RS.newtonH t n.succ = (↑n + 1)⁻¹ * ∑ i ∈ Finset.range (n + 1), t (i + 1) * RS.newtonH t (n - i)
Instances For
Integer-indexed extension of newtonH, vanishing in negative
degrees — the form entering the Jacobi–Trudi determinant.
Equations
- RS.newtonHZ t n = if 0 ≤ n then RS.newtonH t n.toNat else 0
Instances For
The Schur specialization of a row-length list rows, defined as
the Jacobi–Trudi determinant det (h_{rows i − i + j})_{i,j}.
Equations
- RS.schurDet t rows = (Matrix.of fun (i j : Fin rows.length) => RS.newtonHZ t (↑(rows.get i) + ↑↑j - ↑↑i)).det
Instances For
The Schur specialization of a Young diagram: schurDet on its
row-length list.
Equations
- RS.diagramSchur μ t = RS.schurDet t μ.rowLens