Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.48 -- polyhedral_mconvex_iff_mnat_with_domain

Disproved
DiscreteConvex.MConvexFunctionsD.polyhedral_mconvex_iff_mnat_with_domain

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

convex-optimizationdiscrete-convex-analysis

Theorem 6.48 (p.162). A polyhedral M-convex function is polyhedral M♮^\natural♮-convex. Conversely, a polyhedral M♮^\natural♮-convex function is polyhedral M-convex if and only if its effective domain is contained in {x:x(V)=r}\{x:x(V)=r\}{x:x(V)=r} for some r∈Rr\in\mathbb Rr∈R.

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


Retired (2026-10-07). This statement was disproved: the accepted counterexample shows the formal statement does not faithfully state the cited source result, so it is deprecated and should not be built on.

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_DomR
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_MExchangeAxiomR
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_MNaturalConvexR
Formal statement
namespace DiscreteConvex.MConvexFunctionsD

open scoped Pointwise
open Classical
variable {V : Type*} [Fintype V] [DecidableEq V]
/-- Theorem 6.48 (p.181). -/
theorem polyhedral_mconvex_iff_mnat_with_domain (g : (V → ℝ) → WithTop ℝ) :
    (MExchangeAxiomR g → MNaturalConvexR g) ∧
    (MNaturalConvexR g → (MExchangeAxiomR g ↔ ∃ r : ℝ, ∀ x ∈ DomR g, ∑ v, x v = r)) := by sorry

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