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)
ProvedJeroslowMLP.Value.lemma_4_4Let and let be binary vectors for the blocks , with truth values . Let be the game obtained from by fixing for , played by with the criteria of . Then this game has an optimal solution, and every optimal solution has all atom variables and all binary, with
In particular 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 whose blocks equal (true ): levels 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 (0-based blocks ) are used. " binary" is read as the atom variables; the are included because the paper's proof derives it (Lemma 3.1) and Theorem 4.5 claims all optimal solutions binary.
import Mathlib import Definitions.Def_JeroslowMLP_Value_Game
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.