Graph Problems: cnt N dedup
ProvedGraphProblems.cntN_dedupalgorithmsanthropic-eth-16a5ce4complexity-theory
The Graph Problems construction uses the cnt N dedup property established by this source lemma. The formal statement records the complete hypotheses and conclusion.
Preamble
/- Copyright (c) 2026 Anthropic, PBC. All rights reserved. Released under Apache 2.0; SPDX-License-Identifier: Apache-2.0. Source and original notices: https://github.com/anthropics/formal-math/blob/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth/NOTICE -/ import Definitions.Def_GraphProblems_Interfaces import Definitions.Def_GraphProblems_Engine import Definitions.Def_GraphProblems_Cert import Definitions.Def_ToTuring_Poly_Range import Definitions.Def_ToTuring_Machine_EndTM import Definitions.Def_StepMachines_Prog_Sat import Definitions.Def_StepMachines_Prog_Sat import Definitions.Def_StepMachines_Prog_Decode import Definitions.Def_StepMachines_Prog_Decode import Definitions.Def_WidthK_Top_Sat import Definitions.Def_WidthK_Top_Sat import Mathlib.Tactic import Definitions.Def_GraphProblems_Sized import Theorems.Thm_Groundwork_PolyT_all import Theorems.Thm_Groundwork_PolyT_dedup attribute [local fun_prop] Groundwork.PolyT.all attribute [local fun_prop] Groundwork.PolyT.dedup set_option autoImplicit false section section open GraphProblems open Groundwork Groundwork.Prog Groundwork.Stepped CountKSat Finset
Formal statement
theorem GraphProblems.cntN_dedup (N : ℕ) (ψ : Fml) : cntN N ψ.dedup = cntN N ψ := by sorry
Source