Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.34 -- polyhedral_lconvex_argmin_is_lconvex_polyhedron

Proved
DiscreteConvex.LConvexFunctionsC.polyhedral_lconvex_argmin_is_lconvex_polyhedron

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

discrete-convex-analysisdiscrete-geometry

Proposition 7.34 (p.193). Let g∈L[R→R]g\in L[\mathbb R\to\mathbb R]g∈L[R→R] be a polyhedral L-convex function. For any x∈RVx\in\mathbb R^Vx∈RV, arg⁡min⁡g[−x]\arg\min g[-x]argming[−x] is an L-convex polyhedron if it is not empty.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.193, Proposition 7.34.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_LConvexFunctionsC_SBFR
import Definitions.Def_DiscreteConvex_LConvexFunctionsC_TRFR
import Definitions.Def_DiscreteConvex_LConvexFunctionsC_LConvexPolyhedronR
import Definitions.Def_DiscreteConvex_LConvexFunctionsC_IsPolyhedralConvex
import Definitions.Def_DiscreteConvex_LConvexFunctionsC_ArgMinR
import Definitions.Def_DiscreteConvex_LConvexFunctionsC_LinearWeightR
Formal statement
namespace DiscreteConvex.LConvexFunctionsC

open Classical
open scoped Pointwise
variable {V : Type*} [Fintype V] [DecidableEq V]
/-- Proposition 7.34 (p.193). The minimizer set of a linearly-perturbed polyhedral L-convex
function is an L-convex polyhedron of the class `L⁰[R]`, if nonempty. The class is the real one,
not the integral hull class `L⁰[Z|R]`: for `g(p) = max(p₁ - p₂ - 1/2, 0)` and `x = 0` the
minimizer set is `{p : p₁ - p₂ ≤ 1/2}`, which is the convex hull of no integer set. -/
theorem polyhedral_lconvex_argmin_is_lconvex_polyhedron (g : (V → ℝ) → WithTop ℝ)
    (hg : SBFR g ∧ TRFR g) (hpoly : IsPolyhedralConvex g) (x : V → ℝ)
    (hne : (ArgMinR (LinearWeightR g (fun v => - x v))).Nonempty) :
    LConvexPolyhedronR (ArgMinR (LinearWeightR g (fun v => - x v))) := by sorry

end DiscreteConvex.LConvexFunctionsC
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.193, Proposition 7.34
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