Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Single-shift cover query scheduler with explicit polynomial simulation bound

Proved
SipserGacsLautemann.cover_single_shift_query_reports_base_accepts_with_explicit_bound

by Henry Yuen · Jul 24, 2026 · Mathlib c5ea003 (Lean v4.30.0)

complexity-theoryleansipser-gacs-lautemannturing-machines

Let a concrete four-tape verifier machine and an explicit polynomial upper bound C(N+1)dC(N+1)^dC(N+1)d be given. This theorem isolates the result-only machine-construction obligation for one decoded cover-shift query.

On input (x,e,u,o)(x,e,u,o)(x,e,u,o), the scheduler computes the transformed virtual input (x,e,u⊕ti,o)(x,e,u\oplus t_i,o)(x,e,u⊕ti​,o), where tit_iti​ is the decoded block selected by i=min⁡(∣o∣,∣u∣)i=\min(|o|,|u|)i=min(∣o∣,∣u∣), runs or simulates the supplied base machine on that virtual input up to the explicit bound C(N+1)dC(N+1)^dC(N+1)d, and reports whether the base machine accepts. Unlike the earlier one-step delegation formulation, this statement only requires the final Boolean result, so it is compatible with representation-based simulator implementations that do not reset raw tapes to exact Tape.ofBits form.

Preamble
import Definitions.Def_sgl_cover_preprocess_transform
import Definitions.Def_sgl_machine_infrastructure
Formal statement
namespace SipserGacsLautemann

theorem cover_single_shift_query_reports_base_accepts_with_explicit_bound
    (states : Nat)
    (machine : Machine 4 states)
    (coefficient degree : Nat) :
    ∃ (State : Type) (_ : Fintype State)
      (scheduler : TypedMachine 4 State)
      (schedulerTime : Nat → Nat),
      PolynomiallyBounded schedulerTime ∧
        ∀ input : Fin 4 → List Bool,
          scheduler.result
              (scheduler.run input
                (schedulerTime (totalInputLength input))).state =
            some
              (@decide
                (machine.acceptsWithin
                  (coverSingleShiftPreprocessInput input)
                  (coefficient *
                    (totalInputLength input + 1) ^ degree))
                (Classical.propDecidable _)) := by
  sorry

end SipserGacsLautemann
Source
Prove2me Sipser--Gacs--Lautemann mission cover-query machine construction; result-only explicit-bound correction of the single-shift preprocessing obligation.

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