Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The event Ek,nE_{k,n}Ek,n​

Definition
AvgPHETH_Supplement_EventE

by iris · Nov 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

average-case-complexitycomplexity-theoryoracle-constructionp2o-gran-per-chapterp2o-plan-paperp2o-v1

Ek,nE_{k,n}Ek,n​ is the event that, after Jk(n)J_k(n)Jk​(n) restriction rounds, there exists some x∈{0,1}nx\in\{0,1\}^nx∈{0,1}n such that BxkB^k_xBxk​ is unset and TxkT^k_xTxk​ has a complete subtree with arity 2ak(n)2^{a_k(n)}2ak​(n) which has all selectors unset.

On this event a hard formula of Theorem 7.1 can be embedded into the still undetermined part of TxkT^k_xTxk​. Lemma 8.2 shows Pr⁡[Ek,n]=1−o(1)\Pr[E_{k,n}]=1-o(1)Pr[Ek,n​]=1−o(1) for every fixed kkk.

Formalization Note The event is a property of the seeds of the restriction rounds only; "all selectors" includes the root selector SxkS^k_xSxk​.

Definition code
import Mathlib
import Definitions.Def_AvgPHETH_Supplement_rawRestr
import Definitions.Def_AvgPHETH_Supplement_HasUnsetSubtree
import Definitions.Def_AvgPHETH_Supplement_JPar

namespace AvgPHETH.Supplement

/-- The event `E_{k,n}` (Hirahara–Juvekar–Nanashima, *Average-Case Hardness of PH from ETH-Type Hypotheses*, manuscript of November 3, 2026 (STOC 2027 submission; held version sha256 ea5fd472…), §8.1, p.40 (PDF 42)): "after `J_k(n)` such restrictions
there exists some `x ∈ {0,1}^n` such that `B^k_x` is unset and `T^k_x` has a complete subtree with arity
`2^{a_k(n)}` which has all selectors unset."

**Formalization Note** The event is a property of the seeds `U` of the restriction rounds; it does not
depend on the reserved lengths `n_s`, whose choice refers to its probability. "All selectors" includes
the root selector `S^k_x` (proof of Lemma 8.2, p.42 (PDF 44)). -/
def EventE (ε : ℕ → ℝ) (U : ℕ → CVar → ℕ → ℝ) (k n : ℕ) : Prop :=
  ∃ x : List Bool, x.length = n ∧ rawRestr ε U (JPar ε k n) ⟨k, x, true, []⟩ = none ∧
    HasUnsetSubtree ε (rawRestr ε U (JPar ε k n)) k x k []

end AvgPHETH.Supplement
Source
Hirahara–Juvekar–Nanashima, Average-Case Hardness of PH from ETH-Type Hypotheses, manuscript of November 3, 2026 (STOC 2027 submission; held version sha256 ea5fd472…), §8.1, "The construction", p.40 (PDF 42)

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