Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3: a position is a P-position iff its Sprague–Grundy value is 000

Proved
ArcKayles192.PSPACE.lemma_3

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

arc-kaylesp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1sprague-grundy

Let GGG be a simple graph and SSS a position of Arc Kayles on it. Then the player to move at SSS loses under normal play (that is, SSS is a P-position) if and only if

sg(G,S)=0.\mathrm{sg}(G,S)=0.sg(G,S)=0.

This links outcomes, which the reduction must control, to values, which Lemmas 4 and 6 compute.

Differences from the source:

  • encoding: a position is a graph; isolated vertices are removed automatically (p.3) → a position is a finite set S of remaining vertices of an ambient simple graph G, the current graph being G[S]; isolated vertices stay in S; reason: an isolated vertex carries no move, so outcomes and values are unchanged; every finite graph H is the position (H, all vertices), and every position is the finite graph G[S]
  • encoding: P-position / N-position defined through winning strategies (p.2) → FirstPlayerWins G S defined by backward induction on |S|; a P-position is its negation; reason: the game tree is finite, so the player to move has a winning strategy iff some move leads to a position not won by the next player to move; determinacy is built in
Preamble
import Mathlib
import Definitions.Def_ArcKayles192_PSPACE_Game
Formal statement
namespace ArcKayles192.PSPACE

/-- **Lemma 3** (p.3). A position is a P-position (the player to move does not win under normal
play) if and only if its Sprague–Grundy value is `0`. -/
theorem lemma_3 {V : Type*} [DecidableEq V] (G : SimpleGraph V) (S : Finset V) :
    ¬ FirstPlayerWins G S ↔ sg G S = 0 := by sorry

end ArcKayles192.PSPACE
Source
Édouard Bonnet, Arc Kayles is PSPACE-complete, STOC 2027 submission #192 (October 2026), source.pdf SHA-256 f8b3a1c14347452b03dab2f19656aa6d2b17ba3956fefe2abc190b98ce44fc53, p.3, Lemma 3
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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