Elementary skew Jacobi–Trudi matrices are totally nonnegativeRealRooted original
theorem elementaryMatrix_isTotallyNonneg {ι : Type*} {n : ℕ}
(s : Finset ι) (α : ι → ℝ) (hα : ∀ i ∈ s, 0 ≤ α i)
{h k : Fin n → ℕ} (hh : Antitone h) (hk : Antitone k) :
(elementaryMatrix s α h k).IsTotallyNonneg
Parity-compatible specialization assuming positive constant determinantRealRooted original
theorem elementarySubstitution_isPFPolynomial {ι : Type*} {n : ℕ}
(s : Finset ι) (α : ι → ℝ) (hα : ∀ i ∈ s, 0 ≤ α i)
{h k : Fin n → ℕ} (hh : Antitone h) (hk : Antitone k) (r : ℤ)
(hdet : 0 < (elementaryMatrix s α h k).det)
(hpar : ∀ i j, (columnIndex h i : ℤ) = columnIndex k j + r →
Even (i.val + j.val)) :
IsPFPolynomial (elementarySubstitution s α h k r)
Corner-section interlacing for general totally nonnegative pencilsRealRooted original
theorem IsTotallyNonneg.strictInterl_checkerboardPencil_succ {n : ℕ}
{A B : Matrix (Fin (n + 1)) (Fin (n + 1)) ℝ}
(hA : A.IsTotallyNonneg) (hB : B.IsTotallyNonneg) (hdet : 0 < A.det)
(hminor : 0 < (A.submatrix Fin.succ Fin.succ).det) :
RealRooted.StrictInterl
(checkerboardPencil (A.submatrix Fin.succ Fin.succ)
(B.submatrix Fin.succ Fin.succ)) (checkerboardPencil A B)
Conditional parity criterion for a totally nonnegative determinant pencilRealRooted original
theorem isPFPolynomial_det_active {n : ℕ} {M : Matrix (Fin n) (Fin n) ℝ}
{a b : Fin n → ℤ} {r : ℤ} (hM : M.IsTotallyNonneg) (hdet : 0 < M.det)
(ha : StrictAnti a) (hb : StrictAnti b)
(hpar : ∀ i j, a i = b j + r → Even (i.val + j.val)) :
RealRooted.IsPFPolynomial
(Matrix.det (M.map C + (X : ℝ[X]) • (activeMatrix a b r).map C))
Positive constant determinant from the number of positive lettersRealRooted original
theorem det_elementaryMatrix_pos_of_nonneg {ι : Type*} {n : ℕ} (s : Finset ι)
(a : ι → ℝ) (ha : ∀ i ∈ s, 0 ≤ a i)
{h k : Fin n → ℕ} (hh : Antitone h) (hk : Antitone k)
(hkh : ∀ i, k i ≤ h i)
(hsize : ∀ i, h i ≤ k i + (s.filter fun j => 0 < a j).card) :
0 < (elementaryMatrix s a h k).det
Real-rooted dual Jacobi–Trudi specialization under alphabet-size and parity hypothesesMain resultRealRooted original
theorem elementarySubstitution_isRealRooted :
elementarySubstitution s a h k r ≠ 0 ∧ (elementarySubstitution s a h k r).Splits
All roots of the parity-compatible specialization are strictly negativeRealRooted original
theorem roots_elementarySubstitution_neg :
∀ x ∈ (elementarySubstitution s a h k r).roots, x < 0
Consecutive leading sections of general TN pencils interlaceRealRooted original
theorem IsTotallyNonneg.strictInterl_checkerboardPencil_castSucc {n : ℕ}
{A B : Matrix (Fin (n + 1)) (Fin (n + 1)) ℝ}
(hA : A.IsTotallyNonneg) (hB : B.IsTotallyNonneg) (hdet : 0 < A.det)
(hminor : 0 < (A.submatrix Fin.castSucc Fin.castSucc).det) :
RealRooted.StrictInterl
(checkerboardPencil (A.submatrix Fin.castSucc Fin.castSucc)
(B.submatrix Fin.castSucc Fin.castSucc)) (checkerboardPencil A B)
Real-rootedness under odd active-position parityRealRooted original
theorem elementarySubstitution_isRealRooted_of_odd :
elementarySubstitution s a h k r ≠ 0 ∧ (elementarySubstitution s a h k r).Splits
Strictly positive roots under odd active-position parityRealRooted original
theorem roots_elementarySubstitution_pos_of_odd :
∀ x ∈ (elementarySubstitution s a h k r).roots, 0 < x
Every horizontal stretch is real-rooted under even boundary parityRealRooted original
theorem repeatColumns_isRealRooted (hpar : ∀ i j, Even (h i + k j + r)) (m : ℕ) :
elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r ≠ 0 ∧
(elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r).Splits
Strictly negative roots under all horizontal stretchesRealRooted original
theorem roots_repeatColumns_neg (hpar : ∀ i j, Even (h i + k j + r)) (m : ℕ) :
∀ x ∈ (elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r).roots,
x < 0
Every horizontal stretch is real-rooted under odd boundary parityRealRooted original
theorem repeatColumns_isRealRooted_of_odd (hpar : ∀ i j, Odd (h i + k j + r)) (m : ℕ) :
elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r ≠ 0 ∧
(elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r).Splits
Strictly positive roots for odd-parity horizontal stretchesRealRooted original
theorem roots_repeatColumns_pos (hpar : ∀ i j, Odd (h i + k j + r)) (m : ℕ) :
∀ x ∈ (elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r).roots,
0 < x
Constant skew column height gives det(M+tI)RealRooted original
theorem elementarySubstitution_eq_det_add_X_one {ι : Type*} {n : ℕ}
(s : Finset ι) (a : ι → ℝ) {h k : Fin n → ℕ}
(hk : Antitone k) (r : ℕ) (hheight : ∀ i, h i = k i + r) :
elementarySubstitution s a h k r =
det ((elementaryMatrix s a h k).map C + (X : ℝ[X]) • 1)
All constant-column-height stretches are real-rootedRealRooted original
theorem repeatColumns_isRealRooted_of_constant_height {ι : Type*} {n : ℕ}
(s : Finset ι) (a : ι → ℝ) (ha : ∀ i ∈ s, 0 ≤ a i)
{h k : Fin n → ℕ} (hh : Antitone h) (hk : Antitone k)
(r : ℕ) (hheight : ∀ i, h i = k i + r)
(hsize : r ≤ (s.filter fun i => 0 < a i).card) (m : ℕ) :
elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r ≠ 0 ∧
(elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r).Splits
Constant-column-height stretches have negative rootsRealRooted original
theorem roots_repeatColumns_neg_of_constant_height {ι : Type*} {n : ℕ}
(s : Finset ι) (a : ι → ℝ) (ha : ∀ i ∈ s, 0 ≤ a i)
{h k : Fin n → ℕ} (hh : Antitone h) (hk : Antitone k)
(r : ℕ) (hheight : ∀ i, h i = k i + r)
(hsize : r ≤ (s.filter fun i => 0 < a i).card) (m : ℕ) :
∀ x ∈ (elementarySubstitution s a (repeatColumns h m) (repeatColumns k m) r).roots,
x < 0
Duplicating rows gives real-rooted families for every even moving coordinateRealRooted original
theorem repeatColumns_double_isRealRooted {ι : Type*} {n : ℕ}
(s : Finset ι) (a : ι → ℝ) (ha : ∀ i ∈ s, 0 ≤ a i)
{h k : Fin n → ℕ} (hh : Antitone h) (hk : Antitone k) (hkh : ∀ i, k i ≤ h i)
(hsize : ∀ i, 2 * h i ≤ 2 * k i + (s.filter fun j => 0 < a j).card)
(r m : ℕ) :
elementarySubstitution s a (repeatColumns (fun i => 2 * h i) m)
(repeatColumns (fun i => 2 * k i) m) (2 * r) ≠ 0 ∧
(elementarySubstitution s a (repeatColumns (fun i => 2 * h i) m)
(repeatColumns (fun i => 2 * k i) m) (2 * r)).Splits
Duplicated-row families have negative roots under all stretchesRealRooted original
theorem roots_repeatColumns_double_neg {ι : Type*} {n : ℕ}
(s : Finset ι) (a : ι → ℝ) (ha : ∀ i ∈ s, 0 ≤ a i)
{h k : Fin n → ℕ} (hh : Antitone h) (hk : Antitone k) (hkh : ∀ i, k i ≤ h i)
(hsize : ∀ i, 2 * h i ≤ 2 * k i + (s.filter fun j => 0 < a j).card)
(r m : ℕ) :
∀ x ∈ (elementarySubstitution s a (repeatColumns (fun i => 2 * h i) m)
(repeatColumns (fun i => 2 * k i) m) (2 * r)).roots, x < 0
Consecutive compatible skew suffixes interlaceRealRooted original
theorem strictInterl_elementarySubstitution_succ {ι : Type*} {n : ℕ}
(s : Finset ι) (a : ι → ℝ) (ha : ∀ i ∈ s, 0 ≤ a i)
{h k : Fin (n + 1) → ℕ} (hh : Antitone h) (hk : Antitone k)
(hkh : ∀ i, k i ≤ h i)
(hsize : ∀ i, h i ≤ k i + (s.filter fun j => 0 < a j).card)
(r : ℤ) (hpar : ∀ i j, (columnIndex h i : ℤ) = columnIndex k j + r →
Even (i.val + j.val)) :
StrictInterl (elementarySubstitution s a (h ∘ Fin.succ) (k ∘ Fin.succ) r)
(elementarySubstitution s a h k r)
The rectangular definition equals the signed elementary substitutionRealRooted original
theorem rectangularElementarySubstitution_eq_det {ι : Type*} (s : Finset ι)
(a : ι → ℝ) (r j n : ℕ) :
rectangularElementarySubstitution s a r j n =
det ((elementaryMatrix s a (fun _ : Fin n => r) (fun _ => 0)).map C +
(X : ℝ[X]) • ((-1 : ℝ) ^ (r + j) • activeMatrix
(fun i => (columnIndex (fun _ : Fin n => r) i : ℤ))
(fun i => (columnIndex (fun _ : Fin n => 0) i : ℤ)) j).map C)
Every signed rectangular specialization is real-rootedRealRooted original
theorem rectangularElementarySubstitution_isRealRooted (n : ℕ) :
rectangularElementarySubstitution s a r j n ≠ 0 ∧
(rectangularElementarySubstitution s a r j n).Splits
Every signed rectangular specialization has negative rootsRealRooted original
theorem roots_rectangularElementarySubstitution_neg (n : ℕ) :
∀ x ∈ (rectangularElementarySubstitution s a r j n).roots, x < 0
Consecutive rectangular widths interlace for every moving coordinateRealRooted original
theorem strictInterl_rectangularElementarySubstitution (n : ℕ) :
StrictInterl (rectangularElementarySubstitution s a r j n)
(rectangularElementarySubstitution s a r j (n + 1))
Supported minors of Toeplitz matrices of positive linear-factor products are positiveRealRooted original
theorem det_toeplitz_prod_linear_pos {ι : Type*} (s : Finset ι) (a : ι → ℝ)
(ha : ∀ i ∈ s, 0 < a i) {n : ℕ}
(rows cols : Fin n → ℕ) (hrows : StrictMono rows) (hcols : StrictMono cols)
(hlo : ∀ i, cols i ≤ rows i) (hhi : ∀ i, rows i ≤ cols i + s.card) :
0 < ((toeplitz (∏ i ∈ s, (X - C (-a i))).coeff).submatrix rows cols).det
Supported minors of a bidiagonal Toeplitz matrix are strictly positiveRealRooted original
theorem det_bidiagonal_submatrix_pos {a : ℝ} (ha : 0 < a) {n : ℕ}
{rows cols : Fin n → ℕ} (hrows : StrictMono rows) (hcols : StrictMono cols)
(hlo : ∀ i, cols i ≤ rows i) (hhi : ∀ i, rows i ≤ cols i + 1) :
0 < ((bidiagonal a).submatrix rows cols).det