Cert Top: tau Of unary
ProvedPaddedDescent.F.CertTop.tauOf_unaryalgorithmsanthropic-eth-16a5ce4complexity-theory
The threshold τ of the sparsification is given in unary if n is, since 2^(sOf n) ≤ n + 1.
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_PaddedDescent_F_Interfaces
import Definitions.Def_PaddedDescent_F_CertSparsify
import Definitions.Def_ToTuring_Poly_Sat
import Definitions.Def_PaddedDescent_F_CertTop
set_option autoImplicit false
section
section
open PaddedDescent PaddedDescent.F PaddedDescent.F.CertTop
open Groundwork Groundwork.Prog Groundwork.Prog.Count Groundwork.Sparsify
open WidthK (theta)
open WidthK.Prog (stepK)
variable {α : Type} [Enc α]Formal statement
theorem PaddedDescent.F.CertTop.tauOf_unary {n : α → ℕ} (hn : Unary n) : Unary fun x => tauOf (sOf (n x)) := by sorrySource