Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, p. 23 — the coefficient matrix of the system (RS)–(CS) is totally unimodular

Proved
ProConChoice.Rational.rs_cs_matrix_tu

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

integer-programmingmatricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1total-unimodularity

Let III and JJJ be finite index sets. Consider the linear system in the unknowns λij\lambda_{ij}λij​, (i,j)∈I×J(i, j) \in I \times J(i,j)∈I×J, consisting of the row equations ∑j∈Jλij=ri\sum_{j \in J} \lambda_{ij} = r_i∑j∈J​λij​=ri​ for i∈Ii \in Ii∈I (RS) and the column equations ∑i∈Iλij=cj\sum_{i \in I} \lambda_{ij} = c_j∑i∈I​λij​=cj​ for j∈Jj \in Jj∈J (CS). Its coefficient matrix has one row for each i∈Ii \in Ii∈I, with a 111 in the columns (i,j)(i, j)(i,j), j∈Jj \in Jj∈J, and one row for each j∈Jj \in Jj∈J, with a 111 in the columns (i,j)(i, j)(i,j), i∈Ii \in Ii∈I, and zeros elsewhere. This matrix is totally unimodular:

every square submatrix has determinant 0,1 or −1.\text{every square submatrix has determinant } 0, 1 \text{ or } -1.every square submatrix has determinant 0,1 or −1.

In Section 7, III indexes the k!k!k! prefixes ordering X∖SX \setminus SX∖S and JJJ the alternatives of SSS; total unimodularity together with Lemma 4 makes the weights of the next step integral.

Formalization Note The matrix is indexed by rows I ⊕ J and columns I × J. The paper's description of the rows by integer indices on p. 23 does not match its own column ordering; the matrix stated here is the coefficient matrix of (RS)–(CS) that the text describes in words.

Preamble
import Mathlib
Formal statement
namespace ProConChoice.Rational

/-- Section 7 (p. 23): the coefficient matrix of the system (RS)–(CS) is totally unimodular. Its
columns are the variables `λᵢⱼ`, `(i, j) ∈ I × J`; the row of `i ∈ I` (RS) has a `1` exactly in the
columns `(i, j)`, `j ∈ J`, and the row of `j ∈ J` (CS) has a `1` exactly in the columns `(i, j)`,
`i ∈ I`. -/
theorem rs_cs_matrix_tu {I J : Type*} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J] :
    (Matrix.of (fun (r : I ⊕ J) (c : I × J) =>
      Sum.elim (fun i => if c.1 = i then (1 : ℝ) else 0)
        (fun j => if c.2 = j then (1 : ℝ) else 0) r)).IsTotallyUnimodular := by sorry

end ProConChoice.Rational
Source
Dogan & Yildiz, Every choice function is pro-con rationalizable, SSRN 3085542 (January 10, 2021), p. 23, Section 7 (proof of Theorem 1), total unimodularity of the matrix defining (RS) and (CS)
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 2026

    Confirmed by the mission captain (proposal self-audit).

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