Proposition 6.1 — submodularity of the rank of submatrices
ProvedApproxCliqueWidth.Certificate.rank_submatrix_submodularlinear-algebramatrix-rankp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1submodular-functions
Let be a matrix over a field , with and finite. For all and ,
This rank inequality is the linear-algebra input behind the submodularity of cut-rank; it is not in Mathlib.
Formalization Note is Matrix.submatrix with rows and columns indexed by the elements of the finite sets and ; ranks are natural numbers and the field is arbitrary.
Preamble
import Mathlib
Formal statement
namespace ApproxCliqueWidth.Certificate
/-- Oum–Seymour Proposition 6.1 (p. 522): submodularity of the rank of submatrices,
`rk M[X₁, Y₁] + rk M[X₂, Y₂] ≥ rk M[X₁ ∪ X₂, Y₁ ∩ Y₂] + rk M[X₁ ∩ X₂, Y₁ ∪ Y₂]`. -/
theorem rank_submatrix_submodular {F R C : Type*} [Field F] [Fintype R] [Fintype C]
[DecidableEq R] [DecidableEq C] (M : Matrix R C F) (X₁ X₂ : Finset R) (Y₁ Y₂ : Finset C) :
(M.submatrix (fun i : ↥(X₁ ∪ X₂) => (i : R)) (fun j : ↥(Y₁ ∩ Y₂) => (j : C))).rank +
(M.submatrix (fun i : ↥(X₁ ∩ X₂) => (i : R)) (fun j : ↥(Y₁ ∪ Y₂) => (j : C))).rank ≤
(M.submatrix (fun i : ↥X₁ => (i : R)) (fun j : ↥Y₁ => (j : C))).rank +
(M.submatrix (fun i : ↥X₂ => (i : R)) (fun j : ↥Y₂ => (j : C))).rank := by sorry
end ApproxCliqueWidth.Certificate
Source
Oum and Seymour, Approximating clique-width and branch-width, J. Combin. Theory Ser. B 96 (2006) 514–528, p. 522, Proposition 6.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.