Avail: gate
ProvedCircuitLowerBound.Inf.Avail.gatealgorithmsanthropic-eth-16a5ce4complexity-theory
One more gate.
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 open CircuitLowerBound CircuitLowerBound.Inf open ENP
Formal statement
theorem CircuitLowerBound.Inf.Avail.gate {n : ℕ} {C : Circuit} {g₁ g₂ : List Bool → Bool} (h₁ : Avail n C g₁) (h₂ : Avail n C g₂) (op : Bool → Bool → Bool) :
∃ G : Gate, Avail n (C ++ [G]) fun x => op (g₁ x) (g₂ x) := by sorrySource