Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.49 -- polyhedral_mconvex_operations

Proved
DiscreteConvex.MConvexFunctionsD.polyhedral_mconvex_operations

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

convex-optimizationdiscrete-convex-analysis

Theorem 6.49 (p.162-163), operations (1)-(4). Let f∈M[R→R]f\in M[\mathbb R\to\mathbb R]f∈M[R→R] be polyhedral M-convex. (1) λf\lambda fλf is polyhedral M-convex for λ>0\lambda>0λ>0. (2) f(a+βx)f(a+\beta x)f(a+βx) is polyhedral M-convex in xxx, for a∈RVa\in\mathbb R^Va∈RV, β≠0\beta\ne 0β=0. (3) f[−p]f[-p]f[−p] is polyhedral M-convex for p∈RVp\in\mathbb R^Vp∈RV. (4) The separable perturbation f(x)+∑vϕv(x(v))f(x)+\sum_v\phi_v(x(v))f(x)+∑v​ϕv​(x(v)) is polyhedral M-convex, for convex univariate ϕv\phi_vϕv​, provided its domain is nonempty.

Formalization Note. Parts (5)-(8) (real-interval restriction, restriction to UUU, aggregation, infimal convolution) are not restated here — the same scope decision as chunk 22-ch06b-mconvexfunctions's Theorem 6.13, see MODERATION_NOTES.md.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.162-163, Theorem 6.49.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_DomR
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_MExchangeAxiomR
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_PosScalarMul
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_LinearWeightR
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_IsConvexUniv
import Definitions.Def_DiscreteConvex_MConvexFunctionsD_SeparablePerturbR
Formal statement
namespace DiscreteConvex.MConvexFunctionsD

open scoped Pointwise
open Classical
variable {V : Type*} [Fintype V] [DecidableEq V]
/-- Theorem 6.49 (p.181-182), operations (1)-(4); (5)-(8) are not restated here (see
`MODERATION_NOTES.md`, the same scope decision as chunk `22-ch06b-mconvexfunctions`'s Theorem
6.13). -/
theorem polyhedral_mconvex_operations (f : (V → ℝ) → WithTop ℝ) (hf : MExchangeAxiomR f) :
    (∀ lam : ℝ, 0 < lam → MExchangeAxiomR (fun x => PosScalarMul lam (f x))) ∧
    (∀ (a : V → ℝ) (beta : ℝ), beta ≠ 0 → MExchangeAxiomR (fun x => f (fun v => a v + beta * x v))) ∧
    (∀ p : V → ℝ, MExchangeAxiomR (LinearWeightR f p)) ∧
    (∀ phi : V → ℝ → WithTop ℝ, (∀ v, IsConvexUniv (phi v)) →
      (DomR (SeparablePerturbR f phi)).Nonempty → MExchangeAxiomR (SeparablePerturbR f phi)) := by sorry

end DiscreteConvex.MConvexFunctionsD
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.162-163, Theorem 6.49
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