Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.1, p. 156 — atoms within δ of a binary assignment force |x(G) − x⁰(G)| < γ when δL ≤ γ

Proved
JeroslowMLP.Value.lemma_4_1

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

linear-inequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1propositional-logicrobustness

Let GGG be a propositional formula of length LLL and let δ,γ>0\delta,\gamma>0δ,γ>0 with δL≤γ\delta L\le\gammaδL≤γ. Let x0x^0x0 be a truth assignment of the atoms, and write x0(A)x^0(A)x0(A), x0(G)∈{0,1}x^0(G)\in\{0,1\}x0(G)∈{0,1} for the binary values of an atom and of GGG under it. Suppose real values x(A)x(A)x(A) of the atoms satisfy

∣x(A)−x0(A)∣<δfor every atom A occurring in G,(4.9)|x(A)-x^0(A)|<\delta\quad\text{for every atom } A \text{ occurring in } G, \qquad (4.9)∣x(A)−x0(A)∣<δfor every atom A occurring in G,(4.9)

and that the node values x(⋅)x(\cdot)x(⋅) solve the system (3.1) of GGG (with each node value in [0,1][0,1][0,1]). Then

∣x(G)−x0(G)∣<γ.(4.10)|x(G)-x^0(G)|<\gamma. \qquad (4.10)∣x(G)−x0(G)∣<γ.(4.10)

The lemma is a robustness property of LGL_GLG​: near-binary inputs produce an output near the correct truth value. It is what allows player 1 in J′(F)J'(F)J′(F) to be forced to binary choices.

Formalization Note The atom type is arbitrary, the length is the one of the Formula definition (atom 111, each connective +1+1+1), and hypothesis (4.9) is required only on the atoms occurring in GGG.

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

theorem lemma_4_1 {α : Type} (G : Formula α) (δ γ : ℝ) (hδ : 0 < δ) (hγ : 0 < γ)
    (hδγ : δ * (G.length : ℝ) ≤ γ) (x₀ : α → Bool) (xa : α → ℝ) (xn : G.Node → ℝ)
    (h49 : ∀ a ∈ G.atoms, |xa a - (if x₀ a then 1 else 0)| < δ)
    (hsys : G.LSys xa xn) :
    |G.nodeVal xa xn - (if G.eval x₀ then 1 else 0)| < γ := by sorry

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