Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.12 -- nine equivalent characterizations of L-inverse matrices

Proved
DiscreteConvex.CombinatorialB.theorem_2_12_nine_conditions_equivalent

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-convex-analysisdualitylinear-algebra

For an n×nn\times nn×n nonsingular symmetric matrix MMM, nine conditions (a),(b),(b+),(c),(c+),(d),(d+),(e),(e+) -- membership in L−1\mathcal L^{-1}L−1, two sign-consistency inequalities and their strict forms, two directional-derivative exchange conditions and their strict forms, and the exchange property (M♮-EXC[R])(\mathrm{M}^\natural\text{-EXC}[\mathbb R])(M♮-EXC[R]) and its strict form -- are all equivalent.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, pp.70-71, Theorem 2.12.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_CombinatorialB_MemLInv
import Definitions.Def_DiscreteConvex_CombinatorialB_CondB
import Definitions.Def_DiscreteConvex_CombinatorialB_CondBPlus
import Definitions.Def_DiscreteConvex_CombinatorialB_CondC
import Definitions.Def_DiscreteConvex_CombinatorialB_CondCPlus
import Definitions.Def_DiscreteConvex_CombinatorialB_CondD
import Definitions.Def_DiscreteConvex_CombinatorialB_CondDPlus
import Definitions.Def_DiscreteConvex_CombinatorialB_QF
import Definitions.Def_DiscreteConvex_CombinatorialB_MNatExchangeR
import Definitions.Def_DiscreteConvex_CombinatorialB_MNatExchangePlusR
Formal statement
/-!
Murota, *Discrete Convex Analysis*, SIAM 2003, pp.70-71, Theorem 2.12, in
`DiscreteConvex.CombinatorialB`.
-/

namespace DiscreteConvex.CombinatorialB

/-- **Theorem 2.12.** For an `n×n` nonsingular symmetric matrix `M`, the nine conditions
(a), (b), (b+), (c), (c+), (d), (d+), (e), (e+) are all equivalent. -/
theorem theorem_2_12_nine_conditions_equivalent {V : Type*} [Fintype V] [DecidableEq V]
    (M : Matrix V V ℝ) (hsymm : M.IsSymm) (hnonsing : M.det ≠ 0) :
    List.TFAE [MemLInv M, CondB M, CondBPlus M, CondC M, CondCPlus M, CondD M, CondDPlus M,
      MNatExchangeR (QF M), MNatExchangePlusR (QF M)] := by sorry

end DiscreteConvex.CombinatorialB
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, pp.70-71, Theorem 2.12
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 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