Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.46 -- integral_lconvex_iff_integral_argmin

Disproved
DiscreteConvex.LConvexFunctionsD.integral_lconvex_iff_integral_argmin

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

convex-optimizationdiscrete-convex-analysisdiscrete-geometry

Theorem 7.46 (p.198). For a polyhedral convex function g:RV→R∪{+∞}g:\mathbb R^V\to\mathbb R\cup\{+\infty\}g:RV→R∪{+∞} with dom⁡Rg≠∅\operatorname{dom}_{\mathbb R} g\ne\emptysetdomR​g=∅: g∈L[Z∣R→R]g\in L[\mathbb Z|\mathbb R\to\mathbb R]g∈L[Z∣R→R] iff arg⁡min⁡g[−x]∈L0[Z∣R]\arg\min g[-x]\in L_0[\mathbb Z|\mathbb R]argming[−x]∈L0​[Z∣R] for every xxx with arg⁡min⁡g[−x]\arg\min g[-x]argming[−x] nonempty. The integral refinement of Theorem 7.45's (a) ⇔\Leftrightarrow⇔ (d).

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.198, Theorem 7.46.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_LConvexFunctionsD_DomR
import Definitions.Def_DiscreteConvex_LConvexFunctionsD_IsIntegralPolyhedron
import Definitions.Def_DiscreteConvex_LConvexFunctionsD_LinearWeightR
import Definitions.Def_DiscreteConvex_LConvexFunctionsD_ArgMinR
import Definitions.Def_DiscreteConvex_LConvexFunctionsD_LConvexIntegralR
import Definitions.Def_DiscreteConvex_LConvexFunctionsD_LConvexPolyhedron
Formal statement
namespace DiscreteConvex.LConvexFunctionsD

open Classical
open scoped Pointwise
variable {V : Type*} [Fintype V] [DecidableEq V]
/-- Theorem 7.46 (p.198). The integral refinement of Theorem 7.45's (a) ⇔ (d). -/
theorem integral_lconvex_iff_integral_argmin (g : (V → ℝ) → WithTop ℝ) (hdom : (DomR g).Nonempty) :
    LConvexIntegralR g ↔
      ∀ x : V → ℝ, (ArgMinR (LinearWeightR g (fun v => - x v))).Nonempty →
        (LConvexPolyhedron (ArgMinR (LinearWeightR g (fun v => - x v))) ∧
          IsIntegralPolyhedron (ArgMinR (LinearWeightR g (fun v => - x v)))) := by sorry

end DiscreteConvex.LConvexFunctionsD
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.198, Theorem 7.46
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