Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.10 -- lconvex_integrally_convex

Proved
DiscreteConvex.LConvexSetsB.lconvex_integrally_convex

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

combinatoricsdiscrete-convex-analysisdiscrete-geometry

Theorem 5.10 (p.127-128). GOAL. For an L-convex set D⊆ZVD \subseteq \mathbb Z^VD⊆ZV,

D‾={p∈RV:⌊p⌋+χUi(p)∈D (i=0,1,…,m)},\overline D = \{p \in \mathbb R^V : \lfloor p\rfloor + \chi_{U_i(p)} \in D\ (i=0,1,\ldots,m)\},D={p∈RV:⌊p⌋+χUi​(p)​∈D (i=0,1,…,m)},

where Ui(p)U_i(p)Ui​(p) are the level sets of the fractional part of ppp (Eq. (5.11)-(5.12)). Hence an L-convex set is integrally convex: every point of its convex hull is already a convex combination of finitely many nearby integer points of DDD (its own integral neighborhood), an explicit witness rather than an abstract existence claim.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.127-128, Theorem 5.10, Eq. (5.11)-(5.12).)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_LConvexSetsB_LConvexSet
import Definitions.Def_DiscreteConvex_LConvexSetsB_IntEmbed
import Definitions.Def_DiscreteConvex_LConvexSetsB_FracSortedValues
import Definitions.Def_DiscreteConvex_LConvexSetsB_FracVec
import Definitions.Def_DiscreteConvex_LConvexSetsB_FracLevelSet
import Definitions.Def_DiscreteConvex_LConvexSetsB_NeighborVec
import Definitions.Def_DiscreteConvex_LConvexSetsB_IsIntegrallyConvex
import Definitions.Def_DiscreteConvex_LConvexSetsB_IntegralNeighborhood
Formal statement
/-!
Murota, *Discrete Convex Analysis*, SIAM 2003, p.127-128, Theorem 5.10, in `DiscreteConvex.LConvexSetsB`.
-/

namespace DiscreteConvex.LConvexSetsB

/-- Theorem 5.10 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.127-128). See the item's
`natural_language_statement` for the full statement. -/
theorem lconvex_integrally_convex {V : Type*} [Fintype V] [DecidableEq V] (D : Set (V → ℤ))
    (hD : LConvexSet D) :
    (convexHull ℝ (IntEmbed D) =
      {p : V → ℝ | ∀ i ≤ (FracSortedValues p).length, NeighborVec p i ∈ D}) ∧
    IsIntegrallyConvex D := by sorry

end DiscreteConvex.LConvexSetsB
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.127-128, Theorem 5.10
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