Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 11.21 -- equilibrium_price_set_is_lnat_polyhedron

Open
DiscreteConvex.EconomicEquilibriumB.equilibrium_price_set_is_lnat_polyhedron

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

discrete-convex-analysisdiscrete-geometry

Theorem 11.21 (p.343). GOAL. The set P∗P^*P∗ of all equilibrium price vectors for a given allocation (x,y)(x,y)(x,y) is an Latural^ aturalatural-convex polyhedron, described explicitly by the inequality system (11.43): max⁡{0,ℓ(j)}≤p(j)≤u(j)\max\{0,\ell(j)\}\le p(j)\le u(j)max{0,ℓ(j)}≤p(j)≤u(j) for j∈Kj\in Kj∈K and p(j)−p(i)≤u(i,j)p(j)-p(i)\le u(i,j)p(j)−p(i)≤u(i,j) for ieji e jiej.

Chosen as goal: this is the sharpest structural result of chapter 11's computation section, upgrading the qualitative Latural^ aturalatural-convex-polyhedron fact (Theorem 11.16, mission 14-economic-equilibrium) to a concrete, linear-programming-checkable description, and is the fact Theorem 11.22 (also placed) builds on directly.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.343, Theorem 11.21.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_EconomicEquilibriumB_IsLNaturalConvexPolyhedron
import Definitions.Def_DiscreteConvex_EconomicEquilibriumB_EquilibriumPriceSet
import Definitions.Def_DiscreteConvex_EconomicEquilibriumB_EquilibriumPricePolyhedronE
import Definitions.Def_DiscreteConvex_EconomicEquilibriumB_MNaturalConcave
import Definitions.Def_DiscreteConvex_EconomicEquilibriumB_MNaturalConvexC
import Definitions.Def_DiscreteConvex_EconomicEquilibriumB_IsOptimalAllocation
Formal statement
namespace DiscreteConvex.EconomicEquilibriumB

open Classical
open scoped Pointwise
variable {K : Type*} [Fintype K] [DecidableEq K]
/-- Theorem 11.21 (p.343). GOAL. The set `P*` of all equilibrium price vectors for a given
allocation `(x,y)` is an L♮-convex polyhedron, described explicitly by the inequality system
(11.43).  Murota, *Discrete Convex Analysis*, SIAM 2003, §11.5 assumes the utilities
M♮-concave, the cost functions M♮-convex and `(x,y)` an optimal allocation of the associated
MSFP2, and its bounds `ℓ(j)`, `u(j)`, `u(i,j)` are read in `EReal`: with one good, one consumer
with `U(0) = U(1) = 0`, `U(2) = 5` and `-∞` elsewhere and one producer with `C` the indicator of
`0`, the equilibrium price set is `{p ≥ 5/2}` while the bounds taken with `unbotD 0`/`untopD 0`
give `{0}`. -/
theorem equilibrium_price_set_is_lnat_polyhedron {H L : Type*} [Fintype H] [Fintype L]
    [Nonempty H] [Nonempty L] (U : H → (K → ℤ) → WithBot ℝ) (C : L → (K → ℤ) → WithTop ℝ)
    (x : H → (K → ℤ)) (y : L → (K → ℤ))
    (hU : ∀ h, MNaturalConcave (U h)) (hC : ∀ l, MNaturalConvexC (C l))
    (hopt : IsOptimalAllocation U C x y) :
    IsLNaturalConvexPolyhedron (EquilibriumPriceSet U C x y) ∧
    EquilibriumPriceSet U C x y = EquilibriumPricePolyhedronE U C x y := by sorry

end DiscreteConvex.EconomicEquilibriumB
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.343, Theorem 11.21
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me