Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A total certified refinement suffices for two-round presentation membership

Proved
StudentTeacher976.Adaptivity.total_certified_refinement_resources

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

adaptivitycomputational-complexitystudent-teacher

Let RRR be a total polynomially bounded search relation with a refutable presentation at hierarchy level iii. Suppose a predicate VVV, decidable in Δi+1p\Delta_{i+1}^pΔi+1p​, and a polynomial ccc satisfy

∣v∣=c(∣x∣) ∧ V(x,y,v) ⟹ R(x,y),∀x ∃y,v∣v∣=c(∣x∣) ∧ V(x,y,v).\begin{aligned} |v|=c(|x|)\ \wedge\ V(x,y,v)&\ \Longrightarrow\ R(x,y),\\ \forall x\ \exists y,v\quad |v|=c(|x|)&\ \wedge\ V(x,y,v). \end{aligned}∣v∣=c(∣x∣) ∧ V(x,y,v)∀x ∃y,v∣v∣=c(∣x∣)​ ⟹ R(x,y), ∧ V(x,y,v).​

These conditions give a sound certificate for at least one valid answer on each input. Other valid answers need not have such certificates.

Let r,qr,qr,q be polynomial-time length functions with positive effective resource counts at every length, and assume that the effective round count is at least two at all sufficiently large lengths. Then

R∈STΣip[r,q].R\in\mathrm{ST}^{\Sigma_i^p}[r,q].R∈STΣip​[r,q].

Membership permits an alternative faithful refutation presentation of the same relation and preserves the original raw input length and resource functions. This strengthens the positive-validity-certificate construction to total verifiable refinements. It is useful for checking whether a search construction can separate intrinsic round budgets when changes of presentation are allowed. The empty input follows the published length-one resource convention.

Preamble
import Definitions.Def_StudentTeacher976_Adaptivity_Game
set_option autoImplicit false
open QAdvFew.PoQOracle StudentTeacher976.Adaptivity
Formal statement
theorem StudentTeacher976.Adaptivity.total_certified_refinement_resources {i : ℕ} {R : SearchRelation} (P : RefutablePresentation i R)
    (c : Polynomial ℕ) (V : Word → Word → Word → Prop)
    (heff : {s | ∃ x y z, s = tup [x,y,z] ∧ V x y z} ∈ Delta i)
    (hsound : ∀ x y v, v.length = c.eval x.length → V x y v → R x y)
    (htotal : ∀ x, ∃ y v, v.length = c.eval x.length ∧ V x y v)
    (r q : ℕ → ℕ) (hr : PolyTimeLength r) (hq : PolyTimeLength q)
    (hrpos : ∀ n, 1 ≤ resource r n) (hqpos : ∀ n, 1 ≤ resource q n)
    (hevent : ∃ N : ℕ, ∀ n, N ≤ n → 2 ≤ resource r n) : R ∈ ST i r q := 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, Definitions 1.1–1.2, pp.6–7. Generalization of the certified-replacement construction developed here: certificate completeness for all valid answers is replaced by soundness and totality of a refinement. This auxiliary construction is not asserted in the source.

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