Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.7 — Hash injectivity and polynomial-evaluation tail bound

Open
ParityBarrier563.Trilinear.Supplement.lemma_5_7

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

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

Let n≥64n\ge64n≥64, r=⌈n2/3⌉r=\lceil n^{2/3}\rceilr=⌈n2/3⌉, t the largest even integer with t6≤nt^6\le nt6≤n, and fix any irreducible monic degree-r polynomial P over F2\mathbb F_2F2​. Let σ restrict the n data coordinates, T=live⁡(σ)T=\operatorname{live}(\sigma)T=live(σ) and J:{0,1}T→[−1,1]J:\{0,1\}^T\to[-1,1]J:{0,1}T→[−1,1]. A uniformly random Hankel hash U fails to be injective on the points extending σ with probability at most 2∣T∣−r2^{|T|-r}2∣T∣−r. For every injective such U, choose independent uniform β0,…,βt−1∈F2[Z]/(P)\beta_0,\ldots,\beta_{t-1}\in\mathbb F_2[Z]/(P)β0​,…,βt−1​∈F2​[Z]/(P). For g the sign of the acceptance predicate [Z0]∑j<tβjh(x)j=0[Z^0]\sum_{j<t}\beta_j h(x)^j=0[Z0]∑j<t​βj​h(x)j=0,

Pr⁡β[∣E[gσJ]∣>2−∣T∣/4]≤tt/22−t∣T∣/4.\Pr_\beta\left[|\mathbb E[g_\sigma J]|>2^{-|T|/4}\right]\le t^{t/2}2^{-t|T|/4}.βPr​[∣E[gσ​J]∣>2−∣T∣/4]≤tt/22−t∣T∣/4.

Both the hash failure estimate and the tail estimate for every injective hash are included. These give the hard slices for hashed evaluation.

Differences from the source:

  • encoding: field quotient and uniform ring elements → monic coefficient bits, polynomial remainders, and uniform coefficient cubes; reason: irreducibility is assumed only in this support lemma; coefficient encoding is a bijection
Preamble
import Definitions.Def_ParityBarrier563_Trilinear_Supplement_HashedEvaluation

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

/-- Lemma 5.7: both the hash failure bound and the tail bound for every injective hash. -/
theorem lemma_5_7 (n : ℕ) (hn : 64 ≤ n) (Pbits : Fin (hashR n) → Bool)
    (hP : Irreducible (hashModulus Pbits)) (σ : Restriction (Fin n))
    (J : RealFn (Live σ)) (hJ : BoundedTest J) :
  probability (fun U : Fin (n+hashR n-1) → Bool =>
    ¬ Function.Injective (fun z : Live σ → Bool => hankelHash U (fill σ z))) ≤
      (2 : ℝ)^((Fintype.card (Live σ) : ℝ)-hashR n) ∧
  ∀ U : Fin (n+hashR n-1) → Bool,
    Function.Injective (fun z : Live σ → Bool => hankelHash U (fill σ z)) →
    probability (fun β : Fin (hashT n) × Fin (hashR n) → Bool =>
      |avg (fun z => restrict σ (sgn (hashAccept U (hashModulus Pbits) β)) z * J z)| >
        (2 : ℝ)^(-(Fintype.card (Live σ) : ℝ)/4)) ≤
      (hashT n : ℝ)^(hashT n/2) *
        (2 : ℝ)^(-((hashT n : ℝ)*Fintype.card (Live σ))/4) := 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 5.7, printed p.20 / PDF p.22

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