Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Adaptivity separation for a fixed refutable presentation

Proved
StudentTeacher976.Adaptivity.presented_adaptivity_separation

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

adaptivitycomputational-complexitystudent-teacher

Let i≥0i\ge0i≥0 and suppose Σi+1p⊈Δi+1p/poly\Sigma_{i+1}^p\not\subseteq\Delta_{i+1}^p/\mathrm{poly}Σi+1p​⊆Δi+1p​/poly. Let rrr be a polynomial-time, nondecreasing, unbounded round function with 1≤r(m)≤m1−ε1\le r(m)\le m^{1-\varepsilon}1≤r(m)≤m1−ε at positive lengths for some ε>0\varepsilon>0ε>0, and let qqq be a positive polynomial-time, polynomially bounded query function. There are a total bounded search relation RRR and a refutable presentation PPP of RRR, with a Δi+1p\Delta_{i+1}^pΔi+1p​ test, such that

P has an (r+1,1) uniform winning student, but has no (r,q) uniform winning student.P\text{ has an }(r+1,1)\text{ uniform winning student, but has no }(r,q)\text{ uniform winning student}.P has an (r+1,1) uniform winning student, but has no (r,q) uniform winning student.

Both students are measured against this same presentation. This result isolates the operational separation proved by the witness-tuple and advice-cover construction; it does not exclude students using other faithful presentations of RRR.

Preamble
import Definitions.Def_StudentTeacher976_Adaptivity_Game
set_option autoImplicit false
open QAdvFew.PoQOracle StudentTeacher976.Adaptivity
Formal statement
theorem StudentTeacher976.Adaptivity.presented_adaptivity_separation (i : ℕ) (hardness : ¬ StudentTeacher976.Adaptivity.Sigma (i+1)⊆DeltaPoly i)
    (r q : ℕ → ℕ) (hr : AdmissibleRounds r) (hq : AdmissibleQueries q) :
    ∃ (R : SearchRelation) (P : RefutablePresentation i R),
      (∃ g : Student,UniformStudent i g ∧ StudentShape P (fun m => r m+1) (fun _ => 1) g ∧
        StudentWins P (fun m => r m+1) (fun _ => 1) g) ∧
      ¬∃ g : Student,UniformStudent i g ∧ StudentShape P r q g ∧ StudentWins P r q g := 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, Theorem 1.4, p.7, fixed-predicate construction in §3.1, pp.19–21.

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