Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.3), §4, p. 154 — at the level of player k ≥ 2, y = p(x) with p(x) = 1 on [0,1) and p(1) = 0

Proved
JeroslowMLP.Value.eq_4_3

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

gadgetmultilevel-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reduction

In the game J′(F)J'(F)J′(F), let k≥2k\ge2k≥2 be a player, xkjx_{kj}xkj​ one of its atoms, and x∈Sk+1x\in S_{k+1}x∈Sk+1​ (the set after player kkk has moved). For both gadgets of xkjx_{kj}xkj​ (on ξ=xkj\xi=x_{kj}ξ=xkj​ and on ξ=1−xkj\xi=1-x_{kj}ξ=1−xkj​) the variable yyy equals

p(ξ)={1,0≤ξ<1,0,ξ=1,(4.3)p(\xi)=\begin{cases}1,&0\le\xi<1,\\0,&\xi=1,\end{cases}\qquad (4.3)p(ξ)={1,0,​0≤ξ<1,ξ=1,​(4.3)

and consequently

yxkj+y1−xkj=P(xkj)=p(xkj)+p(1−xkj)={1,xkj∈{0,1},2,0<xkj<1.y_{x_{kj}}+y_{1-x_{kj}}=P(x_{kj})=p(x_{kj})+p(1-x_{kj})=\begin{cases}1,&x_{kj}\in\{0,1\},\\2,&0<x_{kj}<1.\end{cases}yxkj​​+y1−xkj​​=P(xkj​)=p(xkj​)+p(1−xkj​)={1,2,​xkj​∈{0,1},0<xkj​<1.​

The term 2P(xkj)2P(x_{kj})2P(xkj​) in player kkk's criterion therefore penalises fractional choices.

Formalization Note Lean block k : Fin p with 1 ≤ k.val is the paper's block and player k+1≥2k+1\ge2k+1≥2, whose level is k.val + 2; since atoms lie in [0,1][0,1][0,1], p(ξ)p(\xi)p(ξ) is written if ξ < 1 then 1 else 0.

Preamble
import Mathlib
import Definitions.Def_JeroslowMLP_Value_Game
Formal statement
namespace JeroslowMLP.Value

open MultilevelProgram GVar

theorem eq_4_3 (p : ℕ) (n : Fin p → ℕ) (F : Formula (Atom p n)) (k : Fin p) (hk : 1 ≤ k.val)
    (x : GVar p n F → ℝ) (hx : x ∈ (jGame p n F).solSet (k.val + 2)) (j : Fin (n k)) :
    (∀ s : Bool, x (gy ⟨⟨k, j⟩, hk⟩ s) = if gArg x ⟨⟨k, j⟩, hk⟩ s < 1 then 1 else 0) ∧
    x (gy ⟨⟨k, j⟩, hk⟩ false) + x (gy ⟨⟨k, j⟩, hk⟩ true) =
      if x (atom ⟨k, j⟩) = 0 ∨ x (atom ⟨k, j⟩) = 1 then 1 else 2 := by sorry

end JeroslowMLP.Value
Source
Jeroslow, The polynomial hierarchy and a simple model for competitive analysis, Math. Programming 32 (1985), p. 154, §4, (4.3), and P(x) = p(x) + p(1 − x), Fig. 1b, pp. 154–155
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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