A submatrix has rank zero iff it vanishes
ProvedDiscreteConvex.MixedMatrices.matrixSubRank_eq_zero_iffdiscrete-convex-analysislinear-algebramixed-matrices
Let be finite index sets and an matrix over a field, with the submatrix with rows in and columns in . For index sets ,
Formalization Note. MatrixSubRank M I J is the platform definition of .
Preamble
import Mathlib import Definitions.Def_DiscreteConvex_MixedMatrices_MatrixSubRank
Formal statement
namespace DiscreteConvex.MixedMatrices
theorem matrixSubRank_eq_zero_iff {R C 𝔽 : Type*} [Fintype R] [Fintype C] [Field 𝔽]
(M : Matrix R C 𝔽) (I : Finset R) (J : Finset C) :
MatrixSubRank M I J = 0 ↔ ∀ i ∈ I, ∀ j ∈ J, M i j = 0 := by sorry
end DiscreteConvex.MixedMatrices
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, Chapter 12 (mixed matrices); elementary lemma used in formalising Theorem 12.8 (p. 358); not stated in the book