Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — Both depth-two restriction bounds for layered circuits

Open
ParityBarrier563.Trilinear.Supplement.lemma_6_2

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

boolean-circuitscomplexity-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix an integer d≥3d\ge3d≥3. There exist functions k(s),q(s), positive comparison constants and Ad>0A_d>0Ad​>0, depending only on d, with k(s)≥1k(s)\ge1k(s)≥1, 0<q(s)≤10<q(s)\le10<q(s)≤1, k(s)=Θd(log⁡2s)k(s)=\Theta_d(\log_2 s)k(s)=Θd​(log2​s) and 1/q(s)=Θd((log⁡2s)d−2)1/q(s)=\Theta_d((\log_2 s)^{d-2})1/q(s)=Θd​((log2​s)d−2) for every integer s≥2s\ge2s≥2. For every finite variable set V, every layered depth-d circuit C of size at most s and bottom fan-in at most 3log⁡2(4s)3\log_2(4s)3log2​(4s), every ψ:{0,1}V→[−1,1]\psi:\{0,1\}^V\to[-1,1]ψ:{0,1}V→[−1,1] and integer D≥1D\ge1D≥1, let E=Eφcorr⁡k(s)(ψφ)E=\mathbb E_\varphi\operatorname{corr}_{k(s)}(\psi_\varphi)E=Eφ​corrk(s)​(ψφ​) for a q(s)-random restriction. Both estimates hold:

∣E[ψC]∣≤ds−3+2E,∣E[ψC]∣≤sAd2−D+22d−2DE.|\mathbb E[\psi C]|\le d s^{-3}+2E,\qquad |\mathbb E[\psi C]|\le s^{A_d}2^{-D}+2^{2^{d-2}D}E.∣E[ψC]∣≤ds−3+2E,∣E[ψC]∣≤sAd​2−D+22d−2DE.

The same k,q work before choosing V,C,ψ,D. This is the depth-two reduction needed for average-case bounds.

Differences from the source:

  • encoding: Θ_d parameters and O_d exponent → positive comparison constants, functions k(s),q(s), and A before s,V,C,ψ,D; reason: this spells out the source uniformity and both estimates for one choice of parameters
  • encoding: alternating layered circuits, with actual gate count and the stated fan-in bounds → Layering data over the published Circuit DAG, retaining constants and unary gates and counting literal or gate wires; reason: this is the source layer convention and keeps both output types; duplicate wires can be deleted without increasing any bound
Preamble
import Definitions.Def_ParityBarrier563_Trilinear_Supplement_Layering
import Definitions.Def_ParityBarrier563_Trilinear_Correlation

set_option autoImplicit false
open scoped Classical
Formal statement
namespace ParityBarrier563.Trilinear.Supplement

/-- Lemma 6.2: one choice of k(s),q(s) works for both estimates and every test and D. -/
theorem lemma_6_2 (d : ℕ) (hd : 3 ≤ d) :
  ∃ (ak bk aq bq A : ℝ) (k : ℕ → ℕ) (q : ℕ → ℝ),
    0 < ak ∧ 0 < bk ∧ 0 < aq ∧ 0 < bq ∧ 0 < A ∧
    ∀ s : ℕ, 2 ≤ s →
      1 ≤ k s ∧ 0 < q s ∧ q s ≤ 1 ∧
      ak*Real.logb 2 s ≤ k s ∧ (k s : ℝ) ≤ bk*Real.logb 2 s ∧
      aq*(Real.logb 2 s)^(d-2) ≤ 1/q s ∧
      1/q s ≤ bq*(Real.logb 2 s)^(d-2) ∧
      ∀ (V : Type) [Fintype V] [DecidableEq V] (C : Circuit V) (L : Layering C d),
        C.size ≤ s → BottomBoundFull L (3*Real.logb 2 (4*s)) →
      ∀ (ψ : RealFn V), BoundedTest ψ → ∀ D : ℕ, 1 ≤ D →
        let E := restrExpect (q s) (fun φ => corr (k s) (restrict φ ψ))
        |avg (fun x => ψ x * ind C.eval x)| ≤ (d : ℝ)/(s : ℝ)^3 + 2*E ∧
        |avg (fun x => ψ x * ind C.eval x)| ≤
          (s : ℝ)^A * (2 : ℝ)^(-(D : ℝ)) +
          (2 : ℝ)^((2 : ℕ)^(d-2)*D) * E := 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), Lemma 6.2, printed p.26 / PDF p.28

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me