Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.4 — Graph Non-Isomorphism reduces to SSLB

Open
AMRangeAvoid.Characterization.Supplement.theorem_4_4

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

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

For pairs of finite simple undirected graphs on a common labeled vertex set, there is a deterministic polynomial-time many-one reduction

GNI≤mPSSLB.\mathrm{GNI}\le_m^{\mathrm P}\mathrm{SSLB}.GNI≤mP​SSLB.

A nonisomorphic graph pair maps to a YES instance of SSLB; an isomorphic pair maps to a NO instance with both the size and covering promises. The input does not include automorphism generators. All graph sizes, including zero and one, are retained.

Differences from the source:

  • encoding: graph pairs on the common set [n] → binary adjacency matrices on Fin n, with invalid codes assigned to the isomorphism side; reason: relabeling is bijective, and the decidable extension specifies only strings that are not source instances
Preamble
import Definitions.Def_AMRangeAvoid_Characterization_Supplement_Graphs
import Definitions.Def_AMRangeAvoid_Characterization_SSLB
Formal statement
namespace AMRangeAvoid.Characterization.Supplement

theorem theorem_4_4 : PromiseReduces GNI SSLB := by sorry

end AMRangeAvoid.Characterization.Supplement
Source
Zeyong Li, STOC 2027 submission #502 (October 2026), Theorem 4.4, printed p.20 (PDF p.22); 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