Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Independent transversals of the mixed-matrix family are bounded by the rank

Proved
DiscreteConvex.MixedMatrices.card_le_rank_of_indep_transversal

by moona3k · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-convex-analysislinear-algebramixed-matrices

Throughout, RRR and CCC are finite index sets, K⊆FK\subseteq FK⊆F are fields (in Lean: Algebra K F), and for a matrix MMM and subsets I⊆RI\subseteq RI⊆R, J⊆CJ\subseteq CJ⊆C we write M[I,J]M[I,J]M[I,J] for the submatrix with rows in III and columns in JJJ and ρ(I,J)=rank⁡Q[I,J]\rho(I,J)=\operatorname{rank}Q[I,J]ρ(I,J)=rankQ[I,J], τ(I,J)=rank⁡T[I,J]\tau(I,J)=\operatorname{rank}T[I,J]τ(I,J)=rankT[I,J] for matrices QQQ over KKK and TTT over FFF. A mixed matrix is A=Q+TA=Q+TA=Q+T with QQQ over KKK and the nonzero entries of TTT algebraically independent over KKK (Murota, Ch. 12).

Let A=Q+TA=Q+TA=Q+T be a mixed matrix. For each column c∈Cc\in Cc∈C let Ac⊆FR\mathcal A_c\subseteq F^RAc​⊆FR consist of the column QcQ_cQc​ of QQQ (viewed over FFF) together with the unit vectors ese_ses​ for those rows sss with Tsc≠0T_{sc}\neq0Tsc​=0. If (vc)c∈J(v_c)_{c\in J}(vc​)c∈J​ is a linearly independent partial transversal of the family (Ac)c∈C(\mathcal A_c)_{c\in C}(Ac​)c∈C​, that is vc∈Acv_c\in\mathcal A_cvc​∈Ac​ for c∈Jc\in Jc∈J, then

∣J∣≤rank⁡A.|J|\le\operatorname{rank}A .∣J∣≤rankA.

Formalization Note. hA : IsMixedMatrix A Q T is the platform notion of a mixed matrix.

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_MixedMatrices_IsMixedMatrix
import Definitions.Def_DiscreteConvex_MixedMatrices_MatrixSubRank
Formal statement
namespace DiscreteConvex.MixedMatrices

theorem card_le_rank_of_indep_transversal {R C K F : Type*} [Fintype R] [Fintype C] [Field K]
    [Field F] [Algebra K F] [DecidableEq R] [DecidableEq C]
    (A : Matrix R C F) (Q : Matrix R C K) (T : Matrix R C F) (hA : IsMixedMatrix A Q T)
    (J : Finset C) (v : C → R → F)
    (hv : ∀ c ∈ J, v c ∈ ({fun r : R => algebraMap K F (Q r c)} ∪
      (fun s : R => (Pi.single s (1 : F) : R → F)) '' {s : R | T s c ≠ 0}))
    (hind : LinearIndepOn F v (J : Set C)) :
    J.card ≤ A.rank := by sorry

end DiscreteConvex.MixedMatrices
Source
Auxiliary lemma for Murota, Discrete Convex Analysis, SIAM 2003, Theorem 12.9 (p. 358), using Theorem 12.7 (p. 357); the route through Rado's theorem is not the book's

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me