Theorem 1.3 — Uniform average-case inverse-trace bound with its full size range
OpenParityBarrier563.Trilinear.Supplement.theorem_1_3boolean-circuitscomplexity-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
For every integer there exist and such that for every , every basis e of and every , every circuit C of depth at most d and size at most s satisfies
The input x is uniform on the full Boolean cube. Both signs of the advantage are bounded, arbitrary base-model circuits are included, and constants depend only on d. This is the average-case inverse-trace companion theorem.
Differences from the source:
- encoding: asymptotic agreement bound and sufficiently large n → positive size-range and correlation constants and a threshold before n, field, basis, s 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
- encoding: the complete input cube and depth-d AND/OR circuits → the published coordinate types and Circuit, with depth at most d; agreement is a finite uniform probability where used; reason: all blocks remain in the cube, fan-in and fan-out are unrestricted, and size is the number of gates
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.3: arbitrary base-model circuits and absolute deviation from one half. -/
theorem theorem_1_3 (d : ℕ) (hd : 3 ≤ d) :
∃ (a c : ℝ) (N : ℕ), 0 < a ∧ 0 < c ∧ 2 ≤ N ∧ ∀ n : ℕ, N ≤ n →
∀ (K : Type) [Field K] [Algebra (ZMod 2) K]
(e : Module.Basis (Fin n) (ZMod 2) K) (s : ℝ),
(n : ℝ) ≤ s → s ≤ (2 : ℝ)^(a*(n : ℝ)^(1/((d : ℝ)-1))) →
∀ C : Circuit (Fin n), C.depth ≤ d → (C.size : ℝ) ≤ s →
|agreement C.eval (inverseTrace e) - 1/2| ≤ (2 : ℝ)^(-c*averageExponent d n s) := 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.3, printed p.3 / PDF p.5