File size: 1,680 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 | import OAI.Algorithms.SubexponentialSAT.ExecQuantitativeSparsify
import OAI.Algorithms.SubexponentialSAT.SqrtLogSpace.DisjointReuse.CNFNormalize
import OAI.Algorithms.SubexponentialSAT.SqrtLogSpace.EncodingBounds
/-! The canonical input is already the declared-variable raw input of the
disjoint counting machine. Normalization preserves its exact ambient count. -/
namespace OAI.Algorithms.SubexponentialSAT.SqrtLogSpace
open DisjointReuse
theorem canonical_counting_input {n k : ℕ} (F : SAT.CNF (Fin n))
(hw : SAT.WidthAtMost k F) :
encodeRawCNF (ExecQuantitativeSparsify.formulaList F) = Encoding.encodeCNF F ∧
rawCount (ExecCNF.normalize SAT.Literal.negate
(ExecQuantitativeSparsify.formulaList F)) = SAT.count F ∧
(∀ C ∈ ExecCNF.normalize SAT.Literal.negate
(ExecQuantitativeSparsify.formulaList F), C.length ≤ k) ∧
(ExecCNF.normalize SAT.Literal.negate
(ExecQuantitativeSparsify.formulaList F)).length ≤ F.card := by
refine ⟨ExecQuantitativeSparsify.encodeCNF_formulaList F, ?_, ?_, ?_⟩
· rw [rawCount_normalize, rawCount, ExecQuantitativeSparsify.formulaList_set]
· exact normalize_width_le _ (ExecQuantitativeSparsify.formulaList_width F k hw)
· simpa using ExecCNF.normalize_length_le SAT.Literal.negate
(ExecQuantitativeSparsify.formulaList F)
theorem canonical_counting_output {n : ℕ} (F : SAT.CNF (Fin n)) :
binaryNat (rawCount (ExecCNF.normalize SAT.Literal.negate
(ExecQuantitativeSparsify.formulaList F))) = countWord (SAT.count F) := by
rw [rawCount_normalize, rawCount, ExecQuantitativeSparsify.formulaList_set]
rfl
end OAI.Algorithms.SubexponentialSAT.SqrtLogSpace
|