ENP: infinitely often
ProvedENP.infinitely_oftenalgorithmsanthropic-eth-16a5ce4complexity-theory
A language that is not decided by circuits of linear size fails at infinitely many lengths, for every c.
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_CircuitLowerBoundInfinitelyOftenStatement import Definitions.Def_CircuitLowerBound_Closed import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_Inf set_option autoImplicit false section section
Formal statement
theorem ENP.infinitely_often {L : ENP.Lang} (h : ¬ENP.HasLinearCircuits L) (c N : ℕ) : ∃ n, N ≤ n ∧ ¬ENP.DecidedAt L (c * (n + 1)) n := by sorrySource