Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 368, proof of THEOREM 2 — H − {x, y, z} is three u–v paths of length 4, so H needs at least four of its own edges

Proved
EdgeDomSets.NPC.H_four_needed

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

edge-dominating-setgadgetp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be the gadget of Fig. 3. Then

  1. H−{x,y,z}H-\{x,y,z\}H−{x,y,z} consists of three uuu–vvv paths of length 4 (internally vertex-disjoint, covering all its vertices and edges);
  2. therefore HHH needs at least four edges for its domination: even if all three external edges at x,y,zx,y,zx,y,z are in FFF, FFF must contain four more edges of HHH. In the Lean form, for every set SSS of corners whose external edge is in FFF and every set DDD of edges of HHH dominating HHH relative to SSS,
∣D∣≥4.|D|\ge 4.∣D∣≥4.

Together with the next two properties this fixes the cost of each gadget in the threshold 3n+4q3n+4q3n+4q.

Formalization Note HHH is on {0,…,13}\{0,\dots,13\}{0,…,13} with x,y,z=0,1,2x,y,z=0,1,2x,y,z=0,1,2, a1,a2,a3=3,4,5a_1,a_2,a_3=3,4,5a1​,a2​,a3​=3,4,5, b1,b2,b3=6,7,8b_1,b_2,b_3=6,7,8b1​,b2​,b3​=6,7,8, c1,c2,c3=9,10,11c_1,c_2,c_3=9,10,11c1​,c2​,c3​=9,10,11, u=12u=12u=12, v=13v=13v=13. The three paths are a map P:{0,1,2}×{0,…,4}→V(H)P:\{0,1,2\}\times\{0,\dots,4\}\to V(H)P:{0,1,2}×{0,…,4}→V(H) with P(i,0)=uP(i,0)=uP(i,0)=u, P(i,4)=vP(i,4)=vP(i,4)=v. Corners are indexed by Fin 3 (x,y,zx,y,zx,y,z).

Differences from the source:

  • encoding: H as drawn in Fig. 3; "even if all three edges incident to x, y, z are in F" → H on Fin 14 with fixed labels; for every set S of corners whose external edge is in F; reason: S = {x, y, z} is the weakest hypothesis, so the statement for every S is equivalent to the printed one
Preamble
import Mathlib
import Definitions.Def_EdgeDomSets_NPC_Construction
Formal statement
namespace EdgeDomSets.NPC

theorem H_four_needed :
    (∃ P : Fin 3 → Fin 5 → Fin 14,
      (∀ i, P i 0 = hu ∧ P i 4 = hv) ∧
      (∀ i (k : Fin 4), H.Adj (P i k.castSucc) (P i k.succ)) ∧
      (∀ i k, P i k ≠ hx ∧ P i k ≠ hy ∧ P i k ≠ hz) ∧
      (∀ i i' (k k' : Fin 5), 0 < k → k < 4 → P i k = P i' k' → i = i' ∧ k = k') ∧
      (∀ w, w ≠ hx → w ≠ hy → w ≠ hz → ∃ i k, P i k = w) ∧
      (∀ a b, a ≠ hx → a ≠ hy → a ≠ hz → b ≠ hx → b ≠ hy → b ≠ hz → H.Adj a b →
        ∃ (i : Fin 3) (k : Fin 4), s(a, b) = s(P i k.castSucc, P i k.succ))) ∧
    ∀ (S : Finset (Fin 3)) (D : Finset (Sym2 (Fin 14))), EdsRestricted S D → 4 ≤ D.card := by sorry

end EdgeDomSets.NPC
Source
Yannakakis, Gavril, Edge dominating sets in graphs, SIAM J. Appl. Math. 38(3) (1980) 364–372, p. 368, proof of THEOREM 2 (first property of H)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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