Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.4, p. 158 — with X_{k+1},…,X_p fixed to binary v, J′(F) has optima; all have x, x(F) binary, x(F) = 1 iff (4.15)

Proved
JeroslowMLP.Value.lemma_4_4

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

multilevel-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-hierarchyquantified-boolean-formulareduction

Let p≥k≥1p\ge k\ge1p≥k≥1 and let vk+1,…,vpv^{k+1},\dots,v^pvk+1,…,vp be binary vectors for the blocks Xk+1,…,XpX_{k+1},\dots,X_pXk+1​,…,Xp​, with truth values αk+1,…,αp\alpha^{k+1},\dots,\alpha^pαk+1,…,αp. Let J′(F)(vk+1,…,vp)J'(F)(v^{k+1},\dots,v^p)J′(F)(vk+1,…,vp) be the game obtained from J′(F)J'(F)J′(F) by fixing xt=vtx^t=v^txt=vt for k+1≤t≤pk+1\le t\le pk+1≤t≤p, played by 0,1,…,k0,1,\dots,k0,1,…,k with the criteria of J′(F)J'(F)J′(F). Then this game has an optimal solution, and every optimal solution has all atom variables and all x(G)x(G)x(G) binary, with

x(F)=1  ⟺  (QkXk)⋯(Q1X1) [F(X1,…,Xk,αk+1,…,αp)=1].(4.15)x(F)=1\iff (Q_kX_k)\cdots(Q_1X_1)\,[F(X_1,\dots,X_k,\alpha^{k+1},\dots,\alpha^p)=1]. \qquad (4.15)x(F)=1⟺(Qk​Xk​)⋯(Q1​X1​)[F(X1​,…,Xk​,αk+1,…,αp)=1].(4.15)

In particular x(F)x(F)x(F) is the same in all optimal solutions.

This is the inductive core of the reduction: each level of the game evaluates one quantifier.

Formalization Note The subgame's optimal solutions are the points of the full game's level set Sk+1S_{k+1}Sk+1​ whose blocks Xk+1,…,XpX_{k+1},\dots,X_pXk+1​,…,Xp​ equal vvv (true ↦1\mapsto1↦1): levels 1,…,k+11,\dots,k+11,…,k+1 only compare points that agree on those blocks, so the two sets coincide and no separate subgame is built. v assigns every atom, but only blocks Xk+1,…,XpX_{k+1},\dots,X_pXk+1​,…,Xp​ (0-based blocks ≥k\ge k≥k) are used. "xxx binary" is read as the atom variables; the x(G)x(G)x(G) are included because the paper's proof derives it (Lemma 3.1) and Theorem 4.5 claims all optimal solutions binary.

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

open MultilevelProgram GVar

theorem lemma_4_4 (p : ℕ) (n : Fin p → ℕ) (F : Formula (Atom p n)) (k : ℕ)
    (hk1 : 1 ≤ k) (hkp : k ≤ p) (v : Atom p n → Bool) :
    let Slice : Set (GVar p n F → ℝ) :=
      {x | x ∈ (jGame p n F).solSet (k + 1) ∧
        ∀ a : Atom p n, k ≤ a.1.val → x (atom a) = if v a then 1 else 0}
    Slice.Nonempty ∧
    ∀ x ∈ Slice, (∀ a, IsBinary (x (atom a))) ∧ (∀ g, IsBinary (x (node g))) ∧
      (xF x = 1 ↔ QHolds p n F k v) := by sorry

end JeroslowMLP.Value
Source
Jeroslow, The polynomial hierarchy and a simple model for competitive analysis, Math. Programming 32 (1985), p. 158, Lemma 4.4, (4.15)
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