Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weak duality for the rank of a mixed matrix

Proved
DiscreteConvex.MixedMatrices.rank_le_matrixSubRank_add

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 K⊆FK\subseteq FK⊆F be fields and A=Q+TA=Q+TA=Q+T entrywise, with QQQ over KKK and TTT over FFF. Then for all I⊆RI\subseteq RI⊆R, J⊆CJ\subseteq CJ⊆C,

rank⁡A≤ρ(I,J)+τ(I,J)+∣R∖I∣+∣C∖J∣.\operatorname{rank}A\le\rho(I,J)+\tau(I,J)+|R\setminus I|+|C\setminus J| .rankA≤ρ(I,J)+τ(I,J)+∣R∖I∣+∣C∖J∣.

This is the easy (weak duality) inequality behind the min-formulas for the rank of a mixed matrix. No independence of the entries of TTT is needed.

Formalization Note. The hypothesis is only the entrywise decomposition A i j = algebraMap K F (Q i j) + T i j.

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

theorem rank_le_matrixSubRank_add {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 : ∀ i j, A i j = algebraMap K F (Q i j) + T i j) (I : Finset R) (J : Finset C) :
    A.rank ≤ MatrixSubRank Q I J + MatrixSubRank T I J + Iᶜ.card + Jᶜ.card := by sorry

end DiscreteConvex.MixedMatrices
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, Chapter 12 (mixed matrices), Theorem 12.8 (p. 358): the inequality rank A <= the minima in Eqs. (12.10)-(12.12) (weak duality)

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