Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.30 -- nonempty minimizer set for integer-valued integrally convex functions

Proved
DiscreteConvex.IntegralConvexityC.prop_3_30_argmin_nonempty_integer_valued

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

discrete-convex-analysis

For integer-valued integrally convex fff: arg⁡min⁡f[−p]≠∅\arg\min f[-p]\ne\emptysetargminf[−p]=∅ whenever inf⁡f[−p]>−∞\inf f[-p]>-\inftyinff[−p]>−∞.

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

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_IntegralConvexityC_IntegrallyConvex
import Definitions.Def_DiscreteConvex_IntegralConvexityC_ArgMinPerturbed
import Definitions.Def_DiscreteConvex_IntegralConvexityC_InfPerturbed
import Definitions.Def_DiscreteConvex_IntegralConvexityC_CastZR
Formal statement
/-!
Murota, *Discrete Convex Analysis*, SIAM 2003, p.98, Proposition 3.30, in
`DiscreteConvex.IntegralConvexityC`.
-/

namespace DiscreteConvex.IntegralConvexityC

/-- **Proposition 3.30.** For an integer-valued integrally convex function
`f : Zⁿ → Z∪{+∞}` and `p ∈ Rⁿ`, `arg min f[-p] ≠ ∅` if `inf f[-p] > -∞`. -/
theorem prop_3_30_argmin_nonempty_integer_valued {n : ℕ} (f : (Fin n → ℤ) → WithTop ℤ)
    (hic : IntegrallyConvex (CastZR f)) (p : Fin n → ℝ)
    (hinf : InfPerturbed (CastZR f) p > ⊥) :
    (ArgMinPerturbed (CastZR f) p).Nonempty := by sorry

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