(4.2), §4, p. 154 — in S₂ of J′(F), y = 1 if 0 ≤ x < 1, and y ∈ {0, 1} if x = 1
ProvedJeroslowMLP.Value.eq_4_2gadgetmultilevel-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reduction
In the game , let (after the bookkeeper and player have moved). For every (4.1) gadget with argument and variable ,
Player 1 chooses to maximise ; (4.2) records the maximisers.
Formalization Note The statement holds for every ; for there are no (4.1) gadgets.
Preamble
import Mathlib import Definitions.Def_JeroslowMLP_Value_Game
Formal statement
namespace JeroslowMLP.Value
open MultilevelProgram GVar
theorem eq_4_2 (p : ℕ) (n : Fin p → ℕ) (F : Formula (Atom p n))
(x : GVar p n F → ℝ) (hx : x ∈ (jGame p n F).solSet 2)
(g : {a : Atom p n // 1 ≤ a.1.val}) (s : Bool) :
(0 ≤ gArg x g s ∧ gArg x g s < 1 → x (gy g s) = 1) ∧
(gArg x g s = 1 → x (gy g s) = 0 ∨ x (gy g s) = 1) := 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.2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.