Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.7 -- discrete midpoint convexity characterizes L-natural-convexity

Proved
DiscreteConvex.LConvexFunctions.l_natural_convex_characterizations

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

combinatoricsdiscrete-convex-analysis

Theorem 7.7 (p.180). For g:ZV→R∪{+∞}g : \mathbb Z^V \to \mathbb R \cup \{+\infty\}g:ZV→R∪{+∞} with dom⁡g≠∅\operatorname{dom} g \ne \emptysetdomg=∅, the translation-submodularity axiom (SBF♮^\natural♮[Z]), the approach property (L♮^\natural♮-APR[Z]), and discrete midpoint convexity are all equivalent, and each is a necessary and sufficient condition for ggg to be L♮^\natural♮-convex. Discrete midpoint convexity has no counterpart in the M-convex theory of chunk 06 — it is a distinctively L-convex phenomenon, and this theorem shows it is exactly as strong as the axiomatic definition.

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

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

/-- Theorem 7.7 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.180). For a function
`g : Zⱽ → R ∪ {+∞}` with `dom g ≠ ∅`, the translation-submodularity axiom (SBF♮[Z]), the
approach property (L♮-APR[Z]), and discrete midpoint convexity are all equivalent, and each is
a necessary and sufficient condition for `g` to be L♮-convex. -/
theorem l_natural_convex_characterizations {V : Type*} [Fintype V] [DecidableEq V]
    (g : (V → ℤ) → WithTop ℝ) (hg : (DomZ g).Nonempty) :
    [SBFNat g, LAPR g, DiscreteMidpointConvexity g].TFAE := by sorry

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