Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.8 -- quadratic_form_mconvex_iff

Proved
DiscreteConvex.MConvexFunctionsB.quadratic_form_mconvex_iff

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

convex-optimizationdiscrete-convex-analysis

Proposition 6.8 (p.139). Let A=(aij)A=(a_{ij})A=(aij​) be a symmetric matrix and f(x)=12x⊤Axf(x)=\tfrac12 x^\top A xf(x)=21​x⊤Ax. (1) On {x∈Zn:∑ix(i)=r}\{x \in \mathbb Z^n : \sum_i x(i)=r\}{x∈Zn:∑i​x(i)=r}, fff is M-convex iff {i,j}∩{k,l}=∅  ⟹  aij+akl≥min⁡(aik+ajl,ail+ajk)\{i,j\}\cap\{k,l\}=\emptyset \implies a_{ij}+a_{kl} \ge \min(a_{ik}+a_{jl}, a_{il}+a_{jk}){i,j}∩{k,l}=∅⟹aij​+akl​≥min(aik​+ajl​,ail​+ajk​) (Eq. (6.25)). (2) On all of Zn\mathbb Z^nZn, fff is M♮^\natural♮-convex iff additionally {i,j}∩{k}=∅  ⟹  aij≥min⁡(aik,ajk)\{i,j\}\cap\{k\}=\emptyset \implies a_{ij}\ge\min(a_{ik},a_{jk}){i,j}∩{k}=∅⟹aij​≥min(aik​,ajk​) (Eq. (6.27)) and aij≥0a_{ij}\ge 0aij​≥0 for every (i,j)(i,j)(i,j) (Eq. (6.28)).

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.139, Proposition 6.8, Eq. (6.25)-(6.28).)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_MConvexFunctionsB_MExchangeAxiom
import Definitions.Def_DiscreteConvex_MConvexFunctionsB_QuadraticFormRestricted
import Definitions.Def_DiscreteConvex_MConvexFunctionsB_MNaturalConvex
import Definitions.Def_DiscreteConvex_MConvexFunctionsB_QuadraticFormTotal
Formal statement
/-!
Murota, *Discrete Convex Analysis*, SIAM 2003, p.139, Proposition 6.8, in `DiscreteConvex.MConvexFunctionsB`.
-/

namespace DiscreteConvex.MConvexFunctionsB

/-- Proposition 6.8 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.139). See the item's
`natural_language_statement` for the full statement. -/
theorem quadratic_form_mconvex_iff (n : ℕ) (A : Matrix (Fin n) (Fin n) ℝ) (hA : A.IsSymm)
    (r : ℤ) :
    (MExchangeAxiom (QuadraticFormRestricted n A r) ↔
      ∀ i j k l : Fin n, Disjoint ({i, j} : Finset (Fin n)) ({k, l} : Finset (Fin n)) →
        A i j + A k l ≥ min (A i k + A j l) (A i l + A j k)) ∧
    (MNaturalConvex (QuadraticFormTotal n A) ↔
      (∀ i j k l : Fin n, Disjoint ({i, j} : Finset (Fin n)) ({k, l} : Finset (Fin n)) →
        A i j + A k l ≥ min (A i k + A j l) (A i l + A j k)) ∧
      (∀ i j k : Fin n, Disjoint ({i, j} : Finset (Fin n)) ({k} : Finset (Fin n)) →
        A i j ≥ min (A i k) (A j k)) ∧
      (∀ i j : Fin n, A i j ≥ 0)) := by sorry

end DiscreteConvex.MConvexFunctionsB
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.139, Proposition 6.8
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