Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Total-search selectors yield efficient refutation translations

Proved
StudentTeacher976.Adaptivity.refutation_translation_of_selectors

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

adaptivitycomputational-complexitystudent-teacher

Fix iii and assume that every total polynomially bounded search relation whose encoded graph lies in Δi+1p\Delta_{i+1}^pΔi+1p​ has an FPΣip\mathrm{FP}^{\Sigma_i^p}FPΣip​ selector. For any two refutable presentations P,QP,QP,Q of the same total search relation, there exists an FPΣip\mathrm{FP}^{\Sigma_i^p}FPΣip​ function ψ\psiψ on encoded triples such that, whenever ∣z∣=bP(∣x∣)|z|=b_P(|x|)∣z∣=bP​(∣x∣),

∣ψ(x,y,z)∣=bQ(∣x∣),Q(x,y,ψ(x,y,z))⟹P(x,y,z).|\psi(x,y,z)|=b_Q(|x|),\qquad Q(x,y,\psi(x,y,z))\Longrightarrow P(x,y,z).∣ψ(x,y,z)∣=bQ​(∣x∣),Q(x,y,ψ(x,y,z))⟹P(x,y,z).

The tests PPP and QQQ in this formula are the presentations' success predicates. The selector hypothesis is an explicit additional assumption. The resulting map is an interface for transferring uniform students between presentations without increasing their resource budgets.

Preamble
import Definitions.Def_StudentTeacher976_Adaptivity_Game
import Definitions.Def_StudentTeacher976_Adaptivity_Selectors
set_option autoImplicit false
open QAdvFew.PoQOracle StudentTeacher976.Adaptivity
Formal statement
theorem StudentTeacher976.Adaptivity.refutation_translation_of_selectors (i : ℕ) (hselectors : SelectorPresentationTranslation.SelectorCollapse i)
    (R : SearchRelation) (P Q : RefutablePresentation i R) :
    ∃ ψ : Word → Word → Word → Word,
      (∃ F : Word → Word,InFP i F ∧ ∀ x y z,F (tup [x,y,z])=ψ x y z) ∧
      (∀ x y z : Word,z.length=P.refutationLength.eval x.length →
        (ψ x y z).length=Q.refutationLength.eval x.length) ∧
      ∀ x y z : Word,z.length=P.refutationLength.eval x.length →
        Q.test x y (ψ x y z) → P.test x y z := by sorry
Source
Ježil–Tsintsilidas, Parallelism and Adaptivity in Student-Teacher Witnessing, STOC 2027 submission #976, https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/976.pdf, Definition 1.2, p.7; selector-case refutation-translation interface developed for this formalization.

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