Theorem 1.2 — Worst-case inverse-trace lower bound at every constant depth
OpenParityBarrier563.Trilinear.Supplement.theorem_1_2boolean-circuitscomplexity-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
For every fixed integer there exist and such that for all , every basis e of and every AND/OR circuit C of depth at most d computing inverse trace in that basis,
Size counts gates, fan-in and fan-out are unrestricted, and either output gate is allowed. Constants depend only on d. This extends the worst-case lower bound to the seedless inverse-trace function.
Differences from the source:
- encoding: asymptotic gate bound and sufficiently large n → positive constants and a threshold before n, basis and circuit; reason: this spells out the source bound at full strength, with exactly its allowed dependence
- encoding: the field of order 2^n in every binary basis → an arbitrary field K with an F₂-algebra structure and an n-vector basis; reason: the basis bijects K with F₂^n and enforces order 2^n without any additional restriction
Preamble
import Definitions.Def_ParityBarrier563_Trilinear_Supplement_InverseTrace import Definitions.Def_ParityBarrier563_Trilinear_Circuit set_option autoImplicit false open scoped Classical
Formal statement
namespace ParityBarrier563.Trilinear.Supplement
/-- Theorem 1.2: every basis, both output types, arbitrary DAG circuits, all fixed d≥3. -/
theorem theorem_1_2 (d : ℕ) (hd : 3 ≤ d) :
∃ (c : ℝ) (N : ℕ), 0 < c ∧ 2 ≤ N ∧ ∀ n : ℕ, N ≤ n →
∀ (K : Type) [Field K] [Algebra (ZMod 2) K]
(e : Module.Basis (Fin n) (ZMod 2) K) (C : Circuit (Fin n)),
C.depth ≤ d → C.Computes (inverseTrace e) →
(2 : ℝ)^(c*((n : ℝ)*Real.logb 2 n)^(1/((d : ℝ)-1))) ≤ C.size := by sorry
end ParityBarrier563.Trilinear.Supplement
Source
Nikolai Chukhin, Xin Li, Ivan Mihajlin, Yan Zhong, Breaking the Parity Barrier for Constant-Depth Circuits, STOC 2027 submission #563 (October 2026), Theorem 1.2, printed p.3 / PDF p.5