Barrett-Johnson inequalities for totally nonnegative matrices
Abstract
Given a matrix A, let AI,J denote the submatrix of A determined by rows I and columns J. Fischer's Inequalities state that for each n × n Hermitian positive semidefinite matrix A, and each subset I of \1,…c,n\ and its complement Ic, we have (A) ≤ (AI,I)(AIc,Ic). Barrett and Johnson (Linear Multilinear Algebra 34, 1993) extended these to state inequalities for sums of products of principal minors whose orders are given by nonincreasing integer sequences (λ1,…c,λr), (μ1,…c,μs) summing to n. Specifically, if λ1+·s+λi≤ μ1+·s+μi for all i, then λ1!·sλr! Σ(I1,…c,Ir) (AI1,I1) ·s (AIr,Ir) ~≥~ μ1!·sμs! Σ(J1,…c,Js) (AJ1,J1) ·s (AJs,Js), where sums are over sequences of disjoint subsets of \1,…c,n\ satisfying |Ik| = λk, |Jk| = μk. We show that these inequalities hold for totally nonnegative matrices as well.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.