Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.9 — SSLB is in promise symmetric polynomial time

Open
AMRangeAvoid.Characterization.Supplement.theorem_3_9

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

complexity-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1range-avoidance

Structured Set Lower Bound admits one deterministic polynomial-time symmetric predicate and one fixed polynomial witness bound. Every YES input has a first witness forcing acceptance against all second witnesses; every NO input has a second witness forcing rejection against all first witnesses:

SSLB∈promise-S2P.\mathrm{SSLB}\in\mathrm{promise}\text{-}S_2\mathrm P.SSLB∈promise-S2​P.

This is unconditional membership. No single-valued Avoid solver, oracle separation or additional algorithm is assumed. The promise problem is the published SSLB definition.

Differences from the source: none.

Preamble
import Definitions.Def_AMRangeAvoid_Characterization_Supplement_Complexity
import Definitions.Def_AMRangeAvoid_Characterization_SSLB
Formal statement
namespace AMRangeAvoid.Characterization.Supplement

theorem theorem_3_9 : InPromiseS2P SSLB := by sorry

end AMRangeAvoid.Characterization.Supplement
Source
Zeyong Li, STOC 2027 submission #502 (October 2026), Theorem 3.9, printed p.18 (PDF p.20); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/502.pdf

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