Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6: a biclique Ka,bK_{a,b}Ka,b​ whose vertices have private pendants, plus an independent set, has value g(a,b)g(a,b)g(a,b)

Proved
ArcKayles192.PSPACE.lemma_6

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

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

Let HHH be a simple graph and SSS a position on it, partitioned into B=B1∪B2B=B_1\cup B_2B=B1​∪B2​ and III, such that

  1. H[B]H[B]H[B] is an induced biclique with sides B1B_1B1​ and B2B_2B2​: two vertices of BBB are adjacent iff they lie on different sides (in particular B1∩B2=∅B_1\cap B_2=\emptysetB1​∩B2​=∅); write a=∣B1∣a=|B_1|a=∣B1​∣ and b=∣B2∣b=|B_2|b=∣B2​∣, which may be 000;
  2. III is an independent set;
  3. every vertex u∈Bu\in Bu∈B has a neighbour w∈Iw\in Iw∈I of degree 111 in H[S]H[S]H[S], i.e. uuu is the only neighbour of www in SSS.

Vertices of III may have any degree, and the edges between BBB and III are otherwise arbitrary. Then

sg(H,S)=g(a,b):=(a+b) mod 2+2⋅(min⁡(a,b) mod 2).\mathrm{sg}(H,S)=g(a,b):=(a+b)\bmod 2+2\cdot(\min(a,b)\bmod 2).sg(H,S)=g(a,b):=(a+b)mod2+2⋅(min(a,b)mod2).

This exact formula is what makes every cheating move in GφG_\varphiGφ​ computable (Claims 7–10).

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: V(H) is partitioned into B, I with H[B] an induced biclique isomorphic to K_{a,b} → B₁ ∪ B₂ ∪ I = S, B₁ ∪ B₂ disjoint from I, and for u, w ∈ B₁ ∪ B₂: Adj u w ↔ (u ∈ B₁ ↔ w ∈ B₂); a = |B₁|, b = |B₂|; reason: this is the definition of an induced K_{a,b}; it forces B₁ ∩ B₂ = ∅ because the graph is loopless
  • encoding: a neighbor in I that has degree 1 (in H) → w ∈ I adjacent to u whose only neighbour in S is u; reason: the degree of w in H = G[S] counts its neighbours in S
Preamble
import Mathlib
import Definitions.Def_ArcKayles192_PSPACE_Game
Formal statement
namespace ArcKayles192.PSPACE

/-- **Lemma 6** (p.4). Let the position `S` of `H` be partitioned into `B = B₁ ∪ B₂` and `I`, where
`H[B]` is the induced biclique with sides `B₁`, `B₂` (two vertices of `B` are adjacent iff they lie
on different sides; this forces `B₁ ∩ B₂ = ∅`), `I` is independent, and every vertex of `B` has a
neighbour in `I` whose only neighbour in `S` is that vertex. Then `sg(H[S]) = g(|B₁|, |B₂|)`. -/
theorem lemma_6 {W : Type*} [DecidableEq W] (H : SimpleGraph W) (S B₁ B₂ I : Finset W)
    (hcover : B₁ ∪ B₂ ∪ I = S) (hdisj : Disjoint (B₁ ∪ B₂) I)
    (hbic : ∀ u ∈ B₁ ∪ B₂, ∀ w ∈ B₁ ∪ B₂, H.Adj u w ↔ (u ∈ B₁ ↔ w ∈ B₂))
    (hind : ∀ u ∈ I, ∀ w ∈ I, ¬ H.Adj u w)
    (hpend : ∀ u ∈ B₁ ∪ B₂, ∃ w ∈ I, H.Adj u w ∧ ∀ x ∈ S, H.Adj w x → x = u) :
    sg H S = g B₁.card B₂.card := 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.4, Lemma 6
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