Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.9 (efficiency half) — the exhaustive-search tree circuit is computable in polynomial time

Open
PPADSIS.SubexpSIS.searchRTC_polyTime

by arka · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

circuitscomplexity-theorypolynomial-time

Let Φ\PhiΦ be the exhaustive-search tree circuit map PPADSIS_SubexpSIS_SearchRTC, which sends a Boolean circuit φ\varphiφ to a regular tree circuit Φ(φ)\Phi(\varphi)Φ(φ). The map

⟨φ⟩ ⟼ ⟨Φ(φ)⟩\langle\varphi\rangle\ \longmapsto\ \langle\Phi(\varphi)\rangle⟨φ⟩ ⟼ ⟨Φ(φ)⟩

from the description of a circuit to the description of its tree circuit is computable in polynomial time: one multi-stack Turing machine (Mathlib's FinTM2 model, as in the published PolyTimeComputable) maps the code of every circuit φ\varphiφ to the code of Φ(φ)\Phi(\varphi)Φ(φ) within a number of steps polynomial in the length of the input code.

This is the efficiency half of Lemma 3.9 ("computed from φ\varphiφ in polynomial time"). The construction is syntactic: Φ(φ)\Phi(\varphi)Φ(φ) copies the gates of φ\varphiφ, appends nnn conjunctions, and repeats one fixed combining circuit with 2n+22n+22n+2 gates nnn times, so its description has length polynomial in that of φ\varphiφ. Together with PPADSIS.SubexpSIS.searchRTC_spec it gives the milestone PPADSIS.SubexpSIS.lemma_3_9.

Formalization Note Polynomial time is PPSLattice.PolyTimeOn Circuit.enc (fun φ => (searchRTC φ).enc): it is required on every circuit, well formed or not, with descriptions Circuit.enc and RTC.enc.

Preamble
import Mathlib
import Definitions.Def_PPSLattice_PolyTimeOn
import Definitions.Def_PPADSIS_SubexpSIS_SearchRTC
Formal statement
namespace PPADSIS.SubexpSIS

theorem searchRTC_polyTime : PPSLattice.PolyTimeOn Circuit.enc (fun φ => (searchRTC φ).enc) := by sorry

end PPADSIS.SubexpSIS
Source
Arka Rai Choudhuri, PPAD Hardness from SIS, STOC 2027 submission (manuscript), Lemma 3.9, p. 22 (with Definition 3.8, p. 22)

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