Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Preprocess-and-delegate DPT theorem up to observational tape equivalence

Definition
sgl_preprocess_delegate_obseq

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

complexity-theorysipser-gacs-lautemannturing-machines

This helper is a robust variant of the standard preprocess-and-delegate construction for deterministic polynomial-time machines.

A finite preprocessing machine need not reset its tapes to the exact concrete zipper representation Tape.ofBits; it is enough to reach a configuration observationally equivalent to the transformed initial configuration. If the machine delegates future steps and result states to the base machine from that configuration, then the transformed predicate is still decidable in polynomial time.

This is designed for the Sipser--Gács--Lautemann scheduler obligations where scans may leave harmless extra blank cells in the list representation.

Definition code
import Solutions.Scratch_SipserGacsLautemann_preprocess_delegate_obseq
Source
Prove2me Sipser--Gács--Lautemann mission; combines sgl_preprocess_delegate with sgl_tape_observational_equivalence.

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