Circuit Lower Bound: st Vars
ProvedCircuitLowerBound.stVarsalgorithmsanthropic-eth-16a5ce4complexity-theory
The variables of the formula of a table have L bits.
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_Interfaces import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_Small set_option autoImplicit false section section open CircuitLowerBound open ENP Groundwork open SmallFacts
Formal statement
theorem CircuitLowerBound.stVars : StVars := by sorry
Source