p. 367, proof of THEOREM 2, part (ii) — every dominating edge-set has an edge at each literal vertex (so |F| ≥ 3n)
ProvedEdgeDomSets.NPC.part_ii_loweredge-dominating-setp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1
Let be a SAT-3-restricted formula with variables and an edge dominating set of . Because of the pendant edges etc., contains at least one edge incident to each literal vertex , , , and consequently
This is the lower bound used in part (ii): with it leaves no room for any other edge.
Formalization Note Clause and position indices are 0-based (Fin). The vertices of are indexed by literal occurrences: the occurrence has a literal vertex lit o (the paper's , or ), a pendant pend o (the primed copy) and a variable-side vertex varNode o ( or for the two positive occurrences of , for the negated one); dNode j, dNode' j are , .
Differences from the source:
- encoding: vertices a_i, b_i, c_i, (a_i, j1), (b_i, j2), (c_i, j3), their primed copies, d_j, d'_j, with 1-based indices → one literal vertex, one pendant vertex and one variable-side vertex per literal occurrence (clause index, position), plus d_j, d'_j, all 0-based (
Fin); reason: under SAT-3-restricted the three occurrences of x_i are exactly x_i ∈ C_j1, x_i ∈ C_j2, x̄_i ∈ C_j3, so the vertices and edges are the printed ones - generalization: stated for a dominating edge-set F with |F| = 3n; conclusion: F has an edge at each (a_i, j1), (b_i, j2), (c_i, j3) → for every edge dominating set F (no size hypothesis); conclusion: an edge at each literal vertex, and 3n ≤ |F|; reason: the sentence uses only the pendant edges, not |F| = 3n; the count follows because the 3n literal vertices are pairwise non-adjacent; with |F| = 3n it gives the printed claim
- generalization: a set of clauses with at most three literals per clause, every variable occurring two times and its negation once → IsSat3Restricted φ on a list of literal lists: occurrences counted with multiplicity, so a clause may repeat a literal or hold x and x̄, clauses may repeat, and empty clauses are allowed; reason: every instance of the printed problem satisfies IsSat3Restricted, so the statement specializes to the source's claim on each of them; the construction and the argument are unchanged on the extra formulas (paper.md reading 4)
Preamble
import Mathlib import Definitions.Def_EdgeDomSets_NPC_Construction
Formal statement
namespace EdgeDomSets.NPC
theorem part_ii_lower (φ : CookLevin.Formula) (hφ : IsSat3Restricted φ)
(F : Finset (Sym2 (GV φ))) (hF : IsEdgeDominating (G φ) F) :
(∀ o : Occ φ, ∃ f ∈ F, lit o ∈ f) ∧ 3 * numVars φ ≤ F.card := by sorry
end EdgeDomSets.NPC
Source
Yannakakis, Gavril, Edge dominating sets in graphs, SIAM J. Appl. Math. 38(3) (1980) 364–372, p. 367, proof of THEOREM 2, part (ii), second sentence
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.