Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A linear-time input adapter for Cook checking relations

Proved
StableMSR.Recovery.Supplement.BinaryVerifier.tagged_checker_of_poly

by lreyzin · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmsclusteringcomputational-complexity

Any polynomial-time Boolean-stack program for a Boolean predicate of two bitstrings gives a polynomial-time machine in the mission’s Cook checker model. A linear-time input adapter reads the tagged four-symbol alphabet and writes the runtime’s framed binary pair. The remainder is composition of the two certified machines.

Preamble
import Definitions.Def_PvsNP
import Definitions.Def_QuantumMaxCutFiniteNumericRuntime

set_option autoImplicit false
open OAI.MetricKMedian.Binary.Automatic
Formal statement
namespace StableMSR.Recovery.Supplement.BinaryVerifier

theorem tagged_checker_of_poly (f : List Bool × List Bool → Bool) (hf : Poly f) : PvsNP.PolyTimeChecker f := by sorry

end StableMSR.Recovery.Supplement.BinaryVerifier
Source
Shyam Ravichandran and Lev Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Appendix C, Lemma C.3 and Theorem 5.1. https://arxiv.org/abs/2611.03547

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