Cert: sign poly T
ProvedPaddedDescent.F.Mark.Cert.sign_polyTalgorithmsanthropic-eth-16a5ce4complexity-theory
The sign (−1)^k is polynomial-time in k.
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_FuelCert
import Definitions.Def_ToTuring_Poly_Digits
import Definitions.Def_PaddedDescent_F_CertMark
set_option autoImplicit false
section
section
open PaddedDescent PaddedDescent.F PaddedDescent.F.Mark PaddedDescent.F.Mark.Cert
open Groundwork Groundwork.Prog Groundwork.Grid
variable {α : Type} [Enc α]Formal statement
theorem PaddedDescent.F.Mark.Cert.sign_polyT {k : α → ℕ} (hk : PolyT k) : PolyT fun x => (-1 : ℤ) ^ k x := by sorrySource