ThreeSATToClique.CliqueVertex
structureimported Lean
A vertex of the conflict graph for a formula with $m$ clauses is a pair $\langle c\_idx, l\_idx \rangle$ where $c\_idx : \mathrm{Fin}\,m$ is a clause index and $l\_idx : \mathrm{Fin}\,3$ is a literal position within that clause.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in structure ThreeSATToClique.CliqueVertex (m : Nat)
- Defined in
- TCSlib, `ThreeSATToClique.CliqueVertex`
- Lean proof
- By Yangshuo Zou, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 Yangshuo Zou. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.ThreeSATToClique.CliqueVertex← ThreeSATToClique.CliqueVertex (TCSlib/Complexity/NPReductions/ThreeSATToClique.lean:121): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 7
- ThreeSATToClique.getLitAtGiven a 3-CNF formula $f$ and a vertex $v : \mathtt{CliqueVertex}\,f.\mathtt{length}$, returns the literal at position $v.l\_idx$ within…
- ThreeSATToClique.clique_vertices_choose_one_per_clauseOne clique vertex per clause. Let $f$ be a 3-CNF formula with $m$ clauses, and let $s$ be a set of vertices of the conflict graph of $f$.…
- ThreeSATToClique.ThreeSAT_to_Clique_soundnessSoundness of the 3-SAT to clique reduction. Let $f$ be a 3-CNF formula consisting of $m$ clauses. If the conflict graph of $f$ has an…
- ThreeSATToClique.getLitAt_mem_clauseVertex literal lies among its clause's three literals. Let $f$ be a 3-CNF formula, let $v$ be a vertex of the conflict graph of $f$, and…
- ThreeSATToClique.ThreeSAT_to_Clique_equivalenceCorrectness of the 3-SAT to Clique reduction. Let $f$ be a 3-CNF formula with $m$ clauses. Then $f$ is satisfiable if and only if its…
- ThreeSATToClique.ThreeSAT_to_Clique_completenessCompleteness of the 3-SAT to clique reduction. Let $f$ be a 3-CNF formula consisting of $m$ clauses, and let its conflict graph be the…
- ThreeSATToClique.toCliqueGraphThe conflict graph of a 3-CNF formula $f$ is the simple graph on vertex set $\mathtt{CliqueVertex}\,f.\mathtt{length}$ in which two…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in /-- A vertex of the conflict graph names a literal by its clause index `c_idx : Fin m` and its position `l_idx : Fin 3` within that clause. -/ structure ThreeSATToClique.CliqueVertex (m : Nat) where c_idx : Fin m l_idx : Fin 3 deriving DecidableEq