Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.7, p. 7 — decomposition of the minimizer set

Proved
NashVecOpt.SharedConstraint.lemma_2_7

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

ordering-conep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pareto-optimalityvector-optimization

Let fff be the arbitrary cost profile and X\mathbb XX the arbitrary shared feasible set of an NNN-player game with N≥2N\ge2N≥2. With the augmented objective g(x)=(x,f(x))g(x)=(x,f(x))g(x)=(x,f(x)), the full-cone minimizers equal the intersection of the player-cone minimizers:

C-argmin{(x,f(x)):x∈X}=⋂i=1NCi-argmin{(x,f(x)):x∈X}.C\text{-argmin}\{(x,f(x)):x\in\mathbb X\} =\bigcap_{i=1}^{N}C_i\text{-argmin}\{(x,f(x)):x\in\mathbb X\}.C-argmin{(x,f(x)):x∈X}=i=1⋂N​Ci​-argmin{(x,f(x)):x∈X}.

This is the paper's decomposition of the entire Pareto minimizer set, including when the feasible set is empty.

Formalization Note The cones are exactly (6) and (7), and the minimizer notion is Definition 2.3. The stated N≥2N\ge2N≥2 is the paper's standing convention; the identity can be proved without using it.

Preamble
import Mathlib
import Definitions.Def_NashVecOpt_SharedConstraint_Model
Formal statement
namespace NashVecOpt.SharedConstraint

variable {ι : Type} [Fintype ι] [DecidableEq ι]
  {E : ι → Type} [∀ i, AddCommGroup (E i)] [∀ i, Module ℝ (E i)]

/-- Lemma 2.7, p. 7: the full-cone minimizers equal the intersection of the player-cone
minimizers. -/
theorem lemma_2_7 (hN : 2 ≤ Fintype.card ι) (f : ι → (∀ j, E j) → ℝ)
    (X : Set (∀ j, E j)) :
    vArgMin (orderCone (E := E)) (obj f) X =
      ⋂ i, vArgMin (coneI (E := E) i) (obj f) X := by sorry

end NashVecOpt.SharedConstraint
Source
Feinstein, Rudloff, Characterizing and Computing the Set of Nash Equilibria via Vector Optimization, arXiv:2109.14932v5, p. 7, Lemma 2.7
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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