Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.1 -- L-natural-convexity equals the direct translation-submodularity axiom

Proved
DiscreteConvex.LConvexFunctions.lnat_convex_iff_sbf_nat

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

combinatoricsdiscrete-convex-analysis

Theorem 7.1 (p.178). For g:ZV→R∪{+∞}g : \mathbb Z^V \to \mathbb R \cup \{+\infty\}g:ZV→R∪{+∞} with dom⁡g≠∅\operatorname{dom} g \ne \emptysetdomg=∅, ggg is L♮^\natural♮-convex if and only if ggg satisfies the direct translation-submodularity axiom (SBF♮^\natural♮[Z]). The direct analogue, for L-convexity, of chunk 06's Theorem 6.2 for M♮^\natural♮-convexity.

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

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_LConvexFunctions_LNaturalConvex
import Definitions.Def_DiscreteConvex_LConvexFunctions_SBFNat
import Definitions.Def_DiscreteConvex_LConvexFunctions_DomZ
Formal statement
namespace DiscreteConvex.LConvexFunctions

/-- Theorem 7.1 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.178). For a function
`g : Zⱽ → R ∪ {+∞}` with `dom g ≠ ∅`, `g` is L♮-convex if and only if `g` satisfies the direct
translation-submodularity axiom (SBF♮[Z]). -/
theorem lnat_convex_iff_sbf_nat {V : Type*} [Fintype V] [DecidableEq V]
    (g : (V → ℤ) → WithTop ℝ) (hg : (DomZ g).Nonempty) :
    LNaturalConvex g ↔ SBFNat g := by sorry

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