Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.10 -- lconvex_basic_operations

Disproved
DiscreteConvex.LConvexFunctionsB.lconvex_basic_operations

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

convex-optimizationdiscrete-convex-analysis

Theorem 7.10 (p.183-184). Let g,g1,g2∈L[Z→R]g,g_1,g_2\in L[\mathbb Z\to\mathbb R]g,g1​,g2​∈L[Z→R] be L-convex functions. (1) λg\lambda gλg is L-convex for λ∈R++\lambda\in\mathbb R_{++}λ∈R++​. (2) g(a+βp)g(a+\beta p)g(a+βp) is L-convex in ppp, for a∈ZVa\in\mathbb Z^Va∈ZV, β∈Z∖{0}\beta\in\mathbb Z\setminus\{0\}β∈Z∖{0}. (3) g[−x]g[-x]g[−x] is L-convex for x∈RVx\in\mathbb R^Vx∈RV. (4) The projection gUg_UgU​ is L-convex provided gU>−∞g_U>-\inftygU​>−∞. (5) The infimal convolution of ggg with a separable convex function is L-convex provided it is >−∞>-\infty>−∞. (6) The sum g1+g2g_1+g_2g1​+g2​ is L-convex provided its domain is nonempty.

Formalization Note. All six parts are stated in full (unlike several sibling missions' 4-of-8-part reductions for the M-convex analogue, Theorem 6.13 — this book's own six-part L-convex operations theorem needed no cut). ">−∞>-\infty>−∞" is replaced by the equivalent, already-established (DomZ ...).Nonempty hypothesis (WithTop ℝ has no −∞-\infty−∞ element), matching mission 24-ch06d-mconvexfunctions's identical substitution for ProjectionR.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.183-184, Theorem 7.10.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_LConvexFunctionsB_DomZ
import Definitions.Def_DiscreteConvex_LConvexFunctionsB_SBF
import Definitions.Def_DiscreteConvex_LConvexFunctionsB_TRF
import Definitions.Def_DiscreteConvex_LConvexFunctionsB_PosScalarMul
import Definitions.Def_DiscreteConvex_LConvexFunctionsB_LinearWeight
import Definitions.Def_DiscreteConvex_LConvexFunctionsB_ProjectionZ
import Definitions.Def_DiscreteConvex_LConvexFunctionsB_SeparablePerturbZ
Formal statement
namespace DiscreteConvex.LConvexFunctionsB

open Classical
open scoped Pointwise
variable {V : Type*} [Fintype V] [DecidableEq V]
/-- Theorem 7.10 (p.183-184). Basic operations on L-convex functions: scaling, affine
reparametrization, linear perturbation, projection, infimal convolution with a separable
function, and sum. -/
theorem lconvex_basic_operations (g g1 g2 : (V → ℤ) → WithTop ℝ) (hg : SBF g ∧ TRF g) :
    (∀ lam : ℝ, 0 < lam →
      SBF (fun p => PosScalarMul lam (g p)) ∧ TRF (fun p => PosScalarMul lam (g p))) ∧
    (∀ a : V → ℤ, ∀ beta : ℤ, beta ≠ 0 →
      SBF (fun p => g (fun v => a v + beta * p v)) ∧
      TRF (fun p => g (fun v => a v + beta * p v))) ∧
    (∀ x : V → ℝ, SBF (LinearWeight g (fun v => - x v)) ∧ TRF (LinearWeight g (fun v => - x v))) ∧
    (∀ U : Set V, (DomZ (ProjectionZ g U)).Nonempty →
      SBF (ProjectionZ g U) ∧ TRF (ProjectionZ g U)) ∧
    (∀ psi : V → ℤ → WithTop ℝ, (DomZ (SeparablePerturbZ g psi)).Nonempty →
      SBF (SeparablePerturbZ g psi) ∧ TRF (SeparablePerturbZ g psi)) ∧
    ((DomZ (fun p => g1 p + g2 p)).Nonempty → SBF g1 → TRF g1 → SBF g2 → TRF g2 →
      SBF (fun p => g1 p + g2 p) ∧ TRF (fun p => g1 p + g2 p)) := by sorry

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