Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

CookLevin.structuralClauseEmitters_polyTime_core_reduction_child

Open

by Rizwan · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

Reduction child lemma for CookLevin.structuralClauseEmitters_polyTime_core

Formal statement
import Definitions.Def_CookLevin_Reduction
open CookLevin

theorem CookLevin.structuralClauseEmitters_polyTime_core_reduction_child (k G Q cw dw ct dt : Nat) :
    ∀ family ∈ ([cellClauses, headClauses, stateClauses, readClauses,
      linkClauses, inertiaClauses, haltClauses, acceptClauses,
      fun sh => blankSuffixClauses sh 1] : List (Shape → Formula)),
      IsPolyTimeComputable (fun x =>
        encodeFormula (family ⟨k, G, Q, tabWidth cw dw ct dt x⟩)) := by sorry

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me