Graph Problems: n Blocks unary
ProvedGraphProblems.nBlocks_unaryalgorithmsanthropic-eth-16a5ce4complexity-theory
The Graph Problems construction uses the n Blocks unary 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_ToTuring_Poly_Sat
import Definitions.Def_CountKSat_Poly
import Definitions.Def_GraphProblems_Cert
set_option autoImplicit false
section
section
open GraphProblems
open Groundwork Groundwork.Prog CountKSat
variable {α : Type} [Enc α]Formal statement
theorem GraphProblems.nBlocks_unary (b : ℕ) {n : α → ℕ} (hn : Unary n) : Unary fun a => nBlocks b (n a) := by sorrySource