A generic square block with nonzero diagonal is nonsingular
ProvedDiscreteConvex.MixedMatrices.matrixSubRank_eq_card_of_nonzero_transversaldiscrete-convex-analysislinear-algebramixed-matrices
Throughout, and are finite index sets, are fields (in Lean: Algebra K F), and for a matrix and subsets , we write for the submatrix with rows in and columns in and , for matrices over and over . A mixed matrix is with over and the nonzero entries of algebraically independent over (Murota, Ch. 12).
Let be a matrix over whose nonzero entries are algebraically independent over . Let and let be injective on with for every . Then the square submatrix is nonsingular:
Formalization Note. Algebraic independence is that of the family of nonzero entries, indexed by the positions with .
Preamble
import Mathlib import Definitions.Def_DiscreteConvex_MixedMatrices_MatrixSubRank
Formal statement
namespace DiscreteConvex.MixedMatrices
theorem matrixSubRank_eq_card_of_nonzero_transversal {R C K F : Type*} [Fintype R] [Fintype C]
[Field K] [Field F] [Algebra K F] [DecidableEq R] [DecidableEq C] (T : Matrix R C F)
(hT : AlgebraicIndependent K (fun e : {p : R × C // T p.1 p.2 ≠ 0} => T e.1.1 e.1.2))
(J : Finset C) (ψ : C → R) (hψ : Set.InjOn ψ (J : Set C)) (hne : ∀ c ∈ J, T (ψ c) c ≠ 0) :
MatrixSubRank T (J.image ψ) J = J.card := by sorry
end DiscreteConvex.MixedMatrices
Source
Standard fact on generic matrices (a square matrix with algebraically independent nonzero entries and a nonzero diagonal is nonsingular); auxiliary lemma for Murota, Discrete Convex Analysis, SIAM 2003, Theorem 12.8 (p. 358); not stated in the book