AFTD Auto-Formalizing Theoretical Domains

Cslib.Turing.SingleTapeTM.PolyTimeComputable.id

defimported Lean

A proof that the identity map on Symbol is computable in polytime.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing Cslib.Turing.SingleTapeTM in
open Relation in
open Cslib.Turing.BiTape Cslib.Turing.StackTape in
open _root_.Turing in
variable {Symbol : Type} in
variable [Inhabited Symbol] [Fintype Symbol] in
open Polynomial in
noncomputable def Cslib.Turing.SingleTapeTM.PolyTimeComputable.id : PolyTimeComputable (Symbol := Symbol) id
Defined in
CSLib, `Cslib.Turing.SingleTapeTM.PolyTimeComputable.id`
Lean proof
By Bolton Bailey, Pim Spelier, Daan van Gent, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Bolton Bailey. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 26

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.Turing Cslib.Turing.SingleTapeTM in
open Relation in
open Cslib.Turing.BiTape Cslib.Turing.StackTape in
open _root_.Turing in
variable {Symbol : Type} in
variable [Inhabited Symbol] [Fintype Symbol] in
open Polynomial in
/-- A proof that the identity map on Symbol is computable in polytime. -/
noncomputable def Cslib.Turing.SingleTapeTM.PolyTimeComputable.id : PolyTimeComputable (Symbol := Symbol) id where
  toTimeComputable := TimeComputable.id
  poly := 1
  bounds _ := by simp [TimeComputable.id]

-- TODO remove `h_mono` assumption
-- by developing function to convert PolyTimeComputable into one with monotone time bound
See it in the graphDiscuss this resultChallenge it