Sched: eq top iff
ProvedCircuitLowerBound.Sched.eq_top_iffalgorithmsanthropic-eth-16a5ce4complexity-theory
«s is the last place of chain a»: it is at most s and not at most s − 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_CircuitLowerBound_InterfacesPolyT
import Definitions.Def_ToTuring_Lib_Unary
import Definitions.Def_ToTuring_Lib_Nat2
import Definitions.Def_ToTuring_Lib_Nat1b
import Definitions.Def_ToTuring_Lib_List3
import Definitions.Def_ToTuring_Poly_Words
import Mathlib.Tactic
import Definitions.Def_CircuitLowerBound_Cert_Sched
set_option autoImplicit false
section
section
open CircuitLowerBound CircuitLowerBound.Sched
open ENP Groundwork
variable {α : Type} [Enc α]Formal statement
theorem CircuitLowerBound.Sched.eq_top_iff (a s : ℕ) : s = top a ↔ (leTop a s && !leTop a (s - 1)) = true := by sorry
Source